Skip to main content
SpringerLink
Log in
Book cover

Intelligent Information Systems Symposium

IIS 2013: Language Processing and Intelligent Information Systems pp 220–233Cite as

Finding the Number of Clusters on the Basis of Eigenvectors

  • Conference paper

  • 1056 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 7912))

Abstract

Finding the number of clusters is a challenging task. We suggest a new method for an assessment of a group number. Our solution uses only simple properties of signless Laplacian eigenvectors. The novel method has been incorporated to our previous spectral algorithm. The performance of the modified version is competitive to existing solutions. We empirically evaluate the proposed approach using standard test sets and show that it is able to find correct partitioning even for weakly separated groups of varying densities.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   49.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adamic, L., Glance, N.: The political blogosphere and the 2004 U.S. election. In: WWW Workshop on the Weblogging Ecosystem, pp. 36–43 (2005)

    Google Scholar 

  2. Alimoglu, F., Alpaydin, E.: Combining multiple representations and classifiers for handwrittendigit recognition. In: Proc. of ICDAR, pp. 637–640 (1997)

    Google Scholar 

  3. Andrews, N.O., Fox, E.A.: Recent Developments in Document Clustering. Technical Report TR-07-35, Computer Science, Virginia Tech (2007)

    Google Scholar 

  4. Berkhin, P.: Survey of Clustering Data Mining Techniques (2002), http://citeseer.nj.nec.com/berkhin02survey.html

  5. Cvetkovic, D.: Signless Laplacians and line graphs. Bull. Acad. Serbe Sci. Arts, Cl. Sci. Math. Natur., Sci. Math. 131(30), 85–92 (2005)

    MathSciNet  MATH  Google Scholar 

  6. Deepak, V., Meila, M.: Comparison of Spectral Clustering Methods. UW TR CSE-03-05-01 (2003)

    Google Scholar 

  7. Elon, Y.: Eigenvectors of the discrete Laplacian on regular graphs a statistical approach. J. Phys. A: Math. Theor. 41, 1–17 (2008)

    Google Scholar 

  8. Fischer, I., Poland, J.: Amplifying the Block Matrix Structure for Spectral Clustering. Technical Report No. IDSIA-03-05, Telecommunications Lab, pp. 21–28 (2005)

    Google Scholar 

  9. Kale, A., Karandikar, A., Kolari, P., Java, A., Finin, T., Joshi, A.: Modeling trust and influence in the blogosphere using link polarity. In: Proc. of ICWSM 2007 (2007)

    Google Scholar 

  10. Kaynak, C.: Methods of combining multiple classifiers and their applications to handwritten digit recognition. Master’s thesis, Institute of Graduate Studies in Science and Engineering, Bogazici University (1995)

    Google Scholar 

  11. Langville, A.N., Meyer, C.D.: Google’s PageRank and Beyond: The Science of Search Engine Rankings. Princeton University Press, Princeton (2006)

    MATH  Google Scholar 

  12. Lin, F., Cohen, W.W.: Power iteration clustering. In: Proc. of ICML–2010, pp. 655–662 (2010)

    Google Scholar 

  13. Lucińska, M., Wierzchoń, S.T.: Spectral clustering based on k-nearest neighbor graph. In: Cortesi, A., Chaki, N., Saeed, K., Wierzchoń, S. (eds.) CISIM 2012. LNCS, vol. 7564, pp. 254–265. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  14. Manning, C.D., Raghavan, P., Schütze, H.: Introduction to Information Retrieval. Cambridge University Press (2008)

    Google Scholar 

  15. Meila, M., Shi, J.: A random walks view of spectral segmentation. In: Proc. of 10th International Workshop on Artificial Intelligence and Statistics (AISTATS), pp. 8–11 (2001)

    Google Scholar 

  16. Meila, M., Verma, D.: A comparison of spectral clustering methods. Technical Report UW TR CSE-03-05-01 (2003)

    Google Scholar 

  17. Mitchell, T.: Machine Learning. McGraw Hill (1997)

    Google Scholar 

  18. Newman, M.E.J.: Detecting community structure in networks. European Physics. J. B 38, 321–330 (2004)

    Article  Google Scholar 

  19. Newman, M.E.J.: Finding community structure in networks using the eigenvectors of matrices. Physical Review E 74, 036104 (2006)

    Google Scholar 

  20. Ng, A., Jordan, M., Weiss, Y.: On spectral clustering: Analysis and an algorithm. In: Advances in Neural Information Processing Systems 14 (2001)

    Google Scholar 

  21. Shi, T., Belkin, M., Yu, B.: Data spectroscopy: eigenspace of convolution operators and clustering. The Annals of Statistics 37(6B), 3960–3984 (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Kielce University of Technology, Kielce, Poland

    Małgorzata Lucińska

  2. Institute of Computer Science, Polish Academy of Sciences, Warsaw, Poland

    Sławomir T. Wierzchoń

  3. University of Gdańsk, Gdańsk, Poland

    Sławomir T. Wierzchoń

Authors
  1. Małgorzata Lucińska
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sławomir T. Wierzchoń
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Computer Science, Polish Academy of Sciences, ul. Jana Kazimierza 5, 01-248, Warsaw, Poland

    Mieczysław A. Kłopotek , Jacek Koronacki , Małgorzata Marciniak  & Agnieszka Mykowiecka , ,  & 

  2. Institute of Computer Science, Polish Academy of Sciences, ul. Brzegi 55, 80-045, Gdańsk, Poland

    Sławomir T. Wierzchoń

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lucińska, M., Wierzchoń, S.T. (2013). Finding the Number of Clusters on the Basis of Eigenvectors. In: Kłopotek, M.A., Koronacki, J., Marciniak, M., Mykowiecka, A., Wierzchoń, S.T. (eds) Language Processing and Intelligent Information Systems. IIS 2013. Lecture Notes in Computer Science, vol 7912. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38634-3_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-38634-3_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-38633-6

  • Online ISBN: 978-3-642-38634-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation