Support measures for graph data*

Authors:
N. Vanetik;S. E. Shimony;E. Gudes
Affiliations:
Department of Computer Science, Ben-Gurion University of the Negev, Beer-Sheva, Israel 84105;Department of Computer Science, Ben-Gurion University of the Negev, Beer-Sheva, Israel 84105;Department of Computer Science, Ben-Gurion University of the Negev, Beer-Sheva, Israel 84105
Venue:
Data Mining and Knowledge Discovery
Year:
2006

Citing 0
Cited 8

Discovering Frequent Graph Patterns Using Disjoint Paths

IEEE Transactions on Knowledge and Data Engineering
Mining globally distributed frequent subgraphs in a single labeled graph

Data & Knowledge Engineering
Mining Graph Evolution Rules

ECML PKDD '09 Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases: Part I
A log-linear approach to mining significant graph-relational patterns

Data & Knowledge Engineering
All normalized anti-monotonic overlap graph measures are bounded

Data Mining and Knowledge Discovery
Network node label acquisition and tracking

EPIA'11 Proceedings of the 15th Portugese conference on Progress in artificial intelligence
An efficiently computable support measure for frequent subgraph pattern mining

ECML PKDD'12 Proceedings of the 2012 European conference on Machine Learning and Knowledge Discovery in Databases - Volume Part I
NODAR: mining globally distributed substructures from a single labeled graph

Journal of Intelligent Information Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The concept of support is central to data mining. While the definition of support in transaction databases is intuitive and simple, that is not the case in graph datasets and databases. Most mining algorithms require the support of a pattern to be no greater than that of its subpatterns, a property called anti-monotonicity, or admissibility. This paper examines the requirements for admissibility of a support measure. Support measures for mining graphs are usually based on the notion of an instance graph---a graph representing all the instances of the pattern in a database and their intersection properties. Necessary and sufficient conditions for support measure admissibility, based on operations on instance graphs, are developed and proved. The sufficient conditions are used to prove admissibility of one support measure--the size of the independent set in the instance graph. Conversely, the necessary conditions are used to quickly show that some other support measures, such as weighted count of instances, are not admissible.