人工知能学会論文誌
Online ISSN : 1346-8030
Print ISSN : 1346-0714
ISSN-L : 1346-0714
原著論文
負の相関ルールを抽出する高速トップダウン型アルゴリズム
井出 典子岩沼 宏治山本 泰生
著者情報
ジャーナル フリー

2014 年 29 巻 4 号 p. 406-415

詳細
抄録

Negative association rules represent some relationships between presence and absence of itemsets. In general, the number of negative association rules is enormously huge even if compared with that of positive association rules. Therefore, an efficient mining method is quite important. In this paper, we propose a novel top-down mining method for negative association rules in the forms of X ⇒¬Y and ¬XY. The proposed method search a suffix tree over frequent itemsets in a top-down manner, and efficiently extract all of valid negative rules of these two types, step by step. The suffix tree plays very important roles for effectively pruning a lot of redundant searches such as the one producing non-minimal valid negative rules. We also show some good results of experiments for evaluating our proposed method. The proposed method is given for simple negative rule mining based on the support and confidence measures, therefore is definitely the most fundamental and important framework, into which additional measures can be easily introduced if necessary.

著者関連情報
© 人工知能学会 2014
前の記事 次の記事
feedback
Top