Constrained spectral embedding for K-way data clustering - Archive ouverte HAL Access content directly
Journal Articles Pattern Recognition Letters Year : 2013

Constrained spectral embedding for K-way data clustering


Spectral clustering methods meet more and more success in machine learning community thanks to their ability to cluster data points of any complex shapes. The problem of clustering is addressed in terms of finding an embedding space in which the projected data are linearly separable by a classical clustering algorithm such as K-means algorithm. Often, spectral algorithm performances are significantly improved by incorporating prior knowledge in their design, and several techniques have been developed for this purpose. In this paper, we describe and compare some recent linear and non-linear projection algorithms integrating instance-level constraints (“must-link” and “cannot-link”) and applied for data clustering. We outline a K-way spectral clustering algorithm able to integrate pairwise relationships between the data samples. We formulate the objective function as a combination of the original spectral clustering criterion and the penalization term based on the instance constraints. The optimization problem is solved as a standard eigensystem of a signed Laplacian matrix. The relevance of the proposed algorithm is highlighted using six UCI benchmarks and two public face databases.
Fichier principal
Vignette du fichier
2013.PRL.pdf (7.47 Mo) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-01536663 , version 1 (15-06-2017)



Guillaume Wacquet, Emilie Poisson Caillault, Denis Hamad, Pierre-Alexandre Hébert. Constrained spectral embedding for K-way data clustering. Pattern Recognition Letters, 2013, 34 (9), pp.1009-1017. ⟨10.1016/j.patrec.2013.02.003⟩. ⟨hal-01536663⟩
224 View
73 Download



Gmail Mastodon Facebook X LinkedIn More