Overview
The inductive database approach to graph mining can be characterized by (1) the concept of querying for (subgraph) patterns in databases of graphs, and (2) the use of specific data structures representing the space of solutions. For the former, a query language for the specification of the patterns of interest is necessary. The latter aims at a compact representation of the solution patterns.
Pattern Domain
In contrast to other graph mining approaches, the inductive database approach to graph mining (De Raedt & Kramer, 2001; Kramer, De Raedt, & Helma, 2001) focuses on simple patterns (paths and trees) and complex queries (see below), not on complex patterns (general subgraphs) and simple queries (minimum frequency only). While the first approaches were restricted to paths as patterns in graph databases, they were later extended toward unrooted trees (Rückert & Kramer, 2003, 2004). Most of the applications are dealing with structures of small molecules and structure–activity...
This is a preview of subscription content, log in via an institution to check access.
Recommended Reading
De Raedt, L., Jaeger, M., Lee, S. D., & Mannila, H. (2002). A theory of inductive query answering. In Proceedings of the 2002 IEEE international conference on data mining (ICDM 2002). IEEE Computer Society, Washington, DC.
De Raedt, L., & Kramer, S. (2001). The levelwise version space algorithm and its application to molecular fragment finding. In Proceedings of the seventeenth international joint conference on artificial intelligence (IJCAI 2001). Morgan Kaufmann: San Francisco, CA.
Fischer, J., Heun, V., & Kramer, S. (2006). Optimal string mining under frequency constraints. In Proceedings of the tenth European conference on the principles and practice of knowledge discovery in databases (PKDD 2006). Springer: Berlin.
Kramer, S., De Raedt, L., & Helma, C. (2001). Molecular feature mining in HIV data. In Proceedings of the seventh ACM SIGKDD international conference on knowledge discovery and data mining (KDD 2001). ACM Press: New York, NY.
Lee, S. D., & De Raedt, L. (2003). An algebra for inductive query evaluation. In Proceedings of the third IEEE international conference on data mining (ICDM 2003). IEEE Computer Society, Washington, DC.
Mannila, H., & Toivonen, H. (1997). Levelwise search and borders of theories in knowledge discovery. Data Mining and Knowledge Discovery, 1(3), 241–258.
Morishita, S., & Sese, J. (2000). Traversing itemset lattice with statistical metric pruning. In Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on principles of database systems (PODS 2000). ACM Press: New York, NY.
Rückert, U., & Kramer, S. (2003). Generalized version space trees. In J.-F. Boulicaut, S. Dzeroski (Eds.), Proceedings of the second international workshop on knowledge discovery in inductive databases (KDID-2003). Springer: Berlin.
Rückert, U., & Kramer, S. (2004). Frequent free tree discovery in graph data. In Proceedings of the ACM symposium on applied computing (SAC 2004). ACM Press: New York, NY.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer Science+Business Media, LLC
About this entry
Cite this entry
Kramer, S. (2011). Inductive Database Approach to Graphmining. In: Sammut, C., Webb, G.I. (eds) Encyclopedia of Machine Learning. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-30164-8_391
Download citation
DOI: https://doi.org/10.1007/978-0-387-30164-8_391
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-30768-8
Online ISBN: 978-0-387-30164-8
eBook Packages: Computer ScienceReference Module Computer Science and Engineering