Random prism: An alternative to random forests

Res. and Dev. in Intelligent Syst. XXVIII: Incorporating Applications and Innovations in Intel. Sys. XIX - AI 2011, 31st SGAI Int. Conf. on Innovative Techniques and Applications of Artificial Intel.

Volumn , Issue , 2011, Pages 5-18

  Stahl, Frederic ^a   Bramer, Max ^a  

^a School of Computing Science   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; DECISION TREES; LARGE DATASET; RANDOM FORESTS;

CLASSIFICATION ACCURACY; CLASSIFICATION RESULTS; CLASSIFICATION RULES; DECISION TREE CLASSIFIERS; ENSEMBLE CLASSIFIERS; ENSEMBLE TECHNIQUES; MULTIPLE CLASSIFIERS; RULE-BASED CLASSIFIER;

PRISMS;

EID: 84877984160     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-1-4471-2318-7_1     Document Type: Conference Paper

References (31)

1. Hadoop, http://hadoop.apache.org/mapreduce/ 2011
2. C L Blake and C J Merz. UCI repository of machine learning databases. Technical report, University of California, Irvine, Department of Information and Computer Sciences, 1998
3. M A Bramer. Automatic induction of classification rules from examples using N-Prism. In Research and Development in Intelligent Systems XVI, pages 99-121, Cambridge, 2000. Springer-Verlag
4. M A Bramer. An information-Theoretic approach to the pre-pruning of classification rules. In B Neumann M Musen and R Studer, editors, Intelligent Information Processing, pages 201-212. Kluwer, 2002
5. M A Bramer. Inducer: A public domain workbench for data mining. International Journal of Systems Science, 36(14):909-919, 2005
6. Leo Breiman. Bagging predictors. Machine Learning, 24(2):123-140, 1996
7. Leo Breiman. Random forests. Machine Learning, 45(1):5-32, 2001
8. J. Cendrowska. PRISM: An algorithm for inducing modular rules. International Journal of Man-Machine Studies, 27(4):349-370, 1987
9. Philip Chan and Salvatore J Stolfo. Experiments on multistrategy learning by meta learning. In Proc. Second Intl. Conference on Information and Knowledge Management, pages 314-323, 1993
10. Philip Chan and Salvatore J Stolfo. Meta-Learning for multi strategy and parallel learning. In Proceedings. Second International Workshop on Multistrategy Learning, pages 150-165, 1993
11. Nitesh V. Chawla, Lawrence O. Hall, Kevin W. Bowyer, and W. Philip Kegelmeyer. Learning ensembles from bites: A scalable and accurate approach. J. Mach. Learn. Res., 5:421-451, December 2004
12. Jeffrey Dean and Sanjay Ghemawat. Mapreduce: Simplified data processing on large clusters. Commun. ACM, 51:107-113, January 2008
13. Saso Dzeroski and Bernard Zenko. Is combining classifiers with stacking better than selecting the best onë Machine Learning, 54:255-273, 2004
14. Jiawei Han and Micheline Kamber. Data Mining: Concepts and Techniques. Morgan Kaufmann, 2001
15. Tin Kam Ho. Random decision forests. Document Analysis and Recognition, International Conference on, 1:278, 1995
16. R S Michalski. On the Quasi-Minimal solution of the general covering problem. In Proceedings of the Fifth International Symposium on Information Processing, pages 125-128, Bled, Yugoslavia, 1969
17. Domingos P. and Hulten G. Mining high-speed data streams. In In International Conference on Knowledge Discovery and Data Mining, pages 71-81, 2000
18. Biswanath Panda, Joshua S. Herbach, Sugato Basu, and Roberto J. Bayardo. Planet: Massively parallel learning of tree ensembles with mapreduce. Proc. VLDB Endow., 2:1426-1437, August 2009
19. Foster Provost. Distributed data mining: Scaling up and beyond. In Advances in Distributed and Parallel Knowledge Discovery, pages 3-27. MIT Press, 2000
20. R J Quinlan. C4.5: Programs for machine learning. Morgan Kaufmann, 1993
21. Ross J Quinlan. Induction of decision trees. Machine Learning, 1(1):81-106, 1986
22. P. Smyth and R M Goodman. An information theoretic approach to rule induction from databases. Transactions on Knowledge and Data Engineering, 4(4):301-316, 1992
23. F T Stahl,MA Bramer, andMAdda. PMCRI: A parallel modular classification rule induction framework. In MLDM, pages 148-162. Springer, 2009
24. Frederic Stahl, Max Bramer, and Mo Adda. J-PMCRI: A methodology for inducing pre-pruned modular classification rules. IFIP Advances in Information and Communication Technology, 331:47-56, 2010
25. Frederic Stahl, Max Bramer, and Mo Adda. Parallel rule induction with information theoretic pre-pruning. In Research and Development in Intelligent Systems XXVI, volume 4, pages 151-164. Springerlink, 2010
26. Frederic Stahl, Mohamed Medhat Gaber, Max Bramer, and Phillip S. Yu. Distributed hoeffding trees for pocket data mining. In The 2011 International Conference on High Performance Computing and Simulation, Istanbul, Turkey, in Press (2011
27. Frederic Stahl, Mohamed Medhat Gaber, Han Liu, Max Bramer, and Phillip S. Yu. Distributed classification for pocket data mining. In 19th International Symposium on Methodologies for Intelligent Systems, Warsaw, Poland, in Press (2011). Springer
28. Frederic T. Stahl and Max Bramer. Induction of modular classification rules: Using jmaxpruning. In SGAI Conf.'10, pages 79-92, 2010
29. Frederic T. Stahl, Max Bramer, and Mo Adda. Parallel induction of modular classification rules. In SGAI Conf., pages lookup-lookup. Springer, 2008
30. Frederic T. Stahl, Mohamed Medhat Gaber, Max Bramer, and Philip S. Yu. Pocket data mining: Towards collaborative data mining in mobile computing environments. In ICTAI (2)'10, pages 323-330, 2010
31. I H Witten and F Eibe. Data Mining: Practical Machine Learning Tools and Techniques with Java Implementations. Morgan Kaufmann, 1999