Abstract
In contrast to mining over transactional data, graph mining is done over structured data represented in the form of a graph. Data having structural relationships lends itself to graph mining. Subdue is one of the early main memory graph mining algorithms that detects the best substructure that compresses a graph using the minimum description length principle. Database approach to graph mining presented in this paper overcomes the problems – performance and scalability – inherent to main memory algorithms. The focus of this paper is the development of graph mining algorithms (specifically Subdue) using SQL and stored procedures in a Relational database environment. We have not only shown how the Subdue class of algorithms can be translated to SQL-based algorithms, but also demonstrated that scalability can be achieved without sacrificing performance.
This work was supported, in part, by the Office of Naval Research, the SPAWAR System Center-San Diego & by the Rome Laboratory (grant F30602-02-2-0134), and by NSF grant IIS-0097517
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, pp. 487–499 (1994)
Han, J., Pei, J., Yin, Y.: Mining Frequent Patterns without Candidate Generation. In: ACM SIGMOD International Conference on Management of Data (2000)
Thomas, S.: Architectures and Optimizations for integrating Data Mining algorithms with Database Systems, Ph.d Thesis CISE Dept, University of Florida (1998)
Sarawagi, S., Thomas, S., Agrawal, R.: Integrating Mining with Relational Database Systems: Alternatives and Implications. In: SIGMOD, Seattle, pp. 343–354 (1998)
Mishra, P., Chakravarthy, S.: Performance Evaluation and Analysis of SQL 1992 Approaches for Association Rule Mining. In: BNCOD Proceedings, pp. 95–114 (2003)
Leclerc, Y.G.: Constructing simple stable descriptions for image partitioning. International journal of Computer Vision 3(1), 73–102 (1989)
Rissanen, J.: Stochastic Complexity in statistical inquiry. World Scientific Publishing Company, Singapore (1989)
Quinlan, J.R., Rivest, R.L.: Inferring decision trees using the minimum description length principle. Information and Computation 80, 227–248 (1989)
Brazma, A., et al.: Discovering patterns and subfamilies in biosequences. In: Proceedings of the Fourth International Conference on Intelligent Systems for Molecular Biology, pp. 34–93 (1996)
Kuramochi, M., Karypis, G.: An Efficient Algorithm for Discovering Frequent Subgraphs, in Technical Report. Department of Computer Science/Army HPC Research Center, University of Minnesota (2002)
Chamberlin, D.: A Complete Guide to DB2 Universal Database. Morgan Kaufmann Publishers, Inc., San Francisco (1998)
Read, R.C., Corneil, D.G.: The graph isomorph disease. Journal of Graph Theory 1, 339–363 (1977)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chakravarthy, S., Beera, R., Balachandran, R. (2004). DB-Subdue: Database Approach to Graph Mining. In: Dai, H., Srikant, R., Zhang, C. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2004. Lecture Notes in Computer Science(), vol 3056. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24775-3_42
Download citation
DOI: https://doi.org/10.1007/978-3-540-24775-3_42
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22064-0
Online ISBN: 978-3-540-24775-3
eBook Packages: Springer Book Archive