Mining Level-Crossing Association Rules from Large Databases
نویسندگان
چکیده
Existing algorithms for mining association rule at multiple concept level, restricted mining strong association among the concept at same level of a hierarchy. However mining level-crossing association rule at multiple concept level may lead to the discovery of mining strong association among at different level of hierarchy. In this study, a top-down progressive deepening method is developed for mining level-crossing association rules in large transaction databases by extension of some existing multiple-level association rule mining techniques. This method is using concept of reduced support and refine the transaction table at each level.
منابع مشابه
Mining Multiple-Level Association Rules in Large Databases
ÐA top-down progressive deepening method is developed for efficient mining of multiple-level association rules from large transaction databases based on the Apriori principle. A group of variant algorithms is proposed based on the ways of sharing intermediate results, with the relative performance tested and analyzed. The enforcement of different interestingness measurements to find more intere...
متن کاملDiscovery of Multiple-Level Association Rules from Large Databases
Discovery of association rules from large databases has been a focused topic recently in the research into database mining. Previous studies discover association rules at a single concept level, however, mining association rules at multiple concept levels may lead to nding more informative and re ned knowledge from data. In this paper, we study e cient methods for mining multiple-level associat...
متن کامل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 ...
متن کاملMeta-Rule-Guided Mining of Association Rules in Relational Databases
A metarule guided data mining approach is proposed and studied which applies metarules as a guidance at nding multiple-level association rules in large relational databases. A metarule is a rule template in the form of \P1 ^ ^ Pm ! Q1^ ^Qn", in which some of the predicates (and/or their variables) in the antecedent and/or consequent of the metarule could be instantiated. The rule template is us...
متن کاملIntroducing an algorithm for use to hide sensitive association rules through perturb technique
Due to the rapid growth of data mining technology, obtaining private data on users through this technology becomes easier. Association Rules Mining is one of the data mining techniques to extract useful patterns in the form of association rules. One of the main problems in applying this technique on databases is the disclosure of sensitive data by endangering security and privacy. Hiding the as...
متن کامل