The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Database mining: a performance perspective
Abstract
The authors' perspective of database mining as the confluence of machine learning techniques and the performance emphasis of database technology is presented. Three classes of database mining problems involving classification, associations, and sequences are described. It is argued that these problems can be uniformly viewed as requiring discovery of rules embedded in massive amounts of data. A model and some basic operations for the process of rule discovery are described. It is shown how the database mining problems considered map to this model, and how they can be solved by using the basic operations proposed. An example is given of an algorithm for classification obtained by combining the basic rule discovery operations. This algorithm is efficient in discovering classification rules and has accuracy comparable to ID3, one of the best current classifiers.>
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
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
An introduction to computing with neural nets
Lippmann, R. (1987) · IEEE ASSP Magazine · doi:10.1109/massp.1987.1165576 · Cited by 7,825
Principles of database and knowledge-base systems
(1989) · Choice Reviews Online · doi:10.5860/choice.26-5107 · Cited by 2,683
Quinlan, J. R. (1987) · International Journal of Man-Machine Studies · doi:10.1016/s0020-7373(87)80053-6 · Cited by 2,553
Knowledge Discovery in Databases
Piateski, G., & Frawley, W. (1991) · The MIT Press eBooks · Cited by 1,749
(1988) · Computer Science Press, Inc. eBooks · Cited by 1,435
Knowledge discovery in databases
FrawleyWilliam, J., Piatetsky-ShapiroGregory, & MatheusChristopher, J. (1992) · AI Magazine · doi:10.5555/140629.140633 · Cited by 1,055
Discovery, Analysis, and Presentation of Strong Rules
Piatetsky-Shapiro, G. (1991) · Medical Entomology and Zoology · Cited by 993
Cited by
Data Mining: Practical Machine Learning Tools and Techniques
(2011) · Elsevier eBooks · doi:10.1016/c2009-0-19715-5 · Cited by 25,437
Mining association rules between sets of items in large databases
Agrawal, R., Imieliński, T., & Swami, A. (1993) · Proceedings of the 1993 ACM SIGMOD international conference on Management of data · doi:10.1145/170035.170072 · Cited by 14,907
Self-citationMining association rules between sets of items in large databases
Agrawal, R., Imieliński, T., & Swami, A. (1993) · ACM SIGMOD Record · doi:10.1145/170036.170072 · Cited by 4,551
Self-citationA survey on concept drift adaptation
Gama, J., Žliobaitė, I., Bifet, A., Pechenizkiy, M., & Bouchachia, A. (2014) · ACM Computing Surveys · doi:10.1145/2523813 · Cited by 3,735
Toward integrating feature selection algorithms for classification and clustering
Liu, H., & Yu, L. (2005) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2005.66 · Cited by 2,706
Automatic subspace clustering of high dimensional data for data mining applications
Agrawal, R., Gehrke, J., Gunopulos, D., & Raghavan, P. (1998) · Proceedings of the 1998 ACM SIGMOD international conference on Management of data · doi:10.1145/276304.276314 · Cited by 2,412
Self-citationData mining: an overview from a database perspective
Chen, M.-S., Han, J., & Yu, P. S. (1996) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.553155 · Cited by 2,232
Efficient similarity search in sequence databases
Agrawal, R., Faloutsos, C., & Swami, A. (1993) · Lecture Notes in Computer Science · doi:10.1007/3-540-57301-1_5 · Cited by 1,979
Self-citationDynamic itemset counting and implication rules for market basket data
Brin, S., Motwani, R., Ullman, J. D., & Tsur, S. (1997) · Proceedings of the 1997 ACM SIGMOD international conference on Management of data - SIGMOD '97 · doi:10.1145/253260.253325 · Cited by 1,951
Fast subsequence matching in time-series databases
Faloutsos, C., Ranganathan, M., & Manolopoulos, Y. (1994) · Proceedings of the 1994 ACM SIGMOD international conference on Management of data · doi:10.1145/191839.191925 · Cited by 1,709
Beyond market baskets: generalizing association rules to correlations
Brin, S., Motwani, R., & Silverstein, C. (1997) · Proceedings of the 1997 ACM SIGMOD international conference on Management of data - SIGMOD '97 · doi:10.1145/253260.253327 · Cited by 1,281
Input feature selection for classification problems
Kwak, N., & Choi, C.-H. (2002) · IEEE Transactions on Neural Networks · doi:10.1109/72.977291 · Cited by 938
Adaptive random forests for evolving data stream classification
Gomes, H. M., Bifet, A., Read, J., Barddal, J. P., Enembreck, F., Pfharinger, B., Holmes, G., & Abdessalem, T. (2017) · Machine Learning · doi:10.1007/s10994-017-5642-8 · Cited by 805
SLIQ: A fast scalable classifier for data mining
Mehta, M., Agrawal, R., & Rissanen, J. (1996) · Lecture Notes in Computer Science · doi:10.1007/bfb0014141 · Cited by 749
Self-citationFast subsequence matching in time-series databases
Faloutsos, C., Ranganathan, M., & Manolopoulos, Y. (1994) · ACM SIGMOD Record · doi:10.1145/191843.191925 · Cited by 722
Machine learning and data mining
Mitchell, T. M. (1999) · Communications of the ACM · doi:10.1145/319382.319388 · Cited by 691
Data Mining and Knowledge Discovery
Cios, K. J., Pedrycz, W., & Swiniarski, R. W. (1998) · Data Mining Methods for Knowledge Discovery · doi:10.1007/978-1-4615-5589-6_1 · Cited by 689
Fast Time Sequence Indexing for Arbitrary Lp Norms
Yi, B.-K., & Faloutsos, C. (2018) · doi:10.1184/r1/6605618 · Cited by 650
A Survey on Ensemble Learning for Data Stream Classification
Gomes, H. M., Barddal, J. P., Enembreck, F., & Bifet, A. (2018) · ACM Computing Surveys · doi:10.1145/3054925 · Cited by 579
Knowledge management and data mining for marketing
Shaw, M. J., Subramaniam, C., Tan, G. W., & Welge, M. E. (2001) · Decision Support Systems · doi:10.1016/s0167-9236(00)00123-8 · Cited by 575
Selecting the right objective measure for association analysis
Tan, P.-N., Kumar, V., & Srivastava, J. (2004) · Information Systems · doi:10.1016/s0306-4379(03)00072-3 · Cited by 568
New ensemble methods for evolving data streams
Bifet, A., Holmes, G., Pfahringer, B., Kirkby, R., & Gavaldà, R. (2009) · Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1557019.1557041 · Cited by 558
Identifying the signs of fraudulent accounts using data mining techniques
Li, S.-H., Yen, D. C., Lu, W.-H., & Wang, C. (2012) · Computers in Human Behavior · doi:10.1016/j.chb.2012.01.002 · Cited by 505
A database perspective on knowledge discovery
Imielinski, T., & Mannila, H. (1996) · Communications of the ACM · doi:10.1145/240455.240472 · Cited by 470
Self-citationEfficient mining of both positive and negative association rules
Wu, X., Zhang, C., & Zhang, S. (2004) · ACM Transactions on Information Systems · doi:10.1145/1010614.1010616 · Cited by 466
Business intelligence: data mining and optimization for decision making
Vercellis, C., Ahmadi, A., & Mohebi, A. (2016) · doi:10.5281/zenodo.13983826 · Cited by 398
Neural-network feature selector
Setiono, R., & Liu, H. (1997) · IEEE Transactions on Neural Networks · doi:10.1109/72.572104 · Cited by 379
Lent, B., Swami, A., & Widom, J. (2002) · Proceedings 13th International Conference on Data Engineering · doi:10.1109/icde.1997.581756 · Cited by 374
Self-citationBeyond Market Baskets: Generalizing Association Rules to Dependence Rules
Silverstein, C., Brin, S., & Motwani, R. (1998) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009713703947 · Cited by 368
Effective data mining using neural networks
Lu, H., Setiono, R., & Liu, H. (1996) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.553163 · Cited by 358
RainForest—A Framework for Fast Decision Tree Construction of Large Datasets
Gehrke, J., Ramakrishnan, R., & Ganti, V. (2000) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009839829793 · Cited by 348
Efficient mining of association rules in distributed databases
Cheung, D. W., Ng, V. T., Fu, A. W., & Fu, Y. (1996) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.553158 · Cited by 345
Combinatorial Heterogeneous Catalysis—A New Path in an Old Field
Senkan, S. (2001) · Angewandte Chemie International Edition · doi:10.1002/1521-3773(20010119)40:2<312::aid-anie312>3.0.co;2-i · Cited by 311
Beyond market baskets: generalizing association rules to correlations
Brin, S., Motwani, R., & Silverstein, C. (1997) · ACM SIGMOD Record · doi:10.1145/253262.253327 · Cited by 308
BOAT—optimistic decision tree construction
Gehrke, J., Ganti, V., Ramakrishnan, R., & Loh, W.-Y. (1999) · ACM SIGMOD Record · doi:10.1145/304181.304197 · Cited by 288
Data mining using two-dimensional optimized association rules: scheme, algorithms, and visualization
Fukuda, T., Morimoto, Y., Morishita, S., & Tokuyama, T. (1996) · Proceedings of the 1996 ACM SIGMOD international conference on Management of data - SIGMOD '96 · doi:10.1145/233269.233313 · Cited by 265
Set-oriented mining for association rules in relational databases
Houtsma, M., & Swami, A. (2002) · Proceedings of the Eleventh International Conference on Data Engineering · doi:10.1109/icde.1995.380413 · Cited by 263
Self-citationSystems for knowledge discovery in databases
Matheus, C. J., Chan, P. K., & Piatetsky-Shapiro, G. (1993) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.250073 · Cited by 254
A comprehensive survey of numeric and symbolic outlier mining techniques
Agyemang, M., Barker, K., & Alhajj, R. (2006) · Intelligent Data Analysis · doi:10.3233/ida-2006-10604 · Cited by 164
A Data Mining methodology for cross-sales
Anand, S. S., Patrick, A. R., Hughes, J. G., & Bell, D. A. (1998) · Knowledge-Based Systems · doi:10.1016/s0950-7051(98)00035-5 · Cited by 72
A COMPARISON BETWEEN DIFFERENT CLASSIFIERS FOR TENNIS MATCH RESULT PREDICTION
Ghosh, S., Sadhu, S., Biswas, S., Sarkar, D., & Sarkar, P. P. (2019) · Malaysian Journal of Computer Science · doi:10.22452/mjcs.vol32no2.2 · Cited by 20
Metadata
- Authors
- Agrawal, R., Imielinski, T., & Swami, A.
- Venue
- IEEE Transactions on Knowledge and Data Engineering
- Published
- 1993-12
- Volume
- 5
- Issue
- 6
- Pages
- 914-925
- ISSN
- 1041-4347 (ISSN-L)
- 1558-2191
- 2326-3865
- OpenAlex
- W2100406636
- Cited by
- 1,505
- References
- 15
- FWCI
- 85.66
- Type
- journal article
- Language
- en
- Open access
- closed
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.