Association rules... and what’s next? — Towards second generation data mining systems

1998 ◽  
pp. 6-25 ◽  
Author(s):  
Tomasz Imieliński ◽  
Aashu Virmani
Keyword(s):  
Data Mining ◽  
Association Rules ◽  
Second Generation

How Useful Can Be Data Mining For A Continuos Speech Therapist’s Education?

2014 ◽  
Vol 1 (1) ◽  
pp. 339-342
Author(s):  
Mirela Danubianu ◽  
Dragos Mircea Danubianu
Keyword(s):  
Data Mining ◽  
Information And Communication Technology ◽  
Association Rules ◽  
Communication Technology ◽  
Speech Therapy ◽  
Proper Treatment ◽  
Speech Impairments ◽  
Information And Communication ◽  
Specific Education

AbstractSpeech therapy can be viewed as a business in logopaedic area that aims to offer services for correcting language. A proper treatment of speech impairments ensures improved efficiency of therapy, so, in order to do that, a therapist must continuously learn how to adjust its therapy methods to patient's characteristics. Using Information and Communication Technology in this area allowed collecting a lot of data regarding various aspects of treatment. These data can be used for a data mining process in order to find useful and usable patterns and models which help therapists to improve its specific education. Clustering, classification or association rules can provide unexpected information which help to complete therapist's knowledge and to adapt the therapy to patient's needs.

A Hybrid Algorithm of Mining Closed Itemsets for Large Databases

2011 ◽  
Vol 145 ◽  
pp. 292-296
Author(s):  
Lee Wen Huang
Keyword(s):  
Data Mining ◽  
Association Rules ◽  
Execution Time ◽  
Hybrid Algorithm ◽  
Hybrid Approach ◽  
Market Basket Analysis ◽  
Market Basket ◽  
Large Databases ◽  
Closed Itemsets ◽  
Simulation Results

Data Mining means a process of nontrivial extraction of implicit, previously and potentially useful information from data in databases. Mining closed large itemsets is a further work of mining association rules, which aims to find the set of necessary subsets of large itemsets that could be representative of all large itemsets. In this paper, we design a hybrid approach, considering the character of data, to mine the closed large itemsets efficiently. Two features of market basket analysis are considered – the number of items is large; the number of associated items for each item is small. Combining the cut-point method and the hash concept, the new algorithm can find the closed large itemsets efficiently. The simulation results show that the new algorithm outperforms the FP-CLOSE algorithm in the execution time and the space of storage.

Association Rules Algorithms for Data Mining Process Based on Multi Agent System

2020 ◽  
pp. 431-443
Author(s):  
Imane Belabed ◽  
Mohammed Talibi Alaoui ◽  
Jaara El Miloud ◽  
Abdelmajid Belabed
Keyword(s):  
Data Mining ◽  
Association Rules ◽  
Multi Agent System ◽  
Agent System ◽  
Multi Agent

scholarly journals IMPLEMENTASI ALGORITMA APRIORI TERHADAP DATA PENJUALAN PADA PERUSAHAAN RETAIL

2019 ◽  
Vol 15 (1) ◽  
pp. 85-90 ◽  
Author(s):  
Jordy Lasmana Putra ◽  
Mugi Raharjo ◽  
Tommi Alfian Armawan Sandi ◽  
Ridwan Ridwan ◽  
Rizal Prasetyo
Keyword(s):  
Data Mining ◽  
Association Rules ◽  
A Priori ◽  
Apriori Algorithm ◽  
Business World ◽  
Transaction Data ◽  
Retail Company ◽  
Special Strategy

The development of the business world is increasingly rapid, so it needs a special strategy to increase the turnover of the company, in this case the retail company. In increasing the company's turnover can be done using the Data Mining process, one of which is using apriori algorithm. With a priori algorithm can be found association rules which can later be used as patterns of purchasing goods by consumers, this study uses a repository of 209 records consisting of 23 transactions and 164 attributes. From the results of this study, the goods with the name CREAM CUPID HEART COAT HANGER are the products most often purchased by consumers. By knowing the pattern of purchasing goods by consumers, the company management can increase the company's turnover by referring to the results of processing sales transaction data using a priori algorithm

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.

Sign in / Sign up

Export Citation Format

Share Document