Fast agglomerative clustering using information of \(k\)-nearest neighbors
From MaRDI portal
Publication:609105
DOI10.1016/J.PATCOG.2010.06.021zbMath1207.68264OpenAlexW1987819498MaRDI QIDQ609105
Jim Z. C. Lai, Chih-Tang Chang, M. D. Jeng
Publication date: 30 November 2010
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.patcog.2010.06.021
Cites Work
- Fast \(k\)-nearest-neighbor search based on projection and triangular inequality
- On voting-based consensus of cluster ensembles
- Cooperative clustering
- An incremental nested partition method for data clustering
- Improvement of the fast exact pairwise-nearest-neighbor algorithm
- Efficient algorithms for divisive hierarchical clustering with the diameter criterion
- Artifact reduction of JPEG coded images using mean-removed classified vector quantization
- Image restoration of compressed image using classified vector quantization
This page was built for publication: Fast agglomerative clustering using information of \(k\)-nearest neighbors