Fuzzy association rules: general model and applications
IEEE Transactions on Fuzzy SystemsPublished 1 April 2003
Miguel Delgado‐Rodríguez, Nicolás Marı́n, Daniel Sánchez, M.A. Vila
Citations323
SJR quartileQ1
SJR score3.61
SNIP2.80
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
A general model to discover association rules among items in a (crisp) set of fuzzy transactions is developed, which can be particularized in several ways; each particular instance corresponds to a certain kind of pattern and/or repository of data.
Abstract
The theory of fuzzy sets has been recognized as a suitable tool to model several kinds of patterns that can hold in data. In this paper, we are concerned with the development of a general model to discover association rules among items in a (crisp) set of fuzzy transactions. This general model can be particularized in several ways; each particular instance corresponds to a certain kind of pattern and/or repository of data. We describe some applications of this scheme, paying special attention to the discovery of fuzzy association rules in relational databases.
Keywords
Computer Science
Mining association rules between sets of items in large databases
14,720 Citations1993Rakesh Agrawal, Tomasz Imieliński +1 more
An efficient algorithm is presented that generates all significant association rules between items in the database of customer transactions and incorporates buffer management and novel estimation and pruning techniques.
Fast algorithms for mining association rules
10,739 Citations1998Rakesh Agrawal, Ramakrishnan Srikant
Lecture notes in statisticsAn Introduction to Copulas
7,190 Citations1999Roger B. Nelsen
This book discusses the fundamental properties of copulas and some of their primary applications, which include the study of dependence and measures of association, and the construction of families of bivariate distributions.
ACM SIGMOD RecordMining frequent patterns without candidate generation
6,360 Citations2000Jiawei Han, Jian Pei +1 more
ACM SIGMOD RecordMining association rules between sets of items in large databases
4,475 Citations1993Rakesh Agrawal, Tomasz Imieliński +1 more
Mining frequent patterns without candidate generation
3,195 Citations2000Jiawei Han, Jian Pei +1 more
This study proposes a novel frequent pattern tree (FP-tree) structure, which is an extended prefix-tree structure for storing compressed, crucial information about frequent patterns, and develops an efficient FP-tree-based mining method, FP-growth, for mining the complete set of frequent patterns by pattern fragment growth.
European Journal of Operational ResearchFuzzy sets, uncertainty, and information
3,193 Citations1989
The fuzzy sets uncertainty and information is universally compatible with any devices to read and is available in the book collection an online access to it is set as public so you can get it instantly.
IEEE Transactions on Fuzzy SystemsFuzzy logic = computing with words
3,187 Citations1996Lotfi A. Zadeh
The point of this note is that fuzzy logic plays a pivotal role in CW and vice-versa and, as an approximation, fuzzy logic may be equated to CW.
Dynamic itemset counting and implication rules for market basket data
1,954 Citations1997Sergey Brin, Rajeev Motwani +2 more
A new algorithm for finding large itemsets which uses fewer passes over the data than classic algorithms, and yet uses fewer candidate itemsets than methods based on sampling and a new way of generating “implication rules” which are normalized based on both the antecedent and the consequent.
Computers & Mathematics with ApplicationsA computational approach to fuzzy quantifiers in natural languages
1,825 Citations1983Lotfi A. Zadeh
Future Generation Computer SystemsMining generalized association rules
1,617 Citations1997Ramakrishnan Srikant, Rakesh Agrawal
A new interest-measure for rules which uses the information in the taxonomy is presented, and given a user-specified “minimum-interest-level”, this measure prunes a large number of redundant rules.
Mining quantitative association rules in large relational tables
1,484 Citations1996Ramakrishnan Srikant, Rakesh Agrawal
This work deals with quantitative attributes by fine-partitioning the values of the attribute and then combining adjacent partitions as necessary and introduces measures of partial completeness which quantify the information lost due to partitioning.
Data Mining and Knowledge DiscoveryDiscovery of Frequent Episodes in Event Sequences
1,445 Citations1997Heikki Mannila, Hannu Toivonen +1 more
This work gives efficient algorithms for the discovery of all frequent episodes from a given class of episodes, and presents detailed experimental results that are in use in telecommunication alarm management.
Mathematical BiosciencesA model of inexact reasoning in medicine
1,437 Citations1975Edward H. Shortliffe, Bruce G. Buchanan
A quantification scheme is proposed which attempts to model the inexact reasoning processes of medical experts and offers advantages over Bayesian analysis when they are utilized in a rule-based computer diagnostic system.
An effective hash-based algorithm for mining association rules
1,412 Citations1995Jong Soo Park, Ming-Syan Chen⋆ +1 more
The number of candidate 2-itemsets generated by the proposed algorithm is, in orders of magnitude, smaller than that by previous methods, thus resolving the performance bottleneck, and allows us to effectively trim the transaction database size at a much earlier stage of the iterations, thereby reducing the computational cost for later iterations significantly.
International Journal of Intelligent SystemsQuantifier guided aggregation using OWA operators
1,106 Citations1998Ronald R. Yager
An extension of the OWA operators which involves the use of triangular norms is introduced and a procedure for determining the measure of “orness” directly from the quantifier is suggested.
ACM SIGKDD Explorations NewsletterAlgorithms for association rule mining — a general survey and comparison
960 Citations2000Jochen Hipp, Ulrich Güntzer +1 more
The fundamentals of asso iation rule mining are explained and a general framework is derived and it turns out that the runtime behavior of the algorithms is more similar as to be expe ted.
Knowledge Discovery and Data MiningEfficient algorithms for discovering association rules
630 Citations1994Heikki Mannila, Hannu Toivonen +1 more
An improved algorithm for the problem of mining association rules from large collections of data based on careful combinatorial analysis of the information obtained in previous passes is given, which makes it possible to eliminate unnecessary candidate rules.
ACM SIGMOD RecordDynamic itemset counting and implication rules for market basket data
611 Citations1997Sergey Brin, Rajeev Motwani +2 more
ACM SIGMOD RecordMining quantitative association rules in large relational tables
573 Citations1996Ramakrishnan Srikant, Rakesh Agrawal
International Journal of Intelligent SystemsQuantifier guided aggregation using OWA operators
547 Citations1996Ronald R. Yager
ACM SIGMOD RecordMining fuzzy association rules in databases
528 Citations1998Chan Man Kuok, Ada W. C. Fu +1 more
This paper introduces the fuzzy association rules of the form, 'If X is A then Y is B', to deal with quantitative attributes, using the fuzzy set concept, to find association rules more understandable to human.
ACM SIGMOD RecordAn effective hash-based algorithm for mining association rules
487 Citations1995Jong Soo Park, Ming-Syan Chen⋆ +1 more
Data Mining and Knowledge DiscoveryBeyond Market Baskets: Generalizing Association Rules to Dependence Rules
374 Citations1998Craig Silverstein, Sergey Brin +1 more
This work develops the notion of dependence rules that identify statistical dependence in both the presence and absence of items in itemsets in the lattice and develops pruning strategies based on the closure property that lead to an efficient algorithm for discovering dependence rules.
Cornerstone (Minnesota State University, Mankato)Data Mining: A Tutorial Based Primer
289 Citations2002Richard J. Roiger
This chapter discusses data mining techniques for managing Uncertainty in Rule-Based Systems, which involves Integrating Data Mining, Expert Systems, and Intelligent Agents.
Set-oriented mining for association rules in relational databases
270 Citations2002M.A.W. Houtsma, A. Swami
This paper shows that at least some aspects of data mining can be carried out by using general query languages such as SQL, rather than by developing specialized black-box algorithms.
Association rules over interval data
266 Citations1997Renée J. Miller, Yusheng Yang
An algorithm for mining association rules under the new definition of interest for association rules that takes into account the semantics of interval data is developed and the experience using the algorithm on large real-life datasets is overview.
Intelligent Data AnalysisMining association rules from quantitative data
260 Citations1999Tzung‐Pei Hong
Mining fuzzy association rules
207 Citations1997Keith C. C. Chan, Wai-Ho Au
The fact that F-APACS is able to mine fiuy association rules which utilize linguistic representation and that it uses an objective yet meanhg@ confidence measure to determine the interestingness of a rule makes it vety effective at the discovery of rules from a real-life transactional database of a PBX system provided by a telecommunication corporation.
International Journal of Approximate ReasoningFuzzy cardinality based evaluation of quantified sentences
172 Citations2000Miguel Delgado, Daniel Sánchez +1 more
A set of properties that must be fulfilled by any method of evaluation of quantified statements is proposed, and a general approach for the evaluation ofquantified statements based on the fuzzy cardinality and fuzzy relative cardinality of fuzzy sets is described.
Intelligent Data AnalysisMeasuring the accuracy and interest of association rules: A new framework
149 Citations2002Fernando Berzal, Ignacio J. Blanco +2 more
A different framework is introduced, based on Shortliffe and Buchanan's certainty factors and the new concept of very strong rules, and some intuitive properties of the new framework are discussed, showing that it can avoid the discovery of misleading rules, improving the manageability and quality of the results.
Efficient discovery of error-tolerant frequent itemsets in high dimensions
143 Citations2001Cheng Yang, Usama M. Fayyad +1 more
An efficient algorithm that identifies error-tolerant frequent clusters of items in transactional data that consistently uncovers structure in large sparse databases that other traditional clustering algorithms fail to find is presented.
Mining fuzzy association rules with weighted items
119 Citations2002Jinghang Yue, Eric C.C. Tsang +2 more
A new fuzzy association rule mining algorithm, which generalizes the popular Apriori Gen large itemset based algorithm, is developed and the advantages of the new algorithm are shown by testing it on a census database with 5000 transaction records.
Online association rule mining
111 Citations1999Christian Hidber
International Journal of Intelligent SystemsA new definition of fuzzy functional dependency in fuzzy relational databases
105 Citations1994Juan-Carlos Cubero, M.A. Vila
A fuzzy extension of this concept to overcome the previous anomalous behaviors and study its properties is introduced, and the completeness of this fuzzy version of Armstrong axioms is of primary interest.
An effective algorithm for discovering fuzzy rules in relational databases
102 Citations2002Wai-Ho Au, Keith C. C. Chan
F-APACS employs linguistic terms to represent the revealed regularities and exceptions and provides a mechanism to allow quantitative values be inferred from the rules, which make it very effective at various data mining tasks.
Fuzzy Sets and SystemsFuzzy set technology in knowledge discovery
97 Citations1998Witold Pedrycz
The paper re-examines the key issues of knowledge discovery by putting them in the context of the technology of fuzzy sets and reveals several interesting links between fuzzy data mining and fuzzy sets.
Data & Knowledge EngineeringTBAR: An efficient method for association rule mining in relational databases
93 Citations2001Fernando Berzal, Juan-Carlos Cubero +2 more
The proposed algorithm, which is called Tree-Based Association Rule mining (TBAR), redefines the notion of item and employs an effective tree data structure, which can also use techniques such as Direct Hashing and Pruning.
FARM: a data mining system for discovering fuzzy association rules
87 Citations1999Wai-Ho Au, Keith C. C. Chan
The experimental results showed that FARM is capable of discovering meaningful and useful fuzzy association rules in an effective manner from a real-life database.
Studies in fuzziness and soft computingFuzzy Data Mining: Discovery of Fuzzy Generalized Association Rules+
80 Citations2000Guoqing Chen, Qiang Wei +1 more
The classical Srikant and Agrawal’s algorithm is extended to allow discovering the relationships between data attributes upon all levels of fuzzy taxonomic structures, and it is revealed that the extended algorithm is at the same level of computational complexity in the number of the transactions as that of the classical algorithm.
The Handbooks of fuzzy sets seriesFuzzy Sets and Possibility Theory in Approximate and Plausible Reasoning
74 Citations1999Bernadette Bouchon‐Meunier, Didier Dubois +2 more
This long chapter is an attempt at providing a coherent view of the abundant body of results published in the field of approximate reasoning, including similarity-based and case-based reasoning, default reasoning, abductive reasoning, and reasoning with fuzzy quantifiers.
Mining fuzzy quantitative association rules
73 Citations2003Weining Zhang
An algorithm extended from the equi-depth partition (EDP) algorithm for solving the problem of mining fuzzy quantitative association rules that may contain crisp values, intervals, and fuzzy terms in both antecedent and consequent is presented.
Fuzzy Sets and SystemsA probabilistic definition of a nonconvex fuzzy cardinality
60 Citations2002Miguel Delgado, Daniel Sánchez +2 more
A possibilistic and a probabilistic cardinality of a fuzzy set with finite support are proposed and, contrary to the generalizing opinion, they are found to be more intuitive for humans.
Fuzzy Sets and SystemsMining changes in association rules: a fuzzy approach
58 Citations2004Wai-Ho Au, Keith C. C. Chan
Fuzzy decision trees are constructed in the discovered association rules in order to reveal the changes in these rules, which can be revealed and presented to human users in a comprehensible form and used to predict any change in the future.
Data Mining and Knowledge DiscoveryOn the Complexity of Mining Quantitative Association Rules
54 Citations1998Jef Wijsen, Robert Meersman
This paper studies the computational complexity of mining quantitative association rules in large databases using LaSalle's inequality and Bayesian inference.
Fuzzy rules in knowledge-based systems
39 Citations1992Didier Dubois, Henri Prade
Four distinct types of rules with different semantics involving gradedness and uncertainty are introduced and the combination operations which appear for taking advantage of the available knowledge are all derived from the intended semantics of the rules.
Vaguely Defined Objects
38 Citations1996Maciej Wygralak
Lecture notes in computer scienceA New Framework to Assess Association Rules
37 Citations2001Fernando Berzal, Ignacio J. Blanco +2 more
This paper introduces a different framework, based on Shortliffe and Buchanan's certainty factors and the new concept of very strong rules, which has several good properties, and the experiments have shown that it can avoid the discovery of misleading rules.
Lecture notes in computer scienceInteresting Fuzzy Association Rules in Quantitative Databases
35 Citations2001Jeannette M. de Graaf, Walter A. Kosters +1 more
A method for finding interesting rules with the help of fuzzy techniques and taxonomies for the items/attributes and experiments show that the use of the proposed interestingness measure substantially decreases the number of rules.
Ghent University Academic Bibliography (Ghent University)Fuzzy Association Rules: a Two-Sided Approach
34 Citations2003Martine De Cock, Chris Cornelis +1 more
The set of positive as well as the set of negative examples which are not necessarily complementary are identified, which brings to the surface the fundamental two-sidedness of knowledge in the framework of association rules.
Studies in fuzziness and soft computingAcquisition of Fuzzy Association Rules from Medical Data
25 Citations2002Miguel Delgado, Daniel Sánchez +1 more
Association rules are one of the best studied models for knowledge acquisition in the field of Data Mining and related problems can be found in the literature.
Intelligent Data AnalysisMining association rules from quantitative data☆
23 Citations1999Tzung‐Pei Hong, Chan-Sheng Kuo +1 more
A new data-mining algorithm for extracting interesting knowledge from transactions stored as quantitative values is proposed that integrates fuzzy set concepts and the apriori mining algorithm to find interesting fuzzy association rules in given transaction data sets.
CERN Document Server (European Organization for Nuclear Research)Vaguely Defined Objects: Representations, Fuzzy Sets and Nonclassical Cardinality theory
23 Citations2013Maciej Wygralak
This chapter discusses the development of nonclassical Cardinality Theory for Vaguely Defined Objects and its application to Arithmetical Operations.
Functional dependencies revisited under graduality and imprecision
17 Citations2002P. Bosc, Ludovic Liétard +1 more
The semantics of basic extensions of a functional dependency when fuzzy sets (and/or possibility) theory is used is discussed and the case of a relational database where tuples may contain imperfectly known values is specifically investigated.
Dialnet (Universidad de la Rioja)Adquisición de relaciones entre atributos en bases de datos relacionales
16 Citations2000Daniel Sánchez Fernández
An ordinal framework for data mining of fuzzy rules
13 Citations2002Junhyeong Lee
This paper proposes the concept of ordinal fuzzy set as basis for interpretation of fuzzy rules and frees us from the implicit assumptions mentioned and avoids some of the anomalies these assumptions produce.
Journal of Intelligent Information SystemsThe analysis of relationships in databases for rule derivation
12 Citations1996Show-Jane Yen, Arbee L. P. Chen
A technique to analyze relationships among attribute values and to derive compact rule set is presented and some heuristics to reduce the search complexity for the rule derivation process are proposed.
Lecture notes in computer scienceA classification and relationship extraction scheme for relational databases based on fuzzy logic
10 Citations1998Michalis Vazirgiannis
This work presented a scheme for classification of database values into categories characterized by lexical values, and mining of association rules between these classifications being able to express high-level natural language queries and rules.
Weak and strong resemblance in fuzzy functional dependencies
9 Citations1994Juan-Carlos Cubero, Olga Pons +1 more
The need to consider different measures for antecedent and consequent attributes, when fuzzy data are present, is justified and the importance of not having values which are too fuzzy in these attributes is justified.
Advances in psychologyFuzzy Logic with Linguistic Quantifiers: A Tool for Better Modeling of Human Evidence Aggregation Processes?
8 Citations1988Janusz Kacprzyk
This chapter presents two fuzzy logic-based calculi of linguistically quantified propositions concerned with the calculation of the truth of the linguisticallyquantified propositions generally written as “QY's are F” and ”QBY's areF”.
Dialnet (Universidad de la Rioja)A survey of methods to evaluate quantified sentences
7 Citations2000Miguel Delgado Calvo-Flores, Daniel Sánchez Fernández +2 more
This paper proposes an extension of both possibilistic and probabilistic methods, based on the Sugeno and the Choquet fuzzy integrals respectively, for the evaluation of type II sentences, the most general kind of sentences.
Dialnet (Universidad de la Rioja)Modelos de computación flexible para la recuperación de información
6 Citations2000M. José Martín Bautista
Results suggest that the substrate SAM acts as an enzyme-activated inactivator of ACC synthase by covalently linking a fragment of SAM molecule to the active site ofACC synthase, resulting in the inactivation of the enzyme.