Performs fast detection of interactions in largescale 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 highorder interactions in highdimensional binary twoclass 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.
Package details 


Author  Hyun Jik Kim, Rajen D. Shah 
Maintainer  Rajen D. Shah <[email protected]> 
License  GPL2 
Version  0.1.2 
URL  http://www.jmlr.org/papers/v15/shah14a.html 
Package repository  View on CRAN 
Installation 
Install the latest version of this package by entering the following in R:

Any scripts or data that you put into this service are public.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.