Searching for "Generating non-redundant association rules." – sorted by Relevance.
-
Generating Non-Redundant Association Rules
- Generating Non-Redundant Association Rules Mohammed J. Zaki Computer Science Department Rensselaer
- Cited by 128 (8 self) – Add To MetaCart
-
Mining Minimal Non-Redundant Association Rules using Frequent Closed Itemsets
- and their generators; they consist of the non-redundant exact and approximate association rules having minimal
- Cited by 49 (5 self) – Add To MetaCart
-
Mining Association Rules using Formal Concept Analysis
- in generating non-redundant association rules with minimal antecedents and maximal consequents using Formal
- Cited by 4 (0 self) – Add To MetaCart
-
Discovering Representative Episodal Association Rules from Event Sequences Using Frequent Closed
- itemsets to generate non-redundant association rules in CHARM. We use closure as the basis for generating
- Cited by 12 (6 self) – Add To MetaCart
-
Maintaining Frequent Closed Itemsets over a Sliding Window
- , the set of FCIs also enables the generation of non-redundant association rules (Zaki, 2000). In this paper
- Cited by 1 (0 self) – Add To MetaCart
-
Using condensed representations for interactive association rule mining
- non-redundant association rules directly from the output of Alg. 1 [20]. In this process
- Cited by 8 (3 self) – Add To MetaCart

