𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Mining disjunctive consequent association rules

✍ Scribed by Ding-An Chiang; Yi-Fan Wang; Yi-Hsin Wang; Zhi-Yang Chen; Mei-Hua Hsu

Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
421 KB
Volume
11
Category
Article
ISSN
1568-4946

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Mining association rules from biological
Mining association rules from biological databases
✍ AndrΓ©s RodrΓ­guez; JosΓ© MarΓ­a Carazo; Oswaldo Trelles πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 283 KB

## Abstract We present a novel application of knowledge discovery technology to a developing and challenging application area such as bioinformatics. This methodology allows the identification of relationships between low‐magnitude similarity (LMS) sequence patterns and other well‐contrasted protei

Mining Optimized Association Rules for N
Mining Optimized Association Rules for Numeric Attributes
✍ Takeshi Fukuda; Yasuhiko Morimoto; Shinichi Morishita; Takeshi Tokuyama πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 283 KB

Given a huge database, we address the problem of finding association rules for numeric attributes, such as (Balance # I ) O (CardLoan= yes), which implies that bank customers whose balances fall in a range I are likely to use card loan with a probability greater than p. The above rule is interesting

Mining fuzzy association rules from ques
Mining fuzzy association rules from questionnaire data
✍ Yen-Liang Chen; Cheng-Hsiung Weng πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 725 KB

Association rule mining is one of most popular data analysis methods that can discover associations within data. Association rule mining algorithms have been applied to various datasets, due to their practical usefulness. Little attention has been paid, however, on how to apply the association minin

Mining association rules using inverted
Mining association rules using inverted hashing and pruning
✍ John D. Holt; Soon M. Chung πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 224 KB

In this paper, we propose a new algorithm named Inverted Hashing and Pruning (IHP) for mining association rules between items in transaction databases. The performance of the IHP algorithm was evaluated for various cases and compared with those of two well-known mining algorithms, Apriori algorithm