A Global Optimization RLT-based Approach for Solving the Hard Clustering Problem

Authors:
Hanif D. Sherali;Jitamitra Desai
Affiliations:
Grado Department of Industrial and Systems Engineering (0118), Virginia Polytechnic Institute and State University, Blacksburg, U.S.A. 24061;Grado Department of Industrial and Systems Engineering (0118), Virginia Polytechnic Institute and State University, Blacksburg, U.S.A. 24061
Venue:
Journal of Global Optimization
Year:
2005

Citing 13
Cited 11

A lower bound on the complexity of the convex hull problem for simple polyhedra

Information Processing Letters
How many clusters are best?—an experiment

Pattern Recognition
A cutting plane algorithm for a clustering problem

Mathematical Programming: Series A and B
A hierarchy of relaxation between the continuous and convex hull representations

SIAM Journal on Discrete Mathematics
A simulated annealing algorithm for the clustering problem

Pattern Recognition
An optimal convex hull algorithm and new results on cuttings (extended abstract)

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
A hierarchy of relaxations and convex hull characterizations for mixed-integer zero-one programming problems

Discrete Applied Mathematics
Computational experience on four algorithms for the hard clustering problem

Pattern Recognition Letters
Introduction to Algorithms: A Creative Approach

Introduction to Algorithms: A Creative Approach
Clustering Algorithms

Clustering Algorithms
A Decision Criterion for the Optimal Number of Clusters in Hierarchical Clustering

Journal of Global Optimization
Improving Discrete Model Representations via Symmetry Considerations

Management Science
Neural networks for convex hull computation

IEEE Transactions on Neural Networks

A Global Optimization RLT-based Approach for Solving the Fuzzy Clustering Problem

Journal of Global Optimization
A novel clustering approach and prediction of optimal number of clusters: global optimum search with enhanced positioning

Journal of Global Optimization
Topic Extraction with AGAPE

ADMA '07 Proceedings of the 3rd international conference on Advanced Data Mining and Applications
Clustering high dimensional data: A graph-based relaxed optimization approach

Information Sciences: an International Journal
A review of recent advances in global optimization

Journal of Global Optimization
Minimum sum-of-squares clustering by DC programming and DCA

ICIC'09 Proceedings of the Intelligent computing 5th international conference on Emerging intelligent computing technology and applications
Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering

Journal of Global Optimization
An efficient algorithm for maximal margin clustering

Journal of Global Optimization
Gaussian kernel minimum sum-of-squares clustering and solution method based on DCA

ACIIDS'12 Proceedings of the 4th Asian conference on Intelligent Information and Database Systems - Volume Part II
New and efficient DCA based algorithms for minimum sum-of-squares clustering

Pattern Recognition
Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming

Journal of Global Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

The field of cluster analysis is primarily concerned with the sorting of data points into different clusters so as to optimize a certain criterion. Rapid advances in technology have made it possible to address clustering problems via optimization theory. In this paper, we present a global optimization algorithm to solve the hard clustering problem, where each data point is to be assigned to exactly one cluster. The hard clustering problem is formulated as a nonlinear program, for which a tight linear programming relaxation is constructed via the Reformulation-Linearization Technique (RLT) in concert with additional valid inequalities that serve to defeat the inherent symmetry in the problem. This construct is embedded within a specialized branch-and-bound algorithm to solve the problem to global optimality. Pertinent implementation issues that can enhance the efficiency of the branch-and-bound algorithm are also discussed. Computational experience is reported using several standard data sets found in the literature as well as using synthetically generated larger problem instances. The results validate the robustness of the proposed algorithmic procedure and exhibit its dominance over the popular k-means clustering technique. Finally, a heuristic procedure to obtain a good quality solution at a relative ease of computational effort is also described.