
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Pasi Fr?nti, Olli Virmajoki, Ville Hautam?ki, "Fast Agglomerative Clustering Using a kNearest Neighbor Graph," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 28, no. 11, pp. 18751881, November, 2006.  
BibTex  x  
@article{ 10.1109/TPAMI.2006.227, author = {Pasi Fr?nti and Olli Virmajoki and Ville Hautam?ki}, title = {Fast Agglomerative Clustering Using a kNearest Neighbor Graph}, journal ={IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {28}, number = {11}, issn = {01628828}, year = {2006}, pages = {18751881}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPAMI.2006.227}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Pattern Analysis and Machine Intelligence TI  Fast Agglomerative Clustering Using a kNearest Neighbor Graph IS  11 SN  01628828 SP1875 EP1881 EPD  18751881 A1  Pasi Fr?nti, A1  Olli Virmajoki, A1  Ville Hautam?ki, PY  2006 KW  Clustering KW  agglomeration KW  nearest neighbor KW  vector quantization KW  PNN. VL  28 JA  IEEE Transactions on Pattern Analysis and Machine Intelligence ER   
[1] J.H. Ward, “Hierarchical Grouping to Optimize an Objective Function,” J.Am. Statisical Assoc., vol. 58, pp. 236244, 1963.
[2] J. Shanbehzadeh and P.O. Ogunbona, “On the Computational Complexity of the LBG and PNN Algorithms,” IEEE Trans. Image Processing, vol. 6, no. 4, pp. 614616, Apr. 1997.
[3] P. Fränti, T. Kaukoranta, D.F. Shen, and K.S. Chang, “Fast and Memory Efficient Implementation of the Exact PNN,” IEEE Trans. Image Processing, vol. 9, no. 5, pp. 773777, May 2000.
[4] J.C. Gover and G.J.S. Ross, “Minimum Spanning Trees and Single Linkage Cluster Analysis,” Applied Statistics, vol. 18, pp. 5464, 1969.
[5] S. Bandyopadhyay, “An Automatic Shape Independent Clustering Technique,” Pattern Recognition, vol. 37, no. 1, pp. 3345, Jan. 2004.
[6] P.H.A. Sneath, “The Application of Computers to Taxonomy,” J. General Microbiology, vol. 17, no. 1, pp. 210226, Aug. 1957.
[7] G. Karypis, E. Han, and V. Kumar, “CHAMELEON: A Hierarchical Clustering Algorithm Using Dynamic Modeling,” Computer, vol. 32, no. 8, pp. 6675, Aug. 1999.
[8] D. Harel and Y. Koren, “Clustering Spatial Data Using Random Walks,” Proc. Seventh ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining (KDD '01), pp. 281286, Aug. 2001.
[9] J.H. Friedman, J.L. Bentley, and R.A. Finkel, “An Algorithm for Finding Best Matches in Logarithmic Expected Time,” ACM Trans. Math. Software, vol. 3, no. 3, pp. 209226, Sept. 1977.
[10] O. Virmajoki and P. Fränti, “DivideandConquer Algorithm for Creating Neighborhood Graph for Clustering,” Proc. Int'l Conf. Pattern Recognition (ICPR '04), vol. 1, pp. 264267, Aug. 2004.
[11] S.W. Ra and J.K. Kim, “A Fast MeanDistanceOrdered Partial Codebook Search Algorithm for Image Vector Quantization,” IEEE Trans. Circuits and Systems, vol. 40, no. 9, pp. 576579, Sept. 1993.
[12] W.H. Equitz, “A New Vector Quantization Clustering Algorithm,” IEEE Trans. Acoustics, Speech, and Signal Processing, vol. 37, no. 10, pp. 15681575, Oct. 1989.
[13] T. Kurita, “An Efficient Agglomerative Clustering Algorithm Using a Heap,” Pattern Recognition, vol. 24, no. 3, pp. 205209, Mar. 1991.
[14] T. Kaukoranta, P. Fränti, and O. Nevalainen, “Vector Quantization by Lazy Pairwise Nearest Neighbor Method,” Optical Eng., vol. 38, no. 11, pp. 18621868, Nov. 1999.
[15] O. Virmajoki, P. Fränti, and T. Kaukoranta, “Practical Methods for SpeedingUp the Pairwise Nearest Neighbor Method,” Optical Eng., vol. 40, no. 11, pp. 24952504, Nov. 2001.
[16] O. Virmajoki and P. Fränti, “Fast Pairwise Nearest Neighbor Based Algorithm for Multilevel Thresholding,” J. Electronic Imaging, vol. 12, no. 4, pp. 648659, Oct. 2003.
[17] T.H. Cormen, C.E. Leiserson, and R.L. Rivest, Introduction to Algorithms. Cambridge, Mass.: MIT Press, 1998.
[18] G.L. Miller, SH. Teng, W. Thurston, and S.A. Vavaris, “Separators for SpherePackings and Nearest Neighbor Graphs,” J. ACM, vol. 44. no. 1, pp.129, Jan. 1997.
[19] J.H. Conway and N.J.A. Sloane, Sphere Packings, Lattices and Groups. New York: SpringerVerlag, 1998.
[20] R. Sproull, “Refinements to NearestNeighbor Searching in kd Trees,” Algorithmica, vol. 6, pp. 579589, 1991.
[21] P. Fränti, O. Virmajoki, and V. Hautamäki, “Fast PNNBased Clustering Using k Nearest Neighbor Graph,” Proc. IEEE Int'l Conf. Data Mining (ICDM '03), pp. 525528, Nov. 2003.
[22] Encyclopedia of Statistical Sciences, vol. 6, S. Kotz, N.L. Johnson, and C.B.Read, eds. New York: John Wiley Sons, 1985.
[23] T. Zhang, R. Ramakrishnan, and M. Livny, “BIRCH: A New Data Clustering Algorithm and Its Applications,” Data Mining and Knowledge Discovery, vol. 1, no. 2, pp. 141182, June 1997.
[24] Y. Linde, A. Buzo, and R.M. Gray, “An Algorithm for Vector Quantizer Design,” IEEE Trans. Comm., vol. 28, no. 1, pp. 8495, Jan. 1980.
[25] T. Kaukoranta, P. Fränti, and O. Nevalainen, “A Fast Exact GLA Based on Code Vector Activity Detection,” IEEE Trans. Image Processing, vol. 9, no. 8, pp. 13371342, Aug. 2000.