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. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Balachandran, R., Padmanabhan, S., & Chakravarthy, S. (2006). Enhanced DB-subdue: Supporting subtle aspects of graph mining using a relational approach. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3918 LNAI, pp. 673–678). https://doi.org/10.1007/11731139_77
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
