A Method for Closed Frequent Subgraph Mining in a Single Large Graph

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F21%3A10248761" target="_blank" >RIV/61989100:27240/21:10248761 - isvavai.cz</a>

Alternative codes found

RIV/61989100:27740/21:10248761

Result on the web

<a href="https://ieeexplore.ieee.org/document/9641835" target="_blank" >https://ieeexplore.ieee.org/document/9641835</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1109/ACCESS.2021.3133666" target="_blank" >10.1109/ACCESS.2021.3133666</a>

Result language

angličtina

Original language name

A Method for Closed Frequent Subgraph Mining in a Single Large Graph

Original language description

Mining frequent subgraphs is an interesting and important problem in the graph mining field, in that mining frequent subgraphs from a single large graph has been strongly developed, and has recently attracted many researchers. Among them, MNI-based approaches are considered as state-of-the-art, such as the GraMi algorithm. Besides frequent subgraph mining (FSM), frequent closed frequent subgraph mining was also developed. This has many practical applications and is a fundamental premise for many studies. This paper proposes the CloGraMi (Closed Frequent Subgraph Mining) algorithm based on GraMi to find all closed frequent subgraphs in a single large graph. Two effective strategies are also developed, the first one is a new level order traversal strategy to quickly determine closed subgraphs in the searching process, and the second is setting a condition for early pruning a large portion of non-closed candidates, both of them aim to reduce the running time as well as the memory requirements, improve the performance of the proposed algorithm. Our experiments are performed on five real datasets (both directed and undirected graphs) and the results show that the running time as well as the memory requirements of our algorithm are significantly better than those of the GraMi-based algorithm.

Czech name

—

Czech description

—

Type

J_imp - Article in a specialist periodical, which is included in the Web of Science database

CEP classification

—

OECD FORD branch

10200 - Computer and information sciences

Project

—

Continuities

S - Specificky vyzkum na vysokych skolach

Publication year

2021

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

IEEE Access

ISSN

2169-3536

e-ISSN

—

Volume of the periodical

9

Issue of the periodical within the volume

4

Country of publishing house

US - UNITED STATES

Number of pages

15

Pages from-to

165719-165733

UT code for WoS article

000734427700001

EID of the result in the Scopus database

—