By Topic

Mining quantitative association rules under inequality constraints

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

2 Author(s)
Charles Lo ; Dept. of Comput., Hong Kong Polytech., Hong Kong ; Ng, V.

In the past several years, there has been much active work in developing algorithms for mining association rules. However, in many real-life situations, not all association rules are of interest to the user. A user may want to find association rules which satisfy a given inequality constraint for a set of quantitative items. In other words, users are more interested in the subsets of those associations. We present how to integrate the inequality constraints into the mining process and reduce the number of database scannings. The algorithm we present generates the large itemsets by building the expression tree and prunes away the undesired one by checking the acceptance range. In our work, we consider constraints of arithmetic inequalities which are composed of common operators such as +, -, *, and /. Preliminary experimental results of the algorithm in comparison with the classical a-priori algorithm are also reported

Published in:

Knowledge and Data Engineering Exchange, 1999. (KDEX '99) Proceedings. 1999 Workshop on

Date of Conference: