文章基本信息

标题：IDFP-TREE: AN EFFICIENT TREE FOR INTERACTIVE MINING OF FREQUENT SUBGRAPH PATTERNS
本地全文：下载
作者：MOHAMMAD H. NADIMI-SHAHRAKI ; MARYAM TAKI ; MOHAMMAD NADERI 等
期刊名称：Journal of Theoretical and Applied Information Technology
印刷版ISSN：1992-8645
电子版ISSN：1817-3195
出版年度：2015
卷号：74
期号：3
出版社：Journal of Theoretical and Applied
摘要：Recently, knowledge extraction from transactional graph databases by mining frequent subgraph patterns has become an interesting research topic. One of the important challenges in this topic is the situation called interactive mining in which the minimum support threshold can be frequently changed to find proper frequent subgraph patterns. Obviously, running the mining method from scratch is very costly. Therefore, in this paper, an efficient tree called IDFP-tree is proposed to develop our previous two-layer model for interactive mining of frequent subgraph patterns from transactional graph databases. The proposed tree constructs the mining model separated from the mining process. Thus, when the minimum support threshold is changed, there is no need to reconstruct the mining model, and only the mining process must be rerun. The experimental results show when the mining model is constructed by IDFP-tree, it can be frequently used and the total runtime of interactive mining of frequent subgraph patterns can be reduced.
关键词：Interactive Mining; Graph Mining; Transactional Graph; Frequent Subgraph Pattern