{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:58:51Z","timestamp":1760709531335,"version":"3.37.3"},"reference-count":33,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2018,9,1]],"date-time":"2018-09-01T00:00:00Z","timestamp":1535760000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2018,9,1]]},"DOI":"10.1109\/tkde.2018.2807444","type":"journal-article","created":{"date-parts":[[2018,2,19]],"date-time":"2018-02-19T23:27:40Z","timestamp":1519082860000},"page":"1686-1696","source":"Crossref","is-referenced-by-count":10,"title":["CRAFTER: A Tree-Ensemble Clustering Algorithm for Static Datasets with Mixed Attributes and High Dimensionality"],"prefix":"10.1109","volume":"30","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2277-3701","authenticated-orcid":false,"given":"Sangdi","family":"Lin","sequence":"first","affiliation":[]},{"given":"Bahareh","family":"Azarnoush","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9460-6983","authenticated-orcid":false,"given":"George C.","family":"Runger","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref33","DOI":"10.1023\/A:1009783824328"},{"key":"ref32","first-page":"1","article-title":"Statistical comparisons of classifiers over multiple data sets","volume":"7","author":"dem\u0161ar","year":"2006","journal-title":"J Mach Learn Res"},{"doi-asserted-by":"publisher","key":"ref31","DOI":"10.1017\/CBO9780511921803"},{"year":"2017","author":"szepannek","article-title":"R package &#x2019;clustmixtype&#x2019;","key":"ref30"},{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1109\/ICDE.1999.754967"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1145\/1007730.1007731"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1145\/276305.276314","article-title":"Automatic subspace clustering of high dimensional data","author":"agrawal","year":"1998","journal-title":"Proc ACM SIGMOD Int Conf Manage Data"},{"key":"ref13","first-page":"2487","article-title":"Hubs in space: Popular nearest neighbors in high-dimensional data","volume":"11","author":"radovanovi?","year":"2010","journal-title":"J Mach Learn Res"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1109\/TKDE.2013.25"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1073\/pnas.1737401100"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1198\/106186006X94072"},{"key":"ref17","first-page":"102","article-title":"Toward a framework for learner segmentation","volume":"5","author":"azarnoush","year":"2013","journal-title":"J Educ Data Mining"},{"key":"ref18","first-page":"207","article-title":"A new and efficient k-medoid algorithm for spatial clustering","author":"zhang","year":"2005","journal-title":"Proc Comput Sci Appl"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1016\/j.eswa.2008.01.039"},{"key":"ref28","first-page":"18","article-title":"Classification and Regression by randomForest","volume":"2","author":"liaw","year":"2002","journal-title":"R News"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1007\/978-1-4899-7687-1_62"},{"doi-asserted-by":"publisher","key":"ref27","DOI":"10.1109\/TPAMI.2006.227"},{"key":"ref3","first-page":"217","article-title":"When is nearest neighbor meaningful?","author":"beyer","year":"1999","journal-title":"Proc 7th Int Conf Database Theory"},{"year":"2011","author":"han","journal-title":"Data Mining Concepts and Techniques","key":"ref6"},{"year":"2017","author":"maechler","article-title":"Cluster: Cluster analysis basics and extensions","key":"ref29"},{"year":"2003","author":"breiman","article-title":"Manual&#x2013;setting up, using and understanding random forests v4. 0","key":"ref5"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1002\/9780470316801.ch2","article-title":"Partitioning around medoids (program PAM)","author":"kaufman","year":"1990","journal-title":"Finding Groups in Data An Introduction to Cluster Analysis"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.2307\/2346830"},{"key":"ref2","first-page":"420","article-title":"On the surprising behavior of distance metrics in high dimensional spaces","volume":"1","author":"aggarwal","year":"2001","journal-title":"Proc Int Conf Database Theory"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1023\/A:1009769707641"},{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1007\/978-1-4899-7687-1_192"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1016\/j.knosys.2012.01.006"},{"year":"2005","author":"tan","journal-title":"Introduction to Data Mining (First Edition)","key":"ref22"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1016\/j.eswa.2011.06.027"},{"doi-asserted-by":"publisher","key":"ref24","DOI":"10.1145\/2020408.2020555"},{"doi-asserted-by":"publisher","key":"ref23","DOI":"10.2307\/2284239"},{"year":"2013","author":"lichman","article-title":"UCI machine learning repository","key":"ref26"},{"year":"1999","author":"melli","article-title":"The datgen dataset generator. version 3.1","key":"ref25"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/8425816\/08294273.pdf?arnumber=8294273","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T04:21:19Z","timestamp":1693542079000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8294273\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,1]]},"references-count":33,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2018.2807444","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"type":"print","value":"1041-4347"},{"type":"electronic","value":"1558-2191"},{"type":"electronic","value":"2326-3865"}],"subject":[],"published":{"date-parts":[[2018,9,1]]}}}