期刊名称：International Journal of Electronics Communication and Computer Engineering
印刷版ISSN：2249-071X
电子版ISSN：2278-4209
出版年度：2012
卷号：3
期号：3
页码：537-542
出版社：IJECCE
摘要：A novel approach is presented for effectively mining frequent Item sets and association rules (ARs) based on fuzzy Apriori and weighted fuzzy Apriori. The authors address the issue of invalidation of downward closure property (DCP) in weighted association rule mining where each item is assigned a weight according to its significance With respective to some user defined criteria. Most works on weighted association rule mining do not address the downward closure property while some make assumptions to validate the property. This chapter generalizes the weighted association rule mining problem with binary and fuzzy attributes with weighted settings. Their methodology follows an Apriori approach but employs T-tree data structure to improve efficiency of counting itemsets. The authors’ approach avoids pre and post processing as opposed to most weighted association rule mining algorithms, thus eliminating the extra steps during rules generation. We generalize the problem of downward closure property and propose a fuzzy weighted support and Confidence framework for Boolean and quantitative items with weighted settings. The problem of invalidation of the DCP is solved using an improved model of weighted support and confidence framework for classical and fuzzy association rule mining. The proposed approach uses both binary data and fuzzy data and generates Frequent Item Sets. This paper presents experimental results on both synthetic and real-data sets and a discussion on evaluating the proposed approach
