Presentation 2007-06-28
Finding of Frequent Similar Subtrees in Tree-Structured Data
Hisashi TOSAKA, Atsuyoshi NAKAMURA, Mineichi KUDO,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) We study a novel problem of mining subtrees with frequent occurrence of similar subtrees, and propose an efficient algorithm for this problem. According to our problem setting, frequency of a subtree is counted not only for equivalent subtrees but also for similar subtrees. Our experiment showed that our algorithm is enough fast for practical use. Preliminary experiment for data record extraction using our mining method also showed encouraging result.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Frequent subtree mining / Labeled ordered trees / Similar subtree / Tree alignment distance
Paper # DE2007-2,PRMU2007-28
Date of Issue

Conference Information
Committee DE
Conference Date 2007/6/21(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Data Engineering (DE)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Finding of Frequent Similar Subtrees in Tree-Structured Data
Sub Title (in English)
Keyword(1) Frequent subtree mining
Keyword(2) Labeled ordered trees
Keyword(3) Similar subtree
Keyword(4) Tree alignment distance
1st Author's Name Hisashi TOSAKA
1st Author's Affiliation Graduate School of Information Science and Technology Hokkaido University()
2nd Author's Name Atsuyoshi NAKAMURA
2nd Author's Affiliation Graduate School of Information Science and Technology Hokkaido University
3rd Author's Name Mineichi KUDO
3rd Author's Affiliation Graduate School of Information Science and Technology Hokkaido University
Date 2007-06-28
Paper # DE2007-2,PRMU2007-28
Volume (vol) vol.107
Number (no) 114
Page pp.pp.-
#Pages 6
Date of Issue