Mining frequent closed graphs on evolving data streams.
Document typeConference report
PublisherACM Press, NY
Rights accessRestricted access - publisher's policy
Graph mining is a challenging task by itself, and even more so when processing data streams which evolve in real-time. Data stream mining faces hard constraints regarding time and space for processing, and also needs to provide for concept drift detection. In this paper we present a framework for studying graph pattern mining on time-varying streams. Three new methods for mining frequent closed subgraphs are presented. All methods work on coresets of closed subgraphs, compressed representations of graph sets, and maintain these sets in a batch-incremental manner, but use different approaches to address potential concept drift. An evaluation study on datasets comprising up to four million graphs explores the strength and limitations of the proposed methods. To the best of our knowledge this is the first work on mining frequent closed subgraphs in non-stationary data streams.
CitationBifet, A. [et al.]. Mining frequent closed graphs on evolving data streams.. A: ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. "KDD '11 Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining". San Diego: ACM Press, NY, 2011, p. 591-599.