2006
DOI: 10.1007/s00500-006-0046-x
|View full text |Cite
|
Sign up to set email alerts
|

A GA-based Fuzzy Mining Approach to Achieve a Trade-off Between Number of Rules and Suitability of Membership Functions

Abstract: Data mining is most commonly used in attempts to induce association rules from transaction data. Transactions in real-world applications, however, usually consist of quantitative values. This paper thus proposes a fuzzy data-mining algorithm for extracting both association rules and membership functions from quantitative transactions. We present a GA-based framework for finding membership functions suitable for mining problems and then use the final best set of membership functions to mine fuzzy association ru… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
79
0

Year Published

2007
2007
2023
2023

Publication Types

Select...
4
3
1

Relationship

2
6

Authors

Journals

citations
Cited by 103 publications
(79 citation statements)
references
References 19 publications
0
79
0
Order By: Relevance
“…Our method assumes that the membership functions are known in advance. In [6,12] , we proposed some fuzzy learning methods to automatically derive the membership functions. In the future, we will attempt to dynamically adjust the membership functions in the proposed web-mining algorithm to avoid the bottleneck of membership function acquisition.…”
Section: Discussionmentioning
confidence: 99%
“…Our method assumes that the membership functions are known in advance. In [6,12] , we proposed some fuzzy learning methods to automatically derive the membership functions. In the future, we will attempt to dynamically adjust the membership functions in the proposed web-mining algorithm to avoid the bottleneck of membership function acquisition.…”
Section: Discussionmentioning
confidence: 99%
“…III. THE MINING SCHEME An efficient way to generate the fuzzy association rules consists of learning the MFs a priori and then use the final best set of MFs to mine fuzzy association rules [11], [13], [14]. This way to work allows us to learn the most adequate context [20] for each fuzzy partition, which is necessary in different contextual situations (different applications).…”
Section: Preliminaries: the 2-tuples Linguistic Representationmentioning
confidence: 99%
“…To evaluate a determined chromosome we will use the fitness functions defined in [14]. Before (Cq) where L1 is the number of large 1-itemsets obtained by using the set of MFs in Cq.…”
Section: Chromosome Evaluationmentioning
confidence: 99%
See 1 more Smart Citation
“…Mining algorithms that can automatically derive both the appropriate membership functions and the fuzzy rules are thus required. Many approaches have thus been proposed for deriving membership functions [10,11,18,19,23,24].…”
mentioning
confidence: 99%