Mining Quantitative and Fuzzy Association Rules

2011 ◽  
pp. 815-819
Author(s):  
Hong Shen ◽  
Susumu Horiguchi
Keyword(s):  
Machine Learning ◽  
Data Mining ◽  
Process Control ◽  
Query Processing ◽  
Information Management ◽  
Association Rules ◽  
Database Systems ◽  
Fuzzy Association Rules ◽  
Central Task ◽  
Mining Association Rules

The problem of mining association rules from databases was introduced by Agrawal, Imielinski, & Swami (1993). In this problem, we give a set of items and a large collection of transactions, which are subsets (baskets) of these items. The task is to find relationships between the occurrences of various items within those baskets. Mining association rules has been a central task of data mining, which is a recent research focus in database systems and machine learning and shows interesting applications in various fields, including information management, query processing, and process control.

Mining Associations Rules on a NCR Teradata System

2011 ◽  
pp. 746-751
Author(s):  
Soon M. Chung ◽  
Murali Mangamuri
Keyword(s):  
Data Mining ◽  
Association Rules ◽  
Database Systems ◽  
Database System ◽  
Parallel Database ◽  
Parallel Database Systems ◽  
Mining Association Rules

Data mining from relations is becoming increasingly important with the advent of parallel database systems. In this paper, we propose a new algorithm for mining association rules from relations. The new algorithm is an enhanced version of the SETM algorithm (Houtsma & Swami 1995), and it reduces the number of candidate itemsets considerably. We implemented and evaluated the new algorithm on a parallel NCR Teradata database system. The new algorithm is much faster than the SETM algorithm, and its performance is quite scalable.

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.

XML-Enabled Association Analysis

2011 ◽  
pp. 2117-2122
Author(s):  
Ling Feng
Keyword(s):  
Data Mining ◽  
Decision Support ◽  
Marketing Strategy ◽  
Association Rules ◽  
Association Rule ◽  
Rule Mining ◽  
Xml Data ◽  
Market Basket ◽  
Transactional Databases ◽  
Mining Association Rules

The discovery of association rules from large amounts of structured or semi-structured data is an important data mining problem [Agrawal et al. 1993, Agrawal and Srikant 1994, Miyahara et al. 2001, Termier et al. 2002, Braga et al. 2002, Cong et al. 2002, Braga et al. 2003, Xiao et al. 2003, Maruyama and Uehara 2000, Wang and Liu 2000]. It has crucial applications in decision support and marketing strategy. The most prototypical application of association rules is market basket analysis using transaction databases from supermarkets. These databases contain sales transaction records, each of which details items bought by a customer in the transaction. Mining association rules is the process of discovering knowledge such as “80% of customers who bought diapers also bought beer, and 35% of customers bought both diapers and beer”, which can be expressed as “diaper ? beer” (35%, 80%), where 80% is the confidence level of the rule, and 35% is the support level of the rule indicating how frequently the customers bought both diapers and beer. In general, an association rule takes the form X ? Y (s, c), where X and Y are sets of items, and s and c are support and confidence, respectively. In the XML Era, mining association rules is confronted with more challenges than in the traditional well-structured world due to the inherent flexibilities of XML in both structure and semantics [Feng and Dillon 2005]. First, XML data has a more complex hierarchical structure than a database record. Second, elements in XML data have contextual positions, which thus carry the order notion. Third, XML data appears to be much bigger than traditional data. To address these challenges, the classic association rule mining framework originating with transactional databases needs to be re-examined.

Mining Association Rules in Data Warehouses

2008 ◽  
pp. 303-335
Author(s):  
Haorianto Cokrowijoyo Tjioe ◽  
David Taniar
Keyword(s):  
Data Mining ◽  
Association Rules ◽  
Strategic Decision ◽  
Multidimensional Data ◽  
Data Warehouses ◽  
Multidimensional Databases ◽  
Efficient Data ◽  
Decision Making Processes ◽  
Mining Association Rules ◽  
Transactional Data

Data mining applications have enormously altered the strategic decision-making processes of organizations. The application of association rules algorithms is one of the well-known data mining techniques that have been developed to cope with multidimensional databases. However, most of these algorithms focus on multidimensional data models for transactional data. As data warehouses can be presented using a multidimensional model, in this paper we provide another perspective to mine association rules in data warehouses by focusing on a measurement of summarized data. We propose four algorithms — VAvg, HAvg, WMAvg, and ModusFilter — to provide efficient data initialization for mining association rules in data warehouses by concentrating on the measurement of aggregate data. Then we apply those algorithms both on a non-repeatable predicate, which is known as mining normal association rules, using GenNLI, and a repeatable predicate using ComDims and GenHLI, which is known as mining hybrid association rules.

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.

A Novel Efficient Mining Association Rules Algorithm for Distributed Databases

2010 ◽  
Vol 108-111 ◽  
pp. 50-56 ◽  
Author(s):  
Liang Zhong Shen
Keyword(s):  
Data Mining ◽  
Knowledge Discovery ◽  
Association Rules ◽  
Association Rule ◽  
Association Rule Mining ◽  
Distributed Databases ◽  
New Method ◽  
Rule Mining ◽  
Mining Association Rules

Due to the popularity of knowledge discovery and data mining, in practice as well as among academic and corporate professionals, association rule mining is receiving increasing attention. The technology of data mining is applied in analyzing data in databases. This paper puts forward a new method which is suit to design the distributed databases.

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.

The Application of Apriori Algorithm in Analysis on Admitted Students of Colleges and Universities

2013 ◽  
Vol 321-324 ◽  
pp. 2578-2582
Author(s):  
Qian Zhang
Keyword(s):  
Data Mining ◽  
Association Rules ◽  
Colleges And Universities ◽  
Apriori Algorithm ◽  
Data Mining Techniques ◽  
Minimum Support ◽  
Sample Data ◽  
Mining Association Rules

This paper examined the application of Apriori algorithm in extracting association rules in data mining by sample data on student enrollments. It studied the data mining techniques for extraction of association rules, analyzed the correlation between specialties and characteristics of admitted students, and evaluated the algorithm for mining association rules, in which the minimum support was 30% and the minimum confidence was 40%.

A Data Warehouse Cleansing Approach Based on Mathematical Association Rules

2012 ◽  
Vol 490-495 ◽  
pp. 1878-1882
Author(s):  
Yu Xiang Song
Keyword(s):  
Data Mining ◽  
Data Warehouse ◽  
Association Rules ◽  
Data Sets ◽  
Mathematical Association ◽  
Manual Intervention ◽  
Mining Association Rules ◽  
High Degree

The alliance rules stated above based on the principle of data mining association rules provide a solution for detecting errors in the data sets. The errors are detected automatically. The manual intervention in the proposed algorithm is highly negligible resulting in high degree of automation and accuracy. The duplicity in the names field of the data warehouse has been remarkably cleansed and worked out. Domain independency has been achieved using the concept of integer domain which even adds on to the memory saving capability of the algorithm.

Sign in / Sign up

Export Citation Format

Share Document