Article

RainForest - A Framework for Fast Decision Tree Construction of Large Datasets

Authors:

Johannes Gehrke,

Raghu Ramakrishnan,

Venkatesh GantiAuthors Info & Claims

VLDB '98: Proceedings of the 24rd International Conference on Very Large Data Bases

Pages 416 - 427

Published: 24 August 1998 Publication History

Abstract

No abstract available.

References

[1]

{AGI+92} Rakesh Agrawal, Sakti P. Ghosh, Tomasz Imielinski, Balakrishna R. Iyer, Arun N. Swami: An Interval Classifier for Database Mining Applications. VLDB 1992: 560-573.

Digital Library

Google Scholar

[2]

{AIS93} Rakesh Agrawal, Tomasz Imielinski, Arun N. Swami: Database Mining: A Performance Perspective. IEEE Trans. Knowl. Data Eng. 5(6): 914-925(1993).

Digital Library

Google Scholar

[3]

{ASW87} Morton M. Astrahan, Mario Schkolnick, Kyu-Young Whang: Approximating the number of unique values of an attribute without sorting. Inf. Syst. 12(1): 11-15(1987).

Digital Library

Google Scholar

[4]

{BFOS84} Leo Breiman, J. H. Friedman, R. A. Olshen, C. J. Stone: Classification and Regression Trees. Wadsworth 1984, ISBN 0-534-98053-8.

Google Scholar

[5]

{BU92} C.E. Brodley and P.E. Utgoff. Multivariate versus univariate decision trees. TR 8, Department of Computer Science, University of Massachussetts, 1992.

Digital Library

Google Scholar

[6]

{Cat91} J. Catlett. Megainduction: Machine Learning on Very Large Databases. PhD thesis, University of Sydney, 1991.

Google Scholar

[7]

{CFIQ88} J. Cheng, U.M. Fayyad, K.B. Irani, and Z. Qian. Improved decision trees: A generalized version of ID3. In Proc. of Machine Learning, 1988.

Crossref

Google Scholar

[8]

{CM94} S.P. Curram and J. Mingers. Neural networks, decision tree induction and discriminant analysis: an empirical comparison. Journal of the Operational Research Society, 45:440-450, 1994.

Crossref

Google Scholar

[9]

{CS93a} Philip K. Chan, Salvatore J. Stolfo: Experiments on Multi-Strategy Learning by Meta-Learning. CIKM 1993: 314- 323.

Digital Library

Google Scholar

[10]

{CS93b} P. K. Chan and S. J. Stolfo. Meta-learning for multistrategy and parallel learning. In Proc. Second Intl. Workshop on Multistrategy Learning, 1993.

Google Scholar

[11]

{DBP93} V. Corruble D.E. Brown and C.L. Pittard. A comparison of decision classifiers with backpropagation neural networks for multimodal classification problems. Pattern Recognition, 26:953-961, 1993.

Crossref

Google Scholar

[12]

{DKS95} J. Dougherty, R. Kahove, and M. Sahami. Supervised and unsupervised discretization of continous features. In Proc. of Machine Learning, 1995.

Google Scholar

[13]

{Fay91} U.M. Fayyad. On the induction of decision trees for multiple concept learning. PhD thesis, EECS Department, The University of Michigan, 1991.

Digital Library

Google Scholar

[14]

{FI93} U.M. Fayyad and K. Irani. Multi-interval discretization of continous-valued attributes for classification learning. In Proc. of the International Joint Conference on Artificial Intelligence, 1993.

Google Scholar

[15]

{FMM96} Takeshi Fukuda, Yasuhiko Morimoto, Shinichi Morishita, Takeshi Tokuyama: Constructing Efficient Decision Trees by Using Optimized Numeric Association Rules. VLDB 1996: 146-155.

Digital Library

Google Scholar

[16]

{GJ79} M. R. Garey, David S. Johnson: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman 1979, ISBN 0-7167-1044-7.

Digital Library

Google Scholar

[17]

{Han97} D.J. Hand. Construction and Assessment of Classification Rules, 1997.

Google Scholar

[18]

{HNSS95} Peter J. Haas, Jeffrey F. Naughton, S. Seshadri, Lynne Stokes: Sampling-Based Estimation of the Number of Distinct Values of an Attribute. VLDB 1995: 311-322.

Digital Library

Google Scholar

[19]

