MuGRAM: An approach for multi-labelled graph matching

Graph mining has been a widely studied domain over the years. Graph representation of real world problems has enabled the development of simple solutions bringing in better clarity. Graph mining has various sub domains among which graph matching is a prominent one having a number of algorithms. With the rise of new applications involving large sets of networked data, the performance of these algorithms has become important. The graph based representations for social networks and communication networks have led to the evolution of multi-labelled large graphs which are still not completely handled by the existing algorithms. The requirement of a fast and efficient indexing process so as to accommodate dynamic graphs without having to opt for incremental indexing is another major challenge. In this paper, we propose MuGRAM - a multi-labelled graph matching approach aimed at addressing the above mentioned issues. This approach is capable of handling multiple labels for vertices as well as edges of reference graphs. An enhanced indexing method proposed in the paper ensures a fast indexing process. A breadth first search oriented spanning tree along with a novel technique for neighbourhood matching ensures fast query processing. Experimental evaluation of MuGRAM in comparison with some of the recent algorithms in the field highlights its superior performance.

[1]  Shijie Zhang,et al.  GADDI: distance index based subgraph matching in biological networks , 2009, EDBT '09.

[2]  Norbert Krüger,et al.  Face Recognition by Elastic Bunch Graph Matching , 1997, IEEE Trans. Pattern Anal. Mach. Intell..

[3]  Charu C. Aggarwal,et al.  Graph Clustering , 2010, Encyclopedia of Machine Learning and Data Mining.

[4]  Wei Jin,et al.  SAPPER: Subgraph Indexing and Approximate Matching in Large Graphs , 2010, Proc. VLDB Endow..

[5]  Inderjit S. Dhillon,et al.  Co-clustering documents and words using bipartite spectral graph partitioning , 2001, KDD '01.

[6]  Norbert Krüger,et al.  Face Recognition by Elastic Bunch Graph Matching , 1997, CAIP.

[7]  PetrouMaria,et al.  Structural Matching in Computer Vision Using Probabilistic Relaxation , 1995 .

[8]  Jignesh M. Patel,et al.  TALE: A Tool for Approximate Large Graph Matching , 2008, 2008 IEEE 24th International Conference on Data Engineering.

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

[10]  G. Athithan,et al.  A comparative survey of algorithms for frequent subgraph discovery , 2011 .

[11]  Ulrik Brandes,et al.  Experiments on Graph Clustering Algorithms , 2003, ESA.

[12]  D. Bu,et al.  Topological structure analysis of the protein-protein interaction network in budding yeast. , 2003, Nucleic acids research.

[13]  M. Newman,et al.  The structure of scientific collaboration networks. , 2000, Proceedings of the National Academy of Sciences of the United States of America.

[14]  Shijie Zhang,et al.  DELTA: indexing and querying multi-labeled graphs , 2011, CIKM '11.

[15]  Diane J. Cook,et al.  Graph-based anomaly detection , 2003, KDD '03.

[16]  George Karypis,et al.  Frequent subgraph discovery , 2001, Proceedings 2001 IEEE International Conference on Data Mining.

[17]  Satu Elisa Schaeffer,et al.  Graph Clustering , 2017, Encyclopedia of Machine Learning and Data Mining.

[18]  Eleazar Eskin,et al.  A GEOMETRIC FRAMEWORK FOR UNSUPERVISED ANOMALY DETECTION: DETECTING INTRUSIONS IN UNLABELED DATA , 2002 .

[19]  Burton H. Bloom,et al.  Space/time trade-offs in hash coding with allowable errors , 1970, CACM.