The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
BOAT—optimistic decision tree construction
Open accessAbstract
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 very popular class of classifiers are decision trees. All current algorithms to construct decision trees, including all main-memory algorithms, make one scan over the training database per level of the tree. We introduce a new algorithm (BOAT) for decision tree construction that improves upon earlier algorithms in both performance and functionality. BOAT constructs several levels of the tree in only two scans over the training database, resulting in an average performance gain of 300% over previous work. The key to this performance improvement is a novel optimistic approach to tree construction in which we construct an initial tree using a small subset of the data and refine it to arrive at the final tree. We guarantee that any difference with respect to the “real” tree (i.e., the tree that would be constructed by examining all the data in a traditional way) is detected and corrected. The correction step occasionally requires us to make additional scans over subsets of the data; typically, this situation rarely arises, and can be addressed with little added cost. Beyond offering faster tree construction, BOAT is the first scalable algorithm with the ability to incrementally update the tree with respect to both insertions and deletions over the dataset. This property is valuable in dynamic environments such as data warehouses, in which the training dataset changes over time. The BOAT update operation is much cheaper than completely rebuilding the tree, and the resulting tree is guaranteed to be identical to the tree that would be produced by a complete re-build.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
An Introduction to the Bootstrap
Efron, B., & Tibshirani, R. J. (1994) · doi:10.1201/9780429246593 · Cited by 40,500
Classification and Regression Trees.
Gordon, A. D., Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (1984) · Biometrics · doi:10.2307/2530946 · Cited by 23,522
Quinlan, J. R. (1986) · Machine Learning · doi:10.1007/bf00116251 · Cited by 21,439
Classification and Regression Trees.
Ryzin, J. V., Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (1986) · Journal of the American Statistical Association · doi:10.2307/2288003 · Cited by 20,825
Classification And Regression Trees
Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (2017) · doi:10.1201/9781315139470 · Cited by 11,417
Bootstrap Methods and their Application
Davison, A. C., & Hinkley, D. V. (1997) · doi:10.1017/cbo9780511802843 · Cited by 7,350
Mangasarian, O. L. (1994) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971255 · Cited by 3,220
An Introduction to the Bootstrap.
Buckland, S. T., Efron, B., & Tibshirani, R. J. (1994) · Biometrics · doi:10.2307/2532810 · Cited by 3,103
Machine Learning, Neural and Statistical Classification
Fulkerson, B. (1995) · Technometrics · doi:10.1080/00401706.1995.10484383 · Cited by 2,209
Database mining: a performance perspective
Agrawal, R., Imielinski, T., & Swami, A. (1993) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.250074 · Cited by 1,505
Cited by
Data mining: concepts and techniques
(2012) · Choice Reviews Online · doi:10.5860/choice.49-3305 · Cited by 28,531
Mining high-speed data streams
Domingos, P., & Hulten, G. (2000) · Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/347090.347107 · Cited by 2,185
Mining time-changing data streams
Hulten, G., Spencer, L., & Domingos, P. (2001) · Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/502512.502529 · Cited by 1,748
Mining concept-drifting data streams using ensemble classifiers
Wang, H., Fan, W., Yu, P. S., & Han, J. (2003) · Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/956750.956778 · Cited by 1,256
A streaming ensemble algorithm (SEA) for large-scale classification
Street, W. N., & Kim, Y. (2001) · Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/502512.502568 · Cited by 1,205
Bankruptcy prediction in banks and firms via statistical and intelligent techniques – A review
Ravi Kumar, P., & Ravi, V. (2007) · European Journal of Operational Research · doi:10.1016/j.ejor.2006.08.043 · Cited by 1,074
Hand, D. J. (2007) · Drug Safety · doi:10.2165/00002018-200730070-00010 · Cited by 1,044
Top-Down Induction of Decision Trees Classifiers—A Survey
Rokach, L., & Maimon, O. (2005) · IEEE Transactions on Systems, Man and Cybernetics, Part C (Applications and Reviews) · doi:10.1109/tsmcc.2004.843247 · Cited by 792
Rokach, L., & Maimon, O. (2006) · Data Mining and Knowledge Discovery Handbook · doi:10.1007/0-387-25465-x_9 · Cited by 594
Efficient C4.5 [classification algorithm]
Ruggieri, S. (2002) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.991727 · Cited by 389
Series in Machine Perception and Artificial Intelligence
(2012) · Series in machine perception and artificial intelligence · doi:10.1142/smpai · Cited by 365
An Empirical Study of Learning from Imbalanced Data Using Random Forest
Khoshgoftaar, T. M., Golawala, M., & Hulse, J. V. (2007) · 19th IEEE International Conference on Tools with Artificial Intelligence(ICTAI 2007) · doi:10.1109/ictai.2007.46 · Cited by 361
A novel evolutionary data mining algorithm with applications to churn prediction
Au, W.-H., Chan, K. C. C., & Yao, X. (2003) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2003.819264 · Cited by 348
A Pearson’s correlation coefficient based decision tree and its parallel implementation
Mu, Y., Liu, X., & Wang, L. (2018) · Information Sciences · doi:10.1016/j.ins.2017.12.059 · Cited by 336
Ensemble-based multi-filter feature selection method for DDoS detection in cloud computing
Osanaiye, O., Cai, H., Choo, K.-K. R., Dehghantanha, A., Xu, Z., & Dlodlo, M. (2016) · EURASIP Journal on Wireless Communications and Networking · doi:10.1186/s13638-016-0623-3 · Cited by 317
Cancer classification using gene expression data
Lu, Y., & Han, J. (2003) · Information Systems · doi:10.1016/s0306-4379(02)00072-8 · Cited by 278
On computing correlated aggregates over continual data streams
Gehrke, J., Korn, F., & Srivastava, D. (2001) · Proceedings of the 2001 ACM SIGMOD international conference on Management of data · doi:10.1145/375663.375665 · Cited by 278
Self-citationAn application of machine learning to network intrusion detection
Sinclair, C., Pierce, L., & Matzner, S. (2003) · Proceedings 15th Annual Computer Security Applications Conference (ACSAC'99) · doi:10.1109/csac.1999.816048 · Cited by 271
PLANET: massively parallel learning of tree ensembles with MapReduce
Panda, B., Herbach, J. S., Basu, S., & Bayardo, R. J. (2009) · Proceedings of the VLDB Endowment · doi:10.14778/1687553.1687569 · Cited by 267
Metadata
- Authors
- Gehrke, J., Ganti, V., Ramakrishnan, R., & Loh, W.-Y.
- Venue
- ACM SIGMOD Record
- Published
- 1999-06
- Volume
- 28
- Issue
- 2
- Pages
- 169-180
- ISSN
- 0163-5808 (ISSN-L)
- OpenAlex
- W2033139852
- Cited by
- 288
- References
- 27
- FWCI
- 38.03
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.