Sciweavers

PKDD
2015
Springer

Dealing with Overlapping Clustering: A Constraint-based Approach to Algorithm Selection

8 years 4 days ago
Dealing with Overlapping Clustering: A Constraint-based Approach to Algorithm Selection
When confronted to a clustering problem, one has to choose which algorithm to run. Building a system that automatically chooses an algorithm for a given task is the algorithm selection problem. Unlike the well-studied task of classification, clustering algorithm selection cannot rely on labels to choose which algorithm to use. However, in the context of constraint-based clustering, we argue that using constraints can help in the algorithm selection process. We introduce CBOvalue, a measure based on must-link and cannot-link constraints that quantifies the overlapping in a dataset. We demonstrate its usefulness by choosing between two clustering algorithm, EM and spectral clustering. This simple method shows an average performance increase, demonstrating the potential of using constraints in clustering algorithm selection.
Antoine Adam, Hendrik Blockeel
Added 16 Apr 2016
Updated 16 Apr 2016
Type Journal
Year 2015
Where PKDD
Authors Antoine Adam, Hendrik Blockeel
Comments (0)