Abstract
In this paper, we propose to adapt the batch version of self-organizing map (SOM) to background information in clustering task. It deals with constrained clustering with SOM in a deterministic paradigm. In this context we adapt the appropriate topological clustering to pairwise instance level constraints with the study of their informativeness and coherence properties for measuring their utility for the semi-supervised learning process. These measures will provide guidance in selecting the most useful constraint sets for the proposed algorithm. Experiments will be given over several databases for validating our approach in comparison with another constrained clustering ones.
Chapter PDF
References
Basu, S., Davidson, I., Wagstaff, K.: Constrained clustering: Advances in algorithms, theory and applications. Chapman and Hall/CRC Data Mining and Knowledge Discovery Series (2008)
Frank, A., Asuncion, A.: Uci machine learning repository. Technical report, University of California (2010)
Bar-Hillel, A., Hertz, T., Shental, N., Weinshall, D.: Learning a mahalanobis metric from equivalence constraints. Journal of Machine Learning Research 6, 937–965 (2005)
Wagstaff, K., Cardie, C., Rogers, S., Schroedl, S.: Clustering with instance level constraints. In: Proc. of the 18th International Conference on Machine Learning, pp. 577–584 (2001)
Lu, Z., Leen, T.K.: Semi-supervised learning with penalized probabilistic clustering. In: Advances in Neural information Processing Systems 17 (2005)
Wagstaff, K., Cardie, C., Rogers, S., Schroedl, S.: Clustering with instance level constraints. In: Proc. of the 17th International Conference on Machine Learning, pp. 1103–1110 (2000)
Davidson, I., Ravi, S.S.: Agglomerative hierarchical clustering with constraints: theorical and empirical results. In: Proc. of ECML/PKDD, pp. 59–70 (2005)
Elghazel, H., Benabdeslem, K., Dussauchoy, A.: Constrained graph b-coloring based clustering approach. In: Song, I.-Y., Eder, J., Nguyen, T.M. (eds.) DaWaK 2007. LNCS, vol. 4654, pp. 262–271. Springer, Heidelberg (2007)
Davidson, I., Ravi, S.S.: The complexity of non-hierarchical clustering with instance and cluster level constraints. Data Mining and Knowledge Discovery 61, 14–25 (2007)
Davidson, I., Ravi, S.S.: Clustering with constraints: feasibility issues and the k-means algorithm. In: Proc. of the SIAM International Conference on Data Mining, pp. 138–149 (2005)
Kulis, B., Basu, S., Dhillon, I., Mooney, R.: Semi-supervised graph clustering, a kernel approach. In: Proc. of the 22th International Conference on Machine Learning, pp. 577–584 (2005)
Davidson, I., Ester, M., Ravi, S.S.: Efficient incremental clustering with constraints. In: Proc. of 13th ACM Knowledge Discovery and Data Mining (2007)
Davidson, I., Wagstaff, K., Basu, S.: Measuring constraint-set utility for partitional clustering algorithms. In: Proc. of ECML/PKDD (2006)
Bilenko, M., Basu, S., Mooney, R.J.: Integrating constraints and metric learning in semi-supervised clustering. In: Proc. of the 21th International Conference on Machine Learning, pp. 11–18 (2004)
Kohonen, T.: Self organizing Map. Springer, Berlin (2001)
Herrmann, L., Ultsch, A.: Label propagation for semi-supervised learning in self-organizing maps. In: Proc. of the 6th WSOM (2007)
Belkin, M., Niyogi, P.: Using manifold structure for partially labelled classification. In: Proc. of Advances in Neural Information Processing Systems (2003)
Blum, A., Mitchell, T.: Combining labeled and unlabeled data with co-training. In: Proc. of COLT: Proc. of the Workshop on Computational Learning Theory, pp. 92–100 (1998)
Chapelle, O., Scholkopf, B., Zien, A.: Semi-supervised learning. The MIT Press, Cambridge (2006)
Cheng, Y.: Convergence and ordering of kohonen’s batch map. Neural Computation 9(8), 1667–1676 (1997)
Heskes, T., Kappen, B.: Error potentials for self-organization. In: Proc. of IEEE International Conference on Neural Networks, pp. 1219–1223 (1993)
Xing, E.P., Ng, A.Y., Jordan, M.I., Russel, S.: Distance metric learning, with application to clustering with side-information. Advances in Neural Information Processing Systems 15, 505–512 (2003)
Klein, D., Kamvar, S.D., Manning, C.D.: From instance-level constraints to space-level constraints: Making the most of prior knowledge in data clustering. In: Proc. of the 19th International Conference on Machine Learning, pp. 307–313 (2002)
Golub, T.R., Slonim, D.K., Tamayo, P., Huard, C., Gaasenbeek, M., Mesirov, J.P., Coller, H., Loh, M., Downing, L.R., Caligiuri, M.A., Bloomfield, C.D., Lander, E.S.: Molecular classification of cancer: Class discovery and class prediction by gene expression monitoring. Science 15 286(5439), 531–537 (1999)
Ultsch, A.: Fundamental clustering problems suite (fcps). Technical report, University of Marburg (2005)
Vesanto, J., Alhoniemi, E.: Clustering of the self organizing map. IEEE Transactions on Neural Networks 11(3), 586–600 (2000)
Kalyani, M., Sushmita, M.: Clustering and its validation in a symbolic framework. Pattern Recognition Letters 24(14), 2367–2376 (2003)
Rand, W.M.: Objective criteria for the evaluation of clustering method. Journal of the American Statistical Association 66, 846–850 (1971)
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
Allab, K., Benabdeslem, K. (2011). Constraint Selection for Semi-supervised Topological Clustering. In: Gunopulos, D., Hofmann, T., Malerba, D., Vazirgiannis, M. (eds) Machine Learning and Knowledge Discovery in Databases. ECML PKDD 2011. Lecture Notes in Computer Science(), vol 6911. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23780-5_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-23780-5_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23779-9
Online ISBN: 978-3-642-23780-5
eBook Packages: Computer ScienceComputer Science (R0)