Mining frequent closed graphs on evolving data streams

  • Albert Bifet
  • , Geoff Holmes
  • , Bernhard Pfahringer
  • , Ricard Gavaldà

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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.

Original languageEnglish
Title of host publicationProceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD'11
PublisherAssociation for Computing Machinery
Pages591-599
Number of pages9
ISBN (Print)9781450308137
DOIs
Publication statusPublished - 1 Jan 2011
Externally publishedYes
Event17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2011 - San Diego, United States
Duration: 21 Aug 201124 Aug 2011

Publication series

NameProceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Conference

Conference17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2011
Country/TerritoryUnited States
CitySan Diego
Period21/08/1124/08/11

Keywords

  • Closed mining
  • Concept drift
  • Data streams
  • Graphs

Fingerprint

Dive into the research topics of 'Mining frequent closed graphs on evolving data streams'. Together they form a unique fingerprint.

Cite this