A global optimization RLT-based approach for solving the hard clustering problem

Journal of Global Optimization

Volumn 32, Issue 2, 2005, Pages 281-306

  Sherali, Hanif D ^a   Desai, Jitamitra ^a  

^a State University   (United States)

Author keywords

Clustering problem; Global optimization; Hard clustering; k Means algorithm; Reformulation Linearization Technique

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; DATA REDUCTION; HEURISTIC METHODS; LINEAR PROGRAMMING; LINEARIZATION; NONLINEAR PROGRAMMING; PROBLEM SOLVING;

CLUSTERING PROBLEM; HARD CLUSTERING; K-MEANS ALGORITHMS; REFORMULATION-LINEARIZATION TECHNIQUE;

GLOBAL OPTIMIZATION;

EID: 25444530947     PISSN: 09255001     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10898-004-2706-7     Document Type: Article

References (35)

1. Al-Sultan, K.S. and Khan, M.M. (1996), Computational experience on four algorithms for the hard clustering problem, Pattern Recognition Letters 17, 295-308.
2. Balas, E. (1988), On the convex hull of the union of certain polyhedra, Operations Research Letters 7(6), 279-283.
3. Bhuyan, J.N., Raghavan, V.V. and Elayavalli, V.K. (1991), Genetic algorithm for clustering with an ordered representation, Proceedings of the Fourth International Conference on Genetic Algorithms, San Diego, CA.
4. Chazelle, B. (1991), An optimal convex hull algorithm and new results on cuttings, Annual Symposium on Foundations of Computer Science, 29-38.
5. Dubes, R.C. (1987), How many clusters are best? - an experiment, Pattern Recognition 20, 645-663.
6. Forgy, E.W. (1966), Cluster analysis of multivariate data: efficiency versus interpretability of classification, Biometric Society Meetings, Riverside, CA, Abstract in Biometrics 21, 768.
7. Groetschel, M. and Wakabayashi, Y. (1989), Cutting plane algorithm for a clustering problem, Mathematical Programming Series B 45(1), 59-96.
8. Hartigan, J.A. (1975), Clustering Algorithms, John Wiley and Sons, New York, N.Y.
9. Jensen, R.E. (1969), A dynamic programming algorithm for cluster analysis, Operations Research 17, 1034-1057.
10. Jung, Y., Park, H., Du, Z. and Drake, B.L. (2003), A decision criterion for the optimal number of clusters in hierarchical clustering, Journal of Global Optimization 25, 91-111.
11. Klaapper, A. (1987), Lower bound on the complexity of the convex hull problem for simply polyhedra, Information Processing Letters 25(3), 159-161.
12. Klein, R.W. and Dubes, R.C. (1989), Experiments in projection and clustering by simulated annealing, Pattern Recognition 22, 213-220.
13. Koontz, W.L., Narendra, P.M. and Fukunaga, K. (1975), A branch-and- bound clustering algorithm, IEEE Transactions on Computing 23, 908-914.
14. Krovi, R. (1992), Genetic algorithm for clustering: a preliminary investigation, Proceedings of the 25th Hawaii International Conference on Systems Sciences, pp. 540-544.
15. Leung, Y., Zhang, J. and Xu, Z. (1997), Neural networks for convex hull computation, IEEE Transactions on Neural Networks 8(3), 601-611.
16. Lukashin, A.V. and Fuchs, R. (2000), Analysis of temporal gene expression profiles: clustering by simulated annealing and determining the optimal number of clusters, Bioinformatics 17(5), 405-414.
17. Manber, U. (1989), Introduction to Algorithms: A Creative Approach, Addison-Wesley Publishing Company, Reading, MA.
18. Mangiameli, P., Chen, K.S. and West, D. (1996), A comparison of SOM neural network and hierarchical clustering methods, European Journal of Operations Research 93, 402-417.
19. McQueen, J.B. (1967), Some methods of classification and analysis of multivariate observations, Proceedings of the 5th Berkeley Symposium on Mathematical Statistics and Probability, University of California Press, Berkeley, CA, pp. 281-197.
20. Mulvey, J.M. and Crowder, H.P. (1979), Cluster analysis: An application of lagrangian relaxation, Management Science 25(4), 329-340.
21. Rao, M.R. (1971), Cluster analysis and mathematical programming. Journal of American Statistical Association 66, 622-626.
22. Sahinidis, N.V. (1996), BARON: A general purpose global optimization software package, Journal of Global Optimization 8, 201-205.
23. Sahinidis, N.V. (1999-2000), BARON: Branch-and-Reduce Optimization Navigator, User's Manual, Version 4.0, Available for download at http://archimides.scs.uiuc.edu/baron.html.
24. Selim, S.Z. (1982), A global algorithm for the clustering problem, Presentation at the ORSA/TIMS Joint Meeting, San Diego, CA.
25. Selim, S.Z. and Al-Sultan, K.S. (1991), A simulated annealing algorithm for the hard clustering problem, Pattern Recognition 24, 1003-1008.
26. Sherali, H.D. and Adams, W.P. (1990), A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems, SIAM Journal on Discrete Mathematics 3(3), 411-430.
27. Sherali, H.D. and Adams, W.P. (1994), A hierarchy of relaxations and convex hull characterizations for mixed-integer zero-one programming problems, Discrete Applied Mathematics 52, 83-106.
28. Sherali, H.D. and Adams, W.P. (1999), Reformulation-linearization techniques for discrete optimization problems, In: Du, D.Z. and Pardalos, P.M. (eds.), Handbook of Combinatorial Optimization 1, Kluwer Academic Publishers, pp. 479-532.
29. Sherali, H.D. and Smith, J.C. (2001), Improving discrete model representations via symmetry considerations, Management Science 41(10), 1396-1407.
30. Sherali, H.D. and Tuncbilek, C. (1992), A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique, Journal of Global Optimization 2, 101-112.
31. Sherali, H.D. and Tuncbilek, C. (1995), A reformulation-convexification approach for solving nonconvex quadratic programming problems, Journal of Global Optimization 7, 1-31.
32. Späth, H. (1980), Cluster Analysis Algorithms for Data Reduction and Classification of Objects, John Wiley and Sons, New York, NY.
33. Sultan, M., Wigle, D.A., Cumbaa, C.A., Maziarz, M., Glasgow, J., Tsao, M.S. and Jurisica, I. (2002), Binary tree-structured vector quantization approach to clustering and visualizing microarray data, Bioinformatics 18(1), 111-119.
34. Vinod, H.D. (1969), Integer programming and the theory of grouping, Journal of American Statistical Society 64, 506-519.
35. Ward, J.H. Jr. (1963), Hierarchical grouping to optimize an objective function, Journal of American Statistical Society 58, 236-244.