Risk Analysis of the Association Rules in the Incremental Mining Based on the Weighted Model

2008 ◽  
Author(s):  
Ying Mei ◽  
Liangsheng Zhu
Keyword(s):  
Risk Analysis ◽  
Association Rules ◽  
Incremental Mining ◽  
Weighted Model

IMIDB: An Algorithm for Indexed Mining of Incremental Databases

2017 ◽  
Vol 26 (1) ◽  
pp. 69-85
Author(s):  
Mohammed M. Fouad ◽  
Mostafa G.M. Mostafa ◽  
Abdulfattah S. Mashat ◽  
Tarek F. Gharib
Keyword(s):  
Data Structure ◽  
Association Rules ◽  
Efficient Algorithm ◽  
Performance Comparison ◽  
Incremental Mining ◽  
Itemset Mining ◽  
Large Databases ◽  
Transactional Databases ◽  
Dynamic Databases ◽  
Database Size

AbstractAssociation rules provide important knowledge that can be extracted from transactional databases. Owing to the massive exchange of information nowadays, databases become dynamic and change rapidly and periodically: new transactions are added to the database and/or old transactions are updated or removed from the database. Incremental mining was introduced to overcome the problem of maintaining previously generated association rules in dynamic databases. In this paper, we propose an efficient algorithm (IMIDB) for incremental itemset mining in large databases. The algorithm utilizes the trie data structure for indexing dynamic database transactions. Performance comparison of the proposed algorithm to recently cited algorithms shows that a significant improvement of about two orders of magnitude is achieved by our algorithm. Also, the proposed algorithm exhibits linear scalability with respect to database size.

Closed-Itemset Incremental-Mining Problem

2011 ◽  
pp. 150-153
Author(s):  
Luminita Dumitriu
Keyword(s):  
Association Rules ◽  
Frequent Itemsets ◽  
Frequent Itemset ◽  
Incremental Mining ◽  
Minimum Support ◽  
Confidence Threshold ◽  
Support Threshold ◽  
Mining Association Rules

Association rules, introduced by Agrawal, Imielinski and Swami (1993), provide useful means to discover associations in data. The problem of mining association rules in a database is defined as finding all the association rules that hold with more than a user-given minimum support threshold and a user-given minimum confidence threshold. According to Agrawal, Imielinski and Swami, this problem is solved in two steps: 1. Find all frequent itemsets in the database. 2. For each frequent itemset I, generate all the association rules I’ÞI\I’, where I’ÌI.

An Efficient Genetic Simulated Annealing Association Rules Method

2010 ◽  
Vol 34-35 ◽  
pp. 927-931
Author(s):  
Jun Jie Cen ◽  
Guo Hong Gao ◽  
Ying Jun Wang
Keyword(s):  
Genetic Algorithm ◽  
Simulated Annealing ◽  
Data Analysis ◽  
Association Rules ◽  
Association Rule ◽  
Web Site ◽  
Web Mining ◽  
Incremental Mining ◽  
Mining Technology

Association rule is one of the important models of Web mining. By analyzing the topology of web site, this paper brings forward an efficient genetic simulated annealing association rules method．It applies genetic algorithm，incremental mining technology to trace users access behavior and optimizes association rules，and forecast capable association rules which improves its precision．Finally, this paper gives out the data analysis of experiment and summarizes the characteristics of genetic mining．

scholarly journals An Improved Evaluation Methodology for Mining Association Rules

Axioms ◽  
2021 ◽  
Vol 11 (1) ◽  
pp. 17
Author(s):  
Fuguang Bao ◽  
Linghao Mao ◽  
Yiling Zhu ◽  
Cancan Xiao ◽  
Chonghuan Xu
Keyword(s):  
Risk Analysis ◽  
Association Rules ◽  
Evaluation Methodology ◽  
Personalized Recommendation ◽  
Practical Application ◽  
Chi Square ◽  
Objective Criterion ◽  
Interestingness Measure ◽  
Advantages And Disadvantages ◽  
Chi Square Analysis

At present, association rules have been widely used in prediction, personalized recommendation, risk analysis and other fields. However, it has been pointed out that the traditional framework to evaluate association rules, based on Support and Confidence as measures of importance and accuracy, has several drawbacks. Some papers presented several new evaluation methods; the most typical methods are Lift, Improvement, Validity, Conviction, Chi-square analysis, etc. Here, this paper first analyzes the advantages and disadvantages of common measurement indicators of association rules and then puts forward four new measure indicators (i.e., Bi-support, Bi-lift, Bi-improvement, and Bi-confidence) based on the analysis. At last, this paper proposes a novel Bi-directional interestingness measure framework to improve the traditional one. In conclusion, the bi-directional interestingness measure framework (Bi-support and Bi-confidence framework) is superior to the traditional ones in the aspects of the objective criterion, comprehensive definition, and practical application.

Sign in / Sign up

Export Citation Format

Share Document