Advertisement

Correlation Mining in Graph Databases with a New Measure

  • Md. Samiullah
  • Chowdhury Farhan Ahmed
  • Manziba Akanda Nishi
  • Anna Fariha
  • S M Abdullah
  • Md. Rafiqul Islam
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7808)

Abstract

Correlation mining is recognized as one of the most important data mining tasks for its capability to identify underlying dependencies between objects. Nowadays, data mining techniques are increasingly applied to such non-traditional domains, where existing approaches to obtain knowledge from large volume of data cannot be used, as they are not capable to model the requirement of the domains. In particular, the graph modeling based data mining techniques are advantageous in modeling various real life complex scenarios. However, existing graph based data mining techniques cannot efficiently capture actual correlations and behave like a searching algorithm based on user provided query. Eventually, for extracting some very useful knowledge from large amount of spurious patterns, correlation measures are used. Hence, we have focused on correlation mining in graph databases and this paper proposed a new graph correlation measure, gConfidence, to efficiently extract useful graph patterns along with a method CGM (Correlated Graph Mining), to find the underlying correlations among graphs in graph databases using the proposed measure. Finally, extensive performance analysis of our scheme proved two times improvement on speed and efficiency in mining correlation compared to existing algorithms.

Keywords

Correlation mining knowledge discovery correlated graph patterns graph mining graph correlation 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Inokuchi, A., Washio, T., Motoda, H.: An apriori-based algorithm for mining frequent substructures from graph data. In: Zighed, D.A., Komorowski, J., Żytkow, J.M. (eds.) PKDD 2000. LNCS (LNAI), vol. 1910, pp. 13–23. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  2. 2.
    Kuramochi, M., Karypis, G.: Frequent subgraph discovery. In: ICDM, pp. 313–320. IEEE Computer Society (2001)Google Scholar
  3. 3.
    Yan, X., Han, J.: gSpan: Graph-based substructure pattern mining. In: ICDM, pp. 721–724. IEEE Computer Society (2002)Google Scholar
  4. 4.
    Li, J., Liu, Y., Gao, H.: Efficient algorithms for summarizing graph patterns. IEEE Trans. Knowl. Data Eng. 23(9), 1388–1405 (2011)CrossRefGoogle Scholar
  5. 5.
    Tan, P.N., Kumar, V., Srivastava, J.: Selecting the right interestingness measure for association patterns. In: KDD, pp. 32–41. ACM (2002)Google Scholar
  6. 6.
    Yan, X., Zhu, F., Yu, P.S., Han, J.: Feature-based similarity search in graph structures. ACM Trans. Database Syst. 31(4), 1418–1453 (2006)CrossRefGoogle Scholar
  7. 7.
    Ke, Y., Cheng, J., Ng, W.: Efficient correlation search from graph databases. IEEE Trans. Knowl. Data Eng. 20(12), 1601–1615 (2008)CrossRefGoogle Scholar
  8. 8.
    Pubchem web site for information on biological activities of small molecules (2011), http://pubchem.ncbi.nlm.nih.gov

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Md. Samiullah
    • 1
  • Chowdhury Farhan Ahmed
    • 1
  • Manziba Akanda Nishi
    • 1
  • Anna Fariha
    • 1
  • S M Abdullah
    • 2
  • Md. Rafiqul Islam
    • 3
  1. 1.Department of Computer Science and EngineeringUniversity of DhakaBangladesh
  2. 2.Department of Computer Science and EngineeringUnited International UniversityBangladesh
  3. 3.School of Computing and MathematicsCharles Sturt UniversityAustralia

Personalised recommendations