Frequent free tree discovery in graph data

Ulrich Rückert, Stefan Kramer
2004 Proceedings of the 2004 ACM symposium on Applied computing - SAC '04  
In recent years, researchers in graph mining have been exploring linear paths as well as subgraphs as pattern languages. In this paper, we are investigating the middle ground between these two extremes: mining free (that is, unrooted) trees in graph data. The motivation for this is the need to upgrade linear path patterns, while avoiding complexity issues with subgraph patterns. Starting from such complexity considerations, we are defining free trees and their canonical form, before we present
more » ... reeTreeMiner, an algorithm making efficient use of this canonical form during search. Experiments with two datasets from the National Cancer Institute's Developmental Therapeutics Program (DTP), anti-HIV and anti-cancer screening data, are reported.
doi:10.1145/967900.968018 dblp:conf/sac/RuckertK04 fatcat:lgpf2myerbdybfmkaiiuwxgtce