{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,6]],"date-time":"2025-06-06T04:30:44Z","timestamp":1749184244617,"version":"3.37.3"},"reference-count":44,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"DOI":"10.13039\/501100003621","name":"Ministry of Science ICT and Future Planning","doi-asserted-by":"publisher","award":["2015M3A9A7029735","PA-C000001"],"award-info":[{"award-number":["2015M3A9A7029735","PA-C000001"]}],"id":[{"id":"10.13039\/501100003621","id-type":"DOI","asserted-by":"publisher"}]},{"name":"SBS Foundation"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2017]]},"DOI":"10.1109\/access.2017.2690987","type":"journal-article","created":{"date-parts":[[2017,4,4]],"date-time":"2017-04-04T19:57:50Z","timestamp":1491335870000},"page":"1-1","source":"Crossref","is-referenced-by-count":11,"title":["NC-link: A New Linkage Method for Efficient Hierarchical Clustering of Large-Scale Data"],"prefix":"10.1109","author":[{"given":"Yongkweon","family":"Jeon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jaeyoon","family":"Yoo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jongsun","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2367-197X","authenticated-orcid":false,"given":"Sungroh","family":"Yoon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN.2011.6033373"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/34.615448"},{"key":"ref33","volume":"344","author":"kaufman","year":"2009","journal-title":"Finding Groups in Data An Introduction to Cluster Analysis"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bth078"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gkh121"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-8-S4-S10"},{"key":"ref37","first-page":"1135","article-title":"New algorithms for efficient high-dimensional nonparametric classification","volume":"7","author":"liu","year":"2006","journal-title":"J Mach Learn Res"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1975.224297"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/34.955110"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2010.01.003"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/26.4.354"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8191(95)00017-I"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2005.72"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1186\/1756-0381-1-9"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2014.2355205"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1145\/235968.233324","article-title":"BIRCH: An efficient data clustering method for very large databases","author":"zhang","year":"1996","journal-title":"Proc ACM SIGMOD"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.1999.754967"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/2.781637"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/0377-0427(87)90125-7"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-008-0150-6"},{"journal-title":"Geometry a Comprehensive Course","year":"2013","author":"pedoe","key":"ref28"},{"journal-title":"Principle of Data Mining","year":"2001","author":"hand","key":"ref4"},{"key":"ref27","volume":"126","author":"tao","year":"2011","journal-title":"An Introduction to Measure Theory"},{"journal-title":"Introduction to Data Mining","year":"2005","author":"tan","key":"ref3"},{"journal-title":"Foundations of Statistical Natural Language Processing","year":"1999","author":"manning","key":"ref6"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/29.1.152"},{"journal-title":"Data Mining Practical Machine Learning Tools and Techniques","year":"2005","author":"witten","key":"ref5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1497577.1497578"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2004.2"},{"journal-title":"Data Mining","year":"2006","author":"han","key":"ref2"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-39940-9"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/331499.331504"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/16.1.30"},{"key":"ref22","first-page":"226","article-title":"OPTICS: Ordering points to identify the clustering structure","author":"ankerst","year":"1996","journal-title":"Proc Int'l Conf Knowledge Discovery and Data Mining"},{"key":"ref21","first-page":"226","article-title":"A density-based algorithm for discovering clusters in large spatial databases with noise","author":"easter","year":"1996","journal-title":"Proc Int'l Conf Knowledge Discovery and Data Mining"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.49"},{"key":"ref24","article-title":"Multidimensional clustering algorithms","volume":"1","author":"murtagh","year":"1985","journal-title":"COMPSTAT Lectures"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539798347177"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/BF01890115"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2588565"},{"key":"ref26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.18637\/jss.v053.i09","article-title":"fastcluster: Fast hierarchical, agglomerative clustering routines for r and python","volume":"53","author":"m\u00fcllner","year":"2013","journal-title":"J Statist Softw"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8655(93)90047-H"},{"journal-title":"Introduction to Algorithms","year":"2001","author":"cormen","key":"ref25"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/6514899\/07891959.pdf?arnumber=7891959","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:30:13Z","timestamp":1641987013000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7891959\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"references-count":44,"URL":"https:\/\/doi.org\/10.1109\/access.2017.2690987","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2017]]}}}