Branch-and-bound technique for solving optimal clustering

Proceedings - International Conference on Pattern Recognition

Volumn 16, Issue 2, 2002, Pages 232-235

  Fränti, Pasi ^a   Virmajoki, Olli ^a   Kaukoranta, Timo ^b  

^a UNIVERSITY OF EASTERN FINLAND   (Finland)

^b UNIVERSITY OF TURKU   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

DATA REDUCTION; POLYNOMIALS; REDUNDANCY; TREES (MATHEMATICS); POLYNOMIAL APPROXIMATION;

BRANCH-AND-BOUND TECHNIQUE; OPTIMAL CLUSTERING; SEARCH TREES;

PROBLEM SOLVING; PATTERN RECOGNITION;

BRANCH AND BOUND TECHNIQUES; CLUSTERINGS; OPTIMAL CLUSTERING; POLYNOMIAL-TIME; SEARCH TREES; WELL-COVERED;

EID: 0043048597     PISSN: 10514651     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (8)

1. H. Späth, Cluster Analysis Algorithms for Data Reduction and Classification of Objects, Ellis Horwood Limited, West Sussex, UK, 1980.
2. R. Dubes and A. Jain, Algorithms that Cluster Data. Prentice-Hall, Englewood Cliffs, NJ, 1987.
3. L. Kaufman and P.J. Rousseeuw, Finding Croups in Data: An Introduction to Cluster Analysis. John Wiley Sons. New York, 1990.
4. M.R. Garey, D.S. Johnson, H.S. Witsenhausen, "The complexity of the generalized Lloyd-Max problem". IEEE Trans. on Inf. Theory, 28 (2), 255-256, March 1982.
5. J.H. Ward, "Hierarchical grouping to optimize an objective function". J. Amer. Statist.Assoc., 58, 236-244, 1963.
6. W.U. Equitz. "A new vector quantization clustering algorithm". IEEE Transactions on Acoustics, Speech, and Signal Processing 37 (10). 1568-1575, October 1989.
7. nd edition), pp. 257-267. Addison-Wesley, 1994.
8. T. Kaukoranta. P. Fränti and O. Nevalainen. "Vector quantization by lazy pairwise nearest neighbor method", Optical Engineering. 38 (11). 1862-1868. November 1999.