乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T16:10:06Z","timestamp":1740845406448,"version":"3.38.0"},"reference-count":29,"publisher":"Elsevier BV","issue":"9","license":[{"start":{"date-parts":[[2011,5,1]],"date-time":"2011-05-01T00:00:00Z","timestamp":1304208000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Sciences"],"published-print":{"date-parts":[[2011,5]]},"DOI":"10.1016\/j.ins.2011.01.011","type":"journal-article","created":{"date-parts":[[2011,1,10]],"date-time":"2011-01-10T09:05:26Z","timestamp":1294650326000},"page":"1722-1734","source":"Crossref","is-referenced-by-count":20,"title":["An agglomerative clustering algorithm using a dynamic k-nearest-neighbor list"],"prefix":"10.1016","volume":"181","author":[{"given":"Jim Z.C.","family":"Lai","sequence":"first","affiliation":[]},{"given":"Tsung-Jen","family":"Huang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ins.2011.01.011_b0005","doi-asserted-by":"crossref","first-page":"3583","DOI":"10.1016\/j.ins.2009.06.012","article-title":"Performance evaluation of density-based clustering methods","volume":"179","author":"Aliguliyev","year":"2009","journal-title":"Information Sciences"},{"key":"10.1016\/j.ins.2011.01.011_b0010","first-page":"1132","article-title":"An improvement of the minimum distortion encoding algorithms for vector quantization and pattern matching","volume":"COM-33","author":"Bei","year":"1985","journal-title":"IEEE Transactions on Communications"},{"key":"10.1016\/j.ins.2011.01.011_b0015","doi-asserted-by":"crossref","first-page":"2341","DOI":"10.1016\/j.ins.2010.02.021","article-title":"Pairwise-adaptive dissimilarity for document clustering","volume":"180","author":"D\u2019hondt","year":"2010","journal-title":"Information Sciences"},{"key":"10.1016\/j.ins.2011.01.011_b0020","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/643477.643478","article-title":"Web mining for web personalization","volume":"3","author":"Eirinaki","year":"2003","journal-title":"ACM Transactions on Internet Technology"},{"key":"10.1016\/j.ins.2011.01.011_b0025","doi-asserted-by":"crossref","first-page":"1568","DOI":"10.1109\/29.35395","article-title":"A new vector quantization clustering algorithm","volume":"37","author":"Equitz","year":"1989","journal-title":"IEEE Transactions on Acoustics, Speech, and Signal Processing"},{"year":"1996","series-title":"Advances in Knowledge Discovery and Data Mining","author":"Fayyad","key":"10.1016\/j.ins.2011.01.011_b0030"},{"key":"10.1016\/j.ins.2011.01.011_b0035","doi-asserted-by":"crossref","first-page":"773","DOI":"10.1109\/83.841516","article-title":"Fast and memory efficient implementation of the exact PNN","volume":"9","author":"Fr\u00e4nti","year":"2000","journal-title":"IEEE Transactions on Image Processing"},{"key":"10.1016\/j.ins.2011.01.011_b0040","doi-asserted-by":"crossref","first-page":"1875","DOI":"10.1109\/TPAMI.2006.227","article-title":"Fast agglomerative clustering using a k-nearest neighbor graph","volume":"26","author":"Fr\u00e4nti","year":"2006","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"year":"1991","series-title":"Vector Quantization and Signal Compression","author":"Gersho","key":"10.1016\/j.ins.2011.01.011_b0045"},{"key":"10.1016\/j.ins.2011.01.011_b0050","doi-asserted-by":"crossref","unstructured":"P. Hojen-Sorensen, N. de Freitas, T. Fog, On-line probabilistic classification with particle filters, in: Proceedings of the IEEE Signal Processing Society Workshop, vol. 1, 2000, pp. 386\u2013395.","DOI":"10.1109\/NNSP.2000.889430"},{"key":"10.1016\/j.ins.2011.01.011_b0055","doi-asserted-by":"crossref","first-page":"881","DOI":"10.1109\/TPAMI.2002.1017616","article-title":"An efficient k-means clustering algorithm: analysis and implementation","volume":"24","author":"Kanungo","year":"2002","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"10.1016\/j.ins.2011.01.011_b0060","doi-asserted-by":"crossref","first-page":"1862","DOI":"10.1117\/1.602251","article-title":"Vector quantization by lazy pairwise nearest neighbor method","volume":"38","author":"Kaukoranta","year":"1999","journal-title":"Optical Engineering"},{"key":"10.1016\/j.ins.2011.01.011_b0065","doi-asserted-by":"crossref","first-page":"1337","DOI":"10.1109\/83.855429","article-title":"A fast exact GLA based on code vector activity detection","volume":"9","author":"Kaukoranta","year":"2000","journal-title":"IEEE Transactions on Image Processing"},{"key":"10.1016\/j.ins.2011.01.011_b0070","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0031-3203(91)90062-A","article-title":"An efficient agglomerative clustering algorithm using a heap","volume":"24","author":"Kurita","year":"1991","journal-title":"Pattern Recognition"},{"key":"10.1016\/j.ins.2011.01.011_b0075","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1006\/jvci.1996.0016","article-title":"Fast search algorithms for VQ codebook generation","volume":"7","author":"Lai","year":"1996","journal-title":"Journal of Visual Communication and Image Representation"},{"key":"10.1016\/j.ins.2011.01.011_b0080","doi-asserted-by":"crossref","first-page":"1375","DOI":"10.1016\/S0165-1684(02)00277-3","article-title":"Artifact reduction of JPEG coded images using mean-removed classified vector quantization","volume":"82","author":"Lai","year":"2002","journal-title":"Signal Processing"},{"key":"10.1016\/j.ins.2011.01.011_b0085","doi-asserted-by":"crossref","first-page":"1554","DOI":"10.1109\/TIP.2004.837559","article-title":"Fast searching algorithm for vector quantization using projection and triangular inequality","volume":"13","author":"Lai","year":"2004","journal-title":"IEEE Transactions on Image Processing"},{"key":"10.1016\/j.ins.2011.01.011_b0090","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1016\/j.patcog.2006.04.024","article-title":"Fast k-nearest-neighbor search based on projection and triangular inequality","volume":"40","author":"Lai","year":"2007","journal-title":"Pattern Recognition"},{"key":"10.1016\/j.ins.2011.01.011_b0095","doi-asserted-by":"crossref","first-page":"4501","DOI":"10.1016\/j.ins.2008.05.014","article-title":"Clustering high dimensional data: a graph-based relaxed optimization approach","volume":"178","author":"Lee","year":"2008","journal-title":"Information Sciences"},{"key":"10.1016\/j.ins.2011.01.011_b0100","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/S0031-3203(01)00048-6","article-title":"Image restoration of compressed image using classified vector quantization","volume":"35","author":"Liaw","year":"2002","journal-title":"Pattern Recognition"},{"key":"10.1016\/j.ins.2011.01.011_b0105","doi-asserted-by":"crossref","first-page":"867","DOI":"10.1016\/j.patcog.2008.10.001","article-title":"Improvement of the fast exact pairwise-nearest-neighbor algorithm","volume":"42","author":"Liaw","year":"2009","journal-title":"Pattern Recognition"},{"key":"10.1016\/j.ins.2011.01.011_b0110","doi-asserted-by":"crossref","unstructured":"D. Liu, F. Kubala, Online speaker clustering, in: Proceedings of the IEEE Conference on Acoustic, Speech, and Signal Processing, vol. 1, 2004, pp. 333\u2013336.","DOI":"10.1109\/ICASSP.2004.1325990"},{"key":"10.1016\/j.ins.2011.01.011_b0115","doi-asserted-by":"crossref","first-page":"2680","DOI":"10.1016\/j.ins.2008.01.022","article-title":"A tabu search approach for the minimum sum-of-squares clustering problem","volume":"178","author":"Liu","year":"2008","journal-title":"Information Sciences"},{"issue":"40","key":"10.1016\/j.ins.2011.01.011_b0120","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1109\/82.257335","article-title":"A fast mean-distance-ordered partial codebook search algorithm for image vector quantization","volume":"II","author":"Ra","year":"1993","journal-title":"IEEE Transactions on Circuits and Systems"},{"key":"10.1016\/j.ins.2011.01.011_b0125","doi-asserted-by":"crossref","first-page":"614","DOI":"10.1109\/83.563327","article-title":"On the computational complexity of the LBG and PNN algorithm","volume":"6","author":"Shanbehzadeh","year":"1997","journal-title":"IEEE Transactions on Image Processing"},{"year":"2003","series-title":"Pattern Recognition","author":"Theodoridis","key":"10.1016\/j.ins.2011.01.011_b0130"},{"key":"10.1016\/j.ins.2011.01.011_b0135","doi-asserted-by":"crossref","first-page":"2495","DOI":"10.1117\/1.1412423","article-title":"Practical methods for speeding-up the pairwise nearest neighbor method","volume":"40","author":"Virmajoki","year":"2001","journal-title":"Optical Engineering"},{"key":"10.1016\/j.ins.2011.01.011_b0140","doi-asserted-by":"crossref","first-page":"236","DOI":"10.2307\/2282967","article-title":"Hierarchical grouping to optimize an objective function","volume":"58","author":"Ward","year":"1963","journal-title":"Journal of the American Statistical Association"},{"key":"10.1016\/j.ins.2011.01.011_b0145","unstructured":"."}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025511000211?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025511000211?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T15:34:16Z","timestamp":1740843256000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020025511000211"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,5]]},"references-count":29,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2011,5]]}},"alternative-id":["S0020025511000211"],"URL":"https:\/\/doi.org\/10.1016\/j.ins.2011.01.011","relation":{},"ISSN":["0020-0255"],"issn-type":[{"type":"print","value":"0020-0255"}],"subject":[],"published":{"date-parts":[[2011,5]]}}}