𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Mining association rules using inverted hashing and pruning

✍ Scribed by John D. Holt; Soon M. Chung

Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
224 KB
Volume
83
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

✦ Synopsis

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 [Proc.

πŸ“œ 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

Associations and rules in data mining: A
Associations and rules in data mining: A link analysis
✍ Witold Pedrycz πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 211 KB

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