2002 · 102 citations · 13 references
ComputingComputer ScienceInformation SystemsData MiningDatabasesKnowledge RepresentationFrequent Pattern MiningFuzzy LogicPattern EvaluationRelational DatabasesRule-based RepresentationAssociation Rule InterestingnessAssociation Rule LearningAssociation Rule MiningFrequency CountsFuzzy MiningFuzzy Rule-based SystemsRule Interestingness EvaluationRule Mining
We present a novel technique, called F-APACS, for discovering fuzzy association rules in relational databases. F-APACS employs linguistic terms to represent the revealed regularities and exceptions. The definitions of these linguistic terms are based on fuzzy set theory and the association rules expressed in them are called fuzzy association rules. To discover these rules, F-APACS utilizes an objective interestingness measure when determining if two attribute values are related. This measure is defined in terms of an "adjusted difference" between observed and expected frequency counts. The use of such a measure has the advantage that no user-supplied thresholds are required. In addition to this interestingness measure, F-APACS has another unique feature that it provides a mechanism to allow quantitative values be inferred from the rules. Such feature, as shown here, make F-APACS very effective at various data mining tasks.
13
Mining association rules between sets of items in large databases
Rakesh Agrawal, Tomasz Imieliński, Arun Swami · 1993 · 14.8K citations · Full text
Steven L. Salzberg, Alberto M. Segre · 1994 · 5.8K citations
Mining generalized association rules
Ramakrishnan Srikant, Rakesh Agrawal · Future Generation Computer Systems · 1997 · 1.6K citations
Mining quantitative association rules in large relational tables
Ramakrishnan Srikant, Rakesh Agrawal · 1996 · 1.5K citations · Full text