By Topic

A fast algorithm for cofactor implication checking and its application for knowledge discovery

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Minato, S. ; Grad. Sch. of Inf. Sci. & Technol., Hokkaido Univ., Sapporo

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 item set 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.

Published in:

Computer and Information Technology, 2008. CIT 2008. 8th IEEE International Conference on

Date of Conference:

8-11 July 2008