人工知能学会論文誌
Online ISSN : 1346-8030
Print ISSN : 1346-0714
ISSN-L : 1346-0714
論文
限定的出現マッチを利用した逆単調制約付き頻出飽和順序木の発見
尾崎 知伸大川 剛直
著者情報
ジャーナル フリー

2008 年 23 巻 2 号 p. 58-67

詳細
抄録

As semi-structured data is used widely in several fields, the importance of structured data mining is increasing recently. Although mining frequent patterns in structured data is one of the most fundamental tasks, frequent pattern miners often discover huge number of patterns. To overcome this problem, two major approaches, condensed representation mining and constraint-based mining, have been proposed. In this paper, as a technique for integrating these two approaches, we propose three algorithms, RCLOCOT, posCLOCOT, and negCLOCOT, for discovering closed ordered subtrees under anti-monotone constraints about the structure of patterns to be discovered. The proposed algorithms discover closed constrained subtrees efficiently not by post-processing but by pruning and skipping the search space based on the occurrence matching and the patterns on the border.

著者関連情報
© 2008 JSAI (The Japanese Society for Artificial Intelligence)
次の記事
feedback
Top