AAAI Publications, Twenty-Fourth International FLAIRS Conference

Font Size: 
Graph-Based Knowledge Discovery: Compression versus Frequency
William Eberle, Lawrence B. Holder

Last modified: 2011-03-21

Abstract


There are two primary types of graph-based data miners: frequent subgraph and compression-based miners. With frequent subgraph miners, the most interesting substructure is the largest one (or ones) that meet the minimum support. Whereas, compression-based graph miners discover those subgraphs that maximize the amount of compression that a particular substructure provides a graph. The algorithms associated with these two approaches are not only different, but they also may result in dramatic performance differences, as well as in the normative patterns being discovered. In order to compare these two types of graph-based approaches to knowledge discovery, in the following sections we will compare two publicly available applications: GASTON and SUBDUE.

Full Text: PDF