A mixed-integer programming approach to the clustering problem with an application in customer segmentation

DOI10.1016/j.ejor.2005.04.048zbMath1131.90434OpenAlexW2172073367MaRDI QIDQ2497271

Burcu Sağlam, Serpil Sayın, F. Sibel Salman, Metin Turkay

Publication date: 4 August 2006

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2005.04.048

zbMATH Keywords

clusteringdata miningsegmentationmixed-integer programming

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Mixed integer programming (90C11)

Related Items

Impact of minimum-cut density-balanced partitioning solutions in distributed webpage ranking ⋮ Size-constrained graph partitioning polytopes ⋮ Synergies between operations research and data mining: the emerging use of multi-objective approaches ⋮ Segmentation of scanning-transmission electron microscopy images using the ordered median problem ⋮ An integrated solution approach for multi-objective, multi-skill workforce scheduling and routing problems ⋮ On mathematical optimization for clustering categories in contingency tables ⋮ A mathematical programming based procedure for breast cancer classification ⋮ Identifying Fixations in Gaze Data via Inner Density and Optimization ⋮ A novel mixed integer linear programming model for clustering relational networks ⋮ A mixed integer linear program to compress transition probability matrices in Markov chain bootstrapping ⋮ Synergies of operations research and data mining ⋮ Optimization problems for machine learning: a survey ⋮ The traveling salesman puts-on a hard hat -- tower crane scheduling in construction projects ⋮ Between steps: intermediate relaxations between big-M and convex hull formulations

Uses Software

• Matlab
• DICOPT

Cites Work

• Unnamed Item
• On Grouping for Maximum Homogeneity
• K-Means-Type Algorithms: A Generalized Convergence Theorem and Characterization of Local Optimality
• A Branch and Bound Clustering Algorithm
• A near-optimal initial seed value selection in K-means means algorithm using a genetic algorithm
• Mathematical Programming for Data Mining: Formulations and Challenges
• Integer Programming and the Theory of Grouping
• Evaluation of a Branch and Bound Algorithm for Clustering
• Cluster Analysis and Mathematical Programming