SUBDUE is a graph-based knowledge discovery system that finds structural, relational patterns in data representing entities and relationships. SUBDUE represents data using a labeled, directed graph in which entities are represented by labeled vertices or subgraphs, and relationships are represented by labeled edges between the entities. SUBDUE uses the minimum description length (MDL) principle to identify patterns that minimize the number of bits needed to describe the input graph after being compressed by the pattern. SUBDUE can perform several learning tasks, including unsupervised learning, supervised learning, clustering and graph grammar learning.
F. Geerts, B. Goethals, and T. Mielikäinen. Proceedings of the Second International Workshop on Inductive Databases, 22 September, Cavtat-Dubrovnik, Croatia, page 60-69. (2003)
M. McGlohon, L. Akoglu, and C. Faloutsos. KDD '08: Proceeding of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining, page 524--532. New York, NY, USA, ACM, (2008)
T. Wittmann, and J. Ruhland. DaWaK '99: Proceedings of the First International Conference on Data Warehousing and Knowledge Discovery, page 359--368. London, UK, Springer-Verlag, (1999)