{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T05:45:54Z","timestamp":1751521554126,"version":"3.28.0"},"reference-count":30,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,8]]},"DOI":"10.1109\/icpr.2018.8545142","type":"proceedings-article","created":{"date-parts":[[2018,11,30]],"date-time":"2018-11-30T00:17:38Z","timestamp":1543537058000},"page":"1414-1419","source":"Crossref","is-referenced-by-count":4,"title":["D-NND: A Hierarchical Density Clustering Method via Nearest Neighbor Descent"],"prefix":"10.1109","author":[{"given":"Teng","family":"Qiu","sequence":"first","affiliation":[]},{"given":"Chaoyi","family":"Li","sequence":"additional","affiliation":[]},{"given":"Yongjie","family":"Li","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref30","first-page":"119","article-title":"Think globally, fit locally: unsupervised learning of low dimensional manifolds","volume":"4","author":"saul","year":"2003","journal-title":"Journal of Machine Learning Research"},{"key":"ref10","first-page":"58","article-title":"An efficient approach to clustering in large multimedia databases with noise","volume":"98","author":"hinneburg","year":"1998","journal-title":"KDD"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1976.1674719"},{"journal-title":"Clustering by descending to the nearest neighbor in the delaunay graph space","year":"2015","author":"qiu","key":"ref12"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"1492","DOI":"10.1126\/science.1242072","article-title":"Clustering by fast search and find of density peaks","volume":"344","author":"rodriguez","year":"2014","journal-title":"Science"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2014.04.005"},{"journal-title":"A comparison of bandwidth selectors for mean shift clustering","year":"2013","author":"chacn","key":"ref15"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/34.895974"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/34.400568"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/34.1000236"},{"journal-title":"Clustering by hierarchical nearest neighbor descent (h-nnd)","year":"2015","author":"qiu","key":"ref19"},{"key":"ref28","doi-asserted-by":"crossref","first-page":"810","DOI":"10.1038\/nature04977","article-title":"Hierarchy and adaptivity in segmenting visual scenes","volume":"442","author":"sharon","year":"2006","journal-title":"Nature"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1002\/widm.30"},{"key":"ref27","first-page":"217","article-title":"When is “nearest neighbor” meaningful?","author":"beyer","year":"1999","journal-title":"ICDT"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2005.845141"},{"key":"ref6","first-page":"226","article-title":"A density-based algorithm for discovering clusters in large spatial databases with noise","volume":"96","author":"ester","year":"1996","journal-title":"KDD"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1018393108"},{"journal-title":"Nearest descent in-tree and clustering","year":"2014","author":"qiu","key":"ref5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2733381"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/304182.304187"},{"journal-title":"Pattern Recognit","year":"2009","author":"theodoridis","key":"ref2"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1975.1055330"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2009.09.011"},{"journal-title":"Clustering by deep nearest neighbor descent (d-nnd) A density-based parameter-insensitive clustering method","year":"2015","author":"qiu","key":"ref20"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1971.223083"},{"key":"ref21","doi-asserted-by":"crossref","first-page":"972","DOI":"10.1126\/science.1136800","article-title":"Clustering by passing messages between data points","volume":"315","author":"frey","year":"2007","journal-title":"Science"},{"key":"ref24","first-page":"1527","article-title":"Linear-time algorithms for pairwise statistical problems","author":"ram","year":"2009","journal-title":"NIPS"},{"key":"ref23","article-title":"Ann programming manual","author":"mount","year":"1998","journal-title":"Technical Report"},{"key":"ref26","first-page":"849","article-title":"On spectral clustering: Analysis and an algorithm","author":"ng","year":"2002","journal-title":"NIPS"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/34.868688"}],"event":{"name":"2018 24th International Conference on Pattern Recognition (ICPR)","start":{"date-parts":[[2018,8,20]]},"location":"Beijing","end":{"date-parts":[[2018,8,24]]}},"container-title":["2018 24th International Conference on Pattern Recognition (ICPR)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8527858\/8545020\/08545142.pdf?arnumber=8545142","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,27]],"date-time":"2022-01-27T03:17:59Z","timestamp":1643253479000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8545142\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8]]},"references-count":30,"URL":"https:\/\/doi.org\/10.1109\/icpr.2018.8545142","relation":{},"subject":[],"published":{"date-parts":[[2018,8]]}}}