Advertisement

Self Organizing Maps for the Clustering of Large Sets of Labeled Graphs

  • ShuJia Zhang
  • Markus Hagenbuchner
  • Ah Chung Tsoi
  • Alessandro Sperduti
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5631)

Abstract

Data mining on Web documents is one of the most challenging tasks in machine learning due to the large number of documents on the Web, the underlying structures (as one document may refer to another document), and the data is commonly not labeled (the class in which the document belongs is not known a-priori). This paper considers latest developments in Self-Organizing Maps (SOM), a machine learning approach, as one way to classifying documents on the Web. The most recent development is called a Probability Mapping Graph Self-Organizing Map (PMGraphSOM), and is an extension of an earlier Graph-SOM approach; this encodes undirected and cyclic graphs in a scalable fashion. This paper illustrates empirically the advantages of the PMGraphSOM versus the original GraphSOM model in a data mining application involving graph structured information. It will be shown that the performances achieved can exceed the current state-of-the art techniques on a given benchmark problem.

Keywords

Cluster Performance Data Label Label Graph Neighborhood Function Winning Neuron 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Kohonen, T.: Self-Organisation and Associative Memory, 3rd edn. Springer, Heidelberg (1990)Google Scholar
  2. 2.
    Hagenbuchner, M., Tsoi, A., Sperduti, A.: A supervised self-organising map for structured data. In: Allison, N., Yin, H., Allison, L., Slack, J. (eds.) WSOM 2001 - Advances in Self-Organising Maps, pp. 21–28. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  3. 3.
    Günter, S., Bunke, H.: Self-organizing map for clustering in the graph domain. Pattern Recognition Letters 23(4), 405–417 (2002)CrossRefMATHGoogle Scholar
  4. 4.
    Hagenbuchner, M., Sperduti, A., Tsoi, A.: Contextual processing of graphs using self-organizing maps. In: European symposium on Artificial Neural Networks, Poster track, Bruges, Belgium, April 27-29 (2005)Google Scholar
  5. 5.
    Hagenbuchner, M., Tsoi, A.C., Sperduti, A., Kc, M.: Efficient clustering of structured documents using graph self-organizing maps. In: Fuhr, N., Kamps, J., Lalmas, M., Trotman, A. (eds.) INEX 2007. LNCS, vol. 4862, pp. 207–221. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  6. 6.
    Denoyer, L., Gallinari, P.: Initiative for the evaluation of xml retrieval, xml-mining track (2008), http://www.inex.otago.ac.nz/
  7. 7.
    Hagenbuchner, M., Zhang, S., Tsoi, A., Sperduti, A.: Projection of undirected and non-positional graphs using self organizing maps. In: European Symposium on Artificial Neural Networks - Advances in Computational Intelligence and Learning, April 22-24 (to appear, 2009)Google Scholar
  8. 8.
    Pearson, K.: On lines and planes of closest fit to systems of points in space. Philosophical Magazine Series 6(2), 559–572 (1901)CrossRefMATHGoogle Scholar
  9. 9.
    McCallum, A.K.: Bow: A toolkit for statistical language modeling, text retrieval, classification and clustering (1996), http://www.cs.cmu.edu/~mccallum/bow

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • ShuJia Zhang
    • 1
  • Markus Hagenbuchner
    • 1
  • Ah Chung Tsoi
    • 2
  • Alessandro Sperduti
    • 3
  1. 1.University of WollongongWollongongAustralia
  2. 2.Hong Kong Baptist UniversityHong Kong
  3. 3.University of PadovaPadovaItaly

Personalised recommendations