Frequent Subgraph Mining Algorithms in Static and Temporal Graph-Transaction Settings: A Survey

2021 ◽  
pp. 1-1
Author(s):  
Ali Jazayeri ◽  
Chris Yang
Keyword(s):  
Frequent Subgraph Mining ◽  
Subgraph Mining ◽  
Frequent Subgraph ◽  
Temporal Graph ◽  
Mining Algorithms

scholarly journals A Survey of Frequent Subgraph Mining Algorithms

2018 ◽  
Vol 7 (3.8) ◽  
pp. 58
Author(s):  
Chandra Prakash Dixit ◽  
Nilay Khare
Keyword(s):  
Data Structure ◽  
Knowledge Discovery ◽  
Real World ◽  
Review Paper ◽  
Frequent Subgraph Mining ◽  
Real World Data ◽  
Evolving Graphs ◽  
Subgraph Mining ◽  
Frequent Subgraph ◽  
Mining Algorithms

Graphs are broadly used data structure. Graphs are very useful in representing/analyzing and processing real world data. Evolving graphs are graphs which are frequently changing in nature. There is either increase or decrease in their size i.e. change in number of edges or/and vertices.  Mining is the process done for knowledge discovery in graphs. Detecting specific patterns with their number of repetition more than a predefined threshold in graph is known as frequent subgraph mining or FSM. Real Timed data representing graphs are high volumetric or of very large in size, handling such graphs require processing them with special mechanisms and algorithms. Our review paper discovers present FSM techniques and tries to give their comparative study. 

Sign in / Sign up

Export Citation Format

Share Document