A review on declarative approaches for constrained clustering

DOI10.1016/j.ijar.2024.109135MaRDI QIDQ6577669

Christel Vrain, Thi-Bich-Hanh Dao

Publication date: 24 July 2024

Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)

zbMATH Keywords

constrained clusteringBoolean satisfiability (SAT)conceptual clusteringinteger linear programming (ILP)constraint programming (CP)clustering: distance-based clustering

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Constrained clustering by constraint programming
• An improved column generation algorithm for minimum sum-of-squares clustering
• NP-hardness of Euclidean sum-of-squares clustering
• Cluster analysis and mathematical programming
• A repetitive branch-and-bound procedure for minimum within-cluster sums of squares partitioning
• Principles and practice of constraint programming. 21st international conference, CP 2015, Cork, Ireland, August 31 -- September 4, 2015. Proceedings
• A framework for deep constrained clustering
• Fairness through awareness
• Bicriterion Cluster Analysis
• An efficient algorithm for a complete link method
• An Interior Point Algorithm for Minimum Sum-of-Squares Clustering
• GRASP: a search algorithm for propositional satisfiability
• Least squares quantization in PCM
• Constrained Clustering Using Column Generation
• A machine program for theorem-proving
• The complexity of theorem-proving procedures

Related Items (1)

Synergies between machine learning and reasoning -- an introduction by the Kay R. Amel group

This page was built for publication: A review on declarative approaches for constrained clustering