Random intersection trees

Journal of Machine Learning Research

Volumn 15, Issue , 2014, Pages 629-654

  Shah, Rajen Dinesh ^a   Meinshausen, Nicolai ^b  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^b ETH ZURICH   (Switzerland)

Author keywords

High dimensional classification; Interactions; Min wise hashing; Sparse data

Indexed keywords

BEAM PLASMA INTERACTIONS; FORESTRY;

COMPUTATIONAL CHALLENGES; COMPUTATIONAL COSTS; HIGH DIMENSIONAL DATA; HIGH-DIMENSIONAL; MIN-WISE HASHING; PREDICTIVE MODELLING; PREDICTOR VARIABLES; SPARSE DATA;

BINARY TREES;

ALGORITHMS; CLASSIFICATION; FORESTRY;

EID: 84897066164     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Article

References (21)

1. R. Agrawal, R. Srikant, et al. Fast algorithms for mining association rules. In Proceedings of the 20th International Conference on Very Large Data Bases, volume 1215, pages 487-499, 1994.
2. D. Aha, D. Kibler, and M. Albert. Instance-based learning algorithms. Machine Learning, 6:37-66, 1991. (Pubitemid 21727227)
3. A. Bosch, A. Zisserman, and X. Muoz. Image classification using random forests and ferns. In IEEE 11th International Conference on Computer Vision, 2007, pages 1-8. IEEE, 2007.
4. L. Breiman. Random forests. Machine Learning, 45:5-32, 2001. (Pubitemid 32933532)
5. L. Breiman, J. Friedman, R. Olshen, and C. Stone. Classification and Regression Trees. Wadsworth, Belmont, 1984.
6. A. Broder, M. Charikar, A. Frieze, and M. Mitzenmacher. Min-wise independent permutations. In Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, pages 327-336. ACM, 1998.
7. E. Cohen, M. Datar, S. Fujiwara, A. Gionis, P. Indyk, R. Motwani, J. Ullman, and C. Yang. Finding interesting associations without support pruning. IEEE Transactions on Knowledge and Data Engineering, 13:64-78, 2001. (Pubitemid 32301044)
8. M. Datar and S. Muthukrishnan. Estimating rarity and similarity over data stream windows. Lecture Notes in Computer Science, 2461:323, 2002.
9. J. Friedman and B. Popescu. Predictive learning via rule ensembles. Annals of Applied Statistics, 2:916-954, 2008.
10. J. Friedman, T. Hastie, and R. Tibshirani. Regularization paths for generalized linear models via coordinate descent. Journal of Statistical Software, 33:1-22, 2010.
11. J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. SIGMOD Rec., 29:1-12, May 2000.
12. D. Lewis, Y. Yang, T. Rose, and F. Li. Rcv1: a new benchmark collection for text categorization research. Journal of Machine Learning Research, 5:361-397, 2004.
13. W. Loh and Y. Shih. Split selection methods for classification trees. Statistica Sinica, 7: 815-840, 1997.
14. M. Marchand and M. Sokolova. Learning with decision lists of data-dependent features. Journal of Machine Learning Research, 6:427, 2006.
15. C. Matheus and L. Rendell. Constructive induction on decision trees. In Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, volume 645650. Citeseer, 1989.
16. N. Meinshausen. Node harvest. Annals of Applied Statistics, 4:2049-2072, 2010.
17. J. Pei, J. Han, H. Lu, S. Nishio, S. Tang, and D. Yang. H-mine: hyper-structure mining of frequent patterns in large databases. ICDM 2001, Proceedings of the IEEE International Conference on Data Mining, pages 441-448, 2001.
18. R Core Team. R: A Language and Environment for Statistical Computing. R Foundation for Statistical Computing, Vienna, Austria, 2013. URL http://www.R-project.org/.
19. R. Rivest. Learning decision lists. Machine Learning, 2:229-246, 1987.
20. C. Strobl, A. Boulesteix, T. Kneib, T. Augustin, and A. Zeileis. Conditional variable importance for random forests. BMC Bioinformatics, 9:307, 2008.
21. R. Tibshirani. Regression shrinkage and selection via the lasso. Journal of the Royal Statistical Society, Series B, 58:267-288, 1996.