{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,6]],"date-time":"2025-05-06T17:10:20Z","timestamp":1746551420327,"version":"3.28.0"},"reference-count":11,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,9]]},"DOI":"10.1109\/icip.2015.7350969","type":"proceedings-article","created":{"date-parts":[[2015,12,13]],"date-time":"2015-12-13T01:34:48Z","timestamp":1449970488000},"page":"1095-1099","source":"Crossref","is-referenced-by-count":4,"title":["The hidden structure of image datasets"],"prefix":"10.1109","author":[{"given":"Sangchun","family":"Han","sequence":"first","affiliation":[]},{"given":"Mireille","family":"Boutin","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"journal-title":"Irvine CA University of California Department of Information and Computer Science","article-title":"The uci kdd archive","year":"1999","key":"ref4"},{"key":"ref3","doi-asserted-by":"crossref","DOI":"10.32614\/RJ-2011-015","article-title":"Ckmeans.1d.dp: Optimal k-means clustering in one dimension by dynamic programming","volume":"3","author":"wang","year":"2011","journal-title":"R Journal"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687770"},{"article-title":"RP1D (clustering method using 1D random projections) [https:\/\/purr.purdue.edu\/publications\/1729]","year":"2014","author":"han","key":"ref6"},{"key":"ref11","volume":"27","author":"agrawal","year":"1998","journal-title":"Automatic Subspace Clustering of High Dimensional Data for Data Mining Applications"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/GlobalSIP.2014.7032135"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1016\/j.patrec.2009.09.011","article-title":"Data clustering: 50 years beyond k-means","volume":"31","author":"anil","year":"2010","journal-title":"Pattern Recognition Letters"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1145\/304181.304188","article-title":"Fast algorithms for projected clustering","volume":"28","author":"charu","year":"1999","journal-title":"ACM SIGMOD Record"},{"key":"ref2","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511810114","article-title":"Data Mining and Analysis: Fundamental Concepts and Algorithms","author":"zaki","year":"2014"},{"key":"ref9","first-page":"1027","article-title":"k-means+s-: The advantages of careful seeding","author":"arthur","year":"2007","journal-title":"Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms Society for Industrial and Applied Mathematics"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/3-540-49257-7_15","article-title":"When is “nearest neighbor” meaningful?","author":"beyer","year":"1999","journal-title":"Database Theory-ICDT'99"}],"event":{"name":"2015 IEEE International Conference on Image Processing (ICIP)","start":{"date-parts":[[2015,9,27]]},"location":"Quebec City, QC, Canada","end":{"date-parts":[[2015,9,30]]}},"container-title":["2015 IEEE International Conference on Image Processing (ICIP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7328364\/7350743\/07350969.pdf?arnumber=7350969","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,2]],"date-time":"2019-09-02T08:10:58Z","timestamp":1567411858000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7350969\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9]]},"references-count":11,"URL":"https:\/\/doi.org\/10.1109\/icip.2015.7350969","relation":{},"subject":[],"published":{"date-parts":[[2015,9]]}}}