BOSTER: An Efficient Algorithm for Mining Frequent Unordered Induced Subtrees

被引：0
|
作者：
School of Electrical Engineering and Computer Science, Queensland University of Technology, Brisbane, Australia [1 ]
机构：
[1] Chowdhury, Israt J.
[2] Nayak, Richi
来源：
| 1600年 / Springer Verlag卷 / 8786期
关键词：
D O I：
10.1007/978-3-319-11749-2_12
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [1] BOSTER: An Efficient Algorithm for Mining Frequent Unordered Induced Subtrees
    Chowdhury, Israt J.
    Nayak, Richi
    WEB INFORMATION SYSTEMS ENGINEERING - WISE 2014, PT I, 2014, 8786 : 146 - 155
  • [2] BEST: An Efficient Algorithm for Mining Frequent Unordered Embedded Subtrees
    Chowdhury, Israt Jahan
    Nayak, Richi
    PRICAI 2014: TRENDS IN ARTIFICIAL INTELLIGENCE, 2014, 8862 : 459 - 471
  • [3] BEST: An efficient algorithm for mining frequent unordered embedded subtrees
    Chowdhury, Israt Jahan, 1600, Springer Verlag (8862):
  • [4] UNI3 - efficient algorithm for mining unordered induced subtrees using TMG candidate generation
    Hadzic, Fedja
    Tan, Henry
    Dillon, Tharam S.
    2007 IEEE SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE AND DATA MINING, VOLS 1 AND 2, 2007, : 568 - 575
  • [5] 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 - +
  • [6] A fast algorithm for mining frequent ordered subtrees
    Hido, Shohei
    Kawano, Hiroyuki
    Systems and Computers in Japan, 2007, 38 (07) : 34 - 43
  • [7] Mining subtrees with frequent occurrence of similar subtrees
    Tosaka, Hisashi
    Nakamura, Atsuyoshi
    Kudo, Mineichi
    DISCOVERY SCIENCE, PROCEEDINGS, 2007, 4755 : 286 - +
  • [8] 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 - +
  • [9] A Fast Algorithm of Mining Induced Subtrees
    Li, Yun
    Guo, Xin
    Yuan, Yunhao
    Wu, Jia
    Chen, Ling
    2008 INTERNATIONAL CONFERENCE ON INFORMATION AND AUTOMATION, VOLS 1-4, 2008, : 195 - 199
  • [10] 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
12345