A Lagrangian-based score for assessing the quality of pairwise constraints in semi-supervised clustering

DOI10.1007/s10618-021-00794-0zbMath1491.62053OpenAlexW3199460270WikidataQ115161247 ScholiaQ115161247MaRDI QIDQ2066643

Rodrigo Randel, Alain Hertz, Daniel Aloise, Simon J. Blanchard

Publication date: 14 January 2022

Published in: Data Mining and Knowledge Discovery (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10618-021-00794-0

zbMATH Keywords

clusteringLagrangian dualityconstraint selectionpairwise constraintssemi-supervised

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Uses Software

• UCI-ml
• clusfind

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A model for clustering data from heterogeneous dissimilarities
• An improved column generation algorithm for minimum sum-of-squares clustering
• The heterogeneous \(p\)-median problem for categorization based clustering
• Computational study of large-scale \(p\)-median problems
• NP-hardness of Euclidean sum-of-squares clustering
• Cluster analysis and mathematical programming
• Convex fuzzy \(k\)-medoids clustering
• A framework for semi-supervised and unsupervised optimal extraction of clusters from hierarchies
• A fast swap-based local search procedure for location problems
• Solving Large p-Median Problems with a Radius Formulation
• Introduction to Semi-Supervised Learning
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• Bicriterion Cluster Analysis
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Finding Groups in Data
• Validation of subgradient optimization
• Data Mining