Weighted Association Rules Mining Algorithm Research

2012 ◽  
Vol 241-244 ◽  
pp. 1598-1601
Author(s):  
Jun Tan

Aiming at the problem that most of weighted association rules mining algorithms have not the anti-monotonicity, this paper presents a weighted support-confidence framework which supports anti-monotonicity. On this basis, weighted boolean association rules mining algorithm and weighted fuzzy association rules mining algorithm are presented, which use pruning strategy of Apriori algorithm so that improve the efficiency of frequent itemsets generated. Experimental results show that both algorithms have good performance.

2013 ◽  
Vol 333-335 ◽  
pp. 1247-1250 ◽  
Author(s):  
Na Xin Peng

Aiming at the problem that most of weighted association rules algorithm have not the anti-monotonicity, this paper presents a weighted support-confidence framework which supports anti-monotonicity. On this basis, Boolean weighted association rules algorithm and weighted fuzzy association rules algorithm are presented, which use pruning strategy of Apriori algorithm so as to improve the efficiency of frequent itemsets generated. Experimental results show that both algorithms have good performance.


2011 ◽  
Vol 179-180 ◽  
pp. 55-59
Author(s):  
Ping Shui Wang

Association rule mining is one of the hottest research areas that investigate the automatic extraction of previously unknown patterns or rules from large amounts of data. Finding association rules can be derived based on mining large frequent candidate sets. Aiming at the poor efficiency of the classical Apriori algorithm which frequently scans the business database, studying the existing association rules mining algorithms, we proposed a new algorithm of association rules mining based on relation matrix. Theoretical analysis and experimental results show that the proposed algorithm is efficient and practical.


2014 ◽  
Vol 536-537 ◽  
pp. 520-523
Author(s):  
Jia Liu ◽  
Zhen Ya Zhang ◽  
Hong Mei Cheng ◽  
Qian Sheng Fang

Usually, non trivial network visiting behaviors implied in network visiting log can be treated as the frequent itemsets or association rules if data in networking log file are transformed into transaction and technologies on association rule can be used to mine those frequent itemsets which are focused by user or some application. To mine non trivial behaviors of network visiting effectively, an attention based frequent itemsets mining method is proposed in this paper. In our proposed method, properties of users focusing is described as attention set and the early selection model of attention as information filter is referenced in the design of our method. Experimental results show that our proposed method is faster than apriori algorithm on the mining of frequent itemsets which is focused by our attention.


2012 ◽  
Vol 256-259 ◽  
pp. 2890-2893
Author(s):  
Jun Tan

Data streams are continuous, unbounded and coming with high speed which put forward a strong challenge against traditional association rules mining algorithms. In this paper, we give a comprehensive summary on association rules mining algorithm from three side including single-pass scanning algorithm, data processing model, memory optimization. At last, we discuss the main problems and future research directions.


2004 ◽  
Vol 03 (02) ◽  
pp. 143-154
Author(s):  
Chin-Chen Chang ◽  
Chih-Yang Lin ◽  
Pei-Yu Lin

Parallel association rules mining is a noticeable problem in data mining. However, little work has been proposed to deal with three important issues: (1) less memory usage; (2) less communication, among the involved computers, over the network; and (3) load balance among computers. In this paper, we present a graph-based scheme to solve the parallel mining problem by applying independent groups (clusters of maximal cliques). To bring the three issues to a close, the purpose of the independent groups aims at dividing a database into several independent sub-databases, so each sub-database can be employed independently to perform mining algorithms. To emphasis the effectiveness of the graph-based scheme, we adopt the independent groups not only for maximal large itemsets mining but also for general large itemsets mining. The experimental results show that our scheme can improve the efficiency for parallel mining when the independent groups are well-organized and designed.


2012 ◽  
Vol 241-244 ◽  
pp. 1589-1592
Author(s):  
Jun Tan

In recent years, many application systems have generate large quantities of data, so it is no longer practical to rely on traditional database technique to analyze these data. Data mining offers tools for extracting knowledge from data, leading to significant improvement in the decision-making process. Association rules mining is one of the most important data mining technology. The paper first presents the basic concept of association rule mining, then discuss a few different types of association rules mining including multi-level association rules, multidimensional association rules, weighted association rules, multi-relational association rules, fuzzy association rules.


Sign in / Sign up

Export Citation Format

Share Document