Sciweavers

352 search results - page 11 / 71
» Non-derivable itemset mining
Sort
View
KDD
2006
ACM
147views Data Mining» more  KDD 2006»
14 years 9 months ago
Summarizing itemset patterns using probabilistic models
In this paper, we propose a novel probabilistic approach to summarize frequent itemset patterns. Such techniques are useful for summarization, post-processing, and end-user interp...
Chao Wang, Srinivasan Parthasarathy
CINQ
2004
Springer
119views Database» more  CINQ 2004»
14 years 2 months ago
How to Quickly Find a Witness
The subfield of itemset mining is essentially a collection of algorithms. Whenever a new type of constraint is discovered, a specialized algorithm is proposed to handle it. All o...
Daniel Kifer, Johannes Gehrke, Cristian Bucila, Wa...
ACSC
2009
IEEE
14 years 3 months ago
Discovering Itemset Interactions
Itemsets, which are treated as intermediate results in association mining, have attracted significant research due to the inherent complexity of their generation. However, there ...
Ping Liang, John F. Roddick, Aaron Ceglar, Anna Sh...
KDD
2004
ACM
148views Data Mining» more  KDD 2004»
14 years 9 months ago
Interestingness of frequent itemsets using Bayesian networks as background knowledge
The paper presents a method for pruning frequent itemsets based on background knowledge represented by a Bayesian network. The interestingness of an itemset is defined as the abso...
Szymon Jaroszewicz, Dan A. Simovici
TCS
2008
13 years 8 months ago
Itemset frequency satisfiability: Complexity and axiomatization
Computing frequent itemsets is one of the most prominent problems in data mining. We study the following related problem, called FREQSAT, in depth: given some itemset-interval pai...
Toon Calders