A streaming parallel decision tree algorithm

Journal of Machine Learning Research

Volumn 11, Issue , 2010, Pages 849-872

  Ben Haim, Yael ^a   Tom Tov, Elad ^a  

^a IBM HAIFA RESEARCH LAB   (Israel)

Author keywords

Decision tree classifiers; Distributed computing; Scalability; Streaming data

Indexed keywords

DECISION TREE CLASSIFIERS; DISTRIBUTED COMPUTING; DISTRIBUTED ENVIRONMENTS; LARGE DATASETS; MASTER PROCESSOR; MULTIPLE PROCESSORS; PARALLEL DECISION TREES; RIGOROUS ANALYSIS; STREAMING DATA; TREE NODES;

ALGORITHMS; CLASSIFIERS; DECISION TREES; GRAPHIC METHODS; SCALABILITY;

DATA PROCESSING;

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

References (28)

1. Rakesh Agrawal and Arun Swami. A one-pass space-efficient algorithm for finding quantiles. In Proceedings of COMAD, Pune, India, 1995.
2. Khaled AlSabti, Sanjay Ranka, and Vineet Singh. CLOUDS: Classification for large or out-of-core datasets. In Conference on Knowledge Discovery and Data Mining, August 1998.
3. Nuno Amado, Joao Gama, and Fernando Silva. Parallel implementation of decision tree learning algorithms. In The 10th Portuguese Conference on Artificial Intelligence on Progress in Artificial Intelligence, Knowledge Extraction, Multi-agent Systems, Logic Programming and Constraint Solving, pages 6-13, December 2001.
4. Catherine L. Blake, Eamonn J. Keogh, and Christopher J.Merz. UCI repository of machine learning databases. University of California, Irvine, Dept. of Information and Computer Sciences, 1998. http://www.ics.uci.edu/ ~mlearn/MLRepository.html.
5. Leon Bottou and Olivier Bousquet. The tradeoffs of large scale learning. In Advances in Neural Information Processing Systems, volume 20. MIT Press, Cambridge, MA, 2008. URL http://leon.bottou.org/papers/bottou-bousquet-2008. to appear.
6. Leo Breiman, Jerome H. Friedman, Richard Olshen, and Charles J. Stone. Classification and Regression Trees. Wadsworth, Monterrey, CA, 1984.
7. Graham Cormode and S.Muthukrishnan. An improved data stream summary: the count-min sketch and its applications. Journal of Algorithms, 55(1):58-75, 2005.
8. Janez Demšar. Statistical comparisons of classifiers over multiple data sets. Journal of Machine Learning Research, 7:1-30, 2006.
9. Johannes Gehrke, Venkatesh Ganti, Raghu Ramakrishnan, and Wei-Yin Loh. BOAT - optimistic decision tree construction. In ACM SIGMOD International Conference on Management of Data, pages 169-180, June 1999.
10. Anna C. Gilbert, Yannis Kotidis, S. Muthukrishnan, and Martin J. Strauss. How to summarize the universe: dynamic maintenance of quantiles. In Proceedings of the 28th VLDB Conference, pages 454-465, 2002.
11. Sanjay Goil and Alok Choudhary. Efficient parallel classification using dimensional aggregates. In Workshop on Large-Scale Parallel KDD Systems, SIGKDD, pages 197-210, August 1999.
12. Michael Greenwald and Sanjeev Khanna. Space-efficient online computation of quantile summaries. In Proceedings of ACM SIGMOD, Santa Barbara, California, pages 58-66, 'may' 2001.
13. Isaac D. Guedalia, Mickey London, and Michael Werman. An on-line agglomerative clustering method for nonstationary data. Neural Comp., 11(2):521-540, 1999.
14. Sudipto Guha, Nick Koudas, and Kyuseok Shim. Approximation and streaming algorithms for histogram construction problems. ACM Trans. on Database Systems, 31(1):396-438, 'mar' 2006.
15. Yannis E. Ioannidis. The history of histograms (abridged). In Proceedings of the VLDB Conference, pages 19-30, 2003.
16. 2 algorithm for dynamic calculation of quantiles and histograms without storing observations. Communications of the ACM, 28(10):1076-1085, 'oct' 1985.
17. Ruoming Jin and Gagan Agrawal. Communication and memory efficient parallel decision tree construction. In The 3rd SIAM International Conference on Data Mining, May 2003.
18. Mahesh V. Joshi, George Karypis, and Vipin Kumar. ScalParC: A new scalable and efficient parallel classification algorithm for mining large datasets. In The 12th International Parallel Processing Symposium, pages 573-579, March 1998.
19. Michael Kearns and Yishay Mansour. On the boosting ability of top-down decision tree learning algorithms. Journal of Computer and System Sciences, 58(1):109-128, 'feb' 1999.
20. Xuemin Lin. Continuously maintaining order statistics over data streams. In Proceedings of the 18th Australian Database Conference, Ballarat, Victoria, Australia, 2007.
21. Gurmeet Singh Manku, Sridhar Rajagopalan, and Bruce G. Lindsay. Approximate medians and other quantiles in one pass and with limited memory. In Proceedings of ACM SIGMOD, Seattle, WA, USA, pages 426-435, 1998.
22. Manish Mehta, Rakesh Agrawal, and Jorma Rissanen. SLIQ: A fast scalable classifier for data mining. In The 5th International Conference on Extending Database Technology, pages 18-32, 1996.
23. Girija J. Narlikar. A parallel, multithreaded decision tree builder. Technical Report CMU-CS-98-184, Carnegie Mellon University, 1998.
24. Pascal, 2008. Pascal large scale learning challenge, 2008. http://largescale.first.fraunhofer.de, datasets can be downloaded from http://ftp.first.fraunhofer.de/pub/projects/largescale.
25. PML. IBM Parallel Machine Learning Toolbox, 2009. http://www.alphaworks. ibm.com/tech/pml.
26. John Shafer, Rakesh Agrawal, and Manish Mehta. SPRINT: A scalable parallel classifier for data mining. In The 22nd International Conference on Very Large Databases, pages 544-555, September 1996.
27. Mahesh K. Sreenivas, Khaled Alsabti, and Sanjay Ranka. Parallel out-of-core divide-and-conquer techniques with applications to classification trees. In The 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing, pages 555-562, 1999. Available as preprint in http://ipdps.cc.gatech.edu/1999/papers/207.pdf.
28. Anurag Srivastava, Eui-Hong Han, Vipin Kumar, , and Vineet Singh. Parallel formulations of decision-tree classification algorithms. Data Mining and Knowledge Discovery, 3(3):237-261, September 1999.