TBAR: An efficient method for association rule mining in relational databases
نویسندگان
چکیده
In this paper, we propose a new algorithm for ecient association rule mining, which we apply in order to discover interesting patterns in relational databases. Our algorithm, which is called Tree-Based Association Rule mining (TBAR), rede®nes the notion of item and employs an eective tree data structure. It can also use techniques such as Direct Hashing and Pruning (DHP). Experiments with real-life datasets show that TBAR outperforms Apriori, a well-known and widely used algorithm.
منابع مشابه
On Efficient and Effective Association Rule Mining from XML Data
In this paper, we propose a framework, called XAR-Miner, for mining ARs from XML documents efficiently and effectively. In XAR-Miner, raw XML data are first transformed to either an Indexed Content Tree (IX-tree) or Multi-relational databases (Multi-DB), depending on the size of XML document and memory constraint of the system, for efficient data selection in the AR mining. Concepts that are re...
متن کاملA new approach based on data envelopment analysis with double frontiers for ranking the discovered rules from data mining
Data envelopment analysis (DEA) is a relatively new data oriented approach to evaluate performance of a set of peer entities called decision-making units (DMUs) that convert multiple inputs into multiple outputs. Within a relative limited period, DEA has been converted into a strong quantitative and analytical tool to measure and evaluate performance. In an article written by Toloo et al. (2009...
متن کاملMining Association Rules of Simple Conjunctive Queries
We present an algorithm for mining association rules in arbitrary relational databases. We define association rules over a simple, but appealing subclass of conjunctive queries, and show that many interesting patterns can be found. We propose an efficient algorithm and a database-oriented implementation in SQL, together with several promising and convincing experimental results.
متن کامل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...
متن کاملImplementation of Multidimensional Index Structures for Knowledge Discovery in Relational Databases
Efficient query processing is one of the basic needs for data mining algorithms. Clustering algorithms, association rule mining algorithms and OLAP tools all rely on efficient query processors being able to deal with high-dimensional data. Inside such a query processor, multidimensional index structures are used as a basic technique. As the implementation of such an index structures is a diffic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Data Knowl. Eng.
دوره 37 شماره
صفحات -
تاریخ انتشار 2001