Skip to content
Publish & Distribute
Publishing Solutions
Distribution Solutions
Library Services
Subjects
Architecture and Design
Arts
Business and Economics
Chemistry
Classical and Ancient Near Eastern Studies
Computer Sciences
Cultural Studies
Engineering
General Interest
Geosciences
History
Industrial Chemistry
Jewish Studies
Law
Library and Information Science, Book Studies
Life Sciences
Linguistics and Semiotics
Literary Studies
Materials Sciences
Mathematics
Medicine
Music
Pharmacy
Philosophy
Physics
Social Sciences
Sports and Recreation
Theology and Religion
Publications
Journals
Books
Proceedings
Publishers
Journal Matcher
Blog
Contact
Search
English
English
Deutsch
Polski
Español
Français
Italiano
Cart
Home
Journals
Cybernetics and Information Technologies
Volume 17 (2017): Issue 1 (March 2017)
Open Access
An Optimization of Closed Frequent Subgraph Mining Algorithm
J. Demetrovics
J. Demetrovics
Hungary
Search for this author on
Sciendo
|
Google Scholar
Demetrovics, J.
,
H. M. Quang
H. M. Quang
Viet Nam
Search for this author on
Sciendo
|
Google Scholar
Quang, H. M.
,
N. V. Anh
N. V. Anh
Viet Nam
Search for this author on
Sciendo
|
Google Scholar
Anh, N. V.
and
V. D. Thi
V. D. Thi
Viet Nam
Search for this author on
Sciendo
|
Google Scholar
Thi, V. D.
Apr 06, 2017
Cybernetics and Information Technologies
Volume 17 (2017): Issue 1 (March 2017)
About this article
Previous Article
Next Article
Abstract
References
Authors
Articles in this Issue
Preview
PDF
Cite
Share
Download Cover
Published Online:
Apr 06, 2017
Page range:
3 - 15
DOI:
https://doi.org/10.1515/cait-2017-0001
Keywords
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.
