Sciweavers

Share
KDD
1998
ACM

Interestingness-Based Interval Merger for Numeric Association Rules

9 years 3 months ago
Interestingness-Based Interval Merger for Numeric Association Rules
We present an algorithm for mining association rules from relational tables containing numeric and categorical attributes. The approach is to merge adjacent intervals of numeric values, in a bottom-up manner, on the basis of maximizing the interestingness of a set of association rules. A modi cation of the B-tree is adopted for performing this task e ciently. The algorithm takes O(kN ) I/O time, where k is the number of attributes and N is the number of rows in the table. We evaluate the e ectiveness of producing good intervals.
Ke Wang, Soon Hock William Tay, Bing Liu
Added 06 Aug 2010
Updated 06 Aug 2010
Type Conference
Year 1998
Where KDD
Authors Ke Wang, Soon Hock William Tay, Bing Liu
Comments (0)
books