{LLS97} T.-S. Lim, W.-Y. Loh, and Y.-S. Shih. An empirical comparison of decision trees and other classification methods. TR 979, Department of Statistics, UW Madison, June 1997.

Google Scholar

[20]

{LS97} W.-Y. Loh and Y.-S. Shih. Split selection methods for classification trees. Statistica Sinica, 7(4), October 1997.

Google Scholar

[21]

{LV88} W.-Y. Loh and N. Vanichsetakul. Tree-structured classification via generalized disriminant analysis (with discussion). Journal of the American Statistical Association, 83:715-728, 1988.

Crossref

Google Scholar

[22]

{Maa94} W. Maass. Efficient agnostic pac-learning with simple hypothesis. In Proc. of Conference on Computational Learning Theory, 1994.

Digital Library

Google Scholar

[23]

{Mag93} J. Magidson. The CHAID approach to segmentation modeling. In Handbook of Marketing Research, 1993.

Google Scholar

[24]

{MAR96} Manish Mehta, Rakesh Agrawal, Jorma Rissanen: SLIQ: A Fast Scalable Classifier for Data Mining. EDBT 1996: 18- 32.

Digital Library

Google Scholar

[25]

{MRA95} Manish Mehta, Jorma Rissanen, Rakesh Agrawal: MDL-Based Decision Tree Pruning. KDD 1995: 216-221.

Google Scholar

[26]

{MST94} D. Michie, D.J. Spiegelhalter, and C.C. Taylor, editors. Machine Learning, Neural and Statistical Classification , 1994.

Digital Library

Google Scholar

[27]

{Qui79} J.R. Quinlan. Discovering rules by induction from large collections of examples. In Expert Systems in the Micro Electronic Age, 1979.

Google Scholar

[28]

{Qui83} J.R Quinlan. Learning efficient classification procedures. In Machine Learning: An Artificial Intelligence Approach, 1983.

Google Scholar

[29]

{Qui86} J. Ross Quinlan: Induction of Decision Trees. Machine Learning 1(1): 81-106(1986).

Crossref

Google Scholar

[30]

{Qui93} J. Ross Quinlan: C4.5: Programs for Machine Learning. Morgan Kaufmann 1993, ISBN 1-55860-238-0.

Digital Library

Google Scholar

[31]

{RS98} Rajeev Rastogi, Kyuseok Shim: PUBLIC: A Decision Tree Classifier that Integrates Building and Pruning. VLDB 1998: 404-415.

Digital Library

Google Scholar

[32]

{Ris89} J. Rissanen. Stochastic Complexity in Statistical Inquiry , 1989.

Digital Library

Google Scholar

[33]

{SAM96} John C. Shafer, Rakesh Agrawal, Manish Mehta: SPRINT: A Scalable Parallel Classifier for Data Mining. VLDB 1996: 544-555.

Digital Library

Google Scholar

[34]

{SMT91} J.W. Shavlik, R.J. Mooney, and G.G. Towell. Symbolic and neural learning algorithms: an empirical comparison. Machine Learning, 6:111-144, 1991.

Digital Library

Google Scholar

[35]

{WK91} S.M. Weiss and C.A. Kulikowski. Computer Systems that Learn: Classification and Prediction Methods from Statistics, Neural Nets, Machine Learning, and Expert Systems, 1991.

Digital Library

Google Scholar

[36]

{YFM+98} Yasuhiko Morimoto, Takeshi Fukuda, Hirofumi Matsuzawa, Takeshi Tokuyama, Kunikazu Yoda: Algorithms for Mining Association Rules for Binary Segmentations of Huge Categorical Databases. VLDB 1998: 380-391.

Digital Library

Google Scholar

Cited By

View all

Tzirakis PTjortjis C(2017)T3CAdvances in Data Analysis and Classification10.1007/s11634-016-0246-x11:2(353-370)Online publication date: 1-Jun-2017
https://dl.acm.org/doi/10.1007/s11634-016-0246-x
Li PWu XHu X(2012)Mining Recurring Concept Drifts with Limited Labeled Streaming DataACM Transactions on Intelligent Systems and Technology10.1145/2089094.20891053:2(1-32)Online publication date: 1-Feb-2012
https://dl.acm.org/doi/10.1145/2089094.2089105
Bifet A(2010)Adaptive Stream MiningProceedings of the 2010 conference on Adaptive Stream Mining: Pattern Learning and Mining from Evolving Data Streams10.5555/1735125.1735127(1-212)Online publication date: 27-Jul-2010
https://dl.acm.org/doi/10.5555/1735125.1735127
Show More Cited By

