A survey of frequent subgraph mining algorithms

Jiang, Chuntao, Coenen, Frans ORCID: 0000-0003-1026-6649 and Zito, Michele
(2013) A survey of frequent subgraph mining algorithms. KNOWLEDGE ENGINEERING REVIEW, 28 (1). pp. 75-105.

[img] Text
ker-jct-6-May-11.pdf - Author Accepted Manuscript

Download (489kB)


<jats:title>Abstract</jats:title><jats:p>Graph mining is an important research area within the domain of data mining. The field of study concentrates on the identification of frequent subgraphs within graph data sets. The research goals are directed at: (i) effective mechanisms for generating candidate subgraphs (without generating duplicates) and (ii) how best to process the generated candidate subgraphs so as to identify the desired frequent subgraphs in a way that is computationally efficient and procedurally effective. This paper presents a survey of current research in the field of frequent subgraph mining and proposes solutions to address the main research issues.</jats:p>

Item Type: Article
Additional Information: ## TULIP Type: Articles/Papers (Journal) ##
Depositing User: Symplectic Admin
Date Deposited: 07 Feb 2017 15:02
Last Modified: 19 Jan 2023 07:19
DOI: 10.1017/S0269888912000331
Related URLs:
URI: https://livrepository.liverpool.ac.uk/id/eprint/3005601