{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,3]],"date-time":"2026-08-03T20:36:48Z","timestamp":1785789408508,"version":"3.56.0"},"reference-count":92,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,12,4]],"date-time":"2007-12-04T00:00:00Z","timestamp":1196726400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2008,1]]},"DOI":"10.1007\/s10115-007-0114-2","type":"journal-article","created":{"date-parts":[[2007,12,3]],"date-time":"2007-12-03T14:02:12Z","timestamp":1196690532000},"page":"1-37","source":"Crossref","is-referenced-by-count":4171,"title":["Top 10 algorithms in data mining"],"prefix":"10.1007","volume":"14","author":[{"given":"Xindong","family":"Wu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vipin","family":"Kumar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"J.","family":"Ross Quinlan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Joydeep","family":"Ghosh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qiang","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hiroshi","family":"Motoda","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Geoffrey J.","family":"McLachlan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Angus","family":"Ng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bing","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Philip S.","family":"Yu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhi-Hua","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"Steinbach","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David J.","family":"Hand","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dan","family":"Steinberg","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2007,12,4]]},"reference":[{"key":"114_CR1","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules. In: Proceedings of the 20th VLDB conference, pp 487\u2013499"},{"issue":"3","key":"114_CR2","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/s10115-006-0010-1","volume":"10","author":"S Ahmed","year":"2006","unstructured":"Ahmed S, Coenen F and Leng PH (2006). Tree-based partitioning of date for association rule mining. Knowl Inf Syst 10(3): 315\u2013331","journal-title":"Knowl Inf Syst"},{"key":"114_CR3","first-page":"1705","volume":"6","author":"A Banerjee","year":"2005","unstructured":"Banerjee A, Merugu S, Dhillon I and Ghosh J (2005). Clustering with Bregman divergences. J Mach Learn Res 6: 1705\u20131749","journal-title":"J Mach Learn Res"},{"key":"114_CR4","doi-asserted-by":"crossref","unstructured":"Bezdek JC, Chuah SK, Leep D (1986) Generalized k-nearest neighbor rules. Fuzzy Sets Syst 18(3):237\u2013256. http:\/\/dx.doi.org\/10.1016\/0165-0114(86)90004-7","DOI":"10.1016\/0165-0114(86)90004-7"},{"key":"114_CR5","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1198\/106186002760180509","volume":"11","author":"DA Bloch","year":"2002","unstructured":"Bloch DA, Olshen RA and Walker MG (2002). Risk estimation for classification trees. J Comput Graph Stat 11: 263\u2013288","journal-title":"J Comput Graph Stat"},{"issue":"2","key":"114_CR6","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1007\/s10115-005-0201-1","volume":"9","author":"F Bonchi","year":"2006","unstructured":"Bonchi F and Lucchese C (2006). On condensed representations of constrained frequent patterns. Knowl Inf Syst 9(2): 180\u2013201","journal-title":"Knowl Inf Syst"},{"key":"114_CR7","unstructured":"Breiman L (1968) Probability theory. Addison-Wesley, Reading. Republished (1991) in Classics of mathematics. SIAM, Philadelphia"},{"issue":"7","key":"114_CR8","doi-asserted-by":"crossref","first-page":"1493","DOI":"10.1162\/089976699300016106","volume":"11","author":"L Breiman","year":"1999","unstructured":"Breiman L (1999). Prediction games and arcing classifiers. Neural Comput 11(7): 1493\u20131517","journal-title":"Neural Comput"},{"key":"114_CR9","volume-title":"Classification and regression trees","author":"L Breiman","year":"1984","unstructured":"Breiman L, Friedman JH, Olshen RA and Stone CJ (1984). Classification and regression trees. Wadsworth, Belmont"},{"issue":"1\u20137","key":"114_CR10","first-page":"107","volume":"30","author":"S Brin","year":"1998","unstructured":"Brin S and Page L (1998). The anatomy of a large-scale hypertextual Web Search Sngine. Comput Networks 30(1\u20137): 107\u2013117","journal-title":"Comput Networks"},{"issue":"3","key":"114_CR11","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/s10115-006-0042-6","volume":"11","author":"JR Chen","year":"2007","unstructured":"Chen JR (2007). Making clustering in delay-vector space meaningful. Knowl Inf Syst 11(3): 369\u2013385","journal-title":"Knowl Inf Syst"},{"key":"114_CR12","doi-asserted-by":"crossref","unstructured":"Cheung DW, Han J, Ng V, Wong CY (1996) Maintenance of discovered association rules in large databases: an incremental updating technique. In: Proceedings of the ACM SIGMOD international conference on management of data, pp. 13\u201323","DOI":"10.1109\/ICDE.1996.492094"},{"issue":"3","key":"114_CR13","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/s10115-006-0003-0","volume":"10","author":"Y Chi","year":"2006","unstructured":"Chi Y, Wang H, Yu PS and Muntz RR (2006). Catch the moment: maintaining closed frequent itemsets over a data stream sliding window. Knowl Inf Syst 10(3): 265\u2013294","journal-title":"Knowl Inf Syst"},{"key":"114_CR14","doi-asserted-by":"crossref","unstructured":"Cost S, Salzberg S (1993) A weighted nearest neighbor algorithm for learning with symbolic features. Mach Learn 10:57.78 (PEBLS: Parallel Examplar-Based Learning System)","DOI":"10.1007\/BF00993481"},{"issue":"1","key":"114_CR15","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1109\/TIT.1967.1053964","volume":"13","author":"T Cover","year":"1967","unstructured":"Cover T and Hart P (1967). Nearest neighbor pattern classification. IEEE Trans Inform Theory 13(1): 21\u201327","journal-title":"IEEE Trans Inform Theory"},{"key":"114_CR16","unstructured":"Dasarathy BV (ed) (1991) Nearest neighbor (NN) norms: NN pattern classification techniques. IEEE Computer Society Press"},{"key":"114_CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","volume":"39","author":"AP Dempster","year":"1977","unstructured":"Dempster AP, Laird NM and Rubin DB (1977). Maximum likelihood from incomplete data via the EM algorithm (with discussion). J Roy Stat Soc B 39: 1\u201338","journal-title":"J Roy Stat Soc B"},{"key":"114_CR18","doi-asserted-by":"crossref","unstructured":"Devroye L, Gyorfi L, Lugosi G (1996) A probabilistic theory of pattern recognition. Springer, New York. ISBN 0-387-94618-7","DOI":"10.1007\/978-1-4612-0711-5"},{"key":"114_CR19","doi-asserted-by":"crossref","unstructured":"Dhillon IS, Guan Y, Kulis B (2004) Kernel k-means: spectral clustering and normalized cuts. KDD 2004, pp 551\u2013556","DOI":"10.1145\/1014052.1014118"},{"issue":"4","key":"114_CR20","first-page":"97","volume":"18","author":"TG Dietterich","year":"1997","unstructured":"Dietterich TG (1997). Machine learning: Four current directions. AI Mag 18(4): 97\u2013136","journal-title":"AI Mag"},{"key":"114_CR21","doi-asserted-by":"crossref","unstructured":"Domingos P (1999) MetaCost: A general method for making classifiers cost-sensitive. In: Proceedings of the fifth international conference on knowledge discovery and data mining, pp 155\u2013164","DOI":"10.1145\/312129.312220"},{"key":"114_CR22","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1023\/A:1007413511361","volume":"29","author":"P Domingos","year":"1997","unstructured":"Domingos P and Pazzani M (1997). On the optimality of the simple Bayesian classifier under zero-one loss. Mach Learn 29: 103\u2013130","journal-title":"Mach Learn"},{"key":"114_CR23","unstructured":"Fix E, Hodges JL, Jr (1951) Discriminatory analysis, nonparametric discrimination. USAF School of Aviation Medicine, Randolph Field, Tex., Project 21-49-004, Rept. 4, Contract AF41(128)-31, February 1951"},{"issue":"1","key":"114_CR24","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1006\/jcss.1997.1504","volume":"55","author":"Y Freund","year":"1997","unstructured":"Freund Y and Schapire RE (1997). A decision-theoretic generalization of on-line learning and an application to boosting. J Comput Syst Sci 55(1): 119\u2013139","journal-title":"J Comput Syst Sci"},{"key":"114_CR25","doi-asserted-by":"crossref","unstructured":"Friedman JH, Bentley JL, Finkel RA (1977) An algorithm for finding best matches in logarithmic time. ACM Trans. Math. Software 3, 209. Also available as Stanford Linear Accelerator Center Rep. SIX-PUB-1549, February 1975","DOI":"10.1145\/355744.355745"},{"key":"114_CR26","unstructured":"Friedman JH, Kohavi R, Yun Y (1996) Lazy decision trees. In: Proceedings of the thirteenth national conference on artificial intelligence, San Francisco, CA. AAAI Press\/MIT Press, pp. 717\u2013724"},{"key":"114_CR27","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1023\/A:1007465528199","volume":"29","author":"N Friedman","year":"1997","unstructured":"Friedman N, Geiger D and Goldszmidt M (1997). Bayesian network classifiers. Mach Learn 29: 131\u2013163","journal-title":"Mach Learn"},{"issue":"2","key":"114_CR28","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/s10115-006-0043-5","volume":"11","author":"G Fung","year":"2007","unstructured":"Fung G and Stoeckel J (2007). SVM feature selection for classification of SPECT images of Alzheimer\u2019s disease using spatial information. Knowl Inf Syst 11(2): 243\u2013258","journal-title":"Knowl Inf Syst"},{"key":"114_CR29","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1109\/TIT.1972.1054809","volume":"18","author":"GW Gates","year":"1972","unstructured":"Gates GW (1972). The reduced nearest neighbor rule. IEEE Trans Inform Theory 18: 431\u2013433","journal-title":"IEEE Trans Inform Theory"},{"key":"114_CR30","unstructured":"Golub GH, Van Loan CF (1983) Matrix computations. The Johns Hopkins University Press"},{"issue":"1","key":"114_CR31","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10115-006-0009-7","volume":"12","author":"D Gondek","year":"2007","unstructured":"Gondek D and Hofmann T (2007). Non-redundant data clustering. Knowl Inf Syst 12(1): 1\u201324","journal-title":"Knowl Inf Syst"},{"key":"114_CR32","doi-asserted-by":"crossref","unstructured":"Han E (1999) Text categorization using weight adjusted k-nearest neighbor classification. PhD thesis, University of Minnesota, October 1999","DOI":"10.21236\/ADA439688"},{"key":"114_CR33","first-page":"385","volume":"69","author":"DJ Hand","year":"2001","unstructured":"Hand DJ and Yu K (2001). Idiots Bayes\u2014not so stupid after all?. Int Stat Rev 69: 385\u2013398","journal-title":"Int Stat Rev"},{"issue":"6","key":"114_CR34","doi-asserted-by":"crossref","first-page":"2325","DOI":"10.1109\/18.720541","volume":"44","author":"RM Gray","year":"1998","unstructured":"Gray RM and Neuhoff DL (1998). Quantization. IEEE Trans Inform Theory 44(6): 2325\u20132384","journal-title":"IEEE Trans Inform Theory"},{"key":"114_CR35","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1109\/TIT.1968.1054155","volume":"14","author":"P Hart","year":"1968","unstructured":"Hart P (1968). The condensed nearest neighbor rule. IEEE Trans Inform Theory 14: 515\u2013516","journal-title":"IEEE Trans Inform Theory"},{"key":"114_CR36","doi-asserted-by":"crossref","unstructured":"Han J, Pei J, Yin Y (2000) Mining frequent patterns without candidate generation. In: Proceedings of ACM SIGMOD international conference on management of data, pp 1\u201312","DOI":"10.1145\/342009.335372"},{"issue":"6","key":"114_CR37","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1109\/34.506411","volume":"18","author":"T Hastie","year":"1996","unstructured":"Hastie T and Tibshirani R (1996). Discriminant adaptive nearest neighbor classification. IEEE Trans Pattern Anal Mach Intell 18(6): 607\u2013616","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"2","key":"114_CR38","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1214\/aos\/1016218223","volume":"28","author":"J Friedman","year":"2000","unstructured":"Friedman J, Hastie T and Tibshirani R (2000). Additive logistic regression: a statistical view of boosting with discussions. Ann Stat 28(2): 337\u2013407","journal-title":"Ann Stat"},{"key":"114_CR39","unstructured":"Herbrich R, Graepel T, Obermayer K (2000) Rank boundaries for ordinal regression. Adv Mar Classif pp 115\u2013132"},{"issue":"4","key":"114_CR40","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1007\/s10115-006-0017-7","volume":"10","author":"T Hu","year":"2006","unstructured":"Hu T and Sung SY (2006). Finding centroid clusterings with entropy-based criteria. Knowl Inf Syst 10(4): 505\u2013514","journal-title":"Knowl Inf Syst"},{"key":"114_CR41","volume-title":"Experiments in induction","author":"EB Hunt","year":"1966","unstructured":"Hunt EB, Marin J and Stone PJ (1966). Experiments in induction. Academic Press, New York"},{"issue":"1-2","key":"114_CR42","first-page":"53","volume":"66","author":"A Inokuchi","year":"2005","unstructured":"Inokuchi A, Washio T and Motoda H (2005). General framework for mining frequent subgraphs from labeled graphs. Fundament Inform 66(1-2): 53\u201382","journal-title":"Fundament Inform"},{"key":"114_CR43","volume-title":"Algorithms for clustering data","author":"AK Jain","year":"1988","unstructured":"Jain AK and Dubes RC (1988). Algorithms for clustering data. Prentice-Hall, Englewood Cliffs"},{"issue":"1","key":"114_CR44","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/s10115-005-0210-0","volume":"10","author":"R Jin","year":"2006","unstructured":"Jin R, Goswami A and Agrawal G (2006). Fast and exact out-of-core and distributed k-means clustering. Knowl Inf Syst 10(1): 17\u201340","journal-title":"Knowl Inf Syst"},{"issue":"3","key":"114_CR45","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/s10115-006-0005-y","volume":"10","author":"M Kobayashi","year":"2006","unstructured":"Kobayashi M and Aono M (2006). Exploring overlapping clusters using dynamic re-scaling and sampling. Knowl Inf Syst 10(3): 295\u2013313","journal-title":"Knowl Inf Syst"},{"issue":"1","key":"114_CR46","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/s10115-006-0027-5","volume":"12","author":"H Koga","year":"2007","unstructured":"Koga H, Ishibashi T and Watanabe T (2007). Fast agglomerative hierarchical clustering algorithm using Locality-Sensitive Hashing. Knowl Inf Syst 12(1): 25\u201353","journal-title":"Knowl Inf Syst"},{"issue":"3","key":"114_CR47","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1007\/s10115-005-0203-z","volume":"9","author":"M Kukar","year":"2006","unstructured":"Kukar M (2006). Quality assessment of individual classifications in machine learning and data mining. Knowl Inf Syst 9(3): 364\u2013384","journal-title":"Knowl Inf Syst"},{"issue":"4","key":"114_CR48","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1142\/S0218213005002302","volume":"14","author":"M Kuramochi","year":"2005","unstructured":"Kuramochi M and Karypis G (2005). Gene Classification using Expression Profiles: A Feasibility Study. Int J Artif Intell Tools 14(4): 641\u2013660","journal-title":"Int J Artif Intell Tools"},{"key":"114_CR49","doi-asserted-by":"crossref","DOI":"10.1515\/9781400830329","volume-title":"Google\u2019s PageRank and beyond: the science of search engine rankings","author":"AN Langville","year":"2006","unstructured":"Langville AN and Meyer CD (2006). Google\u2019s PageRank and beyond: the science of search engine rankings. Princeton University Press, Princeton"},{"issue":"3","key":"114_CR50","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/s10115-006-0002-1","volume":"10","author":"CW-k Leung","year":"2006","unstructured":"Leung CW-k, Chan SC-f and Chung F-L (2006). A collaborative filtering framework based on fuzzy association rules and multiple-level similarity. Knowl Inf Syst 10(3): 357\u2013381","journal-title":"Knowl Inf Syst"},{"issue":"4","key":"114_CR51","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1007\/s10115-006-0013-y","volume":"10","author":"T Li","year":"2006","unstructured":"Li T, Zhu S and Ogihara M (2006). Using discriminant analysis for multi-class classification: an experimental investigation. Knowl Inf Syst 10(4): 453\u2013472","journal-title":"Knowl Inf Syst"},{"key":"114_CR52","volume-title":"Web data mining: exploring hyperlinks, contents and usage Data","author":"B Liu","year":"2007","unstructured":"Liu B (2007). Web data mining: exploring hyperlinks, contents and usage Data. Springer, Heidelberg"},{"key":"114_CR53","unstructured":"Lloyd SP (1957) Least squares quantization in PCM. Unpublished Bell Lab. Tech. Note, portions presented at the Institute of Mathematical Statistics Meeting Atlantic City, NJ, September 1957. Also, IEEE Trans Inform Theory (Special Issue on Quantization), vol IT-28, pp 129\u2013137, March 1982"},{"issue":"3","key":"114_CR54","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/s10115-006-0032-8","volume":"11","author":"CK-S Leung","year":"2007","unstructured":"Leung CK-S, Khan QI, Li Z and Hoque T (2007). CanTree: a canonical-order tree for incremental frequent-pattern mining. Knowl Inf Syst 11(3): 287\u2013311","journal-title":"Knowl Inf Syst"},{"key":"114_CR55","doi-asserted-by":"crossref","first-page":"318","DOI":"10.2307\/2347790","volume":"36","author":"GJ McLachlan","year":"1987","unstructured":"McLachlan GJ (1987). On bootstrapping the likelihood ratio test statistic for the number of components in a normal mixture.. Appl Stat 36: 318\u2013324","journal-title":"Appl Stat"},{"key":"114_CR56","volume-title":"The EM algorithm and extensions","author":"GJ McLachlan","year":"1997","unstructured":"McLachlan GJ and Krishnan T (1997). The EM algorithm and extensions. Wiley, New York"},{"key":"114_CR57","doi-asserted-by":"crossref","DOI":"10.1002\/0471721182","volume-title":"Finite Mixture Models","author":"GJ McLachlan","year":"2000","unstructured":"McLachlan GJ and Peel D (2000). Finite Mixture Models. Wiley, New York"},{"key":"114_CR58","first-page":"768","volume":"67","author":"RC Messenger","year":"1972","unstructured":"Messenger RC and Mandell ML (1972). A model search technique for predictive nominal scale multivariate analysis. J Am Stat Assoc 67: 768\u2013772","journal-title":"J Am Stat Assoc"},{"key":"114_CR59","doi-asserted-by":"crossref","unstructured":"Morishita S, Sese J (2000) Traversing lattice itemset with statistical metric pruning. In: Proceedings of PODS\u201900, pp 226\u2013236","DOI":"10.1145\/335168.335226"},{"issue":"2","key":"114_CR60","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1214\/ss\/1009213290","volume":"16","author":"R Olshen","year":"2001","unstructured":"Olshen R (2001). A conversation with Leo Breiman. Stat Sci 16(2): 184\u2013198","journal-title":"Stat Sci"},{"key":"114_CR61","unstructured":"Page L, Brin S, Motwami R, Winograd T (1999) The PageRank citation ranking: bringing order to the Web. Technical Report 1999\u20130120, Computer Science Department, Stanford University"},{"key":"114_CR62","unstructured":"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"},{"key":"114_CR63","doi-asserted-by":"crossref","unstructured":"Quinlan R (1989) Unknown attribute values in induction. In: Proceedings of the sixth international workshop on machine learning, pp. 164\u2013168","DOI":"10.1016\/B978-1-55860-036-2.50048-5"},{"key":"114_CR64","volume-title":"C4.5: Programs for machine learning","author":"JR Quinlan","year":"1993","unstructured":"Quinlan JR (1993). C4.5: Programs for machine learning. Morgan Kaufmann Publishers, San Mateo"},{"key":"114_CR65","doi-asserted-by":"crossref","unstructured":"Reyzin L, Schapire RE (2006) How boosting the margin can also boost classifier complexity. In: Proceedings of the 23rd international conference on machine learning. Pittsburgh, PA, pp. 753\u2013760","DOI":"10.1145\/1143844.1143939"},{"key":"114_CR66","first-page":"101","volume-title":"Proceedings of the fourth international conference on knowledge discovery and data mining.","author":"G Ridgeway","year":"1998","unstructured":"Ridgeway G, Madigan D and Richardson T (1998). Interpretable boosted naive Bayes classification. In: Agrawal, R, Stolorz, P, and Piatetsky-Shapiro, G (eds) Proceedings of the fourth international conference on knowledge discovery and data mining., pp 101\u2013104. AAAI Press, Menlo Park"},{"issue":"2","key":"114_CR67","first-page":"197","volume":"5","author":"RE Schapire","year":"1990","unstructured":"Schapire RE (1990). The strength of weak learnability. Mach Learn 5(2): 197\u2013227","journal-title":"Mach Learn"},{"issue":"5","key":"114_CR68","doi-asserted-by":"crossref","first-page":"1651","DOI":"10.1214\/aos\/1024691352","volume":"26","author":"RE Schapire","year":"1998","unstructured":"Schapire RE, Freund Y, Bartlett P and Lee WS (1998). Boosting the margin: A new explanation for the effectiveness of voting methods. Ann Stat 26(5): 1651\u20131686","journal-title":"Ann Stat"},{"issue":"3","key":"114_CR69","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1023\/A:1007614523901","volume":"37","author":"RE Schapire","year":"1999","unstructured":"Schapire RE and Singer Y (1999). Improved boosting algorithms using confidence-rated predictions. Mach Learn 37(3): 297\u2013336","journal-title":"Mach Learn"},{"key":"114_CR70","doi-asserted-by":"crossref","unstructured":"Scholkopf B, Smola AJ (2002) Learning with kernels. MIT Press","DOI":"10.7551\/mitpress\/4175.001.0001"},{"key":"114_CR71","first-page":"154","volume-title":"Proceedings of the 1998 ACM SIGMOD international conference on management of data, Seattle, Washington, United States, 1\u20134 June, 1998","author":"T Seidl","year":"1998","unstructured":"Seidl T and Kriegel H (1998). Optimal multi-step k-nearest neighbor search. In: Tiwary, A and Franklin, M (eds) Proceedings of the 1998 ACM SIGMOD international conference on management of data, Seattle, Washington, United States, 1\u20134 June, 1998, pp 154\u2013165. ACM Press, New York"},{"key":"114_CR72","unstructured":"Srikant R, Agrawal R (1995) Mining generalized association rules. In: Proceedings of the 21st VLDB conference. pp. 407\u2013419"},{"key":"114_CR73","unstructured":"Steinbach M, Karypis G, Kumar V (2000) A comparison of document clustering techniques. In: Proceedings of the KDD Workshop on Text Mining"},{"issue":"3","key":"114_CR74","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/s10115-006-0041-7","volume":"12","author":"M Steinbach","year":"2007","unstructured":"Steinbach M and Kumar V (2007). Generalizing the notion of confidence. Knowl Inf Syst 12(3): 279\u2013299","journal-title":"Knowl Inf Syst"},{"key":"114_CR75","unstructured":"Tan P-N, Steinbach M, Kumar V (2006) Introduction to data mining. Pearson Addison-Wesley"},{"issue":"1","key":"114_CR76","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10115-006-0050-6","volume":"13","author":"D Tao","year":"2007","unstructured":"Tao D, Li X, Wu X, Hu W and Maybank SJ (2007). Supervised tensor learning. Knowl Inf Syst 13(1): 1\u201342","journal-title":"Knowl Inf Syst"},{"issue":"1","key":"114_CR77","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/s10115-005-0213-x","volume":"9","author":"FA Thabtah","year":"2006","unstructured":"Thabtah FA, Cowling PI and Peng Y (2006). Multiple labels associative classification. Knowl Inf Syst 9(1): 109\u2013129","journal-title":"Knowl Inf Syst"},{"key":"114_CR78","doi-asserted-by":"crossref","first-page":"659","DOI":"10.1109\/TKDE.2002.1000348","volume":"14","author":"KM Ting","year":"2002","unstructured":"Ting KM (2002). An instance-weighting method to induce cost-sensitive trees. IEEE Trans Knowl Data Eng 14: 659\u2013665","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"114_CR79","unstructured":"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\u201320 April, 2002"},{"key":"114_CR80","unstructured":"Toussaint GT (2002) Open problems in geometric methods for instance-based learning. JCDCG 273\u2013283"},{"key":"114_CR81","first-page":"363","volume":"6","author":"IW Tsang","year":"2005","unstructured":"Tsang IW, Kwok JT and Cheung P-M (2005). Core vector machines: Fast SVM training on very large data sets. J Mach Learn Res 6: 363\u2013392","journal-title":"J Mach Learn Res"},{"key":"114_CR82","unstructured":"Uno T, Asai T, Uchida Y, Arimura H (2004) An efficient algorithm for enumerating frequent closed patterns in transaction databases. In: Proc. of the 7th international conference on discovery science. LNAI vol 3245, Springe, Heidelberg, pp 16\u201330"},{"key":"114_CR83","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2440-0","volume-title":"The nature of statistical learning theory","author":"V Vapnik","year":"1995","unstructured":"Vapnik V (1995). The nature of statistical learning theory. Springer, New York"},{"key":"114_CR84","doi-asserted-by":"crossref","unstructured":"Viola P, Jones M (2001) Rapid object detection using a boosted cascade of simple features. In: Proceedings of the IEEE computer society conference on computer vision and pattern recognition. pages 511\u2013518, Kauai, HI","DOI":"10.1109\/CVPR.2001.990517"},{"key":"114_CR85","doi-asserted-by":"crossref","unstructured":"Washio T, Nakanishi K, Motoda H (2005) Association rules based on levelwise subspace clustering. In: Proceedings. of 9th European conference on principles and practice of knowledge discovery in databases. LNAI, vol 3721, pp. 692\u2013700 Springer, Heidelberg","DOI":"10.1007\/11564126_74"},{"key":"114_CR86","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511815478","volume-title":"Social network analysis","author":"S Wasserman","year":"1994","unstructured":"Wasserman S and Raust K (1994). Social network analysis. Cambridge University Press, Cambridge"},{"key":"114_CR87","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1023\/A:1006593614256","volume":"11","author":"D Wettschereck","year":"1997","unstructured":"Wettschereck D, Aha D and Mohri T (1997). A review and empirical evaluation of feature weighting methods for a class of lazy learning algorithms. Artif Intell Rev 11: 273\u2013314","journal-title":"Artif Intell Rev"},{"key":"114_CR88","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1109\/TSMC.1972.4309137","volume":"2","author":"DL Wilson","year":"1972","unstructured":"Wilson DL (1972). Asymptotic properties of nearest neighbor rules using edited data. IEEE Trans Syst Man Cyberne 2: 408\u2013420","journal-title":"IEEE Trans Syst Man Cyberne"},{"issue":"4","key":"114_CR89","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1142\/S0219622006002258","volume":"5","author":"Q Yang","year":"2006","unstructured":"Yang Q and Wu X (2006). 10 challenging problems in data mining research. Int J Inform Technol Decis Making 5(4): 597\u2013604","journal-title":"Int J Inform Technol Decis Making"},{"key":"114_CR90","unstructured":"Yan X, Han J (2002) gSpan: Graph-based substructure pattern mining. In: Proceedings of ICDM\u201902, pp 721\u2013724"},{"key":"114_CR91","unstructured":"Yu PS, Li X, Liu B (2005) Adding the temporal dimension to search\u2014a case study in publication search. In: Proceedings of Web Intelligence (WI\u201905)"},{"issue":"2","key":"114_CR92","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/s10115-005-0211-z","volume":"9","author":"J Zhang","year":"2006","unstructured":"Zhang J, Kang D-K, Silvescu A and Honavar V (2006). Learning accurate and concise na\u00efve Bayes classifiers from attribute value taxonomies and data. Knowl Inf Syst 9(2): 157\u2013179","journal-title":"Knowl Inf Syst"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-007-0114-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-007-0114-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-007-0114-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,23]],"date-time":"2025-01-23T05:14:03Z","timestamp":1737609243000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-007-0114-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,12,4]]},"references-count":92,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,1]]}},"alternative-id":["114"],"URL":"https:\/\/doi.org\/10.1007\/s10115-007-0114-2","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,12,4]]}}}