Advertisement

Enhanced DB-Subdue: Supporting Subtle Aspects of Graph Mining Using a Relational Approach

  • Ramanathan Balachandran
  • Srihari Padmanabhan
  • Sharma Chakravarthy
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3918)

Abstract

This paper addresses subtle aspects of graph mining using an SQL-based approach. The enhancements addressed in this paper include detection of cycles, effect of overlapping substructures on compression, and development of a minimum description length for the relational approach. Extensive performance evaluation has been conducted to evaluate the extensions.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules. In: Proceedings 20th International Conference Very Large Databases, VLDB, Chile (1994)Google Scholar
  2. 2.
    Sarawagi, S., Thomas, S., Agrawal, R.: Integrating Mining with Relational Database Systems: Alternatives and Implications. In: SIGMOD, Seattle (1998)Google Scholar
  3. 3.
    Mishra, P., Chakravarthy, S.: Performance Evaluation and Analysis of SQL-92 Approaches for Association Rule Mining. In: BNCOD Proceedings (2003)Google Scholar
  4. 4.
    Mishra, P., Chakravarthy, S.: Performance Evaluation of SQL-OR Variants for Association Rule Mining. In: Dawak (Data Warehousing and Knowledge Discovery), Prague (2003)Google Scholar
  5. 5.
    Cook, D., Holder, L.: Graph-Based Data Mining. IEEE Intelligent Systems 15(2), 32–41 (2000)CrossRefGoogle Scholar
  6. 6.
    Quinlan, J.R., Rivest, R.L.: Inferring decision trees using the minimum description length principle. Information and Computation 80, 227–248 (1989)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Chakravarthy, S., Beera, R., Balachandran, R.: Database Approach to Graph Mining. In: Proc. of PAKDD Conference, Sydney, Australia (2004)Google Scholar
  8. 8.
    Balachandran, R.: Relational Approach to Modeling and Implementing Subtle Aspects of Graph Mining, MS Thesis, Fall (2003), http://www.cse.uta.edu/Research/Publications/Downloads/CSE-2003-41.pdf
  9. 9.
    Inokuchi, A., Washio, T., Motoda, H.: Complete mining of frequent patterns from graphs: mining graph data. Machine Learning 50, 321–354 (2003)CrossRefzbMATHGoogle Scholar
  10. 10.
    Yan, X., Han, J.: gSpan: Graph-based substructure pattern mining. In: ICDM 2002: 2nd IEEE Conf. Data Mining, pp. 721–724 (2002)Google Scholar
  11. 11.
    Kuramochi, M., Karypis, G.: Frequent subgraph discovery. In: 1st IEEE Conference on Data Mining (2001), http://citeseer.ist.psu.edu/kuramochi01frequent.html

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Ramanathan Balachandran
    • 1
  • Srihari Padmanabhan
    • 1
  • Sharma Chakravarthy
    • 1
  1. 1.The University of Texas at ArlingtonArlingtonUSA

Personalised recommendations