scholarly journals A Novel Method of Interestingness Measures for Association Rules Mining Based on Profit

2015 ◽  
Vol 2015 ◽  
pp. 1-10 ◽  
Author(s):  
Chunhua Ju ◽  
Fuguang Bao ◽  
Chonghuan Xu ◽  
Xiaokang Fu
Keyword(s):  
Data Mining ◽  
Association Rules ◽  
Negative Relationship ◽  
Practical Application ◽  
Objective Criterion ◽  
Interestingness Measures ◽  
Association Rules Mining ◽  
New Methods ◽  
Measure Methods ◽  
Novel Method

Association rules mining is an important topic in the domain of data mining and knowledge discovering. Some papers have presented several interestingness measure methods; the most typical areSupport,Confidence,Lift,Improve, and so forth. But their limitations are obvious, like no objective criterion, lack of statistical base, disability of defining negative relationship, and so forth. This paper proposes three new methods,Bi-lift, Bi-improve, andBi-confidence, forLift, Improve, and Confidence, respectively. Then, on the basis of utility function and the executing cost of rules, we propose interestingness function based on profit (IFBP) considering subjective preferences and characteristics of specific application object. Finally, a novel measure framework is proposed to improve the traditional one through experimental analysis. In conclusion, the new methods and measure framework are prior to the traditional ones in the aspects of objective criterion, comprehensive definition, and practical application.

scholarly journals A novel interestingness measure based on fusion model for association rules mining

2021 ◽  
Vol 336 ◽  
pp. 05009
Author(s):  
Junrui Yang ◽  
Lin Xu
Keyword(s):  
Association Rules ◽  
Negative Association ◽  
Fusion Model ◽  
Interestingness Measures ◽  
Association Rules Mining ◽  
Interestingness Measure ◽  
Advantages And Disadvantages ◽  
Measure Model ◽  
Negative Association Rules ◽  
The Difference

Aiming at the shortcomings of the traditional "support-confidence" association rules mining framework and the problems of mining negative association rules, the concept of interestingness measure is introduced. Analyzed the advantages and disadvantages of some commonly used interestingness measures at present, and combined the cosine measure on the basis of the interestingness measure model based on the difference idea, and proposed a new interestingness measure model. The interestingness measure can effectively express the relationship between the antecedent and the subsequent part of the rule. According to this model, an association rules mining algorithm based on the interestingness measure fusion model is proposed to improve the accuracy of mining. Experiments show that the algorithm has better performance and can effectively help mining positive and negative association rules.

scholarly journals Toward a Theory of Normalizing Function of Interestingness Measure of Binary Association Rules

2018 ◽  
Vol 2018 ◽  
pp. 1-8
Author(s):  
Armand Armand ◽  
André Totohasina ◽  
Daniel Rajaonasy Feno
Keyword(s):  
Association Rules ◽  
Quality Measures ◽  
Measures Of Association ◽  
Interestingness Measures ◽  
Association Rules Mining ◽  
Interestingness Measure ◽  
Normalization Function

Regarding the existence of more than sixty interestingness measures proposed in the literature since 1993 till today in the topics of association rules mining and facing the importance these last one, the research on normalization probabilistic quality measures of association rules has already led to many tangible results to consolidate the various existing measures in the literature. This article recommends a simple way to perform this normalization. In the interest of a unified presentation, the article offers also a new concept of normalization function as an effective tool for resolution of the problem of normalization measures that have already their own normalization functions.

Mining Interesting Association Rules of Students Suffering Study Anxieties Using SLP-Growth Algorithm

2012 ◽  
Vol 3 (2) ◽  
pp. 24-41 ◽  
Author(s):  
Tutut Herawan ◽  
Prima Vitasari ◽  
Zailani Abdullah
Keyword(s):  
Data Mining ◽  
Association Rules ◽  
Teaching Strategies ◽  
Engineering Students ◽  
Mining Method ◽  
Association Rules Mining ◽  
Quality Of Learning ◽  
Pattern Growth

