By Topic

Association Rules Mining Based on the Discriminative Concept Lattice

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
$33 $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

4 Author(s)
Shen Xiajiong ; Inst. of Data & Knowledge Eng., Henan Univ., Kaifeng, China ; Wang Peipei ; Wang Qian ; Zhou Bo

As a fundamental data mining task, frequent pattern mining has widespread applications in many different domains. Concept lattice is a very useful formal analysis tool. There is a one-to-one correspondence between concept intensions and frequent itemsets. Abundant literature has been conducted in-depth research in mining frequent itemsets and association rules based on the concept lattice. Most of them, however, did not take into account the differences of attributes when building concept lattice. In this paper, we present a new concept called discriminative attributes (discriminative intension). Every attributes has different discriminative power (DISP). In the process of building concept lattice, we can remove the attributes of low discriminative power, then speed up the step of constructing lattice. Furthermore, there has been a new method to calculate the DISP and reset the value under some conditions, but scan the database on each layer, which reduce the times of scanning the database, then decrease the time to generate association rules.

Published in:

Natural Computation, 2009. ICNC '09. Fifth International Conference on  (Volume:3 )

Date of Conference:

14-16 Aug. 2009