An Efficient Algorithm for Mining Ranged Association Rules

영역 연관규칙 탐사를 위한 효율적 알고리즘

  • 조일래 (순천공업전문대학 전자계산과)
  • Published : 1997.12.01


Some association rules can have very high confidence in a sub-interval or a subrange of the domain, though not quite high confidence in the whole domain. In this paper, we define a ranged association rule, an association with high confidence worthy of special attention in a sub-domain, and further propose an efficient algorithm which finds out ranged association rules. The proposed algorithm is data-driven method in a sense that hypothetical subranges are built based on data distribution itself. In addition, to avoid redundant database scanning, we devise an effective in-memory data structure, that is collected through single database scanning. The simulation shows that the suggested algorithm has reliable performance at the acceptable time cost in actual application areas.