FSInteract: Fast Searches for Interactions

Performs fast detection of interactions in large-scale data using the method of random intersection trees introduced in ``Shah, R. D. and Meinshausen, N. (2014) Random Intersection Trees''. The algorithm finds potentially high-order interactions in high-dimensional binary two-class classification data, without requiring lower order interactions to be informative. The search is particularly fast when the matrices of predictors are sparse. It can also be used to perform market basket analysis when supplied with a single binary data matrix. Here it will find collections of columns which for many rows contain all 1's.

Author
Hyun Jik Kim, Rajen D. Shah
Date of publication
2015-05-15 00:04:47
Maintainer
Rajen D. Shah <r.shah@statslab.cam.ac.uk>
License
GPL-2
Version
0.1.1

View on CRAN

Man pages

RIT
Random Intersection Trees

Files in this package

FSInteract
FSInteract/src
FSInteract/src/ExportedFunctions.cpp
FSInteract/src/Makevars
FSInteract/src/InputFunctions.h
FSInteract/src/RITaux.h
FSInteract/src/RaggedArray.h
FSInteract/src/RITmain.h
FSInteract/src/Makevars.win
FSInteract/src/RcppExports.cpp
FSInteract/NAMESPACE
FSInteract/R
FSInteract/R/RcppExports.R
FSInteract/R/RIT.R
FSInteract/MD5
FSInteract/DESCRIPTION
FSInteract/man
FSInteract/man/RIT.Rd