Sciweavers

174 search results - page 6 / 35
» Probabilistic frequent itemset mining in uncertain databases
Sort
View
PODS
2003
ACM
151views Database» more  PODS 2003»
14 years 7 months ago
Feasible itemset distributions in data mining: theory and application
Computing frequent itemsets and maximally frequent itemsets in a database are classic problems in data mining. The resource requirements of all extant algorithms for both problems...
Ganesh Ramesh, William Maniatty, Mohammed Javeed Z...
ICDE
2012
IEEE
250views Database» more  ICDE 2012»
11 years 10 months ago
Discovering Threshold-based Frequent Closed Itemsets over Probabilistic Data
Yongxin Tong, Lei Chen 0002, Bolin Ding
CIKM
2005
Springer
14 years 1 months ago
Frequent pattern discovery with memory constraint
We explore in this paper a practicably interesting mining task to retrieve frequent itemsets with memory constraint. As opposed to most previous works that concentrate on improvin...
Kun-Ta Chuang, Ming-Syan Chen
KDD
2004
ACM
148views Data Mining» more  KDD 2004»
14 years 8 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
ISMIS
2011
Springer
12 years 10 months ago
Data Access Paths in Processing of Sets of Frequent Itemset Queries
Abstract. Frequent itemset mining can be regarded as advanced database querying where a user specifies the dataset to be mined and constraints to be satisfied by the discovered i...
Piotr Jedrzejczak, Marek Wojciechowski