Abstract
In this study we propose a systematic methodology for constructing a sparse affinity matrix to be used in an advantageous spectral clustering approach. Newton’s equations of motion are employed to concentrate the data points around their cluster centers, using an appropriate potential. During this process possibly overlapping clusters are separated, and simultaneously, useful similarity information is gained leading to the enrichment of the affinity matrix. The method was further developed to treat high-dimensional data with application to document clustering. We have tested the method on several benchmark data sets and we witness a superior performance in comparison with the standard 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
Ng, A., Jordan, M.I., Weiss, Y.: On spectral clustering: Analysis and an algorithm. In: Advances in Neural Information Processing Systems, vol. 14, pp. 849–864 (2001)
Luxburg, U.: A tutorial on spectral clustering. Statistics and Computing 17, 395–416 (2007)
Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Trans. Pattern Recognition and Machine Intelligence 22, 888–905 (2000)
Park, J., Zha, H., Kasturi, R.: Spectral clustering for robust motion segmentation. In: Pajdla, T., Matas, J(G.) (eds.) ECCV 2004. LNCS, vol. 3024, pp. 390–401. Springer, Heidelberg (2004)
Chang, H., Yeung, D.: Robust path-based spectral clustering with application to image segmentation. In: Proc. Intern. Conf. on Computer Vision, pp. 278–285 (2005)
Bach, F., Jordan, M.I.: Learning spectral clustering, with application to speech seperation. Journal of Machine Learning Research 7, 1962–2001 (2006)
Pentney, W., Meila, M.: Spectral clustering fof Biological sequence data. In: Proc. of the 25th Annual Conference of AAAI, pp. 845–850 (2005)
Higham, D.J., Kalna, G., Kibble, M.: Spectral clustering, and its use in bioinformatics. Journal of Computational and Applied Mathematics 204, 25–37 (2007)
Dhillon, I.S.: Co-clustering documents and words using bipartite spectral graph partitioning. In: Proc. seventh ACM SIGKDD Intern. Conf. on Knowledge Discovery and Data mining (KDD), pp. 269–274 (2001)
Chen, W., Song, Y., Bai, H., Lin, C., Chang, E.Y.: Parallel spectral clustering. In: Daelemans, W., Goethals, B., Morik, K. (eds.) ECML PKDD 2008, Part II. LNCS (LNAI), vol. 5212, pp. 374–389. Springer, Heidelberg (2008)
Blekas, K., Lagaris, I.E.: Newtonian clustering: an approach based on molecular dynamics and global optimization. Pattern Recognition 40, 1734–1744 (2007)
Ripley, B.D.: Pattern Recognition and Neural Networks. Cambridge Univ. Press Inc., Cambridge (1996)
Merz, C.J., Murphy, P.M.: UCI repository of machine learning databases. Irvine, CA (1998), http://www.ics.uci.edu/~mlearn/MLRepository.html
Fowlkes, C.S., Belongie, F., Chung, F., Malik, J.: Spectral grouping using the Nyström method. IEEE Trans. on Pattern Analysis and Machine Intelligence 26, 214–225 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Blekas, K., Christodoulidou, K., Lagaris, I.E. (2009). Newtonian Spectral Clustering. In: Alippi, C., Polycarpou, M., Panayiotou, C., Ellinas, G. (eds) Artificial Neural Networks – ICANN 2009. ICANN 2009. Lecture Notes in Computer Science, vol 5769. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04277-5_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-04277-5_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04276-8
Online ISBN: 978-3-642-04277-5
eBook Packages: Computer ScienceComputer Science (R0)