scholarly journals FUZZY SET APPROACHES TO DATA MINING OF ASSOCIATION RULE

2014 ◽  
pp. 236-239
Author(s):  
SHIVANGI SENGAR ◽  
SAKSHI PRIYA ◽  
URVASHI KHATUJA
Keyword(s):  
Data Mining ◽  
Knowledge Discovery ◽  
Fuzzy Set ◽  
Association Rule ◽  
Extended Techniques ◽  
Research Community ◽  
Large Set ◽  
Fuzzy Data ◽  
Typical Data ◽  
Large Databases

Data mining on large databases has been a major concern in research community due to the difficulty of analyzing huge volume of data. This paper focuses on the large set area i.e. on fuzzy sets and knowledge discovery of data. Association rules* provide information in accessing significant correlations in large databases. We have combined an extended techniques developed in both fuzzy data mining and knowledge discovery model in order to deal with the uncertainty found in typical data.

Mining Association Rules

2010 ◽  
pp. 647-673 ◽  
Author(s):  
Mihai Gabroveanu
Keyword(s):  
Data Mining ◽  
Knowledge Discovery ◽  
Association Rules ◽  
Association Rule ◽  
Knowledge Discovery In Databases ◽  
Discovery Process ◽  
Fuzzy Association Rules ◽  
Large Databases ◽  
Hidden Knowledge ◽  
Basic Concepts

During the last years the amount of data stored in databases has grown very fast. Data mining, also known as knowledge discovery in databases, represents the discovery process of potentially useful hidden knowledge or relations among data from large databases. An important task in the data mining process is the discovery of the association rules. An association rule describes an interesting relationship between different attributes. There are different kinds of association rules: Boolean (crisp) association rules, quantitative association rules, fuzzy association rules, etc. In this chapter, we present the basic concepts of Boolean and the fuzzy association rules, and describe the methods used to discover the association rules by presenting the most important algorithms.

Informational Data Mining

2013 ◽  
pp. 58-65
Author(s):  
Feyza Gürbüz ◽  
Fatma Gökçe Önen
Keyword(s):  
Data Mining ◽  
Information Systems ◽  
Knowledge Discovery ◽  
Major Change ◽  
Research Community ◽  
Data Sources ◽  
Accurate Information ◽  
Rule Mining ◽  
Data Mining Techniques ◽  
Information Strategies

The previous decades have witnessed major change within the Information Systems (IS) environment with a corresponding emphasis on the importance of specifying timely and accurate information strategies. Currently, there is an increasing interest in data mining and information systems optimization. Therefore, it makes data mining for optimization of information systems a new and growing research community. This chapter surveys the application of data mining to optimization of information systems. These systems have different data sources and accordingly different objectives for knowledge discovery. After the preprocessing stage, data mining techniques can be applied on the suitable data for the objective of the information systems. These techniques are prediction, classification, association rule mining, statistics and visualization, clustering and outlier detection.

Visual Data Mining for Discovering Association Rules

2008 ◽  
pp. 2105-2120
Author(s):  
Kesaraporn Techapichetvanich ◽  
Amitava Datta
Keyword(s):  
Data Mining ◽  
Association Rules ◽  
Association Rule ◽  
Large Data ◽  
Data Sets ◽  
Visual Data Mining ◽  
Useful Knowledge ◽  
Large Databases ◽  
A New Technique ◽  
Mining Association Rule

Both visualization and data mining have become important tools in discovering hidden relationships in large data sets, and in extracting useful knowledge and information from large databases. Even though many algorithms for mining association rules have been researched extensively in the past decade, they do not incorporate users in the association-rule mining process. Most of these algorithms generate a large number of association rules, some of which are not practically interesting. This chapter presents a new technique that integrates visualization into the mining association rule process. Users can apply their knowledge and be involved in finding interesting association rules through interactive visualization, after obtaining visual feedback as the algorithm generates association rules. In addition, the users gain insight and deeper understanding of their data sets, as well as control over mining meaningful association rules.

