Mining subtrees with frequent occurrence of similar subtrees

被引：0

作者：

Tosaka, Hisashi ^{[1
]}

Nakamura, Atsuyoshi ^{[1
]}

Kudo, Mineichi ^{[1
]}

机构：

[1] Hokkaido Univ, Grad Sch Informat Sci & Technol, Kita Ku, Kita 14,Nishi 9, Sapporo, Hokkaido 0600814, Japan

来源：

DISCOVERY SCIENCE, PROCEEDINGS | 2007年 / 4755卷

关键词：

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

We study a novel problem of mining subtrees with frequent occurrence of similar subtrees, and propose an algorithm for this problem. In our problem setting, frequency of a subtree is counted not only for equivalent subtrees but also for similar subtrees. According to our experiment using tag trees of web pages, this problem can be solved fast enough for practical use. An encouraging result was obtained in a preliminary experiment for data record extraction from web pages using our mining method.

引用

页码：286 / +

页数：2

共 50 条

[1] Mining Compressed Frequent Subtrees Set
ZHAO Chuanshen1
2. School of Computer Science and Engineering
3. Department of Computer
[J]. Wuhan University Journal of Natural Sciences, 2009, 14 (01) : 29 - 34
[2] Incremental Mining of Closed Frequent Subtrees
Viet Anh Nguyen
Yamamoto, Akihiro
[J]. DISCOVERY SCIENCE, DS 2010, 2010, 6332 : 356 - 370
[3] Mining Frequent Agreement Subtrees in Phylogenetic Databases
Zhang, Sen
Wang, Jason T. L.
[J]. PROCEEDINGS OF THE SIXTH SIAM INTERNATIONAL CONFERENCE ON DATA MINING, 2006, : 222 - +
[4] Mining maximal and closed frequent free subtrees
Guo, Ping
Hou, Yang Z.
Zhuang, Jun
[J]. DYNAMICS OF CONTINUOUS DISCRETE AND IMPULSIVE SYSTEMS-SERIES B-APPLICATIONS & ALGORITHMS, 2007, 14 : 198 - 205
[5] Efficient data mining for maximal frequent subtrees
Xiao, YQ
Yao, JF
Li, ZG
Dunham, MH
[J]. THIRD IEEE INTERNATIONAL CONFERENCE ON DATA MINING, PROCEEDINGS, 2003, : 379 - +
[6] A fast algorithm for mining frequent ordered subtrees
Hido, Shohei
Kawano, Hiroyuki
[J]. Systems and Computers in Japan, 2007, 38 (07) : 34 - 43
[7] CMTreeMiner: Mining both closed and maximal frequent subtrees
Chi, Y
Yang, YR
Xia, Y
Muntz, RR
[J]. ADVANCES IN KNOWLEDGE DISCOVERY AND DATA MINING, PROCEEDINGS, 2004, 3056 : 63 - 73
[8] Mining closed and maximal frequent induced free subtrees
Shiozaki, Hitohiro
Ozaki, Tomonobu
Ohkawa, Takenao
[J]. ICDM 2006: SIXTH IEEE INTERNATIONAL CONFERENCE ON DATA MINING, WORKSHOPS, 2006, : 14 - +
[9] A novel method for mining frequent subtrees from XML data
Zhang, WS
Liu, DX
Zhang, JP
[J]. INTELLIGENT DATA ENGINEERING AND AUTOMATED LEARNING IDEAL 2004, PROCEEDINGS, 2004, 3177 : 300 - 305
[10] BEST: An Efficient Algorithm for Mining Frequent Unordered Embedded Subtrees
Chowdhury, Israt Jahan
Nayak, Richi
[J]. PRICAI 2014: TRENDS IN ARTIFICIAL INTELLIGENCE, 2014, 8862 : 459 - 471

← 1 2 3 4 5 →