Skip to main content

Data Clustering by Scaled Adjacency Matrix

  • Conference paper
  • 1474 Accesses

Part of the Lecture Notes in Computer Science book series (LNAI,volume 7091)

Abstract

Similarity based clustering, which is to find the extrinsic clusters in data by taking as input a collection of real-valued similarities between data points, has been playing an important role in data analysis and engineering. Lots of work had been done in this field. However, data clustering is an rather challenge problem as there is no labeled data available. We observe that an ideal similarity matrix should be close to an adjacency matrix up to a scale. Based on this idea, we develop a scaled adjacency matrix (SAM) clustering algorithm that could find an optimal adjacency matrix in some sense for a given similarity matrix. Based on the learnt adjacency matrix, clustering could be performed straightforwardly. Upon three assumptions on the similarity matrix, we prove that the performance of SAM is robust. Experimental results also show that SAM is effective.

Keywords

  • Adjacency Matrix
  • Similarity Matrix
  • Minimum Span Tree
  • Spectral Cluster
  • Data Cluster

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/978-3-642-25975-3_18
  • Chapter length: 12 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   74.99
Price excludes VAT (USA)
  • ISBN: 978-3-642-25975-3
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   99.00
Price excludes VAT (USA)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Shi, J.B., Malik, J.: Normalized cuts and image segmentation. IEEE Transaction on Pattern Analysis and Machine Intelligence 22(8), 888–905 (2000)

    CrossRef  Google Scholar 

  2. Hagen, L., Kahng, A.B.: New spectral methods for ratio cut partitioning and clustering. IEEE Transactions Computer Aided Design 11(9), 1074–1085 (1992)

    CrossRef  Google Scholar 

  3. Ding, C.H.Q., He, H.F., Zha, H.Y., Gu, M., Simon, H.D.: A min-max cut algorithm for graph partitioning and data clustering. In: Proceedings of IEEE International Conference on Data Mining, pp. 107–114 (2001)

    Google Scholar 

  4. Ng, A.Y., Jordan, M.I., Weiss, Y.: On spectral clustering: Analysis and algorithm. In: Proceedings of NIPS, vol. 14, pp. 897–856 (2002)

    Google Scholar 

  5. Zelnik-Manor, L., Perona, P.: Self-Tuning Spectral Clustering. In: Proceedings of NIPS, vol. 17, pp. 1601–1608 (2004)

    Google Scholar 

  6. Li, X.B., Tian, Z.: Optimum cut-based clustering. Signal Processing 87(11), 2491–2502 (2007)

    CrossRef  MATH  Google Scholar 

  7. Chang, H., Yeung, D.Y.: obust Path-Based Spectral Clustering with Application to Image Segmentation. In: Proceedings of ICCV, pp. 278–285 (2005)

    Google Scholar 

  8. Qiu, H.J., Hancock, E.R.: Clustering and Embedding Using Commute Times. IEEE Trans. Pattern Anal. Mach. Intell. 29(11), 1873–1890 (2007)

    CrossRef  Google Scholar 

  9. Gower, J., Ross, G.: Minimum spanning trees and single linkage cluster analysis. Applied Statistics 18, 54–64 (1969)

    MathSciNet  CrossRef  Google Scholar 

  10. Wu, Z.Y., Leahy, R.: An optimal graph theoretic approach to data clustering: Theory and its application to image segmentation. IEEE Transaction on Pattern Analysis and Machine Intelligence 15(11), 1101–1113 (1993)

    CrossRef  Google Scholar 

  11. Nene, S.K.N.S.A., Murase, H.: Columibia object image library (coil-20). Techinical Report CUCS-005-96 (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yu, J., Jia, C. (2011). Data Clustering by Scaled Adjacency Matrix. In: Xiong, H., Lee, W.B. (eds) Knowledge Science, Engineering and Management. KSEM 2011. Lecture Notes in Computer Science(), vol 7091. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25975-3_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-25975-3_18

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)