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.

Getting started

Package details

AuthorHyun Jik Kim, Rajen D. Shah
Date of publication2017-04-03 21:58:38 UTC
MaintainerRajen D. Shah <[email protected]>
URL http://www.jmlr.org/papers/v15/shah14a.html
Package repositoryView on CRAN
Installation Install the latest version of this package by entering the following in R:

Try the FSInteract package in your browser

Any scripts or data that you put into this service are public.

FSInteract documentation built on May 30, 2017, 7:18 a.m.