Recommendations

RainForest—A Framework for Fast Decision Tree Construction of Large Datasets

Classification of large datasets is an important data mining problem. Many classification algorithms have been proposed in the literature, but studies have shown that so far no algorithm uniformly outperforms all other algorithms in terms of quality. In ...
BOAT—optimistic decision tree construction

Classification is an important data mining problem. Given a training database of records, each tagged with a class label, the goal of classification is to build a concise model that can be used to predict the class label of future, unlabeled records. A ...
BOAT—optimistic decision tree construction
SIGMOD '99: Proceedings of the 1999 ACM SIGMOD international conference on Management of data

Classification is an important data mining problem. Given a training database of records, each tagged with a class label, the goal of classification is to build a concise model that can be used to predict the class label of future, unlabeled records. A ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

VLDB '98: Proceedings of the 24rd International Conference on Very Large Data Bases

August 1998

695 pages

ISBN:1558605665

Publisher

Morgan Kaufmann Publishers Inc.

San Francisco, CA, United States

Publication History

Published: 24 August 1998

Qualifiers

Article

Conference

VLDB98

VLDB98: International Conference on Very Large Databases

August 24 - 27, 1998

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

59
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 12 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Tzirakis PTjortjis C(2017)T3CAdvances in Data Analysis and Classification10.1007/s11634-016-0246-x11:2(353-370)Online publication date: 1-Jun-2017
https://dl.acm.org/doi/10.1007/s11634-016-0246-x
Li PWu XHu X(2012)Mining Recurring Concept Drifts with Limited Labeled Streaming DataACM Transactions on Intelligent Systems and Technology10.1145/2089094.20891053:2(1-32)Online publication date: 1-Feb-2012
https://dl.acm.org/doi/10.1145/2089094.2089105
Bifet A(2010)Adaptive Stream MiningProceedings of the 2010 conference on Adaptive Stream Mining: Pattern Learning and Mining from Evolving Data Streams10.5555/1735125.1735127(1-212)Online publication date: 27-Jul-2010
https://dl.acm.org/doi/10.5555/1735125.1735127
Fang LLeFevre K(2010)SplashProceedings of the 13th International Conference on Extending Database Technology10.1145/1739041.1739076(275-286)Online publication date: 22-Mar-2010
https://dl.acm.org/doi/10.1145/1739041.1739076
Sug H(2009)An effective sampling method for decision trees considering comprehensibility and accuracyWSEAS Transactions on Computers10.5555/1558756.15587628:4(631-640)Online publication date: 1-Apr-2009
https://dl.acm.org/doi/10.5555/1558756.1558762
Sug H(2009)An empirical determination of samples for decision treesProceedings of the 8th WSEAS international conference on Artificial intelligence, knowledge engineering and data bases10.5555/1553921.1553998(413-416)Online publication date: 21-Feb-2009
https://dl.acm.org/doi/10.5555/1553921.1553998
Panda BHerbach JBasu SBayardo R(2009)PLANETProceedings of the VLDB Endowment10.14778/1687553.16875692:2(1426-1437)Online publication date: 1-Aug-2009
https://dl.acm.org/doi/10.14778/1687553.1687569
Ye JChow JChen JZheng ZCheung DSong IChu WHu XLin J(2009)Stochastic gradient boosted distributed decision treesProceedings of the 18th ACM conference on Information and knowledge management10.1145/1645953.1646301(2061-2064)Online publication date: 2-Nov-2009
https://dl.acm.org/doi/10.1145/1645953.1646301
Bifet AHolmes GPfahringer BKirkby RGavaldà RElder JFogelman FFlach PZaki M(2009)New ensemble methods for evolving data streamsProceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining10.1145/1557019.1557041(139-148)Online publication date: 28-Jun-2009
https://dl.acm.org/doi/10.1145/1557019.1557041
Chen BRamakrishnan RShavlik JTamma P(2009)Bellwether analysisACM Transactions on Knowledge Discovery from Data10.1145/1497577.14975823:1(1-49)Online publication date: 23-Mar-2009
https://dl.acm.org/doi/10.1145/1497577.1497582
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Recommendations