Self-organizing map for clustering in the graph domain

Self-organizing map (som) is a flexible method that can be applied to various tasks in pattern recognition. However it is limited in the sense that it uses only pattern representations in terms of feature vectors. It was only recently that an extension to strings was proposed. In the present paper we go a step further and present a version of som that works in the domain of graphs. Graphs are a powerful data structure that include pattern representations based on strings and feature vectors as special cases. After introducing the new method a number of experiments will be described demonstrating its feasibility in the context of a graph clustering task.

[1]  Edwin R. Hancock,et al.  Bayesian Graph Edit Distance , 2000, IEEE Trans. Pattern Anal. Mach. Intell..

[2]  Ching Y. Suen,et al.  Hierarchical attributed graph representation and recognition of handwritten chinese characters , 1991, Pattern Recognit..

[3]  Josef Kittler,et al.  On Matching Algorithms for the Recognition of Objects in Cluttered Background , 2001, IWVF.

[4]  Michael J. Fischer,et al.  The String-to-String Correction Problem , 1974, JACM.

[5]  Jin Hyung Kim,et al.  Translation-, Rotation- and Scale- Invariant Recognition of Hand-Drawn Symbols in Schematic Diagrams , 1990, Int. J. Pattern Recognit. Artif. Intell..

[6]  King-Sun Fu,et al.  A distance measure between attributed relational graphs for pattern recognition , 1983, IEEE Transactions on Systems, Man, and Cybernetics.

[7]  Svetha Venkatesh,et al.  Video indexing and similarity retrieval by largest common subgraph detection using decision trees , 2001, Pattern Recognit..

[8]  Theodosios Pavlidis,et al.  A Shape Analysis Model with Applications to a Character Recognition System , 1994, IEEE Trans. Pattern Anal. Mach. Intell..

[9]  Anil K. Jain,et al.  Data clustering: a review , 1999, CSUR.

[10]  Teuvo Kohonen,et al.  Self-Organizing Maps , 2010 .

[11]  Edwin R. Hancock,et al.  Genetic Search for Structural Matching , 1996, ECCV.

[12]  William J. Christmas,et al.  Structural Matching in Computer Vision Using Probabilistic Relaxation , 1995, IEEE Trans. Pattern Anal. Mach. Intell..

[13]  Kaizhong Zhang,et al.  The approximate graph matching problem , 1994, Proceedings of the 12th IAPR International Conference on Pattern Recognition, Vol. 3 - Conference C: Signal Processing (Cat. No.94CH3440-5).

[14]  Horst Bunke,et al.  Inexact graph matching for structural pattern recognition , 1983, Pattern Recognit. Lett..

[15]  Marco Gori,et al.  Similarity learning for graph-based image representations , 2003, Pattern Recognit. Lett..

[16]  Horst Bunke,et al.  Validation indices for graph clustering , 2003, Pattern Recognit. Lett..

[17]  Anil K. Jain,et al.  Template-based online character recognition , 2001, Pattern Recognit..

[18]  E. K. WONG,et al.  Model matching in robot vision by subgraph isomorphism , 1992, Pattern Recognit..

[19]  Luigi Cinque,et al.  2-D Object Recognition By Multiscale Tree Matching , 1998, Pattern Recognit..

[20]  Horst Bunke,et al.  A New Algorithm for Error-Tolerant Subgraph Isomorphism Detection , 1998, IEEE Trans. Pattern Anal. Mach. Intell..

[21]  Bernd Fritzke.  Growing self-organizing networks—history, status quo, and perspectives , 1999 .

[22]  Kaleem Siddiqi,et al.  Matching Hierarchical Structures Using Association Graphs , 1999, IEEE Trans. Pattern Anal. Mach. Intell..

[23]  Erkki Oja,et al.  Kohonen Maps , 1999, Encyclopedia of Machine Learning.

[24]  Panu Somervuo,et al.  Self-organizing maps of symbol strings , 1998, Neurocomputing.