2008年
A fast algorithm for cofactor implication checking and its application for knowledge discovery
Proceedings - 2008 IEEE 8th International Conference on Computer and Information Technology, CIT 2008
- 開始ページ
- 53
- 終了ページ
- 58
- 記述言語
- 英語
- 掲載種別
- 研究論文(国際会議プロシーディングス)
- DOI
- 10.1109/CIT.2008.4594649
In this paper, we propose a new method for discovering hidden information from large-scale transaction databases by considering a property of cofactor implication. Cofactor implication is an extension or generalization of symmetric itemsets, which has been presented recently. Here we discuss the meaning of cofactor implication for the data mining applications, and show an efficient algorithm of extracting all non-trivial item pairs with cofactor implication by using Zero-suppressed Binary Decision Diagrams (ZBDDs). We show an experimental result to see how many itemsets can be extracted by using cofactor implication, compared with symmetric itemset mining. Our result shows that the use of cofactor implication has a possibility of discovering a new aspect of structural information hidden in the databases. © 2008 IEEE.
- ID情報
-
- DOI : 10.1109/CIT.2008.4594649
- SCOPUS ID : 51849093086