| 演題番号 | 3C1-4 |
|---|---|
| 題目 | 部分木制約付き頻出飽和木パターン発見 |
| 著者 | Nguyen Viet Anh(京都大学) 土井 晃一郎(京都大学) 山本 章博(京都大学 大学院情報学研究科) |
| 時間 | 06月19日(Fri) 10:00〜10:20 |
| 概要 | Two critical bottle necks in mining frequent tree patterns from tree databases are the exponential number of mined patterns and the lack of user focus on the mining process. We propose, in this paper, an algorithm that solves the problems for unordered attribute trees by mining only the compact representation of tree patterns, i.e. closed tree patterns, and allows users to mine only trees of their interest by specifying subtree constraints. The experimental results show the efficiency of our algorithm. |
| 論文 | PDFファイル |