A Model for Mining Multilevel Fuzzy Association Rule in Database

The problem of developing models and algorithms for multilevel association mining pose for new challenges for mathematics and computer science. These problems become more challenging, when some form of uncertainty like fuzziness is present in data or relationships in data. This paper proposes a multilevel fuzzy association rule mining models for extracting knowledge implicit in transactions database with different support at each level. The proposed algorithm adopts a top-down progressively deepening approach to derive large itemsets. This approach incorporates fuzzy boundaries instead of sharp boundary intervals. An example is also given to demonstrate that the proposed mining algorithm can derive the multiple-level association rules under different supports in a simple and effective manner.

💡 Research Summary

The paper addresses the emerging challenge of mining association rules in databases that exhibit both hierarchical (multilevel) item structures and inherent uncertainty. Traditional association‑rule mining techniques, such as Apriori, operate on a flat item set and rely on crisp, binary inclusion criteria. Consequently, they struggle when items are organized into taxonomies (e.g., category → subcategory → product) and when the data contain fuzzy boundaries caused by measurement error, subjective labeling, or gradual transitions between categories. To bridge this gap, the authors propose a novel framework that integrates fuzzy set theory with multilevel association‑rule mining, and they introduce a specific algorithmic strategy called Top‑Down Progressive Deepening (TD‑PD).

Core Concepts

1. Multilevel Taxonomy – Items are arranged in a hierarchy of L levels. Each level can have its own minimum support (min‑sup) and minimum confidence (min‑conf) thresholds, reflecting the intuition that higher‑level concepts should be discovered with looser support while lower‑level, more specific concepts require stricter evidence.
2. Fuzzy Membership – Instead of assigning an item to a crisp interval, a fuzzy membership function μ(x) (typically triangular, but also Gaussian in extensions) maps a transaction’s attribute value to a degree of belonging in the interval