Presentation | 2004-10-15 Mining Frequent Trees with Node-Inclusion Constraints Atsuyoshi NAKAMURA, Mineichi KUDO, |
---|---|
PDF Download Page | PDF download Page Link |
Abstract(in Japanese) | (See Japanese page) |
Abstract(in English) | In this paper, we propose an efficient algorithm enumerating all frequent subtrees containing all special nodes that are guaranteed to be included in all trees belonging to a given data. Our algorithm is a modification of TreeMiner algorithm [9] so as to efficiently generate only candidate subtrees satisfying our constraints. We also propose a space saving method for a set of trees with a lot of nodes having the same label. We report mining results obtained by applying our algorithm to the problem of finding frequent structures containing the name and reputation of given restaurants in Web pages collected by a search engine. |
Keyword(in Japanese) | (See Japanese page) |
Keyword(in English) | freequent tree / minimum support / constraint / Web mining |
Paper # | COMP2004-44 |
Date of Issue |
Conference Information | |
Committee | COMP |
---|---|
Conference Date | 2004/10/8(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 | Theoretical Foundations of Computing (COMP) |
---|---|
Language | ENG |
Title (in Japanese) | (See Japanese page) |
Sub Title (in Japanese) | (See Japanese page) |
Title (in English) | Mining Frequent Trees with Node-Inclusion Constraints |
Sub Title (in English) | |
Keyword(1) | freequent tree |
Keyword(2) | minimum support |
Keyword(3) | constraint |
Keyword(4) | Web mining |
1st Author's Name | Atsuyoshi NAKAMURA |
1st Author's Affiliation | Graduate School of Information Science and Technology, Hokkaido University() |
2nd Author's Name | Mineichi KUDO |
2nd Author's Affiliation | Graduate School of Information Science and Technology, Hokkaido University |
Date | 2004-10-15 |
Paper # | COMP2004-44 |
Volume (vol) | vol.104 |
Number (no) | 339 |
Page | pp.pp.- |
#Pages | 8 |
Date of Issue |