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
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
Discovering Frequent Closed Itemsets for Association Rules
Pasquier, N., Bastide, Y., Taouil, R., & Lakhal, L. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-49257-7_25 · Cited by 1,378
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
Hotho, A., Nürnberger, A., & Paaß, G. (2005) · Journal for Language Technology and Computational Linguistics · doi:10.21248/jlcl.20.2005.68 · Cited by 893
State-of-the-art in privacy preserving data mining
Verykios, V. S., Bertino, E., Fovino, I. N., Provenza, L. P., Saygin, Y., & Theodoridis, Y. (2004) · ACM SIGMOD Record · doi:10.1145/974121.974131 · Cited by 816
Zheng, B., Yoon, S. W., & Lam, S. S. (2014) · Expert Systems with Applications · doi:10.1016/j.eswa.2013.08.044 · Cited by 549
A Brief Survey of Text Mining: Classification, Clustering and Extraction Techniques
Allahyari, M., Pouriyeh, S., Assefi, M., Safaei, S., Trippe, E. D., Gutiérrez, J. B., & Kochut, K. J. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1707.02919 · Cited by 509
Efficient 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
Turning telecommunications call details to churn prediction: a data mining approach
Wei, C.-P., & Chiu, I.-T. (2002) · Expert Systems with Applications · doi:10.1016/s0957-4174(02)00030-1 · Cited by 460
Chien, C.-F., & Chen, L.-F. (2008) · Expert Systems with Applications · doi:10.1016/j.eswa.2006.09.003 · Cited by 457
LEE, T., & CHEN, I. (2005) · Expert Systems with Applications · doi:10.1016/j.eswa.2004.12.031 · Cited by 389
Lee, T.-S., Chiu, C.-C., Chou, Y.-C., & Lu, C.-J. (2006) · Computational Statistics & Data Analysis · doi:10.1016/j.csda.2004.11.006 · Cited by 378
Integrating AHP and data mining for product recommendation based on customer lifetime value
Liu, D.-R., & Shih, Y.-Y. (2005) · Information & Management · doi:10.1016/j.im.2004.01.008 · Cited by 347
A survey of frequent subgraph mining algorithms
Jiang, C., Coenen, F., & Zito, M. (2013) · The Knowledge Engineering Review · doi:10.1017/s0269888912000331 · Cited by 346
Mining multiple-level association rules in large databases
Han, J., & Fu, Y. (1999) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.806937 · Cited by 327
Self-citationA survey of interestingness measures for knowledge discovery
MCGARRY, K. (2005) · The Knowledge Engineering Review · doi:10.1017/s0269888905000408 · Cited by 318
A Tutorial on Environment-Aware Communications via Channel Knowledge Map for 6G
Zeng, Y., Chen, J., Xu, J., Wu, D., Xu, X., Jin, S., Gao, X., Gesbert, D., Cui, S., & Zhang, R. (2024) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2024.3364508 · Cited by 303
Brill, T. M., Munoz, L., & Miller, R. J. (2019) · Journal of Marketing Management · doi:10.1080/0267257x.2019.1687571 · Cited by 291
Pourtaghi, Z. S., Pourghasemi, H. R., Aretano, R., & Semeraro, T. (2016) · Ecological Indicators · doi:10.1016/j.ecolind.2015.12.030 · Cited by 289
Forecasting and operational research: a review
Fildes, R., Nikolopoulos, K., Crone, S. F., & Syntetos, A. A. (2008) · Journal of the Operational Research Society · doi:10.1057/palgrave.jors.2602597 · Cited by 287
Profiling relational data: a survey
Abedjan, Z., Golab, L., & Naumann, F. (2015) · The VLDB Journal · doi:10.1007/s00778-015-0389-y · Cited by 283
A Survey of Methods for Scaling Up Inductive Algorithms
Provost, F., & Kolluri, V. (1999) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009876119989 · Cited by 277
Isolated items discarding strategy for discovering high utility itemsets
Li, Y.-C., Yeh, J.-S., & Chang, C.-C. (2008) · Data & Knowledge Engineering · doi:10.1016/j.datak.2007.06.009 · Cited by 267
A Survey of Utility-Oriented Pattern Mining
Gan, W., Lin, J. C.-W., Fournier-Viger, P., Chao, H.-C., Tseng, V. S., & Yu, P. S. (2021) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2019.2942594 · Cited by 257
Self-citation(2003) · Cited by 165
Mousavizadeh, M., Kim, D. J., & Chen, R. (2016) · Decision Support Systems · doi:10.1016/j.dss.2016.09.011 · Cited by 95
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
- 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.