Mining frequent closed graphs on evolving data streams

Authors:
Albert Bifet;Geoff Holmes;Bernhard Pfahringer;Ricard Gavaldà
Affiliations:
University of Waikato, Hamilton, New Zealand;University of Waikato, Hamilton, New Zealand;University of Waikato, Hamilton, New Zealand;UPC-Barcelona Tech, Barcelona, Spain
Venue:
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Year:
2011

Citing 25
Cited 10

Maintaining Stream Statistics over Sliding Windows

SIAM Journal on Computing
Mining Molecular Fragments: Finding Relevant Substructures of Molecules

ICDM '02 Proceedings of the 2002 IEEE International Conference on Data Mining
gSpan: Graph-Based Substructure Pattern Mining

ICDM '02 Proceedings of the 2002 IEEE International Conference on Data Mining
CloseGraph: mining closed frequent graph patterns

Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
BIDE: Efficient Mining of Frequent Closed Sequences

ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Moment: Maintaining Closed Frequent Itemsets over a Stream Sliding Window

ICDM '04 Proceedings of the Fourth IEEE International Conference on Data Mining
Mining Closed and Maximal Frequent Subtrees from Databases of Labeled Rooted Trees

IEEE Transactions on Knowledge and Data Engineering
Mining Graph Data

Mining Graph Data
MoSS: a program for molecular substructure mining

Proceedings of the 1st international workshop on open source data mining: frequent pattern mining implementations
CFI-Stream: mining closed frequent itemsets in data streams

Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
ChemDB: a public database of small molecules and related chemoinformatics resources

Bioinformatics
Fg-index: towards verification-free query processing on graph databases

Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Frequent pattern mining: current status and future directions

Data Mining and Knowledge Discovery
DryadeParent, An Efficient and Robust Closed Attribute Tree Mining Algorithm

IEEE Transactions on Knowledge and Data Engineering
ChemDB update—full-text search and virtual chemical space

Bioinformatics
A survey on algorithms for mining frequent itemsets over data streams

Knowledge and Information Systems
Mining adaptively frequent closed unlabeled rooted trees in data streams

Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
Maintaining frequent closed itemsets over a sliding window

Journal of Intelligent Information Systems
New ensemble methods for evolving data streams

Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Mining frequent closed rooted trees

Machine Learning
Managing and Mining Graph Data

Managing and Mining Graph Data
MOA: Massive Online Analysis

The Journal of Machine Learning Research
On dense pattern mining in graph streams

Proceedings of the VLDB Endowment
Efficiently mining δ-tolerance closed frequent subgraphs

Machine Learning
An output-polynomial time algorithm for mining frequent closed attribute trees

ILP'05 Proceedings of the 15th international conference on Inductive Logic Programming

MOA: a real-time analytics open source framework

ECML PKDD'11 Proceedings of the 2011 European conference on Machine learning and knowledge discovery in databases - Volume Part III
Stream data mining using the MOA framework

DASFAA'12 Proceedings of the 17th international conference on Database Systems for Advanced Applications - Volume Part II
Efficient algorithms for mining maximal high utility itemsets from data streams with different models

Expert Systems with Applications: An International Journal
CGStream: continuous correlated graph query for data streams

Proceedings of the 21st ACM international conference on Information and knowledge management
Online techniques for dealing with concept drift in process mining

IDA'12 Proceedings of the 11th international conference on Advances in Intelligent Data Analysis
Incremental Frequent Route Based Trajectory Prediction

Proceedings of the Sixth ACM SIGSPATIAL International Workshop on Computational Transportation Science
A lossy counting based approach for learning on streams of graphs on a budget

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Mining Top-K Rank Frequent Patterns in Data Streams A Tree Based Approach with Ternary Function and Ternary Feature Vector

Proceedings of the Second International Conference on Innovative Computing and Cloud Computing
Mining frequent itemsets in a stream

Information Systems
Mining maximal frequent patterns by considering weight conditions over data streams

Knowledge-Based Systems

Quantified Score

Hi-index	0.00

Visualization

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.