Skip to main content
SpringerLink
Log in

Graph Adjacency Matrix Associated with a Data Partition

  • Conference paper
Computational Science and Its Applications – ICCSA 2004 (ICCSA 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3044))

Included in the following conference series:

  • 876 Accesses

Abstract

A frequently recurring problem in several applications is to compare two or more data sets and evaluate the level of similarity. In this paper we describe a technique to compare two data partitions of different data sets. The comparison is obtained by means of matrices called Graph Adjacency Matrices which represent the data sets. Then, a match coefficient returns an estimation of the level of similarity between the data sets.

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

Access this chapter

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 54.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bodnarova, A., Bennamoun, M., Latham, S.: Optimal Gabor Filter for Textile Flaw Detection. Pattern recognition 35, 2973–2991 (2002)

    Article  MATH  Google Scholar 

  2. Aksoy, S., Haralick, R.M.: Graph Theoretic Clustering for Image Grouping and Retrieval. In: IEEE, Conference on Computer Vision and Pattern Recognition, pp. 63–68 (1999)

    Google Scholar 

  3. Sahasrabudhe, N., West, J.E., Machiraju, R., Janus, M.: Structured Spatial Domain Image and Data Comparison Metrics. In: Visualization 1999, Proceedings, October 1999, pp. 97–105 (1999)

    Google Scholar 

  4. Hoppner, F., Klawonn, F., Kruse, R., Runkler, T.: Fuzzy Cluster Analysis. John Wiley & Sons, LTD., Chichester (2000)

    Google Scholar 

  5. Papadimitiou, C.H., Steiglitz, K.: Combinatorial Optimization: Algorithm and Complexity. Prentice-Hall, Englewood Cliffs (1982)

    Google Scholar 

  6. Umeyama, S.: An Eigendecomposition Approach to Weighted Graph Matching Problems. IEEE, Transaction on Pattern Analysis and Machine Intelligence 10(5), 695–703 (1988)

    Article  MATH  Google Scholar 

  7. Xu, L.: Best Harmony, Unified RPCL and Automated Model Selection for Unsupervised and Supervised Learning on Gaussian Mixtures, Three-Layer Nets and ME-RBF-SVM Models. International Journal of Neural Systems 11, 43–69 (2001)

    Google Scholar 

  8. Chiarantoni, E., Acciani, G., Fornarelli, G., Vergura, S.: Robust Unsupervised Competitive Neural Network by Local Competitive Signals. In: Proceedings of International Conference On Artificial Neural Networks, pp. 963–968 (2002)

    Google Scholar 

  9. Kohonen, T.: Self-organizing maps, 3rd edn. Springer, Heidelberg (2001)

    MATH  Google Scholar 

  10. Gustafson, D.E., Kessel, W.C.: Fuzzy clustering with a fuzzy covariance matrix. In: Proc. IEEE CDC, pp. 761–766 (1979)

    Google Scholar 

  11. Xie, X.L., Beni, G.: A Validity Measure for Fuzzy Clustering. IEEE, Transaction on Pattern Analysis and Machine Intelligence 13(8), 841–847 (1991)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Elettrotecnica ed Elettronica, Politecnico di Bari, Via E. Orabona no 4, 70125, Bari, Italy

    Giuseppe Acciani, Girolamo Fornarelli & Luciano Liturri

Authors
  1. Giuseppe Acciani
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Girolamo Fornarelli
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Luciano Liturri
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Chemistry, University of Perugia, Via Elce di Sotto, 8, I-06123, Perugia, Italy

    Antonio Laganá

  2. Department of Computer Science, University of Calgary, 2500 University Drive N.W., T2N 1N4, Calgary AB, Canada

    Marina L. Gavrilova

  3. William Norris Professor, Head of the Computer Science and Engineering Department, University of Minnesota, USA

    Vipin Kumar

  4. School of Computing, Soongsil University, Seoul, Korea

    Youngsong Mun

  5. OptimaNumerics Ltd., Cathedral House, 23-31 Waring Street, BT1 2DX, Belfast, UK

    C. J. Kenneth Tan

  6. Department of Mathematics and Computer Science, University of Perugia, via Vanvitelli, 1, I-06123, Perugia, Italy

    Osvaldo Gervasi

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Acciani, G., Fornarelli, G., Liturri, L. (2004). Graph Adjacency Matrix Associated with a Data Partition. In: Laganá, A., Gavrilova, M.L., Kumar, V., Mun, Y., Tan, C.J.K., Gervasi, O. (eds) Computational Science and Its Applications – ICCSA 2004. ICCSA 2004. Lecture Notes in Computer Science, vol 3044. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24709-8_103

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24709-8_103

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22056-5

  • Online ISBN: 978-3-540-24709-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation