Abstract
As an important task in machine learning and computer vision, the clustering analysis has been well studied and solved using different approaches such as k-means, Spectral Clustering, Support Vector Machine, and Maximum Margin Clustering. Some of these approaches are specific solutions to the Graph Clustering problem which needs a similarity measure between samples to create the graph. We propose a novel similarity matrix based on human being perception which introduces information of the dataset density and geodesic connections, with the interesting property of parameter independence. We have tested the novel approach in some synthetic as well as real world datasets giving a better average performance in relation to the current state of the art.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Jain, A.K.: Data clustering: 50 years beyond k-means. Pattern Recogn. Lett. 31(8), 651–666 (2010)
Schaeffer, S.E.: Graph clustering. Comput. Sci. Rev. 1(1), 27–64 (2007)
Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 22(8), 888–905 (2000)
Ng, A.Y., Jordan, M.I., Weiss, Y.: On spectral clustering: analysis and an algorithm. Advances in Neural Information Processing Systems (NIPS), pp. 849–856. MIT Press, Cambridge (2001)
Nie, F., Wang, H., Huang, H., Ding, C.: Unsupervised and semi-supervised learning via l1-norm graph. In: IEEE Intenational Conference on Computer Vision (ICCV), pp. 2268–2273 (2011)
Kim, T.H., Lee, K.M., Lee, S.U.: Learning full pairwise affinities for spectral segmentation. In: IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp. 2101–2108. IEEE (2010)
Ulrike Von Luxburg. A tutorial on spectral clustering (2007)
Fischer, B., Buhmann, J.M.: Path-based clustering for grouping of smooth curves and texture segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 25(4), 513–518 (2003)
Chang, H., Yeung, D.-Y.: Robust path-based spectral clustering. Pattern Recogn. 41(1), 191–203 (2008)
Zelnik-Manor, L., Perona, P.: Self-tuning spectral clustering. Advances in Neural Information Processing Systems (NIPS), pp. 1601–1608. MIT Press, Cambridge (2004)
Zhang, X., Li, J., Hong, Y.: Local density adaptive similarity measurement for spectral clustering. Pattern Recogn. Lett. 32(2), 352–358 (2011)
Strehl, A., Ghosh, J.: Cluster ensembles – a knowledge reuse framework for combining multiple partitions. J. Mach. Learn. Res. 3, 583–617 (2003)
Fischer, I., Poland, J.: Data sets used. In: Amplifying the Block Matrix Structure for Spectral Clustering (2005). http://www.dr-fischer.org/pub/blockamp/index.html
Frank, A., Asuncion, A.: UCI machine learning repository (2010). http://archive.ics.uci.edu/ml
Keysers, D.: U.S.P.S. dataset (1989). http://www-i6.informatik.rwth-aachen.de/keysers/usps.html
Nayar, S.K., Nene, S.A., Murase, H.: Columbia object image library (coil-20) (1996). http://www.cs.columbia.edu/CAVE/software/softlib/coil-20.php
Acknowledgments
This work was partially supported by Spanish Grant TIN2013-45312-R (MINECO) and FEDER. Mario Rodriguez was sponsored by Spanish FPI Grant BES-2011-043752 and EEBB-I-14-08410.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Rodriguez, M., Medrano, C., Herrero, E., Orrite, C. (2015). Spectral Clustering Using Friendship Path Similarity. In: Paredes, R., Cardoso, J., Pardo, X. (eds) Pattern Recognition and Image Analysis. IbPRIA 2015. Lecture Notes in Computer Science(), vol 9117. Springer, Cham. https://doi.org/10.1007/978-3-319-19390-8_36
Download citation
DOI: https://doi.org/10.1007/978-3-319-19390-8_36
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-19389-2
Online ISBN: 978-3-319-19390-8
eBook Packages: Computer ScienceComputer Science (R0)