Visual Data Mining for Discovering Association Rules

2011 ◽  
pp. 209-226
Author(s):  
Kesaraporn Techapichetvanich ◽  
Amitava Datta
Keyword(s):  
Data Mining ◽  
Association Rules ◽  
Association Rule ◽  
Large Data ◽  
Data Sets ◽  
Visual Data Mining ◽  
Useful Knowledge ◽  
Large Databases ◽  
A New Technique ◽  
Mining Association Rule

Both visualization and data mining have become important tools in discovering hidden relationships in large data sets, and in extracting useful knowledge and information from large databases. Even though many algorithms for mining association rules have been researched extensively in the past decade, they do not incorporate users in the association-rule mining process. Most of these algorithms generate a large number of association rules, some of which are not practically interesting. This chapter presents a new technique that integrates visualization into the mining association rule process. Users can apply their knowledge and be involved in finding interesting association rules through interactive visualization, after obtaining visual feedback as the algorithm generates association rules. In addition, the users gain insight and deeper understanding of their data sets, as well as control over mining meaningful association rules.

scholarly journals Incremental Algorithm for Association Rule Mining under Dynamic Threshold

2019 ◽  
Vol 9 (24) ◽  
pp. 5398 ◽  
Author(s):  
Iyad Aqra ◽  
Norjihan Abdul Ghani ◽  
Carsten Maple ◽  
José Machado ◽  
Nader Sohrabi Safa
Keyword(s):  
Data Mining ◽  
Association Rule ◽  
Association Rule Mining ◽  
High Accuracy ◽  
Incremental Algorithm ◽  
Rule Mining ◽  
Massive Datasets ◽  
Large Databases ◽  
New Knowledge ◽  
Standing Problem

Data mining is essentially applied to discover new knowledge from a database through an iterative process. The mining process may be time consuming for massive datasets. A widely used method related to knowledge discovery domain refers to association rule mining (ARM) approach, despite its shortcomings in mining large databases. As such, several approaches have been prescribed to unravel knowledge. Most of the proposed algorithms addressed data incremental issues, especially when a hefty amount of data are added to the database after the latest mining process. Three basic manipulation operations performed in a database include add, delete, and update. Any method devised in light of data incremental issues is bound to embed these three operations. The changing threshold is a long-standing problem within the data mining field. Since decision making refers to an active process, the threshold is indeed changeable. Accordingly, the present study proposes an algorithm that resolves the issue of rescanning a database that had been mined previously and allows retrieval of knowledge that satisfies several thresholds without the need to learn the process from scratch. The proposed approach displayed high accuracy in experimentation, as well as reduction in processing time by almost two-thirds of the original mining execution time.

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.

scholarly journals Privacy preserving association rule hiding using border based approach

2021 ◽  
Vol 23 (2) ◽  
pp. 1137
Author(s):  
Suma B. ◽  
Shobha G.
Keyword(s):  
Data Mining ◽  
Association Rules ◽  
Association Rule ◽  
Association Rule Mining ◽  
Sensitive Information ◽  
Rule Mining ◽  
Data Mining Technique ◽  
Large Databases ◽  
Hidden Correlations ◽  
Rule Set

<div>Association rule mining is a well-known data mining technique used for extracting hidden correlations between data items in large databases. In the majority of the situations, data mining results contain sensitive information about individuals and publishing such data will violate individual secrecy. The challenge of association rule mining is to preserve the confidentiality of sensitive rules when releasing the database to external parties. The association rule hiding technique conceals the knowledge extracted by the sensitive association rules by modifying the database. In this paper, we introduce a border-based algorithm for hiding sensitive association rules. The main purpose of this approach is to conceal the sensitive rule set while maintaining the utility of the database and association rule mining results at the highest level. The performance of the algorithm in terms of the side effects is demonstrated using experiments conducted on two real datasets. The results show that the information loss is minimized without sacrificing the accuracy. </div>

