Abstract
In this paper, we propose a novel spectral clustering algorithm called: Locality Spectral Clustering (Lsc) which assumes that each data point can be linearly reconstructed from its local neighborhoods. The Lsc algorithm firstly try to learn a smooth enough manifold structure on the data manifold and then computes the eigenvectors on the smooth manifold structure, then as former spectral clustering methods, we use the eigenvectors to help the k-means algorithm to do clustering. Experiments have been performed on toy data sets and real world data sets and have shown that our algorithm can effectively discover the cluster structure and holds much better clustering accuracy than former methods. It is also worth noting that our algorithm is also much more stable in parameter than former spectral clustering methods.
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
Preview
Unable to display preview. Download preview PDF.
References
von Luxburg, U.: A Tutorial on Spectral Clustering. In: Proc. British Machine Vision Conference. Statistics and Computing, vol. 17(4) (2007)
Scott, G.L., Longuet-Higgins, H.C.: Feature grouping by relocalisation of eigenvectors of the proximity matrix. In: Proc. British Machine Vision Conference (1990)
Shi, J., Malik, J.: Normalized Cuts and Image Segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence 22(8), 888–905 (2000)
Ng, A., Jordan, M., Weiss, Y.: On spectral clustering: Analysis and an algorithm. In: NIPS 2004 (2004)
Kannan, R., Vempala, S., Vetta, V.: On Spectral Clustering-Good, Bad and Spectral. In: FOCS (2000)
Zelnik-Manor, L., Perona, P.: Self-Tuning Spectral Clustering. In: NIPS (2004)
Wang, F., Zhang, C.: Label Propagation through Linear Neighborhoods. In: ICML (2006)
Zhu, X.: Semi-supervised learning literature survey. Technical Report 1530, Computer Sciences, University of Wisconsin-Madison (2005)
Zhou, D., Bousquet, O., Lal, T., Weston, J., Schlkopf, B.: Learning with local and global consistency. In: Advances in Neural Information Processing System, vol. 16 (2004)
Roweis, S., Saul, L.: Nonlinear dimensionality reduction by locally linear embedding. Science 290(5500), C2323–C2326 (2000)
Yu, H.-J.Z.H., Li, M., Feng, J.: Color texture moments for content-based image retrieval. In: International Conference on Image Processing (2002)
Cai, D., He, X., Han, J.: Document clustering using locality preserving indexing. IEEE Transactions on Knowledge and Data Engineering (2005)
He, X., Niyogi, P.: Locality preserving projections. In: Advances in Neural Information Processing Systems, vol. 16. MIT Press, Cambridge (2003)
Belkin, M., Niyogi, P., Sindhwani, V.: On Mani- fold Regularization. In: Proceedings of the 10th International Workshop on Artificial Intelligence and Statistics (2005)
Zhou, D., Bousquet, O., Lal, T., Weston, J., Schölkopf, B.: Learning with local and global consistency. In: Advances in Neural Information Processing System (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gong, YC., Chen, C. (2008). Locality Spectral Clustering. In: Wobcke, W., Zhang, M. (eds) AI 2008: Advances in Artificial Intelligence. AI 2008. Lecture Notes in Computer Science(), vol 5360. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89378-3_34
Download citation
DOI: https://doi.org/10.1007/978-3-540-89378-3_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-89377-6
Online ISBN: 978-3-540-89378-3
eBook Packages: Computer ScienceComputer Science (R0)