FARP: Mining fuzzy association rules from a probabilistic quantitative database

Current studies on association rule mining focus on finding Boolean/quantitative association rules from certain databases or Boolean association rules from probabilistic databases. However, little work on mining association rules from probabilistic quantitative databases has been mentioned because the simultaneous measurement of quantitative information and probability is difficult. By introducing a novel Shannon-like Entropy, we aggregate and measure the information contained in an item with the coexistence of fuzzy uncertainty hidden in quantitative values and random uncertainty. We then propose Support and Confidence metrics for a fuzzy–probabilistic database to quantify association rules. Finally, we design an algorithm, called FARP (mining Fuzzy Association Rules from a Probabilistic quantitative data), to discover frequent fuzzy–probabilistic itemsets and fuzzy association rules using the proposed interest measures. The experimental results show the effectiveness of our method and its practicality in real-world applications.