{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T18:57:52Z","timestamp":1772909872378,"version":"3.50.1"},"reference-count":32,"publisher":"World Scientific Pub Co Pte Ltd","issue":"04","funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["Grand no. 61272420"],"award-info":[{"award-number":["Grand no. 61272420"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Jiangsu Government Scholarship for Overseas Studies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J CIRCUIT SYST COMP"],"published-print":{"date-parts":[[2019,4]]},"abstract":"<jats:p> Hierarchical clustering is a classical method to provide a hierarchical representation for the purpose of data analysis. However, in practical applications, it is difficult to deal with massive datasets due to their high computation complexity. To overcome this challenge, this paper presents a novel distributed storage and computation hierarchical clustering algorithm, which has a lower time complexity than the standard hierarchical clustering algorithms. Our proposed approach is suitable for hierarchical clustering on massive datasets, which has the following advantages. First, the algorithm is able to store massive dataset exceeding the main memory space by using distributed storage nodes. Second, the algorithm is able to efficiently process nearest neighbor searching along parallel lines by using distributed computation at each node. Extensive experiments are carried out to validate the effectiveness of the DHC algorithm. Experimental results demonstrate that the algorithm is 10 times faster than the standard hierarchical clustering algorithm, which is an effective and flexible distributed algorithm of hierarchical clustering for massive datasets. <\/jats:p>","DOI":"10.1142\/s0218126619500658","type":"journal-article","created":{"date-parts":[[2018,6,4]],"date-time":"2018-06-04T01:52:27Z","timestamp":1528077147000},"page":"1950065","source":"Crossref","is-referenced-by-count":10,"title":["DHC: A Distributed Hierarchical Clustering Algorithm for Large Datasets"],"prefix":"10.1142","volume":"28","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3694-2246","authenticated-orcid":false,"given":"Wei","family":"Zhang","sequence":"first","affiliation":[{"name":"Computer Science and Engineering, Nanjing University of Science and Technology, NO.200 Xiaolingwei Road, Nanjing 210094, P.\u00a0R.\u00a0China"},{"name":"Computer Science and Technology, Huaiyin Normal University, NO.111 Changjiangxi Road, Huai\u2019an 223300, P.\u00a0R.\u00a0China"}]},{"given":"Gongxuan","family":"Zhang","sequence":"additional","affiliation":[{"name":"Computer Science and Engineering, Nanjing University of Science and Technology, NO.200 Xiaolingwei Road, Nanjing 210094, P.\u00a0R.\u00a0China"}]},{"given":"Xiaohui","family":"Chen","sequence":"additional","affiliation":[{"name":"Computer Science and Engineering, Nanjing University of Science and Technology, NO.200 Xiaolingwei Road, Nanjing 210094, P.\u00a0R.\u00a0China"}]},{"given":"Yueqi","family":"Liu","sequence":"additional","affiliation":[{"name":"Computer Science and Engineering, Nanjing University of Science and Technology, NO.200 Xiaolingwei Road, Nanjing 210094, P.\u00a0R.\u00a0China"}]},{"given":"Xiumin","family":"Zhou","sequence":"additional","affiliation":[{"name":"Computer Science and Engineering, Nanjing University of Science and Technology, NO.200 Xiaolingwei Road, Nanjing 210094, P.\u00a0R.\u00a0China"}]},{"given":"Junlong","family":"Zhou","sequence":"additional","affiliation":[{"name":"Computer Science and Engineering, Nanjing University of Science and Technology, NO.200 Xiaolingwei Road, Nanjing 210094, P.\u00a0R.\u00a0China"}]}],"member":"219","published-online":{"date-parts":[[2019,3,31]]},"reference":[{"key":"S0218126619500658BIB001","unstructured":"P. Tan,  M. Steinbach and  V. Kumar ,  Introduction to Data Mining  (Addison-Wesley Longman, Inc.,  2005), pp.  516\u2013518."},{"key":"S0218126619500658BIB002","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/16.1.30"},{"key":"S0218126619500658BIB003","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/20.4.364"},{"key":"S0218126619500658BIB004","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/26.4.354"},{"key":"S0218126619500658BIB006","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2015.02.001"},{"key":"S0218126619500658BIB007","doi-asserted-by":"publisher","DOI":"10.1007\/s10586-015-0515-z"},{"key":"S0218126619500658BIB009","doi-asserted-by":"publisher","DOI":"10.1007\/BF00288933"},{"key":"S0218126619500658BIB010","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/978-3-662-04245-8_14","author":"Berg M. D.","year":"2000","journal-title":"Comput. Geom."},{"key":"S0218126619500658BIB011","doi-asserted-by":"publisher","DOI":"10.1145\/282957.282966"},{"key":"S0218126619500658BIB012","doi-asserted-by":"publisher","DOI":"10.1145\/361002.361007"},{"key":"S0218126619500658BIB014","volume":"25","author":"Barreiros W.","year":"2017","journal-title":"IEEE Int. Conf. Clust. Comput."},{"key":"S0218126619500658BIB015","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2016.2615423"},{"issue":"11","key":"S0218126619500658BIB016","first-page":"1","volume":"126","author":"Wigness M.","year":"2017","journal-title":"Int. J. Comput. Vis."},{"key":"S0218126619500658BIB017","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2016.05.003"},{"issue":"2","key":"S0218126619500658BIB018","first-page":"400","volume":"26","author":"Xu S.","year":"2016","journal-title":"J. Circuits Syst. Comput."},{"key":"S0218126619500658BIB019","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009783824328"},{"key":"S0218126619500658BIB021","doi-asserted-by":"publisher","DOI":"10.1145\/276305.276312"},{"key":"S0218126619500658BIB022","doi-asserted-by":"publisher","DOI":"10.1109\/2.781637"},{"key":"S0218126619500658BIB025","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2015.05.001"},{"key":"S0218126619500658BIB027","doi-asserted-by":"publisher","DOI":"10.1007\/BF01890115"},{"key":"S0218126619500658BIB028","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2017.03.030"},{"key":"S0218126619500658BIB029","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2017.04.006"},{"issue":"99","key":"S0218126619500658BIB030","first-page":"5594","volume":"5","author":"Jeon Y.","year":"2017","journal-title":"IEEE Access"},{"key":"S0218126619500658BIB031","doi-asserted-by":"publisher","DOI":"10.5897\/JETR2017.0628"},{"key":"S0218126619500658BIB032","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2014.09.054"},{"key":"S0218126619500658BIB034","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/10.3.271"},{"key":"S0218126619500658BIB035","doi-asserted-by":"publisher","DOI":"10.1142\/S0218126617500165"},{"issue":"3731","key":"S0218126619500658BIB036","first-page":"34","volume":"153","author":"Bellman R.","year":"1966","journal-title":"Dynam. Program. Science"},{"key":"S0218126619500658BIB038","doi-asserted-by":"publisher","DOI":"10.1111\/j.1469-1809.1936.tb02137.x"},{"key":"S0218126619500658BIB039","doi-asserted-by":"publisher","DOI":"10.2307\/2394164"},{"key":"S0218126619500658BIB040","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2012.08.009"},{"key":"S0218126619500658BIB041","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1963.10500845"}],"container-title":["Journal of Circuits, Systems and Computers"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218126619500658","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,22]],"date-time":"2019-09-22T14:40:24Z","timestamp":1569163224000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218126619500658"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3,31]]},"references-count":32,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2019,3,31]]},"published-print":{"date-parts":[[2019,4]]}},"alternative-id":["10.1142\/S0218126619500658"],"URL":"https:\/\/doi.org\/10.1142\/s0218126619500658","relation":{},"ISSN":["0218-1266","1793-6454"],"issn-type":[{"value":"0218-1266","type":"print"},{"value":"1793-6454","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,3,31]]}}}