An efficient discovery of class-restricted MARs

  • Authors:
  • Hyontai Sug

  • Affiliations:
  • Division of Computer & Information Engineering, Dongseo University, Busan, Republic of Korea

  • Venue:
  • AIKED'11 Proceedings of the 10th WSEAS international conference on Artificial intelligence, knowledge engineering and data bases
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Because the target databases of conventional multidimensional association rule algorithms have no distinction in the role of attributes, a lot of rules can be found and the computing time can be enormous. So, some efficient way is needed to find multidimensioanl associaton rules for a specific class for target database table that has a decision attribute and many conditional attributes. In order to overcome the problem of intensive computig time and possibily generating a lot of unintersting rules, a preprocessing technique that can narrow down the search space is suggested. The method can generate smaller table for multidimensioanl association rule so that computing time can be saved and smaller number of rules are generated. Experiments with a real world data set showed a very good result.