Abstract
This paper proposes an approach for pairwise constraint propagation in graph-based semi-supervised clustering. In our approach, the entire dataset is represented as an edge-weighted graph by mapping each data instance as a vertex and connecting the instances by edges with their similarities. Based on the pairwise constraints, the graph is then modified by contraction in graph theory to reflect must-link constraints, and graph Laplacian in spectral graph theory to reflect cannot-link constraints. However, the latter was not effectively utilized in previous approaches. We propose to propagate pairwise constraints to other pairs of instances over the graph by defining a novel label matrix and utilizing it as a regularization term. The proposed approach is evaluated over several real world datasets, and compared with previous regularized spectral clustering and other methods. The results are encouraging and show that it is worthwhile to pursue the proposed approach.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Belkin, M., Niyogi, P.: Laplacian eigenmaps for dimensionality reduction and data representation. Neural Computation 15, 1373–1396 (2002)
Bie, T.D., Suykens, J., Moor, B.D.: Learning from General Label Constraints. In: Fred, A., Caelli, T.M., Duin, R.P.W., Campilho, A.C., de Ridder, D. (eds.) SSPR&SPR 2004. LNCS, vol. 3138, pp. 671–679. Springer, Heidelberg (2004)
Diestel, R.: Graph Theory. Springer, Heidelberg (2006)
Goldberg, A.B., Zhu, X., Wright, S.: Dissimilarity in graph-based semi-supervised classification. In: Proc. of AISTAT 2007, pp. 155–162 (2007)
Li, Z., Liu, J., Tang, X.: Pairwise constraint propagation by semidefinite programming for semi-supervised classification. In: ICML 2008, pp. 576–583 (2008)
Tang, W., Xiong, H., Zhong, S., Wu, J.: Enhancing semi-supervised clustering: A feature projection perspective. In: Proc. of KDD 2007, pp. 707–716 (2007)
von Luxburg, U.: A tutorial on spectral clustering. Statistics and Computing 17(4), 395–416 (2007)
Wagstaff, K., Cardie, C., Rogers, S., Schroedl, S.: Constrained k-means clustering with background knowledge. In: ICML 2001, pp. 577–584 (2001)
Yoshida, T., Okatani, K.: A Graph-Based Projection Approach for Semi-supervised Clustering. In: Kang, B.-H., Richards, D. (eds.) PKAW 2010. LNCS(LNAI), vol. 6232, pp. 1–13. Springer, Heidelberg (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yoshida, T. (2011). Pairwise Constraint Propagation for Graph-Based Semi-supervised Clustering. In: Kryszkiewicz, M., Rybinski, H., Skowron, A., Raś, Z.W. (eds) Foundations of Intelligent Systems. ISMIS 2011. Lecture Notes in Computer Science(), vol 6804. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21916-0_39
Download citation
DOI: https://doi.org/10.1007/978-3-642-21916-0_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21915-3
Online ISBN: 978-3-642-21916-0
eBook Packages: Computer ScienceComputer Science (R0)