A cutting algorithm for the minimum sum-of-squared error clustering

Proceedings of the 2005 SIAM International Conference on Data Mining, SDM 2005

Volumn , Issue , 2005, Pages 150-160

  Peng, Jiming ^a   Xia, Yu ^b  

^a MCMASTER UNIVERSITY   (Canada)

^b INSTITUTE OF STATISTICAL MATHEMATICS   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ERRORS; GLOBAL OPTIMIZATION; INTEGER PROGRAMMING; THREE TERM CONTROL SYSTEMS;

CLUSTERING PROBLEMS; CONTINUOUS OPTIMIZATION PROBLEMS; CUTTING ALGORITHM; FRACTIONAL SOLUTIONS; GLOBAL OPTIMUM; INTEGER SOLUTIONS; LOCAL MINIMUMS; SUM OF SQUARED ERRORS;

DATA MINING;

EID: 52149095798     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972757.14     Document Type: Conference Paper

References (21)

1. Werner Dinkelbach. On nonlinear fractional programming. Management Sci., 13:492-498, 1967.
2. O. Du Merle, P. Hansen, B. Jaumard, and N. Mladen-ović. An interior point algorithm for minimum sum-of-squares clustering. SIAM J. Sci. Comput., 21(4):1485-1505 (electronic), 1999/00.
3. James E. Falk and Karla R. Hoffman. Successive underestimation method for concave minimization problem. Math. Oper. Res., 1(3):251-259, Aug. 1976.
4. R. A. Fisher. The use of multiple measurements in taxonomic problems. Annual of Eugenics, 7:179-188, 1936.
5. E. Forgy. Cluster analysis of multivariate date: Efficiency vs. interpretability of classifications. Biometrics, 21:768, 1965.
6. A. D. Gordon and J. T. Henderson. An algorithm for euclidean sum of squares classification. Biometrics, 33(2):355-362, Jun. 1977.
7. Pierre Hansen and Brigitte Jaumard. Cluster analysis and mathematical programming. Math. Programming, 79(1-3, Ser. B):191-215, 1997.
8. D. Harrison and D. L. Rubinfeld. Hedonic prices and the demand for clean air. J. Environ. Economics & Management, 5:81-102, 1978.
9. Reiner Horst. An algorithm for nonconvex programming problems. Math. Programming, 10(3):312-321, 1976.
10. Reiner Horst and Hoang Tuy. Global optimization. Springer-Verlag, Berlin, 1993.
11. Stephen E. Jacobsen. Convergence of a Tuy-type algorithm for concave minimization subject to linear inequality constraints. Appl. Math. Optim., 7(1):1-9, 1981.
12. A. K. Jain, M. N. Murty, and P. J. Flynn. Data clustering: a review. ACM Comput. Surv., 31(3):264-323, 1999.
13. R. C. Jancey. Multidimensional group analysis. Australian J. Botany, 14:127-130, 1966.
14. O. L. Mangasarian. Mathematical programming in data mining. Data Min. Knowl. Discov., 1(2):183-201, 1997.
15. J. McQueen. Some methods for classification and analysis of multivariate observations. Computer and Chemistry, 4:257-272, 1967.
16. P. M. Murphy and D. W. Aha. UCI repository of machine learning databases. Technical report, University of California, Department of Information and Computer Science, Irvine, CA, 1994. http://www.ics.uci.edu/~mlearn/MLRepository. html.
17. P. M. Pardalos and J. B. Rosen. Methods for global concave minimization: a bibliographic survey. SIAM Rev., 28(3):367-379, 1986.
18. E. H. Ruspini. Numerical methods for fuzzy clustering. Inform. Sci., 2(3):319-350, 1970.
19. Shokri Z Selim and M. A. Ismail. K-means-type algorithms: A generalized convergence theorem and characterization of local optimality. IEEE Transactions on Pattern Analysis and Machine Intelligence, PAMI-6(1):81-87, Jan. 1984.
20. H. Tuy. Concave programming under linear constraints. Soviet Mathematics, 5:1437-1440, 1964.
21. Hoang Tuy, A. M. Bagirov, and A. M. Rubinov. Clustering via d.c. optimization. In Advances in convex analysis and global optimization (Pythagorion, 2000), volume 54 of Nonconvex Optim. Appl., pages 221-234. Kluwer Acad. Publ., Dordrecht, 2001.