12 search results - page 1 / 3 » dawak 2010 |
DAWAK
2010
Springer
13 years 4 months ago
2010
Springer
DAWAK
2010
Springer
13 years 2 months ago
2010
Springer
Abstract. We present an information-theoretic framework for mining dependencies between itemsets in binary data. The problem of closure-based redundancy in this context is theoreti...
DAWAK
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. We present an algorithm for mining frequent queries in arbitrary relational databases, over which functional dependencies are assumed. Building upon previous results, we ...
DAWAK
2010
Springer
13 years 5 months ago
2010
Springer
Facts are multidimensional concepts of primary interests for knowledge workers because they are related to events occurring dynamically in an organization. Normally, these concepts...
DAWAK
2010
Springer
13 years 5 months ago
2010
Springer
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...