Abstract—Mining association rules is an important task in data mining. It discovers the hidden, interesting relationships (associations) between items in the database based on the user-specified support and confidence thresholds. In order to find relevant associations one has to specify an appropriate support threshold. The support threshold plays an important role in deciding the number of appropriate rules found. The rare associations will not appear if a high threshold is set. Some uninteresting associations may appear if a low threshold is set. This paper proposes an approach to obtain the appropriate support thresholds at each level of the level-wise mining approach. It sets the support threshold by analyzing the frequency of items and their associations in the database at each level. Experimental results show that this approach produces the interesting rules without specifying the user specified support threshold.
Index Terms—Association rules, Collective Support, Dynamic Support, Frequent itemset
C S Kanimozhiselvi, Assistant Professor, Department of Computer Science and Engineering, Kongu Engineering College, Perundurai 638 052 Erode, Tamilnadu, India Phone: 91-09842168224; e-mail: kani_abi@yahoo.co.in.
A Tamilarasi, Professor, Department of Computer Science and Engineering, Kongu Engineering College, Perundurai 638 052 Erode, Tamilnadu, India; e-mail: drtamil@kongu.ac.in.
Cite: C S Kanimozhi Selvi and A Tamilarasi, "Mining Association rules with Dynamic and Collective Support Thresholds," International Journal of Engineering and Technology vol. 1, no. 3, pp. 236-240, 2009.
Copyright © 2008-2024. International Journal of Engineering and Technology. All rights reserved.
E-mail: ijet_Editor@126.com