Research on automobile insurance fraud identification based on fuzzy association rules

2021 ◽  
pp. 1-14
Author(s):  
Chun Yan ◽  
Jiahui Liu ◽  
Wei Liu ◽  
Xinhong Liu
Keyword(s):  
Simulated Annealing ◽  
Association Rules ◽  
Insurance Industry ◽  
Automobile Insurance ◽  
Insurance Fraud ◽  
Fuzzy Data ◽  
Apriori Algorithm ◽  
Rule Mining ◽  
Fuzzy Association Rules ◽  
Fuzzy C Means

With the development of automobile insurance industry, how to identify automobile insurance fraud from massive data becomes particularly important. The purpose of this paper is to improve automobile insurance fraud management and explore the application of data mining technology in automobile insurance fraud identification. To this aim, an Apriori algorithm based on simulated annealing genetic fuzzy C-means (SAGFCM-Apriori) have been proposed. The SAGFCM-Apriori algorithm combines fuzzy theory with association rule mining, expanding the application scope of the Apriori algorithm. Considering that the clustering center of the traditional fuzzy C-means (FCM) algorithm is easy to fall into local optimal, the simulated annealing genetic (SAG) algorithm is used to optimize it. The SAG algorithm optimized FCM (SAGFCM) is used to generate fuzzy membership degrees and introduces fuzzy data into the Apriori algorithm. The Apriori algorithm is improved by reducing the rule mining time when acquiring rules. The results of empirical studies on several data sets demonstrate that the optimization of FCM by SAG can effectively avoid the local optimal problem, improve the accuracy of clustering, and enable SAGFCM-Apriori to obtain better fuzzy data during data preprocessing. Moreover, the proposed algorithm can reduce the mining time of association rules and improve mining efficiency. Finally, the SAGFCM-Apriori algorithm is applied to the scene of automobile insurance fraud identification, and the automobile insurance fraud data is mined to obtain fuzzy association rules that can identify fraud claims.

Finding Active Membership Functions for Genetic-Fuzzy Data Mining

2015 ◽  
Vol 14 (06) ◽  
pp. 1215-1242 ◽  
Author(s):  
Chun-Hao Chen ◽  
Tzung-Pei Hong ◽  
Yeong-Chyi Lee ◽  
Vincent S. Tseng
Keyword(s):  
Data Mining ◽  
Association Rules ◽  
Fuzzy Data ◽  
Membership Functions ◽  
Linguistic Terms ◽  
Fuzzy Association Rules ◽  
Fitness Functions ◽  
The Given ◽  
Binary Strings ◽  
Active Membership

Since transactions may contain quantitative values, many approaches have been proposed to derive membership functions for mining fuzzy association rules using genetic algorithms (GAs), a process known as genetic-fuzzy data mining. However, existing approaches assume that the number of linguistic terms is predefined. Thus, this study proposes a genetic-fuzzy mining approach for extracting an appropriate number of linguistic terms and their membership functions used in fuzzy data mining for the given items. The proposed algorithm adjusts membership functions using GAs and then uses them to fuzzify the quantitative transactions. Each individual in the population represents a possible set of membership functions for the items and is divided into two parts, control genes (CGs) and parametric genes (PGs). CGs are encoded into binary strings and used to determine whether membership functions are active. Each set of membership functions for an item is encoded as PGs with real-number schema. In addition, seven fitness functions are proposed, each of which is used to evaluate the goodness of the obtained membership functions and used as the evolutionary criteria in GA. After the GA process terminates, a better set of association rules with a suitable set of membership functions is obtained. Experiments are made to show the effectiveness of the proposed approach.

GENETIC-FUZZY MINING WITH TAXONOMY

