Efficient mining of closed induced ordered subtrees in tree-structured databases

被引：0
|
作者：
Ozaki, Tomonobu [1 ]
Ohkawa, Takenao [1 ]
机构：
[1] Kobe Univ, Grad Sch Sci & Technol, 1-1 Rokkodai, Kobe, Hyogo 6758501, Japan
来源：
ICDM 2006: SIXTH IEEE INTERNATIONAL CONFERENCE ON DATA MINING, WORKSHOPS | 2006年
关键词：
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
In this paper, two new closed ordered subtree miners are given which are based on the breadth first and depth first/breadth-first enumeration strategy, respectively. Through the experiments with synthesized and real world data, we discuss the effects of the difference of the search strategies in mining closed induced ordered subtrees.
引用
收藏
页码：279 / +
页数：2
相关论文
共 50 条
  • [1] AMIOT: Induced ordered tree mining in tree-structured databases
    Hido, S
    Kawano, H
    [J]. FIFTH IEEE INTERNATIONAL CONFERENCE ON DATA MINING, PROCEEDINGS, 2005, : 170 - 177
  • [2] Mining Mutually Dependent Ordered Subtrees in Tree Databases
    Ozaki, Tomonobu
    Ohkawa, Takenao
    [J]. NEW FRONTIERS IN APPLIED DATA MINING, 2009, 5433 : 75 - +
  • [3] Complete Discovery of Weighted Frequent Subtrees in Tree-Structured Datasets
    AliMohammadzadeh, Rahman
    Zarnani, Ashkan
    Rahgozar, Masoud
    Chehreghani, Mostafa H.
    [J]. INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND NETWORK SECURITY, 2006, 6 (8A): : 188 - 196
  • [4] Mining of closed frequent subtrees from frequently updated databases
    Viet Anh Nguyen
    Yamamoto, Akihiro
    [J]. INTELLIGENT DATA ANALYSIS, 2012, 16 (06) : 953 - 967
  • [5] Deriving tree-structured network relations in bibliographic databases
    Kongthon, Alisa
    Angkawattanawit, Niran
    [J]. ASIAN DIGITAL LIBRARIES: LOOKING BACK 10 YEARS AND FORGING NEW FRONTIERS, PROCEEDINGS, 2007, 4822 : 504 - 505
  • [6] Mining Tree-Structured Data on Multicore Systems
    Tatikonda, Shirish
    Parthasarathy, Srinivasan
    [J]. PROCEEDINGS OF THE VLDB ENDOWMENT, 2009, 2 (01):
  • [7] Detecting irrelevant subtrees to improve probabilistic learning from tree-structured data
    Habrard, A
    Bernard, M
    Sebban, M
    [J]. FUNDAMENTA INFORMATICAE, 2005, 66 (1-2) : 103 - 130
  • [8] EFFICIENT MINING OF CLOSED TREE PATTERNS FROM LARGE TREE DATABASES WITH SUBTREE CONSTRAINT
    Viet Anh Nguyen
    Doi, Koichiro
    Yamamoto, Akihiro
    [J]. INTERNATIONAL JOURNAL ON ARTIFICIAL INTELLIGENCE TOOLS, 2012, 21 (06)
  • [9] Performance evaluation of closed tree-structured assembly systems
    Hazra, J
    Seidmann, A
    [J]. IIE TRANSACTIONS, 1996, 28 (07) : 591 - 599
  • [10] An efficient algorithm for drawing tree-structured diagrams
    Hayashi, K
    Masuda, S
    Tanaka, E
    [J]. ELECTRONICS AND COMMUNICATIONS IN JAPAN PART III-FUNDAMENTAL ELECTRONIC SCIENCE, 1997, 80 (05): : 31 - 41
12345