{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,27]],"date-time":"2026-08-27T01:06:18Z","timestamp":1787792778787,"version":"build-2784847793"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2019,6,27]],"date-time":"2019-06-27T00:00:00Z","timestamp":1561593600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,6,27]],"date-time":"2019-06-27T00:00:00Z","timestamp":1561593600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2020,4]]},"DOI":"10.1007\/s00521-019-04297-4","type":"journal-article","created":{"date-parts":[[2019,6,27]],"date-time":"2019-06-27T17:02:45Z","timestamp":1561654965000},"page":"2589-2600","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Development of new agglomerative and performance evaluation models for classification"],"prefix":"10.1007","volume":"32","author":[{"given":"M.","family":"Vijaya Prabhagar","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"M.","family":"Punniyamoorthy","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,6,27]]},"reference":[{"key":"4297_CR1","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/BF01890115","volume":"1","author":"WHE Day","year":"1984","unstructured":"Day WHE, Edelsbrunner H (1984) Efficient algorithms for agglomerative hierarchical clustering methods. J Classif 1:7\u201324","journal-title":"J Classif"},{"key":"4297_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-85729-495-1","volume-title":"Pattern recognition: an algorithmic approach","author":"N Murthy","year":"2011","unstructured":"Murthy N, Devi S (2011) Pattern recognition: an algorithmic approach. Springer, Berlin"},{"key":"4297_CR3","doi-asserted-by":"publisher","first-page":"1109","DOI":"10.1016\/S0031-3203(96)00140-9","volume":"30","author":"H Frigui","year":"1997","unstructured":"Frigui H, Krishnapuram R (1997) Clustering by competitive agglomeration. Pattern Recogn 30:1109\u20131119","journal-title":"Pattern Recogn"},{"key":"4297_CR4","doi-asserted-by":"publisher","first-page":"442","DOI":"10.2307\/2344977","volume":"137","author":"MRB Clarke","year":"2006","unstructured":"Clarke MRB, Duda RO, Hart PE (2006) Pattern classification and scene analysis. J R Stat Soc Ser A 137:442\u2013443. \nhttps:\/\/doi.org\/10.2307\/2344977","journal-title":"J R Stat Soc Ser A"},{"key":"4297_CR5","volume-title":"Algorithms for clustering data_Jain.pdf","author":"AK Jain","year":"1988","unstructured":"Jain AK, Dubes C (1988) Algorithms for clustering data_Jain.pdf. Prentice Hall, Englewood Cliffs"},{"issue":"5","key":"4297_CR6","doi-asserted-by":"publisher","first-page":"2785","DOI":"10.1016\/j.eswa.2014.09.054","volume":"42","author":"A Bouguettaya","year":"2015","unstructured":"Bouguettaya A, Yu Q, Liu X et al (2015) Efficient agglomerative hierarchical clustering. Expert Syst Appl 42(5):2785\u20132797. \nhttps:\/\/doi.org\/10.1016\/j.eswa.2014.09.054","journal-title":"Expert Syst Appl"},{"issue":"1","key":"4297_CR7","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/S0306-4379(01)00008-4","volume":"26","author":"S Guha","year":"2001","unstructured":"Guha S, Rastogi R, Shim K (2001) CURE: an efficient clustering algorithm for large databases. Inf Syst 26(1):35\u201358. \nhttps:\/\/doi.org\/10.1016\/S0306-4379(01)00008-4","journal-title":"Inf Syst"},{"key":"4297_CR8","doi-asserted-by":"publisher","DOI":"10.1145\/233269.233324","author":"T Zhang","year":"1996","unstructured":"Zhang T, Ramakrishnan R, Livny M (1996) BIRCH: an efficient data clustering databases method for very large. ACM SIGMOD Rec. \nhttps:\/\/doi.org\/10.1145\/233269.233324","journal-title":"ACM SIGMOD Rec"},{"key":"4297_CR9","unstructured":"M\u00fcllner D (2011) Modern hierarchical, agglomerative clustering algorithms. \nhttp:\/\/arXiv.org\/abs\/1109.2378v1"},{"issue":"9","key":"4297_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.18637\/jss.v053.i09","volume":"53","author":"D M\u00fcllner","year":"2015","unstructured":"M\u00fcllner D (2015) Fastcluster: fast hierarchical, agglomerative clustering routines for R and Python. J Stat Softw 53(9):1\u201318. \nhttps:\/\/doi.org\/10.18637\/jss.v053.i09","journal-title":"J Stat Softw"},{"key":"4297_CR11","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1145\/331499.331504","volume":"31","author":"AK Jain","year":"1999","unstructured":"Jain AK, Murty MN, Flynn PJ (1999) Data clustering: a review. ACM Comput Surv 31:264\u2013323. \nhttps:\/\/doi.org\/10.1145\/331499.331504","journal-title":"ACM Comput Surv"},{"key":"4297_CR12","doi-asserted-by":"publisher","DOI":"10.1108\/S1548-6435(2009)5","volume-title":"Marketing research: an applied approach","author":"NK Malhotra","year":"2009","unstructured":"Malhotra NK, Birks DF (2009) Marketing research: an applied approach. Pearson Education, London"},{"issue":"4","key":"4297_CR13","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1093\/comjnl\/26.4.354","volume":"26","author":"F Murtagh","year":"1983","unstructured":"Murtagh F (1983) A survey of recent advances in hierarchical clustering algorithms. Comput J 26(4):354\u2013359","journal-title":"Comput J"},{"key":"4297_CR14","doi-asserted-by":"publisher","DOI":"10.2307\/1268876","author":"WS Sarle","year":"2006","unstructured":"Sarle WS, Jain AK, Dubes RC (2006) Algorithms for clustering data. Technometrics. \nhttps:\/\/doi.org\/10.2307\/1268876","journal-title":"Technometrics"},{"key":"4297_CR15","volume-title":"Multivariate linear regression models","author":"RA Johnson","year":"1988","unstructured":"Johnson RA, Wichern DW (1988) Multivariate linear regression models, 2nd edn. Prentice Hall, Englewood Cliffs","edition":"2"},{"key":"4297_CR16","doi-asserted-by":"publisher","first-page":"13","DOI":"10.5121\/ijaia.2013.4202","volume":"4","author":"SA Shalom","year":"2013","unstructured":"Shalom SA, Dash M (2013) Efficient partitioning based hierarchical agglomerative clustering using graphics accelerators with Cuda. Int J Artif Intell Appl 4:13. \nhttps:\/\/doi.org\/10.5121\/ijaia.2013.4202","journal-title":"Int J Artif Intell Appl"},{"key":"4297_CR17","first-page":"863","volume":"3","author":"M Sebban","year":"2002","unstructured":"Sebban M, Nock R, Lallich S et al (2002) Stopping criterion for boosting-based data reduction techniques: from binary to multiclass problems. J Mach Learn Res 3:863\u2013885","journal-title":"J Mach Learn Res"},{"key":"4297_CR18","first-page":"1","volume":"10","author":"PP Rodrigues","year":"2007","unstructured":"Rodrigues PP, Pedroso P (2007) Hierarchical clustering of time series data streams. IEEE Trans Knowl Data Eng 10:1\u201312","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"3","key":"4297_CR19","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/BF02289588","volume":"32","author":"SC Johnson","year":"1967","unstructured":"Johnson SC (1967) Hierarchical clustering schemes. Psychometrika 32(3):241\u2013254. \nhttps:\/\/doi.org\/10.1007\/BF02289588","journal-title":"Psychometrika"},{"key":"4297_CR20","doi-asserted-by":"publisher","DOI":"10.1002\/widm.53","author":"F Murtagh","year":"2012","unstructured":"Murtagh F, Contreras P (2012) Algorithms for hierarchical clustering: an overview. Wiley Interdiscip Rev Data Min Knowl Discov. \nhttps:\/\/doi.org\/10.1002\/widm.53","journal-title":"Wiley Interdiscip Rev Data Min Knowl Discov"},{"key":"4297_CR21","doi-asserted-by":"crossref","unstructured":"Fung BCM, Wang K, Ester M (2011) Hierarchical document clustering. In: Encyclopedia of data warehousing and mining, Second edition, pp 970\u2013975 \u00a0","DOI":"10.4018\/978-1-60566-010-3.ch150"},{"key":"4297_CR22","unstructured":"Moore AW (2001) K-means and hierarchical clustering. Stat Data Min Tutorials 1\u201324 \u00a0"},{"key":"4297_CR23","doi-asserted-by":"publisher","unstructured":"Rui-Ping L, Mukaidono M (2002) A maximum-entropy approach to fuzzy clustering. In: Proceedings of 1995 IEEE International conference on fuzzy systems. IEEE, Yokohama, pp 2227\u20132232. \nhttps:\/\/doi.org\/10.1109\/fuzzy.1995.409989","DOI":"10.1109\/fuzzy.1995.409989"},{"key":"4297_CR24","volume-title":"Cluster analysis for applications: probability and mathematical statistics: a series of monographs and textbooks","author":"MR Anderberg","year":"1978","unstructured":"Anderberg MR (1978) Cluster analysis for applications: probability and mathematical statistics: a series of monographs and textbooks. Academic Press, Cambridge"},{"issue":"2","key":"4297_CR25","doi-asserted-by":"publisher","first-page":"119","DOI":"10.2307\/2981629","volume":"150","author":"AD Gordon","year":"2006","unstructured":"Gordon AD (2006) A review of hierarchical classification. J R Stat Soc Ser A 150(2):119\u2013137. \nhttps:\/\/doi.org\/10.2307\/2981629","journal-title":"J R Stat Soc Ser A"},{"issue":"3","key":"4297_CR26","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/BF02293743","volume":"46","author":"V Batagelj","year":"1981","unstructured":"Batagelj V (1981) Note on ultrametric hierarchical clustering algorithms. Psychometrika 46(3):351\u2013352. \nhttps:\/\/doi.org\/10.1007\/BF02293743","journal-title":"Psychometrika"},{"key":"4297_CR27","doi-asserted-by":"publisher","DOI":"10.2307\/3151374","author":"GW Milligan","year":"2006","unstructured":"Milligan GW, Romesburg HC (2006) Cluster analysis for researchers. J Mark Res. \nhttps:\/\/doi.org\/10.2307\/3151374","journal-title":"J Mark Res"},{"key":"4297_CR28","volume-title":"Model order reduction based on agglomerative hierarchical clustering","author":"S Al-Dabooni","year":"2018","unstructured":"Al-Dabooni S, Wunsch D (2018) Model order reduction based on agglomerative hierarchical clustering. IEEE Trans Neural Netw Learn, Syst"},{"issue":"03","key":"4297_CR29","doi-asserted-by":"publisher","first-page":"1850008","DOI":"10.1142\/s0218001418500088","volume":"32","author":"H Liu","year":"2017","unstructured":"Liu H, Fen L, Jian J, Chen L (2017) Overlapping community discovery algorithm based on hierarchical agglomerative clustering. Int J Pattern Recognit Artif Intell 32(03):1850008. \nhttps:\/\/doi.org\/10.1142\/s0218001418500088","journal-title":"Int J Pattern Recognit Artif Intell"},{"key":"4297_CR30","first-page":"515","volume-title":"CIKM","author":"Z Ying","year":"2002","unstructured":"Ying Z, Karypis G (2002) Evaluation of hierarchical clustering algorithms for document datasets. CIKM. ACM, New York, pp 515\u2013524"},{"key":"4297_CR31","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1109\/ICIIBMS.2015.7439517","volume":"2015","author":"Z Nazari","year":"2015","unstructured":"Nazari Z, Kang D, Asharif MR et al (2015) A new hierarchical clustering algorithm. Int Conf Intell Inform Biomed Sci 2015:148\u2013152. \nhttps:\/\/doi.org\/10.1109\/ICIIBMS.2015.7439517","journal-title":"Int Conf Intell Inform Biomed Sci"},{"key":"4297_CR32","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-015-1998-5","author":"J Fan","year":"2015","unstructured":"Fan J (2015) OPE-HCA: an optimal probabilistic estimation approach for hierarchical clustering algorithm. Neural Comput Appl. \nhttps:\/\/doi.org\/10.1007\/s00521-015-1998-5","journal-title":"Neural Comput Appl"},{"key":"4297_CR33","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1109\/COMPSAC.2018.00063","volume":"1","author":"D Cheng","year":"2018","unstructured":"Cheng D, Zhu Q, Wu Q (2018) A local cores-based hierarchical clustering algorithm for data sets with complex structures. Proc Int Comput Softw Appl Conf 1:410\u2013419. \nhttps:\/\/doi.org\/10.1109\/COMPSAC.2018.00063","journal-title":"Proc Int Comput Softw Appl Conf"},{"issue":"1","key":"4297_CR34","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10115-006-0027-5","volume":"12","author":"H Koga","year":"2007","unstructured":"Koga H, Ishibashi T, Watanabe T (2007) Fast agglomerative hierarchical clustering algorithm using locality-sensitive hashing. Knowl Inf Syst 12(1):25\u201353. \nhttps:\/\/doi.org\/10.1007\/s10115-006-0027-5","journal-title":"Knowl Inf Syst"},{"issue":"1","key":"4297_CR35","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1186\/1748-7188-4-12","volume":"4","author":"LA Zahor\u00e1nszky","year":"2009","unstructured":"Zahor\u00e1nszky LA, Katona GY, H\u00e1ri P et al (2009) Breaking the hierarchy\u2014a new cluster selection mechanism for hierarchical clustering methods. Algorithms Mol Biol 4(1):12. \nhttps:\/\/doi.org\/10.1186\/1748-7188-4-12","journal-title":"Algorithms Mol Biol"},{"issue":"2","key":"4297_CR36","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1111\/j.1469-1809.1936.tb02137.x","volume":"7","author":"RA Fisher","year":"2011","unstructured":"Fisher RA (2011) The use of multiple measurements in taxonomic problems. Ann Eugen 7(2):179\u2013188. \nhttps:\/\/doi.org\/10.1111\/j.1469-1809.1936.tb02137.x","journal-title":"Ann Eugen"},{"key":"4297_CR37","unstructured":"Fischer I, Poland J (2005) Amplifying the block matrix structure for spectral clustering. In: van Otterlo M, Poel M, Nijholt A (eds) Proceedings of the 14th annual machine learning conference of Belgium and the Netherlands, pp 21\u201328"},{"issue":"1","key":"4297_CR38","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1023\/B:APIN.0000027767.87895.b2","volume":"21","author":"I Uysal","year":"2004","unstructured":"Uysal I, G\u00fcvenir HA (2004) Instance-based regression by partitioning feature projections. Appl Intell 21(1):57\u201379. \nhttps:\/\/doi.org\/10.1023\/B:APIN.0000027767.87895.b2","journal-title":"Appl Intell"},{"key":"4297_CR39","doi-asserted-by":"publisher","first-page":"1553","DOI":"10.1109\/TPAMI.2004.127","volume":"26","author":"I Cohen","year":"2004","unstructured":"Cohen I, Cozman FG, Sebe N et al (2004) Semisupervised learning of classifiers: theory, algorithms, and their application to human\u2013computer interaction. IEEE Trans Pattern Anal Mach Intell 26:1553\u20131567","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"4297_CR40","doi-asserted-by":"publisher","unstructured":"Caruana R, Niculescu-Mizil A (2004) Data mining in metric space: an empirical analysis of supervised learning performance criteria. In: Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, Seattle, pp 69\u201378, 22\u201325 Aug 2004. \nhttps:\/\/doi.org\/10.1145\/1014052.1014063","DOI":"10.1145\/1014052.1014063"},{"key":"4297_CR41","volume-title":"Robust cluster analysis and variable selection","author":"G Ritter","year":"2018","unstructured":"Ritter G (2018) Robust cluster analysis and variable selection. Chapman and Hall, London"},{"key":"4297_CR42","unstructured":"Asuncion A, Newman DJ (2015) UCI machine learning repository: data sets. UCI"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-019-04297-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00521-019-04297-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-019-04297-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,25]],"date-time":"2020-06-25T23:19:15Z","timestamp":1593127155000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00521-019-04297-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,27]]},"references-count":42,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2020,4]]}},"alternative-id":["4297"],"URL":"https:\/\/doi.org\/10.1007\/s00521-019-04297-4","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,6,27]]},"assertion":[{"value":"31 August 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 June 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 June 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that we have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}