A Declarative Framework for Constrained Clustering - Archive ouverte HAL Access content directly
Conference Papers Year : 2013

A Declarative Framework for Constrained Clustering

Abstract

In recent years, clustering has been extended to constrained clustering, so as to integrate knowledge on objects or on clusters, but adding such constraints generally requires to develop new algorithms. We propose a declarative and generic framework, based on Constraint Programming, which enables to design clustering tasks by specifying an optimization criterion and some constraints either on the clusters or on pairs of objects. In our framework, several classical optimization criteria are considered and they can be coupled with different kinds of constraints. Relying on Constraint Programming has two main advantages: the declarativity, which enables to easily add new constraints and the ability to find an optimal solution satisfying all the constraints (when there exists one). On the other hand, computation time depends on the constraints and on their ability to reduce the domain of variables, thus avoiding an exhaustive search.
No file

Dates and versions

hal-00840374 , version 1 (02-07-2013)

Identifiers

  • HAL Id : hal-00840374 , version 1

Cite

Thi-Bich-Hanh Dao, Khanh-Chuong Duong, Christel Vrain. A Declarative Framework for Constrained Clustering. European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases ECML/PKDD, Sep 2013, Prague, Czech Republic. ⟨hal-00840374⟩
85 View
0 Download

Share

Gmail Mastodon Facebook X LinkedIn More