FSInteract: Fast Searches for Interactions
Version 0.1.2

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) . 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.

Browse man pages Browse package API and functions Browse package files

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
URL http://www.jmlr.org/papers/v15/shah14a.html
Package repositoryView on CRAN
InstallationInstall the latest version of this package by entering the following in R:
install.packages("FSInteract")

Getting started

Popular man pages

RIT: Random Intersection Trees

Man pages

RIT: Random Intersection Trees

Functions

RIT Man page Source code
RIT_1class Source code
RIT_2class Source code
convert.to.data.frame Source code

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
FSInteract documentation built on May 20, 2017, 4:55 a.m.