A qualitative survey on frequent subgraph mining

• Published in: Open computer science Vol. 8; no. 1; pp. 194 - 209
• Main Authors: Güvenoglu, Büsra, Bostanoglu, Belgin Ergenç
• Format: Journal Article
• Language: English
• Published: De Gruyter 01.12.2018
• Subjects: data mining; frequent subgraph mining; graph mining
• ISSN: 2299-1093; 2299-1093
• DOI: 10.1515/comp-2018-0018

Data mining is a popular research area that has been studied by many researchers and focuses on finding unforeseen and important information in large databases. One of the popular data structures used to represent large heterogeneous data in the field of data mining is graphs. So, graph mining is one of the most popular subdivisions of data mining. Subgraphs that are more frequently encountered than the user-defined threshold in a database are called frequent subgraphs. Frequent subgraphs in a database can give important information about this database. Using this information, data can be classified, clustered and indexed. The purpose of this survey is to examine frequent subgraph mining algorithms (i) in terms of frequent subgraph discovery process phases such as candidate generation and frequency calculation, (ii) categorize the algorithms according to their general attributes such as input type, dynamicity of graphs, result type, algorithmic approach they are based on, algorithmic design and graph representation as well as (iii) to discuss the performance of algorithms in comparison to each other and the challenges faced by the algorithms recently.