TY - JOUR

T1 - Mining optimized association rules for numeric attributes

AU - Fukuda, Takeshi

AU - Morimoto, Yasuhiko

AU - Morishita, Shinichi

AU - Tokuyama, Takeshi

PY - 1999/2

Y1 - 1999/2

N2 - Given a huge database, we address the problem of finding association rules for numeric attributes, such as (Balance ∈I)⇒(CardLoan=yes), which implies that bank customers whose balances fall in a range I are likely to use card loan with a probability greater than p. The above rule is interesting only if the range I has some special feature with respect to the interrelation between Balance and CardLoan. It is required that the number of customers whose balances are contained in I (called the support of I) is sufficient and also that the probability p of the condition CardLoan= yes being met (called the confidence ratio) be much higher than the average probability of the condition over all the data. Our goal is to realize a system that finds such appropriate ranges automatically. We mainly focus on computing two optimized ranges: one that maximizes the support on the condition that the confidence ratio is at least a given threshold value, and another that maximizes the confidence ratio on the condition that the support is at least a given threshold number. Using techniques from computational geometry, we present novel algorithms that compute the optimized ranges in linear time if the data are sorted. Since sorting data with respect to each numeric attribute is expensive in the case of huge databases that occupy much more space than the main memory, we instead apply randomized bucketing as the preprocessing method and thus obtain an efficient rule-finding system. Tests show that our implementation is fast not only in theory but also in practice. The efficiency of our algorithm enables us to compute optimized rules for all combinations of hundreds of numeric and Boolean attributes in a reasonable time.

AB - Given a huge database, we address the problem of finding association rules for numeric attributes, such as (Balance ∈I)⇒(CardLoan=yes), which implies that bank customers whose balances fall in a range I are likely to use card loan with a probability greater than p. The above rule is interesting only if the range I has some special feature with respect to the interrelation between Balance and CardLoan. It is required that the number of customers whose balances are contained in I (called the support of I) is sufficient and also that the probability p of the condition CardLoan= yes being met (called the confidence ratio) be much higher than the average probability of the condition over all the data. Our goal is to realize a system that finds such appropriate ranges automatically. We mainly focus on computing two optimized ranges: one that maximizes the support on the condition that the confidence ratio is at least a given threshold value, and another that maximizes the confidence ratio on the condition that the support is at least a given threshold number. Using techniques from computational geometry, we present novel algorithms that compute the optimized ranges in linear time if the data are sorted. Since sorting data with respect to each numeric attribute is expensive in the case of huge databases that occupy much more space than the main memory, we instead apply randomized bucketing as the preprocessing method and thus obtain an efficient rule-finding system. Tests show that our implementation is fast not only in theory but also in practice. The efficiency of our algorithm enables us to compute optimized rules for all combinations of hundreds of numeric and Boolean attributes in a reasonable time.

UR - http://www.scopus.com/inward/record.url?scp=0033076953&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0033076953&partnerID=8YFLogxK

U2 - 10.1006/jcss.1998.1595

DO - 10.1006/jcss.1998.1595

M3 - Article

AN - SCOPUS:0033076953

VL - 58

SP - 1

EP - 12

JO - Journal of Computer and System Sciences

JF - Journal of Computer and System Sciences

SN - 0022-0000

IS - 1

ER -