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.
This work was supported, in part, by NSF (grants IIS-0097517, IIS-0326505, and EIA-0216500).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules. In: Proceedings 20th International Conference Very Large Databases, VLDB, Chile (1994)
Sarawagi, S., Thomas, S., Agrawal, R.: Integrating Mining with Relational Database Systems: Alternatives and Implications. In: SIGMOD, Seattle (1998)
Mishra, P., Chakravarthy, S.: Performance Evaluation and Analysis of SQL-92 Approaches for Association Rule Mining. In: BNCOD Proceedings (2003)
Mishra, P., Chakravarthy, S.: Performance Evaluation of SQL-OR Variants for Association Rule Mining. In: Dawak (Data Warehousing and Knowledge Discovery), Prague (2003)
Cook, D., Holder, L.: Graph-Based Data Mining. IEEE Intelligent Systems 15(2), 32–41 (2000)
Quinlan, J.R., Rivest, R.L.: Inferring decision trees using the minimum description length principle. Information and Computation 80, 227–248 (1989)
Chakravarthy, S., Beera, R., Balachandran, R.: Database Approach to Graph Mining. In: Proc. of PAKDD Conference, Sydney, Australia (2004)
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
Inokuchi, A., Washio, T., Motoda, H.: Complete mining of frequent patterns from graphs: mining graph data. Machine Learning 50, 321–354 (2003)
Yan, X., Han, J.: gSpan: Graph-based substructure pattern mining. In: ICDM 2002: 2nd IEEE Conf. Data Mining, pp. 721–724 (2002)
Kuramochi, M., Karypis, G.: Frequent subgraph discovery. In: 1st IEEE Conference on Data Mining (2001), http://citeseer.ist.psu.edu/kuramochi01frequent.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Balachandran, R., Padmanabhan, S., Chakravarthy, S. (2006). Enhanced DB-Subdue: Supporting Subtle Aspects of Graph Mining Using a Relational Approach. In: Ng, WK., Kitsuregawa, M., Li, J., Chang, K. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2006. Lecture Notes in Computer Science(), vol 3918. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11731139_77
Download citation
DOI: https://doi.org/10.1007/11731139_77
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-33206-0
Online ISBN: 978-3-540-33207-7
eBook Packages: Computer ScienceComputer Science (R0)