scholarly journals A Comparison Between Rule Based and Association Rule Mining Algorithms

2009 ◽  
Author(s):  
Mohammed M. Mazid ◽  
A.B.M. Shawkat Ali ◽  
Kevin S. Tickle
Keyword(s):  
Association Rule ◽  
Association Rule Mining ◽  
Rule Mining ◽  
Rule Based ◽  
Mining Algorithms

Algorithm of Mining Association Rule Based on Matrix

2014 ◽  
Vol 513-517 ◽  
pp. 786-791
Author(s):  
Zi Zhi Lin ◽  
Si Hui Shu ◽  
Yun Ding
Keyword(s):  
Association Rule ◽  
Association Rule Mining ◽  
Frequent Itemsets ◽  
Rule Mining ◽  
Rule Based ◽  
Data Mining Algorithms ◽  
Transaction Database ◽  
Temporal And Spatial ◽  
Mining Algorithms ◽  
Mining Association Rule

Association rule mining is one of the most important techniques of data mining. Algorithms based on matrix are efficient due to only scanning the transaction database for one time. In this paper, an algorithm of association rule mining based on the compression matrix is given. It mainly compresses the transaction matrix by integrating various strategies and fleetly finds frequent itemsets. The new algorithm optimizes the known algorithms of mining association rule based on matrix given by some researchers in recent years, which greatly reduces the temporal and spatial complexity, and highly promotes the efficiency of finding frequent itemsets.

scholarly journals Present State-of-The-Art of Association Rule Mining Algorithms

2019 ◽  
Vol 9 (1) ◽  
pp. 6398-6405
Keyword(s):  
Data Mining ◽  
Association Rule ◽  
Association Rule Mining ◽  
State Of The Art ◽  
Synthetic Data ◽  
Data Sets ◽  
Evolutionary Analysis ◽  
Rule Mining ◽  
Transaction Database ◽  
Mining Algorithms

A Data mining is the method of extracting useful information from various repositories such as Relational Database, Transaction database, spatial database, Temporal and Time-series database, Data Warehouses, World Wide Web. Various functionalities of Data mining include Characterization and Discrimination, Classification and prediction, Association Rule Mining, Cluster analysis, Evolutionary analysis. Association Rule mining is one of the most important techniques of Data Mining, that aims at extracting interesting relationships within the data. In this paper we study various Association Rule mining algorithms, also compare them by using synthetic data sets, and we provide the results obtained from the experimental analysis

scholarly journals Finding Efficient Positive and Negative Itemsets Using Interestingness Measures

2018 ◽  
Vol 7 (4.36) ◽  
pp. 533
Author(s):  
P. Asha ◽  
T. Prem Jacob ◽  
A. Pravin
Keyword(s):  
Association Rule ◽  
Association Rule Mining ◽  
Data Gathering ◽  
Unstructured Data ◽  
Rule Mining ◽  
Interestingness Measures ◽  
Data Mining Algorithms ◽  
Data Formats ◽  
Mining Algorithms ◽  
Rare Itemsets

Currently, data gathering techniques have increased through which unstructured data creeps in, along with well defined data formats. Mining these data and bringing out useful patterns seems difficult. Various data mining algorithms were put forth for this purpose. The associated patterns generated by the association rule mining algorithms are large in number. Every ARM focuses on positive rule mining and very few literature has focussed on rare_itemsets_mining. The work aims at retrieving the rare itemsets that are of most interest to the user by utilizing various interestingness measures. Both positive and negative itemset mining would be focused in this work.  

NEW DISCRETE CROW SEARCH ALGORITHM FOR CLASS ASSOCIATION RULE MINING

2022 ◽  
Vol 13 (1) ◽  
pp. 0-0
Keyword(s):  
Association Rule ◽  
Association Rule Mining ◽  
Search Algorithm ◽  
Classification Problem ◽  
Discrete Version ◽  
Classification Algorithms ◽  
Associative Classification ◽  
Rule Mining ◽  
Rule Based ◽  
Class Association Rule

Associative Classification (AC) or Class Association Rule (CAR) mining is a very efficient method for the classification problem. It can build comprehensible classification models in the form of a list of simple IF-THEN classification rules from the available data. In this paper, we present a new, and improved discrete version of the Crow Search Algorithm (CSA) called NDCSA-CAR to mine the Class Association Rules. The goal of this article is to improve the data classification accuracy and the simplicity of classifiers. The authors applied the proposed NDCSA-CAR algorithm on eleven benchmark dataset and compared its result with traditional algorithms and recent well known rule-based classification algorithms. The experimental results show that the proposed algorithm outperformed other rule-based approaches in all evaluated criteria.

Association Rule Mining of Relational Data

2011 ◽  
pp. 87-93
Author(s):  
Anne Denton
Keyword(s):  
Data Mining ◽  
Data Structures ◽  
Association Rule ◽  
Association Rule Mining ◽  
Relational Data ◽  
Rule Mining ◽  
Data Mining Algorithms ◽  
Mining Algorithms ◽  
Relational Database Management ◽  
Relational Database Management Systems

Most data of practical relevance are structured in more complex ways than is assumed in traditional data mining algorithms, which are based on a single table. The concept of relations allows for discussing many data structures such as trees and graphs. Relational data have much generality and are of significant importance, as demonstrated by the ubiquity of relational database management systems. It is, therefore, not surprising that popular data mining techniques, such as association rule mining, have been generalized to relational data. An important aspect of the generalization process is the identification of challenges that are new to the generalized setting.

Sign in / Sign up

Export Citation Format

Share Document