CMTreeMiner: Mining both closed and maximal frequent subtrees

被引:0
|
作者
Chi, Y [1 ]
Yang, YR [1 ]
Xia, Y [1 ]
Muntz, RR [1 ]
机构
[1] Univ Calif Los Angeles, Los Angeles, CA 90095 USA
关键词
frequent subtree; closed subtree; maximal subtree; enumeration tree; rooted unordered tree;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Tree structures are used extensively in domains such as computational biology, pattern recognition, XML databases, computer networks, and so on. One important problem in mining databases of trees is to find frequently occurring subtrees. However, because of the combinatorial explosion, the number of frequent subtrees usually grows exponentially with the size of the subtrees. In this paper, we present CMTreeMiner, a computationally efficient algorithm that discovers all closed and maximal frequent subtrees in a database of rooted unordered trees. The algorithm mines both closed and maximal frequent subtrees by traversing an enumeration tree that systematically enumerates all subtrees, while using an enumeration DAG to prune the branches of the enumeration tree that do not correspond to closed or maximal frequent subtrees. The enumeration tree and the enumeration DAG are defined based on a canonical form for rooted unordered trees-the depth-first canonical form (DFCF). We compare the performance of our algorithm with that of PathJoin, a recently published algorithm that mines maximal frequent subtrees.
引用
收藏
页码:63 / 73
页数:11
相关论文
共 50 条
  • [1] Mining maximal and closed frequent free subtrees
    Guo, Ping
    Hou, Yang Z.
    Zhuang, Jun
    DYNAMICS OF CONTINUOUS DISCRETE AND IMPULSIVE SYSTEMS-SERIES B-APPLICATIONS & ALGORITHMS, 2007, 14 : 198 - 205
  • [2] Mining closed and maximal frequent induced free subtrees
    Shiozaki, Hitohiro
    Ozaki, Tomonobu
    Ohkawa, Takenao
    ICDM 2006: SIXTH IEEE INTERNATIONAL CONFERENCE ON DATA MINING, WORKSHOPS, 2006, : 14 - +
  • [3] An efficient algorithm for mining both closed and maximal frequent free subtrees using canonical forms
    Guo, P
    Zhou, Y
    Zhuang, J
    Chen, T
    Kang, YR
    ADVANCED DATA MINING AND APPLICATIONS, PROCEEDINGS, 2005, 3584 : 96 - 107
  • [4] Incremental Mining of Closed Frequent Subtrees
    Viet Anh Nguyen
    Yamamoto, Akihiro
    DISCOVERY SCIENCE, DS 2010, 2010, 6332 : 356 - 370
  • [5] Mining closed and maximal frequent subtrees from databases of labeled rooted trees
    Chi, Y
    Xia, Y
    Yang, YR
    Muntz, RR
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2005, 17 (02) : 190 - 202
  • [6] Efficient data mining for maximal frequent subtrees
    Xiao, YQ
    Yao, JF
    Li, ZG
    Dunham, MH
    THIRD IEEE INTERNATIONAL CONFERENCE ON DATA MINING, PROCEEDINGS, 2003, : 379 - +
  • [7] Mining closed and maximal frequent embedded subtrees using length-decreasing support constraint
    Ji, Gen-Lin
    Zhu, Ying-Wen
    PROCEEDINGS OF 2008 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-7, 2008, : 268 - 273
  • [8] Mining of closed frequent subtrees from frequently updated databases
    Viet Anh Nguyen
    Yamamoto, Akihiro
    INTELLIGENT DATA ANALYSIS, 2012, 16 (06) : 953 - 967
  • [9] Mining subtrees with frequent occurrence of similar subtrees
    Tosaka, Hisashi
    Nakamura, Atsuyoshi
    Kudo, Mineichi
    DISCOVERY SCIENCE, PROCEEDINGS, 2007, 4755 : 286 - +
  • [10] Mining closed and maximal frequent subtrees from databases of labeled rooted trees (vol 17, pg 190, 2005)
    Chi, Y
    Xia, Y
    Yang, YR
    Muntz, RR
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2005, 17 (12) : 1737 - 1737