Advertisement

K Hops Frequent Subgraphs Mining for Large Attribute Graph

  • Haiwei Zhang
  • Simeng Jin
  • Xiangyu Hu
  • Ying Zhang
  • Yanlong Wen
  • Xiaojie Yuan
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7808)

Abstract

Attribute Graphs are widely used to describe complex data in many applications such as bio-informatics and social network. With the rapid growth of scale for graph data, traditional solutions for mining frequent subgraphs cannot performed well in large attribute graph because of time-consuming candidates generation and isomorphism testing. In this paper, we investigate the problem for k hops subgraph mining in large attribute graph. The attribute graph is transformed into labeled graphs by projection for each attribute. K hops frequent subgraph mining algorithm FSGen consists of three procedures is performed. Firstly, frequent vertices and edges will be extended to frequent subgraphs from root vertices. Secondly, frequent edges joining frequent vertices will be added into extended subgraphs. Thirdly, if necessary, isomorphism testing will be used to summarize frequent subgraphs based on Graph Edit Distance. Then, frequent labeled subgraphs will be merged into attribute subgraphs by integration according to designated attributes. The complexity of our mechanism is approximately O(2 n ), which is more efficient than existing algorithms. Real data sets are applied in experiments to demonstrate the efficiency and effectiveness of our technique.

Keywords

Attribute graph k hops frequent subgraph mining projection integration 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Yang, J., Zhang, S., Jin, W.: DELTA: Indexing and Querying Multi-labeled Graphs. In: The 20th ACM International Conference on Information and Knowledge Management (CIKM), pp. 1765–1774 (2011)Google Scholar
  2. 2.
    Keyvanpour, M.R., Azizani, F.: Classification and Analysis of Frequent Subgraphs Mining Algorithms. Journal of Software 7(1), 220–227 (2012)CrossRefGoogle Scholar
  3. 3.
    James, C., Yiping, K., Ada, W.C.F., Jeffrey, X.Y.: Fast graph query processing with a low-cost index. The International Journal on Very Large Data Bases 20(4), 521–539 (2011)CrossRefGoogle Scholar
  4. 4.
    Koren, Y., North, S.C., Volinsky, C.: Measuring and extracting proximity in networks. In: The 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pp. 245–255 (2006)Google Scholar
  5. 5.
    Meinl, T., Borgelt, C., Berthold, M.R.: Discriminative Closed Fragment Mining and Perfect Extensions in MoFa. In: The 2nd Starting AI Researchers’ Symposium (STAIRS), pp. 3–14 (2004)Google Scholar
  6. 6.
    Li, X.T., Li, J.Z., Gao, H.: An Efficient Frequent Subgraph Mining Algorithm. Journal of Software 18(10), 2469–2480 (2007)CrossRefGoogle Scholar
  7. 7.
    Inokuchi, A., Washio, T., Motoda, H.: Complete Mining of Frequent Patterns From Graphs: Mining graph data. Machine Learning 50(3), 321–354 (2003)zbMATHCrossRefGoogle Scholar
  8. 8.
    Kuramochi, M., Karypis, G.: Frequent Subgraph Discovery. In: The 1st IEEE International Conference on Data Mining (ICDM), pp. 313–320 (2001)Google Scholar
  9. 9.
    Yan, X., Han, J.: GSpan: Graph-Based Substructure Pattern Mining. In: The 2nd IEEE International Conference on Data Mining (ICDM), pp. 721–724 (2002)Google Scholar
  10. 10.
    Huan, J., Wang, W., Prins, J.: Efficient mining of frequent subgraph in the presence of isomorphism. In: The 3rd IEEE International Conference on Data Mining (ICDM), pp. 549–552 (2003)Google Scholar
  11. 11.
    Riesen, K., Bunke, H.: Approximate graph edit distance computation by means of bipartite graph matching. Image and Vision Computing 27(4), 950–959 (2009)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Haiwei Zhang
    • 1
  • Simeng Jin
    • 1
  • Xiangyu Hu
    • 1
  • Ying Zhang
    • 1
  • Yanlong Wen
    • 1
  • Xiaojie Yuan
    • 1
  1. 1.Department of Computer Science and Information SecurityNankai UniversityTianjinChina

Personalised recommendations