{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T20:42:17Z","timestamp":1778272937541,"version":"3.51.4"},"reference-count":55,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2019,4,1]]},"DOI":"10.1109\/tkde.2018.2842191","type":"journal-article","created":{"date-parts":[[2018,5,31]],"date-time":"2018-05-31T19:01:36Z","timestamp":1527793296000},"page":"641-654","source":"Crossref","is-referenced-by-count":63,"title":["A Rapid Hybrid Clustering Algorithm for Large Volumes of High Dimensional Data"],"prefix":"10.1109","volume":"31","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8407-7800","authenticated-orcid":false,"given":"Punit","family":"Rathore","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dheeraj","family":"Kumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3901-7021","authenticated-orcid":false,"given":"James C.","family":"Bezdek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sutharshan","family":"Rajasegarar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3635-4252","authenticated-orcid":false,"given":"Marimuthu","family":"Palaniswami","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1023\/A:1012853629322"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/FUZZY.2007.4295372"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2013.6691561"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ISSNIP.2013.6529823"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN.2002.1007487"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/CIDM.2007.368910"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN.2016.7727499"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/375551.375608"},{"key":"ref35","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1090\/conm\/026\/737400","article-title":"Extensions of Lipschitz mappings into a hilbert space","volume":"26","author":"johnson","year":"1984","journal-title":"Contemporary Math"},{"key":"ref34","article-title":"Comparing nearest neighbor algorithms in high-dimensional space","author":"gunadi","year":"2011"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289263"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2011.33"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2006.02.011"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2013.01.010"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1201\/b15410"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-005-1396-1"},{"key":"ref22","first-page":"186","article-title":"Random projection for high dimensional data clustering: A cluster ensemble approach","author":"fern","year":"2003","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/304181.304188"},{"key":"ref24","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1007\/978-3-642-03070-3_28","article-title":"Fast spectral clustering with random projection and sampling","author":"sakai","year":"2009","journal-title":"Proc Int Workshop Mach Learn Data Mining Pattern Recognit"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/FUZZ-IEEE.2015.7337933"},{"key":"ref26","first-page":"1371","article-title":"Efficient hierarchical clustering of large high dimensional datasets","author":"gilpin","year":"2013","journal-title":"Proc 22nd ACM Int Conf Conf Inf Knowl Manage"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2002.1183915"},{"key":"ref50","first-page":"749","article-title":"The Quadratic-Chi histogram distance family","author":"pele","year":"2010","journal-title":"Proc Eur Conf Comput Vis"},{"key":"ref51","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/978-3-319-67789-7_6","article-title":"Interpreting cluster structure in waveform data with visual assessment and Dunn's index","author":"mahallati","year":"2018","journal-title":"Frontiers in Computational Intelligence"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1145\/1148020.1148024"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972764.49"},{"key":"ref53","first-page":"312","article-title":"Approximating higher-order distances using random projections","author":"li","year":"2012","journal-title":"Proc 26th Conf Uncertainty Artif Intell"},{"key":"ref52","article-title":"Random projections weakly preserving the hamming distance between words","author":"arca","year":"2009","journal-title":"Proc Italian Workshop Neural Networks 95"},{"key":"ref10","author":"rousseeuw","year":"1990","journal-title":"Finding Groups in Data"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/S0306-4379(01)00008-4"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1080\/01969727308546046"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2015.2477416"},{"key":"ref13","volume":"1","author":"bezdek","year":"2017","journal-title":"Primer on Cluster Analysis Four Basic Methods that (Usually) Work"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/1497577.1497578"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1002\/widm.1062"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-08968-2_16"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73435-2_9"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TFUZZ.2017.2729501"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/1007730.1007731"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/502512.502546"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2017.2731875"},{"key":"ref6","first-page":"707","article-title":"Big data clustering: A review","author":"shirkhorshidi","year":"2014","journal-title":"Proc Int Conf Comput Sci Appl"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/347090.347123"},{"key":"ref8","first-page":"9","article-title":"Scaling clustering algorithms to large databases","author":"bradley","year":"1998","journal-title":"Proc Int'l Conf Knowledge Discovery and Data Mining"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TETC.2014.2330519"},{"key":"ref49","first-page":"1","article-title":"Dunn's cluster validity index as a contrast measure of VAT images","author":"havens","year":"2008","journal-title":"Proc 19th Int Conf Pattern Recognit"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772862"},{"key":"ref46","article-title":"UCI machine learning repository","author":"asuncion","year":"2007"},{"key":"ref45","author":"ahmed","year":"2004","journal-title":"Multiple Random Projection for Fast Approximate Nearest Neighbor Search in High Dimensions"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2018.2806886"},{"key":"ref47","article-title":"The MNIST dataset of handwritten digits","author":"lecun","year":"1998"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-009-0421-5"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2008.158"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-009-9157-2"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1002\/int.20344"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/8661586\/08370127.pdf?arnumber=8370127","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T20:47:14Z","timestamp":1657745234000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8370127\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4,1]]},"references-count":55,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2018.2842191","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"value":"1041-4347","type":"print"},{"value":"1558-2191","type":"electronic"},{"value":"2326-3865","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,4,1]]}}}