Discovering Non-Redundant Association Rules using MinMax Approximation Rules
نویسنده
چکیده
Dept. Of Comp. Sci. & Eng. Vaagdevi college of Eng. Warangal, India [email protected] Abstract Frequent pattern mining is an important area of data mining used to generate the Association Rules. The extracted Frequent Patterns quality is a big concern, as it generates huge sets of rules and many of them are redundant. Mining Non-Redundant Frequent patterns is a big concern in the area of Association rule mining. In this paper we proposed a method to eliminate the redundant Frequent patterns using MinMax rule approach, to generate the quality Association Rules.
منابع مشابه
MARBLES: Mining Association Rules Buried in Long Event Sequences
Sequential pattern discovery is a well-studied field in data mining. Episodes are sequential patterns that describe events that often occur in the vicinity of each other. Episodes can impose restrictions on the order of the events, which makes them a versatile technique for describing complex patterns in the sequence. Most of the research on episodes deals with special cases such as serial and ...
متن کاملMining Condensed Non-Redundant Level-Crossing Approximate Association Rules
In association rule mining one intractable problem is the huge number of the extracted rules, especially, in the case of level-crossing association rules. In this paper, aiming at the redundancy produced during level-crossing association rules mining, an approach for eliminating level-crossing approximate redundant rules is proposed. In the method, the redundancies are divided combination with ...
متن کاملReliable representations for association rules
Association rule mining has contributed to many advances in the area of knowledge discovery. However, the quality of the discovered association rules is a big concern and has drawn more and more attention recently. One problem with the quality of the discovered association rules is the huge size of the extracted rule set. Often for a dataset, a huge number of rules can be extracted, but many of...
متن کاملMining Top-K Non-redundant Association Rules
Association rule mining is a fundamental data mining task. However, depending on the choice of the thresholds, current algorithms can become very slow and generate an extremely large amount of results or generate too few results, omitting valuable information. Furthermore, it is well-known that a large proportion of association rules generated are redundant. In previous works, these two problem...
متن کاملA Novel Method of Mining Association Rule with Multilevel Concept Hierarchy
In data mining, there are several works proposed for mining the association rules which are frequent. Researchers argue that mining the infrequent item sets are also important in certain applications. Discovering association rules are based on the preset minimum support threshold given by domain experts. The accuracy in setting up this threshold directly influences the number and the quality of...
متن کامل