ON THE ROLE OF INTERPRETABILITY IN FUZZY DATA MINING

2007 ◽  
Vol 15 (05) ◽  
pp. 521-537 ◽  
Author(s):  
CORRADO MENCAR ◽  
GIOVANNA CASTELLANO ◽  
ANNA M. FANELLI
Keyword(s):  
Data Mining ◽  
Fuzzy Logic ◽  
Knowledge Discovery ◽  
End Users ◽  
Careful Consideration ◽  
Fuzzy Data ◽  
Systematic Methodology ◽  
Mining Methods

Data Mining, a central step in the broader overall process of Knowledge Discovery from Databases, concerns with discovering useful properties, called patterns, from data. Understandability is an essential — yet rarely tackled — feature that makes resulting patterns accessible by end users. In this paper we argue that the adoption of Fuzzy Logic for Data Mining can improve understandability of derived patterns. Indeed, Fuzzy Logic is able to represent concepts in a “human-centric” way. Hence, Data Mining methods based on Fuzzy Logic may potentially meet the so-called “Comprehensibility Postulate”, which characterizes the blurry notion of understandability. However, the mere adoption of Fuzzy Logic for Data Mining is not enough to achieve understandability. This paper describes and comments a number of issues that need to be addressed to provide for understandable patterns. A careful consideration of all such issues may end up in a systematic methodology to discover comprehensible knowledge from data.

scholarly journals PERBANDINGAN ASOSSIATION RULE BERBENTUK BINER DAN FUZZY C-PARTITION PADA ANALISIS MARKET BASKET DALAM DATA MINING

2012 ◽  
Vol 12 (2) ◽  
pp. 135
Author(s):  
Altin J Rindengan
Keyword(s):  
Data Mining ◽  
Fuzzy Sets ◽  
Association Rules ◽  
Fuzzy Set ◽  
Association Rule ◽  
The Other ◽  
Binary Form ◽  
Market Basket Analysis ◽  
Market Basket ◽  
Good Relationship

PERBANDINGAN ASOSSIATION RULE BERBENTUK BINER DAN FUZZY C-PARTITION PADA ANALISIS MARKET BASKET DALAM DATA MININGABSTRAKSalah satu analisis dalam data mining adalah market basket analysis untuk menganalisa kecenderungan pembelian suatu barang yang berasosiasi dengan barang yang lain. Dalam tulisan ini membahas aturan asosiasinya dengan mempertimbangkan jumlah item barang yang dibeli dalam satu transaksi. Asumsinya adalah keterkaitan pembelian suatu barang dengan barang yang lain dalam satu transaksi akan semakin kecil jika jumlah item barang yang dibeli semakin banyak. Tulisan ini menganalisa asosisasi antar item barang dengan membuat tabel transaksi dalam bentuk nilai fuzzy set dibandingkan dengan analisa asosiasi yang biasa dilakukan dalam bentuk biner. Berdasarkan analisis terhadap data yang digunakan memberikan hasil support dan confidence yang cenderung lebih kecil tetapi lebih realistis dibanding aturan asosisasi biasa. Keywords: analisis market basket, association rule, data mining, fuzzy c-partition.COMPARISON OF ASSOCIATION RULE WITH BINARY AND FUZZY C-PARTITION FORM AT MARKET BASKET ANALYSIS ON DATA MININGABSTRACTOne analysis in data mining is market basket analysis to analyze the purchase of a good trends associated with other items. In this paper discussing the association rules by considering the number of items purchased in one transaction. The assumption is that the purchase of a good relationship with the other items in one transaction will be smaller if the number of items purchased items more and more. This paper analyzes the association between the items of goods by making the transaction table in the form of fuzzy sets of values to compare with analysis of the usual associations in binary form. Based on the analysis of the data used to support and confidence of which tend to be smaller but more realistic than usual asosisasi rules. Keywords: market basket analysis, association rule, data mining, fuzzy c-partition.

Sign in / Sign up

Export Citation Format

Share Document