Top 10 algorithms in data mining
The DOI matches its Crossref record; 108 of the 110 references it cites were found in a registry or an index.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“One of the significant advantages of the DT algorithm is its simplicity of comprehension and interpretation [66-68].”
From Cost Overrun Risk Assessment and Prediction in Construction Projects: A Bayesian Network Classifier Approach (2022) · cites this paper as [68]
Citations
Cites
Maximum Likelihood from Incomplete Data Via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1977.tb01600.x · Cited by 50,444
The Nature of Statistical Learning Theory
Vapnik, V. N. (1995) · doi:10.1007/978-1-4757-2440-0 · Cited by 39,138
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
(1967) · Cited by 23,719
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
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
A decision-theoretic generalization of on-line learning and an application to boosting
Freund, Y., & Schapire, R. E. (1997) · Journal of Computer and System Sciences · doi:10.1006/jcss.1997.1504 · Cited by 20,466
Rapid object detection using a boosted cascade of simple features
Viola, P., & Jones, M. (2005) · Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR 2001 · doi:10.1109/cvpr.2001.990517 · Cited by 18,300
Social Network Analysis: Methods and Applications
Wasserman, S., & Faust, K. (1994) · doi:10.1017/cbo9780511815478 · Cited by 17,557
Nearest neighbor pattern classification
Cover, T., & Hart, P. (1967) · IEEE Transactions on Information Theory · doi:10.1109/tit.1967.1053964 · Cited by 16,936 · cited 1×
“In particular, a well known result by Cover and Hart [15] shows that the the error of the nearest neighbor rule is bounded above by twice the Bayes error under certain reasonable assumptions.”
BackgroundLeast squares quantization in PCM
Lloyd, S. (1982) · IEEE Transactions on Information Theory · doi:10.1109/tit.1982.1056489 · Cited by 15,836 · cited 1×
“This algorithm has been discovered by several researchers across different disciplines, most notably Lloyd (1957, 1982) [53], Forgey (1965), Friedman and Rubin (1967), and McQueen (1967).”
(1999) · Cited by 12,854
Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond
Schölkopf, B., & Smola, A. J. (2001) · The MIT Press eBooks · doi:10.7551/mitpress/4175.001.0001 · Cited by 11,703 · cited 1×
“Much study in recent years have gone into the study of different kernels for SVM classification [70] and for many other statistical tests.”
BackgroundClassification And Regression Trees
Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (2017) · doi:10.1201/9781315139470 · Cited by 11,417
Fast algorithms for mining association rules
Agrawal, R., & Srikant, R. (1998) · Cited by 11,307
McLachlan, G., & Peel, D. (2000) · Wiley Series in Probability and Statistics · doi:10.1002/0471721182 · Cited by 10,991
Self-citationFast 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 · cited 1×
“A detailed history of k-means alongwith descriptions of several variations are given in [43].”
Background(2008) · Data Mining and Market Intelligence for Optimal Marketing Returns · doi:10.4324/9780080878096-12 · Cited by 6,954
Friedman, J., Hastie, T., & Tibshirani, R. (2000) · The Annals of Statistics · doi:10.1214/aos/1016218223 · Cited by 6,884
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
Mining frequent patterns without candidate generation
Han, J., Pei, J., & Yin, Y. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335372 · Cited by 6,402
(2017) · The SAGE Encyclopedia of Communication Research Methods · doi:10.4135/9781483381411.n575 · Cited by 6,008
Loève, M. (1963) · Andalas University Repository (Andalas University) · Cited by 5,938
The EM Algorithm and Extensions
Kushary, D. (1998) · Technometrics · doi:10.1080/00401706.1998.10485534 · Cited by 5,417 · cited 1×
“3] described the E- and M-steps of the EM algorithm for the maximum likelihood (ML) estimation of multivariate normal components; see also [56].”
MethodSelf-citationFriedman, N., Geiger, D., & Goldszmidt, M. (1997) · Machine Learning · doi:10.1023/a:1007465528199 · Cited by 4,742
The Strength of Weak Learnability
Schapire, R. E. (1990) · Machine Learning · doi:10.1007/bf00116037 · Cited by 4,600 · cited 1×
“Schapire [67] found that the answer to the question is “yes”, and the proof he gave is a construction, which is the first Boosting algorithm.”
BackgroundBIRCH: 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
A Probabilistic Theory of Pattern Recognition
Devroye, L., Györfi, L., & Lugosi, G. (1996) · Stochastic Modelling and Applied Probability · doi:10.1007/978-1-4612-0711-5 · Cited by 3,274 · cited 1×
“[18].”
Mining frequent patterns without candidate generation
Han, J., Pei, J., & Yin, Y. (2000) · Proceedings of the 2000 ACM SIGMOD international conference on Management of data · doi:10.1145/342009.335372 · Cited by 3,216 · cited 1×
“The most outstanding improvement over Apriori would be a method called FP-growth (frequent pattern growth) that succeeded in eliminating candidate generation [36].”
MethodOn the Optimality of the Simple Bayesian Classifier under Zero-One Loss
Domingos, P., & Pazzani, M. (1997) · Machine Learning · doi:10.1023/a:1007413511361 · Cited by 3,101
An Algorithm for Finding Best Matches in Logarithmic Expected Time
Friedman, J. H., Bentley, J. L., & Finkel, R. A. (1977) · ACM Transactions on Mathematical Software · doi:10.1145/355744.355745 · Cited by 2,813 · cited 2×
“Friedman [ 25 ] suggested moving instances with missing splitter attributes into both left and right child nodes and making a final class assignment by pooling all nodes in which an instance appears.”
BackgroundMining sequential patterns: Generalizations and performance improvements
Srikant, R., & Agrawal, R. (1996) · Lecture Notes in Computer Science · doi:10.1007/bfb0014140 · Cited by 2,711
Improved boosting algorithms using confidence-rated predictions
Schapire, R. E., & Singer, Y. (1998) · Proceedings of the eleventh annual conference on Computational learning theory · doi:10.1145/279943.279960 · Cited by 2,547
A Comparison of Document Clustering Techniques
Steinbach, M. S., Karypis, G., & Kumar, V. (2000) · Cited by 2,532
Self-citationBoosting the margin: a new explanation for the effectiveness of voting methods
Bartlett, P., Freund, Y., Lee, W. S., & Schapire, R. E. (1998) · The Annals of Statistics · doi:10.1214/aos/1024691352 · Cited by 2,306 · cited 1×
“[68] presented a margin-based explanation.”
Asymptotic Properties of Nearest Neighbor Rules Using Edited Data
Wilson, D. L. (1972) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1972.4309137 · Cited by 2,130 · cited 1×
“In addition, data objects can be removed to improve classification accuracy, a process known as “editing” [88].”
BackgroundgSpan: graph-based substructure pattern mining
Yan, X., & Han, J. (2003) · 2002 IEEE International Conference on Data Mining, 2002. Proceedings. · doi:10.1109/icdm.2002.1184038 · Cited by 2,013 · cited 1×
“(5) using richer expressions than itemset: Many algorithms have been proposed for sequences, tree and graphs to enable mining from more complex data structure [90,42].”
BackgroundImproved Boosting Algorithms Using Confidence-rated Predictions
Schapire, R. E., & Singer, Y. (1999) · Machine Learning · doi:10.1023/a:1007614523901 · Cited by 1,971 · cited 1×
“MH [69] which works by decomposing multi-class task to a series of binary tasks.”
BackgroundAuthoritative sources in a hyperlinked environment
Kleinberg, J. M. (1998) · Symposium on Discrete Algorithms · doi:10.5555/314613.315045 · Cited by 1,814
PrefixSpan,: mining sequential patterns efficiently by prefix-projected pattern growth
Pei, J., Han, J., Mortazavi-Asl, B., Pinto, H., Chen, Q., Dayal, U., & Hsu, M.-C. (2005) · Proceedings 17th International Conference on Data Engineering · doi:10.1109/icde.2001.914830 · Cited by 1,791
The condensed nearest neighbor rule (Corresp.)
Hart, P. (1968) · IEEE Transactions on Information Theory · doi:10.1109/tit.1968.1054155 · Cited by 1,733
Nearest neighbor (NN) norms: NN pattern classification techniques
Dasarathy, B. V. (1991) · Medical Entomology and Zoology · Cited by 1,654
Gray, R. M., & Neuhoff, D. L. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720541 · Cited by 1,642
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 · cited 1×
“The major ones include the followings: (1) incorporating taxonomy in items [72]: Use of taxonomy makes it possible to extract frequent itemsets that are expressed by higher concepts even when use of the base level concepts produces only infrequent itemsets.”
BackgroundClustering with Bregman Divergences
Banerjee, A., Merugu, S., Dhillon, I., & Ghosh, J. (2004) · Proceedings of the 2004 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972740.22 · Cited by 1,472 · cited 1×
“It has been recently shown that if one measures distance by selecting any member of a very large class of divergences called Bregman divergences during the assignment step and makes no other changes, the essential properties ofk-means, including guaranteed convergence, linear separation boundaries and scalability, are…”
BackgroundSelf-citationMetaCost: a general method for making classifiers cost-sensitive
Domingos, P. (1999) · Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/312129.312220 · Cited by 1,303 · cited 4×
“10.9 Probability trees Probability trees have been recently discussed in a series of insightful articles elucidating their properties and seeking to improve their performance (see Provost and Domingos 2000).”
BackgroundInfluentialGoogle's PageRank and Beyond: The Science of Search Engine Rankings
Langville, A. N., & Meyer, C. D. (2006) · Cited by 1,204
Kernel k-means: spectral clustering and normalized cuts
Dhillon, I. S., Guan, Y., & Kulis, B. (2004) · Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1014052.1014118 · Cited by 1,193 · cited 1×
“[19] have shown a close connection between kernel k-means and spectral clustering.”
BackgroundWeb data mining: exploring hyperlinks, contents, and usage data
(2012) · Choice Reviews Online · doi:10.5860/choice.49-2718 · Cited by 1,179
Algorithms for clustering data
Jain, A. K., & Dubes, R. C. (1988) · Cited by 1,037
Idiot's Bayes—Not So Stupid After All?
Hand, D. J., & Yu, K. (2001) · International Statistical Review · doi:10.1111/j.1751-5823.2001.tb00465.x · Cited by 973 · cited 1×
“General discussion of the naive Bayes method and its merits are given in [22,33].”
MethodSelf-citation10 CHALLENGING PROBLEMS IN DATA MINING RESEARCH
YANG, Q., & WU, X. (2006) · International Journal of Information Technology & Decision Making · doi:10.1142/s0219622006002258 · Cited by 930 · cited 2×
“Wu was giving a seminar on 10 Challenging Problems in Data Mining Research [89] at PolyU.”
BackgroundSelf-citationCore Vector Machines: Fast SVM Training on Very Large Data Sets
Tsang, I. W.-H., Kwok, J. T.-Y., & Cheung, P.-M. (2005) · doi:10.5555/1046920.1058114 · Cited by 928
Discriminant adaptive nearest neighbor classification
Hastie, T., & Tibshirani, R. (1996) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.506411 · Cited by 833
Google's PageRank and Beyond: The Science of Search Engine Rankings
Langville, A. N., & Meyer, C. D. (2006) · doi:10.1515/9781400830329 · Cited by 814
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 · cited 1×
“The algorithm in [12] updates the frequent itemsets without restarting from scratch.”
A weighted nearest neighbor algorithm for learning with symbolic features
Cost, S., & Salzberg, S. (1993) · Machine Learning · doi:10.1007/bf00993481 · Cited by 764 · cited 1×
“The PEBLS system by by Cost and Salzberg [14] is a well known example of such an approach.”
MethodWettschereck, D., Aha, D. W., & Mohri, T. (1997) · Artificial Intelligence Review · doi:10.1023/a:1006593614256 · Cited by 717
McLachlan, G. J. (1987) · Applied Statistics · doi:10.2307/2347790 · Cited by 708 · cited 1×
“One way to proceed is to use a resampling approach as in [55].”
MethodSelf-citationHunt, E. B., Marin, J., & Stone, P. J. (1966) · Medical Entomology and Zoology · Cited by 691
Knowledge and data engineering
Ramamoorthy, C. V., & Wah, B. W.-S. (1989) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.43400 · Cited by 670
Simon, H. A., Hunt, E. B., Marin, J., & Stone, P. (1967) · The American Journal of Psychology · doi:10.2307/1421207 · Cited by 659 · cited 3×
“These notes describe C4.5 [64], a descendant of CLS [41] and ID3 [62].”
BackgroundThe reduced nearest neighbor rule (Corresp.)
Gates, G. (1972) · IEEE Transactions on Information Theory · doi:10.1109/tit.1972.1054809 · Cited by 566
Prediction Games and Arcing Algorithms
Breiman, L. (1999) · Neural Computation · doi:10.1162/089976699300016106 · Cited by 530
An instance-weighting method to induce cost-sensitive trees
Ting, K. M. (2002) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2002.1000348 · Cited by 504
Probabilistic inference for solving discrete and continuous state Markov Decision Processes
Toussaint, M., & Storkey, A. (2006) · Proceedings of the 23rd international conference on Machine learning - ICML '06 · doi:10.1145/1143844.1143963 · Cited by 482
The EM algorithm and extensions
McLachlan, G. J., & Krishnan, T. (1997) · Cited by 451
Self-citationOptimal multi-step k-nearest neighbor search
Seidl, T., & Kriegel, H.-P. (1998) · Proceedings of the 1998 ACM SIGMOD international conference on Management of data · doi:10.1145/276304.276319 · Cited by 442
The Reduced Nearest Neighbor Rule
Gates, G. W. (1998) · Cited by 416
Tao, D., Li, X., Hu, W., Maybank, S., & Wu, X. (2006) · Fifth IEEE International Conference on Data Mining (ICDM'05) · doi:10.1109/icdm.2005.139 · Cited by 373
Self-citationText Categorization Using Weight Adjusted k-Nearest Neighbor Classification
Han, E.-H., Karypis, G., & Kumar, V. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45357-1_9 · Cited by 354 · cited 1×
“A number of schemes have been developed that try to compute the weights of each individual attribute based upon a training set [32].”
BackgroundSelf-citationUNKNOWN ATTRIBUTE VALUES IN INDUCTION
Quinlan, J. R. (1989) · Elsevier eBooks · doi:10.1016/b978-1-55860-036-2.50048-5 · Cited by 340 · cited 3×
“Quinlan [63] opted for a weighted variant of Friedman’s approach in his study of alternative missing value-handling methods.”
BackgroundMethodInfluentialTao, D., Li, X., Wu, X., Hu, W., & Maybank, S. J. (2007) · Knowledge and Information Systems · doi:10.1007/s10115-006-0050-6 · Cited by 299 · cited 1×
“this article are among the most influential algorithms for classification [47,51,77], clustering [11,31,40,44–46], statistical learning [28,76,92], association analysis [2,6,13,50,54,74], and link mining.”
BackgroundSelf-citationUsing discriminant analysis for multi-class classification: an experimental investigation
Li, T., Zhu, S., & Ogihara, M. (2006) · Knowledge and Information Systems · doi:10.1007/s10115-006-0013-y · Cited by 269
Proceedings of the Fourth International Conference on Knowledge Discovery and Data Mining
Agrawal, R., & Stolorz, P. (1998) · Knowledge Discovery and Data Mining · Cited by 252
Friedman, J. H. (1996) · Cited by 233
How boosting the margin can also boost classifier complexity
Reyzin, L., & Schapire, R. E. (2006) · Proceedings of the 23rd international conference on Machine learning - ICML '06 · doi:10.1145/1143844.1143939 · Cited by 212 · cited 6×
“The AdaBoost algorithm [24] proposed by Yoav Freund and Robert Schapire is one of the most important ensemble methods, since it has solid theoretical foundation, very accurate prediction, great simplicity (Schapire said it needs only “just 10 lines of code”), and wide and successful applications.”
BackgroundInfluentialTransversing itemset lattices with statistical metric pruning
Morishita, S., & Sese, J. (2000) · Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems - PODS '00 · doi:10.1145/335168.335226 · Cited by 209
Catch the moment: maintaining closed frequent itemsets over a data stream sliding window
Chi, Y., Wang, H., Yu, P. S., & Muntz, R. R. (2006) · Knowledge and Information Systems · doi:10.1007/s10115-006-0003-0 · Cited by 173
Self-citationStoeckel, J., & Fung, G. (2006) · Fifth IEEE International Conference on Data Mining (ICDM'05) · doi:10.1109/icdm.2005.141 · Cited by 166
Generalized k-nearest neighbor rules
Bezdek, J. C., Chuah, S. K., & Leep, D. (1986) · Fuzzy Sets and Systems · doi:10.1016/0165-0114(86)90004-7 · Cited by 163 · cited 1×
“Finally, a fuzzy approach to kNN can be found in the work of Bezdek [4].”
MethodFung, G., & Stoeckel, J. (2006) · Knowledge and Information Systems · doi:10.1007/s10115-006-0043-5 · Cited by 156 · cited 1×
“this article are among the most influential algorithms for classification [47,51,77], clustering [11,31,40,44–46], statistical learning [28,76,92], association analysis [2,6,13,50,54,74], and link mining.”
BackgroundCanTree: a canonical-order tree for incremental frequent-pattern mining
Leung, C. K.-S., Khan, Q., Li, Z., & Hoque, T. (2006) · Knowledge and Information Systems · doi:10.1007/s10115-006-0032-8 · Cited by 140
A collaborative filtering framework based on fuzzy association rules and multiple-level similarity
Leung, C. W.-K., Chan, S. C. F., & Chung, F.-L. (2006) · Knowledge and Information Systems · doi:10.1007/s10115-006-0002-1 · Cited by 129
Fast agglomerative hierarchical clustering algorithm using Locality-Sensitive Hashing
Koga, H., 石橋, 徹., & Watanabe, T. (2006) · Knowledge and Information Systems · doi:10.1007/s10115-006-0027-5 · Cited by 119 · cited 1×
“this article are among the most influential algorithms for classification [47,51,77], clustering [11,31,40,44–46], statistical learning [28,76,92], association analysis [2,6,13,50,54,74], and link mining.”
BackgroundFast and exact out-of-core and distributed k-means clustering
Jin, R., Goswami, A., & Agrawal, G. (2005) · Knowledge and Information Systems · doi:10.1007/s10115-005-0210-0 · Cited by 107 · cited 1×
“this article are among the most influential algorithms for classification [47,51,77], clustering [11,31,40,44–46], statistical learning [28,76,92], association analysis [2,6,13,50,54,74], and link mining.”
BackgroundA Modal Search Technique for Predictive Nominal Scale Multivariate Analysis
Messenger, R., & Mandell, L. (1972) · Journal of the American Statistical Association · doi:10.1080/01621459.1972.10481290 · Cited by 92 · cited 2×
“(This splitter is a modified version of Messenger and Mandell [58].)”
BackgroundText Categorization Using Weight Adjusted k-Nearest Neighbor Classification
Han, E.-H. S., Karypis, G., & Kumar, V. (1999) · Defense Technical Information Center (DTIC) · doi:10.21236/ada439688 · Cited by 82
Self-citationInterpretable boosted naïve Bayes classification
Ridgeway, G. K., Madigan, D., Richardson, T. S., & O’Kane, J. W. (1998) · Cited by 77
Gondek, D. C., & Hofmann, T. (2006) · Knowledge and Information Systems · doi:10.1007/s10115-006-0009-7 · Cited by 62 · cited 1×
“this article are among the most influential algorithms for classification [47,51,77], clustering [11,31,40,44–46], statistical learning [28,76,92], association analysis [2,6,13,50,54,74], and link mining.”
BackgroundMultiple labels associative classification
Thabtah, F., Cowling, P., & Peng, Y. (2005) · Knowledge and Information Systems · doi:10.1007/s10115-005-0213-x · Cited by 56
Learning accurate and concise naïve Bayes classifiers from attribute value taxonomies and data
Zhang, J., Kang, D.-K., Silvescu, A., & Honavar, V. (2005) · Knowledge and Information Systems · doi:10.1007/s10115-005-0211-z · Cited by 56
Adding the Temporal Dimension to Search — A Case Study in Publication Search
Yu, P. S., Li, X., & Liu, B. (2005) · IEEE/WIC/ACM International Conference on Web Intelligence · doi:10.1109/wi.2005.21 · Cited by 54 · cited 1×
“Since PageRank was presented in [10,61], researchers have proposed many enhancements to the model, alternative models, improvements for its computation, adding the temporal dimension [91], etc.”
BackgroundSelf-citationOn condensed representations of constrained frequent patterns
Bonchi, F., & Lucchese, C. (2005) · Knowledge and Information Systems · doi:10.1007/s10115-005-0201-1 · Cited by 43
GENE CLASSIFICATION USING EXPRESSION PROFILES: A FEASIBILITY STUDY
Kuramochi, M., & Karypis, G. (2005) · International Journal of Artificial Intelligence Tools · doi:10.1142/s0218213005002302 · Cited by 39
Generalizing the notion of confidence
Steinbach, M. S., & Kumar, V. (2006) · Knowledge and Information Systems · doi:10.1007/s10115-006-0041-7 · Cited by 33
Self-citationQuality assessment of individual classifications in machine learning and data mining
Kukar, M. (2005) · Knowledge and Information Systems · doi:10.1007/s10115-005-0203-z · Cited by 30 · cited 1×
“this article are among the most influential algorithms for classification [47,51,77], clustering [11,31,40,44–46], statistical learning [28,76,92], association analysis [2,6,13,50,54,74], and link mining.”
BackgroundTree-based partitioning of date for association rule mining
Ahmed, S., Coenen, F., & Leng, P. H. (2006) · Knowledge and Information Systems · doi:10.1007/s10115-006-0010-1 · Cited by 26 · cited 1×
“this article are among the most influential algorithms for classification [47,51,77], clustering [11,31,40,44–46], statistical learning [28,76,92], association analysis [2,6,13,50,54,74], and link mining.”
BackgroundMaking clustering in delay-vector space meaningful
Chen, J. R. (2006) · Knowledge and Information Systems · doi:10.1007/s10115-006-0042-6 · Cited by 24
A General Framework for Mining Frequent Subgraphs from Labeled Graphs
Inokuchi, A., Washio, T., & Motoda, H. (2004) · Fundamenta Informaticae · Cited by 16
Self-citationA Conversaton with Leo Breiman
Olshen, R. A. (2001) · Statistical Science · doi:10.1214/ss/1009213290 · Cited by 16
Risk Estimation for Classification Trees
Bloch, D. A., Olshen, R. A., & Walker, M. G. (2002) · Journal of Computational and Graphical Statistics · doi:10.1198/106186002760180509 · Cited by 15 · cited 1×
“[5] reported very good performance for the Breiman adjustment in a series of empirical experiments.”
BackgroundExploring overlapping clusters using dynamic re-scaling and sampling
Kobayashi, M., & Aono, M. (2006) · Knowledge and Information Systems · doi:10.1007/s10115-006-0005-y · Cited by 10 · cited 1×
“this article are among the most influential algorithms for classification [47,51,77], clustering [11,31,40,44–46], statistical learning [28,76,92], association analysis [2,6,13,50,54,74], and link mining.”
BackgroundFinding centroid clusterings with entropy-based criteria
Hu, T., & Sung, S. Y. (2006) · Knowledge and Information Systems · doi:10.1007/s10115-006-0017-7 · Cited by 9
Proc. 6th International Conference on Discovery Science
Grieser, G., Tanaka, Y., & Yamamoto, A. (2003) · Cited by 8
Deriving Class Association Rules Based on Levelwise Subspace Clustering
Washio, T., Nakanishi, K., & Motoda, H. (2005) · Lecture notes in computer science · doi:10.1007/11564126_74 · Cited by 4 · cited 1×
“A method of subspace clustering can be used to obtain an optimal value interval for each item in each itemset [85].”
MethodSelf-citation
Research works printed but not linked: 5
- Brin S and Page L (1998). The anatomy of a large-scale hypertextual Web Search Sngine. Comput Networks 30(1–7): 107–117
- Dietterich TG (1997). Machine learning: Four current directions. AI Mag 18(4): 97–136
- Hand DJ and Yu K (2001). Idiots Bayes—not so stupid after all?. Int Stat Rev 69: 385–398
- Quinlan JR (1979) Discovering rules by induction from large collections of examples. In: Michie D (ed), Expert systems in the micro electronic age. Edinburgh University Press, Edinburgh
- Toussaint GT (2002) Proximity graphs for nearest neighbor decision rules: recent progress. In: Interface-2002, 34th symposium on computing and statistics (theme: Geoscience and Remote Sensing). Ritz-Carlton Hotel, Montreal, Canada, 17–20 April, 2002
Cited by
Pan, S. J., & Yang, Q. (2010) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2009.191 · Cited by 23,387
“ATA mining and machine learning technologies have already achieved significant success in many knowledge engineering areas including classification, regression, and clustering (e.g., [1], [2]).”
BackgroundSelf-citationBusiness intelligence and analytics: from big data to big impact
Chen, H., Chiang, R. H. L., & Storey, V. C. (2012) · MIS Quarterly · doi:10.2307/41703503 · Cited by 6,250
Machine learning: Algorithms, real-world applications and research directions
Sarker, I. H. (2021) · SN Computer Science · doi:10.1007/s42979-021-00592-x · Cited by 5,583
Chen, M., Mao, S., & Liu, Y. (2014) · Mobile Networks and Applications · doi:10.1007/s11036-013-0489-0 · Cited by 2,913
“In 2006, The IEEE International Conference on Data Mining Series (ICDM) identified ten most influential data mining algorithms through a strict selection procedure [111], including C4.”
BackgroundGalar, M., Fernandez, A., Barrenechea, E., Bustince, H., & Herrera, F. (2012) · IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews) · doi:10.1109/tsmcc.2011.2161285 · Cited by 2,794
Metadata
- Authors
- Wu, X., Kumar, V., Ross Quinlan, J., Ghosh, J., Yang, Q., Motoda, H., McLachlan, G. J., Ng, A., Liu, B., Yu, P. S., Zhou, Z.-H., Steinbach, M., Hand, D. J., & Steinberg, D.
- Affiliations
- University of Vermont (US)
- University of Minnesota (US)
- The University of Texas at Austin (US)
- Hong Kong University of Science and Technology (HK)
- Asian Office of Aerospace Research and Development (JP)
- The University of Queensland (AU)
- University of Illinois Chicago (US)
- IBM (United States) (US)
- Nanjing University (CN)
- Imperial College London (GB)
- Salford Systems (United States) (US)
- Corresponding author
- Wu, Xindong
- ORCID
- Venue
- Knowledge and Information Systems
- Published
- 2007-12-04
- Volume
- 14
- Issue
- 1
- Pages
- 1-37
- ISSN
- 0219-1377 (ISSN-L)
- 0219-3116
- OpenAlex
- W2142827986
- Cited by
- 5,667
- References
- 110
- Citations by year
- 2026: 103 · 2025: 238 · 2024: 325 · 2023: 415 · 2022: 420 · 2021: 464 · 2020: 453 · 2019: 565 · 2018: 427 · 2017: 395 · 2016: 396 · 2015: 351 · 2014: 309 · 2013: 221 · 2012: 220
- FWCI
- 181.45
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- www.springer.com/tdm (tdm)
- Locations
- Knowledge and Information Systems (publishedVersion)
- Rare & Special e-Zone (The Hong Kong University of Science and Technology) (submittedVersion)
- Griffith Research Online (submittedVersion)
- Topics
- Physical Sciences › Computer Science › Information Systems › Data Mining Algorithms and Applications
- Physical Sciences › Computer Science › Information Systems › Data Mining and Machine Learning Applications
- Physical Sciences › Computer Science › Artificial Intelligence › Advanced Clustering Algorithms Research
- Keywords
- data mining algorithms, C4.5, K-means clustering, support vector machine, Apriori algorithm, expectation-maximization algorithm, PageRank, AdaBoost, k-nearest neighbors, naive Bayes, CART, classification, clustering, association analysis, link mining, statistical learning
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.