2012 ◽  
Vol 20 (supp02) ◽  
pp. 187-205 ◽  
Author(s):  
CHUN-HAO CHEN ◽  
TZUNG-PEI HONG ◽  
YEONG-CHYI LEE
Keyword(s):  
Association Rules ◽  
Multiple Level ◽  
Membership Functions ◽  
Rule Mining ◽  
Fuzzy Association Rules ◽  
Fitness Value ◽  
Real World Applications ◽  
Fuzzy Association Rule ◽  
Fuzzy Association Rule Mining ◽  
The Given

Data mining is most commonly used in attempts to induce association rules from transaction data. Since transactions in real-world applications usually consist of quantitative values, many fuzzy association-rule mining approaches have been proposed on single- or multiple-concept levels. However, the given membership functions may have a critical influence on the final mining results. In this paper, we propose a multiple-level genetic-fuzzy mining algorithm for mining membership functions and fuzzy association rules using multiple-concept levels. It first encodes the membership functions of each item class (category) into a chromosome according to the given taxonomy. The fitness value of each individual is then evaluated by the summation of large 1-itemsets of each item in different concept levels and the suitability of membership functions in the chromosome. After the GA process terminates, a better set of multiple-level fuzzy association rules can then be expected with a more suitable set of membership functions. Experimental results on a simulation dataset also show the effectiveness of the algorithm.

A Survey on Fuzzy Association Rule Mining

2013 ◽  
Vol 9 (1) ◽  
pp. 1-27 ◽  
Author(s):  
Harihar Kalia ◽  
Satchidananda Dehuri ◽  
Ashish Ghosh
Keyword(s):  
Association Rules ◽  
Association Rule ◽  
Quantitative Data ◽  
Association Rule Mining ◽  
Real Life ◽  
Rule Mining ◽  
Fuzzy Association Rules ◽  
Fuzzy Association Rule ◽  
Mining Algorithms ◽  
Fuzzy Association Rule Mining

Association rule mining is one of the fundamental tasks of data mining. The conventional association rule mining algorithms, using crisp set, are meant for handling Boolean data. However, in real life quantitative data are voluminous and need careful attention for discovering knowledge. Therefore, to extract association rules from quantitative data, the dataset at hand must be partitioned into intervals, and then converted into Boolean type. In the sequel, it may suffer with the problem of sharp boundary. Hence, fuzzy association rules are developed as a sharp knife to solve the aforesaid problem by handling quantitative data using fuzzy set. In this paper, the authors present an updated survey of fuzzy association rule mining procedures along with a discussion and relevant pointers for further research.

Mining Efficient Fuzzy Bio-Statistical Rules for Association of Sandalwood in Pachaimalai Hills

2015 ◽  
Vol 6 (2) ◽  
pp. 40-76
Author(s):  
Delphin Sonia M ◽  
John Robinson P ◽  
Sebastian Rajasekaran A
Keyword(s):  
Association Rules ◽  
Real Life ◽  
Eastern Ghats ◽  
Plant Association ◽  
Rule Mining ◽  
Fuzzy Association Rules ◽  
Original Algorithm ◽  
Life Problems ◽  
Fuzzy Correlation ◽  
Correlation Rules

The integration of association rules and correlation rules with fuzzy logic can produce more abstract and flexible patterns for many real life problems, since many quantitative features in real world, especially surveying the frequency of plant association in any region is fuzzy in nature. This paper presents a modification of a previously reported algorithm for mining fuzzy association and correlation rules, defines the concept of fuzzy partial and semi-partial correlation rule mining, and presents an original algorithm for mining fuzzy data based on correlation rule mining. It adds a regression model to the procedure for mining fuzzy correlation rules in order to predict one data instance from contributing more than others. It also utilizes statistical analysis for the data and the experimental results show a very high utility of fuzzy association rules and fuzzy correlation rule mining in modeling plant association problems. The newly proposed algorithm is utilized for seeking close associations and relationships between a group of plant species clustering around Sandalwood in Pachaimalai hills, Eastern Ghats, Tamilnadu.

