Generally, the study of association mining is majority concentrate on how to find out the frequent item set and attempt to infer the relationship between them. But very few studies deliberate about the two notable issues. The one is the huge number of association rules, which easily caused the decision maker to get lost in it. The other is the general association rules, which just imply the relationship with “AND” logic between items, but not imply the relation with “OR” and “XOR” logic between items. In this paper, we apply Karnaugh Map (K-Map) principle to find out ensemble association rules by experiment transaction data, it names „ARKM‟. The experiment result shows that the ARKM approach which not only provides computational efficiency to obtain simplified and usable rules but also manifest adaptive to the decision maker.
Yi-Chun Lin, Chun-Min Hung, and Yueh-Min Huang*, “Mining Ensemble Association Rules by Karnaugh Map,” 2009 World Congress on Computer Science and Information Engineering (CSIE 2009), Los Angeles/Anaheim, USA, 2009. Accepted. (NSC 96-2221-E-168-030)