Mining closed relational graphs with connectivity constraints
KDD '05: Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining, page 324--333. New York, NY, USA, ACM, (2005)DOI: http://doi.acm.org/10.1145/1081870.1081908
Abstract
Relational graphs are widely used in modeling large scale networks such as biological networks and social networks. In this kind of graph, connectivity becomes critical in identifying highly associated groups and clusters. In this paper, we investigate the issues of mining closed frequent graphs with connectivity constraints in massive relational graphs where each graph has around 10K nodes and 1M edges. We adopt the concept of edge connectivity and apply the results from graph theory, to speed up the mining process. Two approaches are developed to handle different mining requests: CloseCut, a pattern-growth approach, and splat, a pattern-reduction approach. We have applied these methods in biological datasets and found the discovered patterns interesting.
Description
Mining closed relational graphs with connectivity constraints
