Sciweavers

1056 search results - page 49 / 212
» Association Rule Mining Algorithms for Set-Valued Data
Sort
View
DAWAK
2004
Springer
15 years 3 months ago
A Tree Partitioning Method for Memory Management in Association Rule Mining
All methods of association rule mining require the frequent sets of items, that occur together sufficiently often to be the basis of potentially interesting rules, to be first com...
Shakil Ahmed, Frans Coenen, Paul H. Leng
JCST
2008
119views more  JCST 2008»
14 years 9 months ago
Mining Frequent Generalized Itemsets and Generalized Association Rules Without Redundancy
This paper presents some new algorithms to efficiently mine max frequent generalized itemsets (g-itemsets) and essential generalized association rules (g-rules). These are compact ...
Daniel Kunkle, Donghui Zhang, Gene Cooperman
SGAI
2007
Springer
15 years 3 months ago
Dynamic Rule Mining for Argumentation Based Systems
Argumentation has proved to be a very influential reasoning mechanism particularly in the context of multi agent systems. In this paper we introduce PADUA (Protocol for Argumenta...
Maya Wardeh, Trevor J. M. Bench-Capon, Frans Coene...
FPL
2008
Springer
122views Hardware» more  FPL 2008»
14 years 11 months ago
Mining Association Rules with systolic trees
Association Rules Mining (ARM) algorithms are designed to find sets of frequently occurring items in large databases. ARM applications have found their way into a variety of field...
Song Sun, Joseph Zambreno
DAWAK
2010
Springer
14 years 10 months ago
Mining Closed Itemsets in Data Stream Using Formal Concept Analysis
Mining of frequent closed itemsets has been shown to be more efficient than mining frequent itemsets for generating non-redundant association rules. The task is challenging in data...
Anamika Gupta, Vasudha Bhatnagar, Naveen Kumar