Constrained Clustering Via Concavity Cuts

DOI10.1007/978-3-540-72397-4_23MaRDI QIDQ3612427zbMATH OpenOpenAlexFDO

Authors Yu Xia

Publication date 10 March 2009

Published in Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-72397-4_23

zbMATH Keywords

concave cutting plane methodglobal optimizationinstance-level constraintspartitional clusteringsemi-supervised clustering

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• An exact algorithm for semi-supervised minimum sum-of-squares clustering
• DILS: constrained clustering through dual iterative local search
• Some Pairwise Constrained Semi-Supervised Fuzzy c-Means Clustering Algorithms
• Fast semi-supervised evidential clustering
• Constrained Clustering Using Column Generation

Cited in

(6)

• Probability-one homotopy methods for constrained clustering
• A framework for semi-supervised and unsupervised optimal extraction of clusters from hierarchies
• DILS: constrained clustering through dual iterative local search
• An exact algorithm for semi-supervised minimum sum-of-squares clustering
• A fast algorithm for robust constrained clustering
• A Global Constraint for the Exact Cover Problem: Application to Conceptual Clustering

This page was built for publication: Constrained Clustering Via Concavity Cuts

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3612427)