PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

What is frequent in a single graph?
Björn Bringmann and Siegfried Nijssen
In: Mining and Learning with Graphs, MLG 2007, 1-3 Aug 2007, Florence.

Abstract

Frequent graph mining is usually studied in a transactional setting, where the support of a subgraph is defined in terms of the number of examples or transactions that a subgraph is contained in. In this paper we study the problem of defining support when the data consists of a single large graph, such as a network. We propose new support measure that has the desirable property that it is anti-monotonic, and can be computed more efficiently than existing measures.

EPrint Type:Conference or Workshop Item (Poster)
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Theory & Algorithms
ID Code:3618
Deposited By:Siegfried Nijssen
Deposited On:13 February 2008