Associations and rules in data mining: A link analysis
β Scribed by Witold Pedrycz
- Publisher
- John Wiley and Sons
- Year
- 2004
- Tongue
- English
- Weight
- 211 KB
- Volume
- 19
- Category
- Article
- ISSN
- 0884-8173
No coin nor oath required. For personal study only.
β¦ Synopsis
We discuss a problem of synthesis and analysis of rules based on experimental numeric data. Two descriptors of the rules that are viewed individually and en block are introduced. The coverage of the rules is quantified in terms of the data being covered by the antecedents and conclusions standing in the rule. Although this index describes each rule individually, the consistency of the rule deals with the quality of the rule viewed compared with other rules. It expresses how much the rule "interacts" with others in the sense that its conclusion is affected (distorted) by the conclusion parts coming from other rules. We propose a synthetic index of rule relevance that combines the two already introduced descriptors. We show how the rules are formed by means of fuzzy clustering and their quality is evaluated by means of the aforementioned indexes. Global characteristics of a set of rules also are discussed and related to the number of information granules formed in the space of antecedents and conclusions. Finally, we discuss the rules in the setting of granular modeling and express their performance in the design of numeric models.
π SIMILAR VOLUMES
AbstraΒ£t--Mining association rules from databases has attracted great interest because of its potentially very practical applications. Given a database, the problem of interest is how to mine association rules (which could describe patterns of consumers' behaviors) in an efficient and effective way.
This paper shows how a small number of simple fuzzy if-then rules can be selected for pattern classiΓΏcation problems with many continuous attributes. Our approach consists of two phases: candidate rule generation by rule evaluation measures in data mining and rule selection by multi-objective evolut
This paper presents an approximate analysis of the maximum throughput of an HDLC-based data link protocol for a bridged network. To model an end-to-end data link connection, which is connected across multiple transmission lines and bridge processors, a specific server, denoted as a bottleneck server