Mining Graph Patterns

@inproceedings{Cheng2014MiningGP,
  title={Mining Graph Patterns},
  author={Hong Cheng and Xifeng Yan and Jiawei Han},
  booktitle={Frequent Pattern Mining},
  year={2014}
}
Graph pattern mining becomes increasingly crucial to applications in a variety of domains including bioinformatics, cheminformatics, social network analysis, computer vision and multimedia. In this chapter, we first examine the existing frequent subgraph mining algorithms and discuss their computational bottleneck. Then we introduce recent studies on mining various types of graph patterns, including significant, representative and dense subgraph patterns. We also discuss the mining tasks in new… 
Mining interesting frequent patterns in a single graph using inexact matching
TLDR
This work introduces the algorithm AGraP, which, by allowing patterns that can have structural differences, in vertices as well as in edges, respect to their occurrences, is able to find patterns missed by other state of the art algorithms, and introduces the algorithms CloseAFG, MaxAFG and IntAFG that, by focusing on closed, maximal or interesting patterns, respectively, are able to reduce the amount of mined patterns by AGraC.
An Enhancement of Grami Based on Threshold Policy for Pattern Big Graphs
TLDR
This paper follows the Grami structure for the analysis of frequent subgraph mining and also introduces the 20% threshold policy for the enhancement of the directed pattern graphs and shows that the performance of Grami approach has been improved.
Event prediction from news text using subgraph embedding and graph sequence mining
TLDR
This paper aims to predict the news skeleton in the form of a subgraph and model the problem as subgraph prediction and analyzes both a collection of news from an online newspaper and a benchmark news dataset against baseline methods.
Flexible and Feasible Support Measures for Mining Frequent Patterns in Large Labeled Graphs
TLDR
This paper presents two new support measures: minimum instance (MI) measure and minimum vertex cover (MVC) measure, that combine the advantages of existing measures and shows that the existing minimum-image-based support measure is an upper bound of the MI measure, which is also linear-time computable and results in counts that are close to number of instances of a pattern.
FLMin: An Approach for Mining Frequent Links in Social Networks
TLDR
The algorithm works without previous knowledge on the network and exploits both the structure and the attributes of nodes to extract regularities called Frequent Links.
An Efficient Algorithm for Frequent Trajectory Itemset
TLDR
The comparative analysis proves that the proposed TSPTPM algorithm reduces the runtime, memory consumption and the number of rules compared to the traditional frequent mining algorithms.
MAX-FLMin: An Approach for Mining Maximal Frequent Links and Generating Semantical Structures from Social Networks
TLDR
The paper detail the method proposed to extract maximal frequent links from social networks and shows how the extracted patterns are used to generate aggregated networks that represent the initial social network with more semantics.
RiboFSM: Frequent subgraph mining for the discovery of RNA structures and interactions
TLDR
The algorithm was applied to the mitochondrial genome of the kinetoplastid species Trypanosoma brucei, which has a unique RNA editing mechanism and the most significant patterns contain two stem-loops, indicative of gRNA, and represent interactions of these structures with target mRNA.
Extraction of Interpretable Decision Sets in Graph Databases
TLDR
This paper proposes an extension of Interpretable Decision Sets (IDS), one of representative frameworks in the field of interpretable machine learning, for graph databases, and gives a method for deriving a set of classification rules on subgraph patterns.
...
...

References

SHOWING 1-10 OF 52 REFERENCES
Efficient mining of frequent subgraphs in the presence of isomorphism
TLDR
This work proposes a novel frequent subgraph mining algorithm: FFSM, which employs a vertical search scheme within an algebraic graph framework it has developed to reduce the number of redundant candidates proposed.
CloseGraph: mining closed frequent graph patterns
TLDR
A closed graph pattern mining algorithm, CloseGraph, is developed by exploring several interesting pruning methods and shows that it not only dramatically reduces unnecessary subgraphs to be generated but also substantially increases the efficiency of mining, especially in the presence of large graph patterns.
Frequent subgraph discovery
TLDR
The empirical results show that the algorithm scales linearly with the number of input transactions and it is able to discover frequent subgraphs from a set of graph transactions reasonably fast, even though it has to deal with computationally hard problems such as canonical labeling of graphs and subgraph isomorphism which are not necessary for traditional frequent itemset discovery.
GraphSig: A Scalable Approach to Mining Significant Subgraphs in Large Graph Databases
TLDR
This work proposes a highly scalable technique, called GraphSig, to mine significant subgraphs from large graph databases, and develops a classifier using patterns mined by GraphSigs, which achieves superior performance over state-of-the-art classifiers.
On dense pattern mining in graph streams
TLDR
The purpose of the probabilistic approach is to create a summarization of the graph stream, which can be used for further pattern mining and it is shown that this summarization approach leads to effective and efficient results for stream pattern mining over a number of real and synthetic data sets.
Computing frequent graph patterns from semistructured data
TLDR
A new algorithm for mining graph data is proposed, based on a novel definition of support, that can be useful for many applications, including: compact representation of source information and a road-map for browsing and querying information sources.
SPIN: mining maximal frequent subgraphs from graph databases
TLDR
This paper proposes a new algorithm that mines only maximal frequent subgraphs, i.e. sub graphs that are not a part of any other frequent sub graph, and demonstrates that this algorithm can achieve a five-fold speed up over the current state-of-the-art subgraph mining algorithms.
Discovering frequent topological structures from graph datasets
TLDR
This paper proposes a framework to mine frequent large-scale structures, formally defined as frequent topological structures, from graph datasets, and demonstrates the viability and scalability of the proposed algorithms on real and synthetic datasets.
Mining frequent closed graphs on evolving data streams
TLDR
This paper presents a framework for studying graph pattern mining on time-varying streams, and presents three new methods for mining frequent closed subgraphs in non-stationary data streams.
Mining significant graph patterns by leap search
TLDR
The first comprehensive study on general mining method aiming to find most significant patterns directly, and graph classifiers built on mined patterns outperform the up-to-date graph kernel method in terms of efficiency and accuracy, demonstrating the high promise of such patterns.
...
...