An Efficient Weighted Association Rules Mining Algorithm

2013 ◽  
Vol 333-335 ◽  
pp. 1247-1250 ◽  
Author(s):  
Na Xin Peng
Keyword(s):  
Association Rules ◽  
Frequent Itemsets ◽  
Experimental Results ◽  
Apriori Algorithm ◽  
Association Rules Mining ◽  
Fuzzy Association Rules ◽  
Weighted Association Rules ◽  
Mining Algorithm ◽  
Pruning Strategy

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.

A New Algorithm of Association Rules Mining Based on Relation Matrix

2011 ◽  
Vol 179-180 ◽  
pp. 55-59
Author(s):  
Ping Shui Wang
Keyword(s):  
Association Rules ◽  
Association Rule ◽  
Association Rule Mining ◽  
Automatic Extraction ◽  
Apriori Algorithm ◽  
Rule Mining ◽  
Association Rules Mining ◽  
Research Areas ◽  
Mining Algorithms ◽  
Relation Matrix

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.

Different Types of Association Rules Mining Review

2012 ◽  
Vol 241-244 ◽  
pp. 1589-1592
Author(s):  
Jun Tan
Keyword(s):  
Data Mining ◽  
Association Rules ◽  
Association Rule ◽  
Rule Mining ◽  
Association Rules Mining ◽  
Fuzzy Association Rules ◽  
Weighted Association Rules ◽  
Application Systems ◽  
Different Types ◽  
Multi Level

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.

scholarly journals EARMGA and Apriori Algorithm's Performance Evaluation for Association Rule Mining

2019 ◽  
Vol 9 (1) ◽  
pp. 6982-6987
Keyword(s):  
Association Rules ◽  
Association Rule ◽  
Association Rule Mining ◽  
The Other ◽  
Apriori Algorithm ◽  
Rule Mining ◽  
Large Databases ◽  
Algorithm Comparison ◽  
Average Confidence ◽  
Mining Algorithms

Association rule mining techniques are important part of data mining to derive relationship between attributes of large databases. Association related rule mining have evolved huge interest among researchers as many challenging problems can be solved using them. Numerous algorithms have been discovered for deriving association rules effectively. It has been evaluated that not all algorithms can give similar results in all scenarios, so decoding these merits becomes important. In this paper two association rule mining algorithms were analyzed, one is popular Apriori algorithm and the other is EARMGA (Evolutionary Association Rules Mining with Genetic Algorithm). Comparison of these two algorithms were experimentally performed based on different datasets and different parameters like Number of rules generated, Average support, Average Confidence, Covered records were detailed.

Effective Mining of Weighted Fuzzy Association Rules

2010 ◽  
pp. 47-64 ◽  
Author(s):  
Maybin Muyeba ◽  
M. Sulaiman Khan ◽  
Frans Coenen
Keyword(s):  
Association Rules ◽  
Association Rule ◽  
Association Rule Mining ◽  
Real Data ◽  
Closure Property ◽  
Data Sets ◽  
Rule Mining ◽  
Fuzzy Association Rules ◽  
Novel Approach ◽  
Downward Closure

A novel approach is presented for effectively mining weighted fuzzy association rules (ARs). The authors address the issue of invalidation of downward closure property (DCP) in weighted association rule mining where each item is assigned a weight according to its significance wrt some user defined criteria. Most works on weighted association rule mining do not address the downward closure property while some make assumptions to validate the property. This chapter generalizes the weighted association rule mining problem with binary and fuzzy attributes with weighted settings. Their methodology follows an Apriori approach but employs T-tree data structure to improve efficiency of counting itemsets. The authors’ approach avoids pre and post processing as opposed to most weighted association rule mining algorithms, thus eliminating the extra steps during rules generation. The chapter presents experimental results on both synthetic and real-data sets and a discussion on evaluating the proposed approach.

Sign in / Sign up

Export Citation Format

Share Document