One of the most popular techniques used in data mining applications is association rules mining. The purpose of this study is to apply an enhanced association rules mining method, called SLP-Growth (Significant Least Pattern Growth) for capturing interesting rules from students suffering mathematics and examination anxieties datasets. The datasets were taken from a survey exploring study anxieties among engineering students in Universiti Malaysia Pahang (UMP). The results of this research provide useful information for educators to make decisions on their students more accurately and adapt their teaching strategies accordingly. It also can assist students in handling their fear of mathematics and examination and increase the quality of learning.

Association Rules Mining Based on Adaptive Fuzzy Clustering Algorithm

2014 ◽  
Vol 998-999 ◽  
pp. 842-845 ◽  
Author(s):  
Jia Mei Guo ◽  
Yin Xiang Pei
Keyword(s):  
Data Mining ◽  
Association Rules ◽  
Clustering Algorithm ◽  
Original Data ◽  
Data Set ◽  
Association Rules Mining ◽  
Fuzzy Association Rules ◽  
Redundant Data ◽  
Fuzzy Partitions ◽  
Rules Extraction

Association rules extraction is one of the important goals of data mining and analyzing. Aiming at the problem that information lose caused by crisp partition of numerical attribute , in this article, we put forward a fuzzy association rules mining method based on fuzzy logic. First, we use c-means clustering to generate fuzzy partitions and eliminate redundant data, and then map the original data set into fuzzy interval, in the end, we extract the fuzzy association rules on the fuzzy data set as providing the basis for proper decision-making. Results show that this method can effectively improve the efficiency of data mining and the semantic visualization and credibility of association rules.

Application of Association Rules Mining in Employment Guidance

2012 ◽  
Vol 479-481 ◽  
pp. 129-132
Author(s):  
Lei Wang ◽  
Cun Xiao Yi
Keyword(s):  
Data Mining ◽  
Association Rules ◽  
Important Task ◽  
Complex Data ◽  
Employment Rate ◽  
Association Rules Mining ◽  
Mining Association Rules ◽  
Vocational Colleges

How to improve the employment rate of graduates is an important task for higher vocational colleges to solve. In order to effectively improve their Employment competitiveness, advice should be made to help students to enhance specific kinds of learning and ability. Association Rules Mining is one core of the Data Mining Association Rules, it’s helpful in finding useful information hidden in complex data. By using Association Rules Mining in finding the knowledge and ability which helps employed students to earn their jobs, necessary ability for each kind of job can be found, and then advice offered for students to target their employment career will be more exact and proper.

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.

The Discussion on the Improved Association Rules Algorithm in Data Mining

2014 ◽  
Vol 989-994 ◽  
pp. 1985-1988
Author(s):  
Tao Wen ◽  
Li Sun ◽  
Li Zhu
Keyword(s):  
Data Mining ◽  
Pattern Matching ◽  
Association Rules ◽  
Potential Application ◽  
Huge Amount ◽  
Association Rules Mining ◽  
Classical Association ◽  
Improved Algorithm

The data mining can help to extract the information and knowledge with potential application value from a huge amount of data. In order to do the date mining scientifically and efficiently, this article provides an improved algorithm based on the classical association rules Aprior algorithm, taking advantage of which, we can engage in the association rules mining of the database to obtain the useful information. The improved algorithm avoids pattern matching and reduces the number of times of visiting the database, thus improves the speed of date mining to some extend.

An Efficient Graph-Based Method for Parallel Mining Problems

2004 ◽  
Vol 03 (02) ◽  
pp. 143-154
Author(s):  
Chin-Chen Chang ◽  
Chih-Yang Lin ◽  
Pei-Yu Lin
Keyword(s):  
Data Mining ◽  
Association Rules ◽  
Load Balance ◽  
Experimental Results ◽  
Memory Usage ◽  
Association Rules Mining ◽  
Parallel Mining ◽  
Mining Algorithms

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.

Sign in / Sign up

Export Citation Format

Share Document