Article,

Mining Association Rules between Sets of Items in Large Databases

, , and .
International Journal of Innovative Science and Modern Engineering (IJISME), 1 (5): 24-27 (April 2013)

Abstract

In Data Mining, the usefulness of association rules is strongly limited by the huge amount of delivered rules. To overcome this drawback, several methods were proposed in the literature such as item set concise representations, redundancy reduction, and post processing. However, being generally based on statistical information, most of these methods do not guarantee that the extracted rules are interesting for the user. Thus, it is crucial to help the decision-maker with an efficient post processing step in order to reduce the number of rules. This paper proposes a new interactive approach to prune and filter discovered rules. First, we propose to use ontologies in order to improve the integration of user knowledge in the post processing task. Second, we propose the Rule Schema formalism extending the specification language proposed by Liu et al. for user expectations. Furthermore, an interactive framework is designed to assist the user throughout the analyzing task. Applying our new approach over voluminous sets of rules, we were able, by integrating domain expert knowledge in the post processing step, to reduce the number of rules to several dozens or less. Moreover, the quality of the filtered rules was validated by the domain expert at various points in the interactive process.

Tags

Users

  • @ijisme_beiesp

Comments and Reviewsshow / hide

  • @ijisme_beiesp
    3 years ago (last updated 3 years ago)
    good
Please log in to take part in the discussion (add own reviews or comments).