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) <http://www.jmlr.org/papers/v15/shah14a.html>. 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.

Install the latest version of this package by entering the following in R:
install.packages("FSInteract")
AuthorHyun Jik Kim, Rajen D. Shah
Date of publication2017-04-03 21:58:38 UTC
MaintainerRajen D. Shah <r.shah@statslab.cam.ac.uk>
LicenseGPL-2
Version0.1.2
http://www.jmlr.org/papers/v15/shah14a.html

View on CRAN

Files

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

Questions? Problems? Suggestions? or email at ian@mutexlabs.com.

Please suggest features or report bugs with the GitHub issue tracker.

All documentation is copyright its authors; we didn't write any of that.