{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T21:35:35Z","timestamp":1777671335621,"version":"3.51.4"},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2020,10,6]],"date-time":"2020-10-06T00:00:00Z","timestamp":1601942400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,10,6]],"date-time":"2020-10-06T00:00:00Z","timestamp":1601942400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2021,5]]},"DOI":"10.1007\/s11227-020-03436-2","type":"journal-article","created":{"date-parts":[[2020,10,7]],"date-time":"2020-10-07T03:41:50Z","timestamp":1602042110000},"page":"5239-5266","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":48,"title":["K-means tree: an optimal clustering tree for unsupervised learning"],"prefix":"10.1007","volume":"77","author":[{"given":"Pooya","family":"Tavallali","sequence":"first","affiliation":[]},{"given":"Peyman","family":"Tavallali","sequence":"additional","affiliation":[]},{"given":"Mukesh","family":"Singhal","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,10,6]]},"reference":[{"key":"3436_CR1","unstructured":"Bennett KP (1992) Decision tree construction via linear programming, in: Proc. 4th Midwest Artificial Intelligence and Cognitive Sience Society Conference, pp. 97\u2013101"},{"key":"3436_CR2","first-page":"156","volume":"26","author":"KP Bennett","year":"1994","unstructured":"Bennett KP (1994) Global tree optimization: a non-greedy decision tree algorithm. Comput Sci Stat 26:156\u2013160","journal-title":"Comput Sci Stat"},{"key":"3436_CR3","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"JL Bentley","year":"1975","unstructured":"Bentley JL (1975) Multidimensional binary search trees used for associative searching. Commun ACM 18:509\u2013517","journal-title":"Commun ACM"},{"key":"3436_CR4","doi-asserted-by":"publisher","first-page":"1039","DOI":"10.1007\/s10994-017-5633-9","volume":"106","author":"D Bertsimas","year":"2017","unstructured":"Bertsimas D, Dunn J (2017) Optimal classification trees. Mach Learn 106:1039\u20131082","journal-title":"Mach Learn"},{"key":"3436_CR5","volume-title":"Pattern recognition and machine learning","author":"CM Bishop","year":"2006","unstructured":"Bishop CM (2006) Pattern recognition and machine learning. Springer, Berlin"},{"key":"3436_CR6","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1002\/widm.1157","volume":"5","author":"H Borchani","year":"2015","unstructured":"Borchani H, Varando G, Bielza C, Larra\u00f1aga P (2015) A survey on multi-output regression. Wiley Interdiscip Rev Data Min Knowl Discov 5:216\u2013233","journal-title":"Wiley Interdiscip Rev Data Min Knowl Discov"},{"key":"3436_CR7","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1010933404324","volume":"45","author":"L Breiman","year":"2001","unstructured":"Breiman L (2001) Random forests. Mach Learn 45:5\u201332","journal-title":"Mach Learn"},{"key":"3436_CR8","volume-title":"Classification and regression trees","author":"LJ Breiman","year":"1984","unstructured":"Breiman LJ, Friedman JH, Olshen RA, Stone CJ (1984) Classification and regression trees. Wadsworth, Belmont"},{"key":"3436_CR9","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/j.compeleceng.2009.03.008","volume":"36","author":"A Chamam","year":"2010","unstructured":"Chamam A, Pierre S (2010) A distributed energy-efficient clustering protocol for wireless sensor networks. Comput Electr Eng 36:303\u2013312","journal-title":"Comput Electr Eng"},{"key":"3436_CR10","first-page":"27","volume":"2","author":"CC Chang","year":"2011","unstructured":"Chang CC, Lin CJ (2011) Libsvm: a library for support vector machines. ACM Trans Intell Syst Technol (TIST) 2:27","journal-title":"ACM Trans Intell Syst Technol (TIST)"},{"key":"3436_CR11","doi-asserted-by":"publisher","first-page":"790","DOI":"10.1109\/34.400568","volume":"17","author":"Y Cheng","year":"1995","unstructured":"Cheng Y (1995) Mean shift, mode seeking, and clustering. IEEE Trans Pattern Anal Mach Intell 17:790\u2013799","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"3436_CR12","doi-asserted-by":"crossref","unstructured":"Coates A, Ng AY (2012) Learning feature representations with k-means. In: Neural networks: tricks of the trade. Springer, pp 561\u2013580","DOI":"10.1007\/978-3-642-35289-8_30"},{"key":"3436_CR13","doi-asserted-by":"crossref","unstructured":"Criminisi A, Shotton J (2013) Decision forests for computer vision and medical image analysis. In: Advances in computer vision and pattern recognition. Springer","DOI":"10.1007\/978-1-4471-4929-3"},{"key":"3436_CR14","doi-asserted-by":"crossref","unstructured":"Dasgupta S, Freund Y (2008) Random projection trees and low dimensional manifolds. Proceedings of the fortieth annual ACM symposium on Theory of computing. ACM, 537\u2013546","DOI":"10.1145\/1374376.1374452"},{"key":"3436_CR15","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, Rubin DB (1977) Maximum likelihood from incomplete data via the EM algorithm. J R Stat Soc Ser B (Methodol) 39:1\u201338","journal-title":"J R Stat Soc Ser B (Methodol)"},{"key":"3436_CR16","unstructured":"Ester M, Kriegel HP, Sander J, Xu X et al (1996) A density-based algorithm for discovering clusters in large spatial databases with noise. In: Kdd, pp 226\u2013231"},{"key":"3436_CR17","unstructured":"Freund Y, Dasgupta S, Kabra M, Verma N (2008) Learning the structure of manifolds using random projections. In: Advances in neural information processing systems, pp 473\u2013480"},{"key":"3436_CR18","first-page":"1612","volume":"14","author":"Y Freund","year":"1999","unstructured":"Freund Y, Schapire R, Abe N (1999) A short introduction to boosting. J Jpn Soc Artif Intell 14:1612","journal-title":"J Jpn Soc Artif Intell"},{"key":"3436_CR19","unstructured":"Gifford H (2014) Hierarchical k-means for unsupervised learning"},{"key":"3436_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-84858-7","volume-title":"The elements of statistical learning: data mining, inference, and prediction","author":"T Hastie","year":"2009","unstructured":"Hastie T, Tibshirani R, Friedman JH (2009) The elements of statistical learning: data mining, inference, and prediction, 2nd edn. Springer, New York","edition":"2"},{"key":"3436_CR21","doi-asserted-by":"crossref","unstructured":"Heinzelman WR, Chandrakasan A, Balakrishnan H (2000) Energy-efficient communication protocol for wireless microsensor networks. In: Proceedings of the 33rd Annual Hawaii International Conference on System Sciences. IEEE, p 10","DOI":"10.1109\/HICSS.2000.926982"},{"key":"3436_CR22","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/0020-0190(76)90095-8","volume":"5","author":"L Hyafil","year":"1975","unstructured":"Hyafil L, Rivest RL (1975) Constructing optimal binary decision trees is NP-complete. Inf Process Lett 5:15\u201317","journal-title":"Inf Process Lett"},{"key":"3436_CR23","doi-asserted-by":"crossref","unstructured":"Ikonomovska E, Gama J, D\u017eeroski S (2011) Incremental multi-target model trees for data streams. In: Proceedings of the 2011 ACM symposium on applied computing. ACM, pp 988\u2013993","DOI":"10.1145\/1982185.1982402"},{"key":"3436_CR24","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1162\/neco.1994.6.2.181","volume":"6","author":"MI Jordan","year":"1994","unstructured":"Jordan MI, Jacobs RA (1994) Hierarchical mixtures of experts and the EM algorithm. Neural Comput 6:181\u2013214","journal-title":"Neural Comput"},{"key":"3436_CR25","unstructured":"Kristan M, Skocaj D, Leonardis A (2008) Incremental learning with Gaussian mixture models. In: Computer Vision Winter Workshop, pp 25\u201332"},{"key":"3436_CR26","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/BF00263763","volume":"9","author":"DT Lee","year":"1977","unstructured":"Lee DT, Wong C (1977) Worst-case analysis for region and partial region searches in multidimensional binary search trees and balanced quad trees. Acta Inform 9:23\u201329","journal-title":"Acta Inform"},{"key":"3436_CR27","doi-asserted-by":"crossref","unstructured":"Lee YH, Kim HJ, Roh Bh, Yoo SW, Oh Y (2005) Tree-based classification algorithm for heterogeneous unique item id schemes. In: International Conference on Embedded and Ubiquitous Computing. Springer, pp 1078\u20131087","DOI":"10.1007\/11596042_110"},{"key":"3436_CR28","doi-asserted-by":"crossref","unstructured":"Levati\u0107 J, Ceci M, Kocev D, D\u017eeroski S (2014) Semi-supervised learning for multi-target regression. In: International workshop on new frontiers in mining complex patterns. Springer, pp 3\u201318","DOI":"10.1007\/978-3-319-17876-9_1"},{"key":"3436_CR29","unstructured":"Liu L, Wong WH (2014) Multivariate density estimation based on adaptive partitioning: convergence rate, variable selection and spatial adaptation. Department of Statistics, Stanford University"},{"key":"3436_CR30","first-page":"815","volume":"7","author":"WY Loh","year":"1997","unstructured":"Loh WY, Shih YS (1997) Split selection methods for classification trees. Stat Sin 7:815\u2013840","journal-title":"Stat Sin"},{"key":"3436_CR31","unstructured":"McCartin-Lim M, McGregor A, Wang R (2012) Approximate principal direction trees. arXiv preprint: arXiv:1206.4668"},{"key":"3436_CR32","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1214\/088342304000000017","volume":"19","author":"P M\u00fcller","year":"2004","unstructured":"M\u00fcller P, Quintana FA (2004) Nonparametric Bayesian data analysis. Stat Sci 19:95\u2013110","journal-title":"Stat Sci"},{"key":"3436_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1613\/jair.63","volume":"2","author":"SK Murthy","year":"1994","unstructured":"Murthy SK, Kasif S, Salzberg S (1994) A system for induction of oblique decision trees. J Artif Intell Res 2:1\u201332","journal-title":"J Artif Intell Res"},{"key":"3436_CR34","doi-asserted-by":"crossref","unstructured":"Nister D, Stewenius H (2006) Scalable recognition with a vocabulary tree. In: 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR\u201906), vol 2, pp 2161\u20132168","DOI":"10.1109\/CVPR.2006.264"},{"key":"3436_CR35","volume-title":"Numerical optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal J, Wright S (2006) Numerical optimization. Springer, Berlin"},{"key":"3436_CR36","unstructured":"Norouzi M, Collins M, Johnson MA, Fleet DJ, Kohli P (2015a) Efficient non-greedy optimization of decision trees. In: Advances in neural information processing systems, pp 1729\u20131737"},{"key":"3436_CR37","first-page":"1720","volume-title":"Advances in neural information processing systems (NIPS)","author":"M Norouzi","year":"2015","unstructured":"Norouzi M, Collins M, Johnson MA, Fleet DJ, Kohli P (2015b) Efficient non-greedy optimization of decision trees. In: Cortes C, Lawrence ND, Lee DD, Sugiyama M, Garnett R (eds) Advances in neural information processing systems (NIPS). MIT Press, Cambridge, pp 1720\u20131728"},{"key":"3436_CR38","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/BF00116251","volume":"1","author":"JR Quinlan","year":"1986","unstructured":"Quinlan JR (1986) Induction of decision trees. Mach Learn 1:81\u2013106","journal-title":"Mach Learn"},{"key":"3436_CR39","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, San Francisco"},{"key":"3436_CR40","volume-title":"C4. 5: programs for machine learning","author":"JR Quinlan","year":"2014","unstructured":"Quinlan JR (2014) C4. 5: programs for machine learning. Elsevier, Amsterdam"},{"key":"3436_CR41","doi-asserted-by":"crossref","unstructured":"Ram P, Gray AG (2011) Density estimation trees. In: Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data mining. ACM, pp 627\u2013635","DOI":"10.1145\/2020408.2020507"},{"key":"3436_CR42","doi-asserted-by":"crossref","unstructured":"Rokach L, Maimon O (2005a) Clustering methods. In: Data mining and knowledge discovery handbook. Springer, pp 321\u2013352","DOI":"10.1007\/0-387-25465-X_15"},{"key":"3436_CR43","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1109\/TSMCC.2004.843247","volume":"35","author":"L Rokach","year":"2005","unstructured":"Rokach L, Maimon O (2005b) Top-down induction of decision trees classifiers\u2014a survey. IEEE Trans Syst Man Cybern Part C (Appl Rev) 35:476\u2013487","journal-title":"IEEE Trans Syst Man Cybern Part C (Appl Rev)"},{"key":"3436_CR44","unstructured":"Schlimmer JC, Fisher D (1986) A case study of incremental concept induction. In: AAAI, pp 496\u2013501"},{"key":"3436_CR45","doi-asserted-by":"publisher","DOI":"10.1201\/9781315140919","volume-title":"Density estimation for statistics and data analysis","author":"BW Silverman","year":"2018","unstructured":"Silverman BW (2018) Density estimation for statistics and data analysis. Routledge, London"},{"key":"3436_CR46","doi-asserted-by":"crossref","unstructured":"Tavallali P, Tavallali P, Singhal M (2019) Optimization of hierarchical regression model with application to optimizing multi-response regression k-ary trees. In: Thirty-third AAAI Conference on Artificial Intelligence","DOI":"10.1609\/aaai.v33i01.33015133"},{"key":"3436_CR47","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1109\/SURV.2013.103013.00206","volume":"16","author":"CW Tsai","year":"2014","unstructured":"Tsai CW, Lai CF, Chiang MC, Yang LT (2014) Data mining for internet of things: a survey. IEEE Commun Surv Tutor 16:77\u201397","journal-title":"IEEE Commun Surv Tutor"},{"key":"3436_CR48","doi-asserted-by":"crossref","unstructured":"Uckelmann D, Harrison M, Michahelles F (2011) An architectural approach towards the future internet of things. In: Architecting the internet of things. Springer, pp 1\u201324","DOI":"10.1007\/978-3-642-19157-2_1"},{"key":"3436_CR49","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1023\/A:1022699900025","volume":"4","author":"PE Utgoff","year":"1989","unstructured":"Utgoff PE (1989) Incremental induction of decision trees. Mach Learn 4:161\u2013186","journal-title":"Mach Learn"},{"key":"3436_CR50","unstructured":"Verma N, Kpotufe S, Dasgupta S (2009) Which spatial partition trees are adaptive to intrinsic dimension?. In: Proceedings of the Twenty-fifth Conference on Uncertainty in Artificial Intelligence. AUAI Press, pp 565\u2013574"},{"key":"3436_CR51","doi-asserted-by":"crossref","unstructured":"Wang H, Fan W, Yu PS, Han J (2003) Mining concept-drifting data streams using ensemble classifiers. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, pp 226\u2013235","DOI":"10.1145\/956750.956778"},{"key":"3436_CR52","volume-title":"All of nonparametric statistics. Springer series in statistics","author":"L Wasserman","year":"2005","unstructured":"Wasserman L (2005) All of nonparametric statistics. Springer series in statistics. Springer, Berlin"},{"key":"3436_CR53","unstructured":"Yang K, Wong WH (2014) Density estimation via adaptive partition and discrepancy control. arXiv preprint arXiv:1404.1425"}],"updated-by":[{"DOI":"10.1007\/s11227-023-05723-0","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2023,11,16]],"date-time":"2023-11-16T00:00:00Z","timestamp":1700092800000}}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-020-03436-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-020-03436-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-020-03436-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,15]],"date-time":"2024-08-15T16:22:15Z","timestamp":1723738935000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-020-03436-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,6]]},"references-count":53,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2021,5]]}},"alternative-id":["3436"],"URL":"https:\/\/doi.org\/10.1007\/s11227-020-03436-2","relation":{"correction":[{"id-type":"doi","id":"10.1007\/s11227-023-05723-0","asserted-by":"object"}]},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,10,6]]},"assertion":[{"value":"14 September 2020","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 October 2020","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 November 2023","order":3,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Correction","order":4,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"A Correction to this paper has been published:","order":5,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"https:\/\/doi.org\/10.1007\/s11227-023-05723-0","URL":"https:\/\/doi.org\/10.1007\/s11227-023-05723-0","order":6,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}}]}}