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

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

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

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

clustering; data mining; segmentation; mixed-integer programming

Mathematics Subject Classification ID

62H30: Classification and discrimination; cluster analysis (statistical aspects)

90C11: Mixed integer programming

Related Items

Size-constrained graph partitioning polytopes, A mathematical programming based procedure for breast cancer classification, Synergies of operations research and data mining, Synergies between operations research and data mining: the emerging use of multi-objective approaches

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