<abstract xmlns="http://www.w3.org/1999/xhtml"><p> Graph mining isamajor area of interest within the field of data mining in recent years. Akey aspect of graph mining is frequent subgraph mining. Central to the entire discipline of frequent subgraph mining is the concept of subgraph isomorphism. One major issue in early subgraph isomorphism research concerns computational complexity. Normally, the subgraph isomorphism problem is NP-complete. Previous studies of frequent subgraph mining have not solved NP-complete problem in the subgraph isomorphism. In this paper, we proposeanew algorithm which can deal with this problem. The proposed algorithm can solve the subgraph isomorphism in polynomial time in some settings. Moreover, the new algorithm is proved theoretically more effective than previous studies in closed frequent subgraph mining.</p></abstract>

Graph mining isamajor area of interest within the field of data mining in recent years. Akey aspect of graph mining is frequent subgraph mining. Central to the entire discipline of frequent subgraph mining is the concept of subgraph isomorphism. One major issue in early subgraph isomorphism research concerns computational complexity. Normally, the subgraph isomorphism problem is NP-complete. Previous studies of frequent subgraph mining have not solved NP-complete problem in the subgraph isomorphism. In this paper, we proposeanew algorithm which can deal with this problem. The proposed algorithm can solve the subgraph isomorphism in polynomial time in some settings. Moreover, the new algorithm is proved theoretically more effective than previous studies in closed frequent subgraph mining.

An Optimization of Closed Frequent Subgraph Mining Algorithm

Computer and Automation Institute Hungarian Academy of Sciences,

Institute of Information Technology, Vietnam Academy of Science and Technology,

The Information Technology Institute (ITI), Vietnam National University, Hanoi,

Cybernetics and Information Technologies

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

{"article-title":"An Optimization of Closed Frequent Subgraph Mining Algorithm"}

Graph mining isamajor area of interest within the field of data mining in recent years. Akey aspect of graph mining is frequent subgraph mining. Central to the...

An Optimization of Closed Frequent Subgraph Mining Algorithm

Publicado en línea: 06 abr 2017

Páginas: 3 - 15

DOI: https://doi.org/10.1515/cait-2017-0001

Palabras clave
Frequent patterns, closed frequent subgraph, frequent subgraphs, subgraph mining, subgraph isomorphism

© by J. Demetrovics

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

An Optimization of Closed Frequent Subgraph Mining Algorithm

Publicado en línea: 06 abr 2017

Páginas: 3 - 15

DOI: https://doi.org/10.1515/cait-2017-0001

Palabras claveFrequent patterns, closed frequent subgraph, frequent subgraphs, subgraph mining, subgraph isomorphism

© by J. Demetrovics

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

Palabras clave
Frequent patterns, closed frequent subgraph, frequent subgraphs, subgraph mining, subgraph isomorphism