The DOI matches its Crossref record; 75 of the 75 references it cites were found in a registry or an index.
Data mining: an overview from a database perspective
Abstract
Mining information and knowledge from large databases has been recognized by many researchers as a key research topic in database systems and machine learning, and by many industrial companies as an important area with an opportunity of major revenues. Researchers in many different fields have shown great interest in data mining. Several emerging applications in information-providing services, such as data warehousing and online services over the Internet, also call for various data mining techniques to better understand user behavior, to improve the service provided and to increase business opportunities. In response to such a demand, this article provides a survey, from a database researcher's point of view, on the data mining techniques developed recently. A classification of the available data mining techniques is provided and a comparative study of such techniques is presented.
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
(1992) · Cited by 23,431
Quinlan, J. R. (1986) · Machine Learning · doi:10.1007/bf00116251 · Cited by 21,439
Probability, Random Variables, and Stochastic Processes.
Abrahams, J., & Papoulis, A. (1984) · Journal of the American Statistical Association · doi:10.2307/2288754 · Cited by 16,226
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
Finding groups in data: an introduction to cluster analysis
(1991) · Choice Reviews Online · doi:10.5860/choice.28-4558 · Cited by 10,474
Fast Algorithms for Mining Association Rules in Large Databases
Agrawal, R., & Srikant, R. (1994) · Very Large Data Bases · Cited by 9,419
Algorithms for Clustering Data
Sarle, W. S. (1990) · Technometrics · doi:10.1080/00401706.1990.10484648 · Cited by 7,865
Algorithms for clustering data
Flury, B. (1989) · Journal of Statistical Planning and Inference · doi:10.1016/0378-3758(89)90033-5 · Cited by 6,432
Agrawal, R., & Srikant, R. (2002) · Proceedings of the Eleventh International Conference on Data Engineering · doi:10.1109/icde.1995.380415 · Cited by 5,155
The R*-tree: an efficient and robust access method for points and rectangles
Beckmann, N., Kriegel, H.-P., Schneider, R., & Seeger, B. (1990) · Proceedings of the 1990 ACM SIGMOD international conference on Management of data · doi:10.1145/93597.98741 · Cited by 4,161
BIRCH: an efficient data clustering method for very large databases
Zhang, T., Ramakrishnan, R., & Livny, M. (1996) · Proceedings of the 1996 ACM SIGMOD international conference on Management of data - SIGMOD '96 · doi:10.1145/233269.233324 · Cited by 3,935
Advances in knowledge discovery and data mining
(1996) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(96)90007-3 · Cited by 2,971
From data mining to knowledge discovery: an overview
Fayyad, U. M., Piatetsky-Shapiro, G., & Smyth, P. (1996) · Knowledge Discovery and Data Mining · Cited by 2,395
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
Efficient and Effective Clustering Methods for Spatial Data Mining
Ng, R. T., & Han, J. (1994) · Cited by 1,778
Self-citationKnowledge Discovery in Databases
Piateski, G., & Frawley, W. (1991) · The MIT Press eBooks · Cited by 1,749
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
Mining generalized association rules
Srikant, R., & Agrawal, R. (1997) · Future Generation Computer Systems · doi:10.1016/s0167-739x(97)00019-8 · Cited by 1,618
An Efficient Algorithm for Mining Association Rules in Large Databases
Savasere, A., Omiecinski, E. R., & Navathe, S. B. (1995) · Cited by 1,590
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
Mining quantitative association rules in large relational tables
Srikant, R., & Agrawal, R. (1996) · Proceedings of the 1996 ACM SIGMOD international conference on Management of data - SIGMOD '96 · doi:10.1145/233269.233311 · Cited by 1,480
The R*-tree: an efficient and robust access method for points and rectangles
Beckmann, N., Kriegel, H.-P., Schneider, R., & Seeger, B. (1990) · ACM SIGMOD Record · doi:10.1145/93605.98741 · Cited by 1,424
An effective hash-based algorithm for mining association rules
Park, J. S., Chen, M.-S., & Yu, P. S. (1995) · Proceedings of the 1995 ACM SIGMOD international conference on Management of data - SIGMOD '95 · doi:10.1145/223784.223813 · Cited by 1,406
Self-citationCLARANS: a method for clustering objects for spatial data mining
Ng, R. T., & Han, J. (2002) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2002.1033770 · Cited by 1,202
Self-citationImplementing data cubes efficiently
Harinarayan, V., Rajaraman, A., & Ullman, J. D. (1996) · Proceedings - ACM-SIGMOD International Conference on Management of Data · doi:10.1145/233269.233333 · Cited by 1,158
Knowledge discovery in databases
FrawleyWilliam, J., Piatetsky-ShapiroGregory, & MatheusChristopher, J. (1992) · AI Magazine · doi:10.5555/140629.140633 · Cited by 1,055
A theory and methodology of inductive learning
Michalski, R. S. (1983) · Artificial Intelligence · doi:10.1016/0004-3702(83)90016-4 · Cited by 1,002
Discovery, Analysis, and Presentation of Strong Rules
Piatetsky-Shapiro, G. (1991) · Medical Entomology and Zoology · Cited by 993
Bayesian classification (AutoClass): theory and results
Cheeseman, P. C., & Stutz, J. (1996) · Cited by 975
Characterizing browsing strategies in the World-Wide web
Catledge, L. D., & Pitkow, J. E. (1995) · Computer Networks and ISDN Systems · doi:10.1016/0169-7552(95)00043-7 · Cited by 937
Discovery of Multiple-Level Association Rules from Large Databases
Han, J., & Fu, Y. (1995) · Cited by 922
Self-citationWeiss, S. M., & Kulikowski, C. A. (1991) · Morgan Kaufmann Publishers Inc. eBooks · Cited by 898
Faloutsos, C., & Lin, K.-I. (1995) · Proceedings of the 1995 ACM SIGMOD international conference on Management of data - SIGMOD '95 · doi:10.1145/223784.223812 · Cited by 897
Maintenance of discovered association rules in large databases: an incremental updating technique
Cheung, D. W., Han, J., Ng, V. T., & Wong, C. Y. (2002) · Proceedings of the Twelfth International Conference on Data Engineering · doi:10.1109/icde.1996.492094 · Cited by 800
Self-citationSLIQ: 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
Fast subsequence matching in time-series databases
Faloutsos, C., Ranganathan, M., & Manolopoulos, Y. (1994) · ACM SIGMOD Record · doi:10.1145/191843.191925 · Cited by 722
Finding interesting rules from large sets of discovered association rules
Klemettinen, M., Mannila, H., Ronkainen, P., Toivonen, H., & Verkamo, A. I. (1994) · Proceedings of the third international conference on Information and knowledge management - CIKM '94 · doi:10.1145/191246.191314 · Cited by 712
Research problems in data warehousing
Widom, J. (1995) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/221270.221319 · Cited by 698
Fast Similarity Search in the Presence of Noise, Scaling, and Translation in Time-Series Databases
Agrawal, R., Lin, K.-I., Sawhney, H., & Shim, K. (1995) · Cited by 649
Efficient algorithms for discovering association rules
Mannila, H., Toivonen, H. T. T., & Verkamo, A. I. (1994) · Cited by 624
Mining quantitative association rules in large relational tables
Srikant, R., & Agrawal, R. (1996) · ACM SIGMOD Record · doi:10.1145/235968.233311 · Cited by 581
An effective hash-based algorithm for mining association rules
Park, J. S., Chen, M.-S., & Yu, P. S. (1995) · ACM SIGMOD Record · doi:10.1145/568271.223813 · Cited by 491
Self-citationRough Sets, Fuzzy Sets and Knowledge Discovery
Ziarko, W. (1994) · Workshops in computing · doi:10.1007/978-1-4471-3238-7 · Cited by 489
Introduction to object-oriented databases
(1992) · Choice Reviews Online · doi:10.5860/choice.29-2750 · Cited by 468
Discovery of spatial association rules in geographic information databases
Koperski, K., & Han, J. (1995) · Lecture Notes in Computer Science · doi:10.1007/3-540-60159-7_4 · Cited by 452
Self-citationOn subjective measures of interestingness in knowledge discovery
Silberschatz, A., & Tuzhilin, A. (1995) · Knowledge Discovery and Data Mining · Cited by 447
Explora: a multipattern and multistrategy discovery assistant
Klösgen, W. (1996) · Publikationsdatenbank der Fraunhofer-Gesellschaft (Fraunhofer-Gesellschaft) · Cited by 438
View maintenance in a warehousing environment
Zhuge, Y., García-Molina, H., Hammer, J., & Widom, J. (1995) · Proceedings of the 1995 ACM SIGMOD international conference on Management of data - SIGMOD '95 · doi:10.1145/223784.223848 · Cited by 430
Data-driven discovery of quantitative rules in relational databases
Han, J., Cai, Y., & Cercone, N. (1993) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.204089 · Cited by 380
Self-citationData mining for path traversal patterns in a web environment
Chen, M.-S., Park, J. S., & Yu, P. S. (2002) · Proceedings of 16th International Conference on Distributed Computing Systems · doi:10.1109/icdcs.1996.507986 · Cited by 327
Self-citationSECURITY AND PRIVACY IMPLICATIONS OF DATA MINING
Clifton, C., & Marks, D. G. (1996) · Cited by 271
An Interval Classifier for Database Mining Applications
Agrawal, R., Ghosh, S. P., Imieliński, T., Iyer, B. R., & Swami, A. (1992) · Cited by 264
Scalable parallel data mining for association rules
Han, E.-H., Karypis, G., & Kumar, V. (1997) · Proceedings of the 1997 ACM SIGMOD international conference on Management of data - SIGMOD '97 · doi:10.1145/253260.253330 · Cited by 262
A Theory and Methodology of Inductive Learning
Michalski, R. S. (1983) · Machine Learning · doi:10.1007/978-3-662-12405-5_4 · Cited by 223
Efficient parallel data mining for association rules
Park, J. S., Chen, M.-S., & Yu, P. S. (1995) · Proceedings of the fourth international conference on Information and knowledge management - CIKM '95 · doi:10.1145/221270.221320 · Cited by 201
Self-citationAgrawal, R., Mehta, M., Shafer, J. C., Srikant, R., Arning, A., & Bollinger, T. (n.d.) · Cited by 200
Browsing in hypertext: a cognitive study
Carmel, E., Crawford, S., & Chen, H. (1992) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/21.179829 · Cited by 198
Dynamic generation and refinement of concept hierarchies for knowledge discovery in databases
Han, J., & Fu, Y. (1994) · Cited by 163
Self-citationEster, M., Kriegel, H.-P., & Xu, X. (1995) · Lecture Notes in Computer Science · doi:10.1007/3-540-60159-7_5 · Cited by 160
DBMiner: a system for mining knowledge in large relational databases
Han, J., Fu, Y., Wang, W., Chiang, J. Y., Gong, W., Koperski, K., Li, D., Lu, Y., Rajan, A., Stefanović, N., et al. (1996) · Cited by 153
Self-citationNeuroRule: A Connectionist Approach to Data MiningPreprint
Lü, H., Setiono, R., & Liu, H. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1701.01358 · Cited by 113
Knowledge Discovery as a Threat to Database Security.
O’Leary, D. E. (1991) · Cited by 105
Abstract-driven pattern discovery in databases
Dhar, V., & Tuzhulin, A. (1993) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.250075 · Cited by 105
Meta-Rule-Guided Mining of Association Rules in Relational Databases.
Fu, Y., & Han, J. (1995) · Cited by 86
Self-citationShen, W., Ong, K., Mitbander, B. G., & Zaniolo, C. (1996) · Cited by 86
Mining for knowledge in databases: The INLEN architecture, initial implementation and first results
Michalski, R. S., Kerschberg, L., Kaufman, K. A., & Ribeiro, J. S. (1992) · Journal of Intelligent Information Systems · doi:10.1007/bf01006415 · Cited by 80
Knowledge mining by imprecise querying: a classification-based approach
Anwar, T. M., Beck, H., & Navathe, S. B. (2003) · Proceedings - International Conference on Data Engineering · doi:10.1109/icde.1992.213146 · Cited by 77
Mining knowledge at multiple concept levels
Han, J. (1995) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/221270.221287 · Cited by 72
Self-citationDataMine : application programming interface and query language for database mining
Imieliński, T., Virmani, A., & Abdulghani, A. A. (1996) · Knowledge Discovery and Data Mining · Cited by 71
Supporting data mining of large databases by visual feedback queries
Keim, D. A., Kriegel, H.-P., & Seidl, T. (2002) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.1994.283045 · Cited by 59
Selecting and reporting what is interesting
Matheus, C. J., Piatetsky-Shapiro, G., & McNeill, D. (1996) · Knowledge Discovery and Data Mining · Cited by 45
Bussmann, J. B. J., Culhane, K. M., Horemans, H. L. D., et al. (2004) · IEEE Transactions on Neural Systems and Rehabilitation Engineering · doi:10.1109/tnsre.2004.840495 · Cited by 42
Backtracking in a multiple-window hypertext environment
Bieber, M., & Wan, J. (1994) · ACM European Conference on Hypermedia Technology (ECHT) · doi:10.1145/192757.192792 · Cited by 35
IDEA: interactive data exploration and analysis
Selfridge, P. G., Srivastava, D., & Wilson, L. O. (1996) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/233269.233315 · Cited by 30
Cited by
Data mining: concepts and techniques
(2012) · Choice Reviews Online · doi:10.5860/choice.49-3305 · Cited by 28,531
Data Mining: Practical Machine Learning Tools and Techniques
(2011) · Elsevier eBooks · doi:10.1016/c2009-0-19715-5 · Cited by 25,437
Kim, D. J., Ferrin, D. L., & Rao, H. R. (2008) · Decision Support Systems · doi:10.1016/j.dss.2007.07.001 · Cited by 3,613
Web usage mining: discovery and applications of usage patterns from Web data
Srivastava, J., Cooley, R., Deshpande, M., & Tan, P.-N. (2000) · ACM SIGKDD Explorations Newsletter · doi:10.1145/846183.846188 · Cited by 2,105
Chameleon: hierarchical clustering using dynamic modeling
Karypis, G., Han, E.-H., & Kumar, V. (1999) · Computer · doi:10.1109/2.781637 · Cited by 2,097
Metadata
- Authors
- Chen, M.-S., Han, J., & Yu, P. S.
- Venue
- IEEE Transactions on Knowledge and Data Engineering
- Published
- 1996
- Volume
- 8
- Issue
- 6
- Pages
- 866-883
- ISSN
- 1041-4347 (ISSN-L)
- OpenAlex
- W2153028052
- Cited by
- 2,232
- References
- 75
- FWCI
- 89.34
- 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.