Frequent Pattern Mining (FPM) is a very powerful paradigm which encompasses an entire class of data mining tasks. The specific
tasks encompassed by FPM include the mining of increasingly complex and informative patterns, in complex structured and unstructured
relational datasets, such as: Itemsets or co-occurrences [1] (transactional, unordered data), Sequences [2,8] (temporal or
positional data, as in text mining, bioinformatics), Tree patterns [9] (XML/semistructured data), and Graph patterns [4,5,6]
(complex relational data, bioinformatics). Figure [1] shows examples of these different types of patterns; in a generic sense
a pattern denotes links/relationships between several objects of interest. The objects are denoted as nodes, and the links
as edges. Patterns can have multiple labels, denoting various attributes, on both the nodes and edges.
This work was supported in part by NSF CAREER Award IIS-0092978, DOE Career Award DE-FG02-02ER25538, and NSF grants EIA-0103708
and EMT-0432098.