Mining and Learning with Graphs · 2007 · 14 citations · 7 references
Although tree and graph mining have attracted a lot of attention, there are nearly no algorithms devoted to DAGmining, whereas many applications are in dire need of such algorithms. We present in this paper DIGDAG, the first algorithm capable of mining closed frequent embedded sub-DAGs. This algorithm combines efficient closed frequent itemset algorithms with novel techniques in order to scale up to complex input data. 1.
7
Functional Discovery via a Compendium of Expression Profiles
Timothy R. Hughes, Matthew J. Marton, Allan R. Jones et al. · Cell · 2000 · 2.6K citations · Full text