Mining frequent closed graphs on evolving data streams

@inproceedings{Bifet2011MiningFC,
  title={Mining frequent closed graphs on evolving data streams},
  author={A. Bifet and Geoff Holmes and B. Pfahringer and R. Gavald{\`a}},
  booktitle={KDD},
  year={2011}
}
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… Expand
73 Citations
Frequent Subgraph Mining from Streams of Uncertain Data
  • 8
Frequent Pattern Mining from Dense Graph Streams
  • 8
  • PDF
Frequent Subgraph Mining from Streams of Linked Graph Structured Data
  • 9
  • PDF
Complex graph stream mining
  • PDF
Efficient frequent subgraph mining on large streaming graphs
  • PDF
Mining Frequent Patterns in Evolving Graphs
  • 12
  • PDF
Incremental Frequent Subgraph Mining on Large Evolving Graphs
  • 21
  • PDF
...
1
2
3
4
5
...