Sciweavers

352 search results - page 4 / 71
» Non-derivable itemset mining
Sort
View
APWEB
2005
Springer
14 years 1 months ago
A Fast Algorithm for Mining Share-Frequent Itemsets
Itemset share has been proposed as a measure of the importance of itemsets for mining association rules. The value of the itemset share can provide useful information such as total...
Yu-Chiang Li, Jieh-Shan Yeh, Chin-Chen Chang
SAC
2010
ACM
14 years 23 days ago
Mining interesting sets and rules in relational databases
In this paper we propose a new and elegant approach toward the generalization of frequent itemset mining to the multirelational case. We define relational itemsets that contain i...
Bart Goethals, Wim Le Page, Michael Mampaey
AMT
2006
Springer
108views Multimedia» more  AMT 2006»
13 years 9 months ago
Efficient Frequent Itemsets Mining by Sampling
As the first stage for discovering association rules, frequent itemsets mining is an important challenging task for large databases. Sampling provides an efficient way to get appro...
Yanchang Zhao, Chengqi Zhang, Shichao Zhang
FQAS
2006
Springer
99views Database» more  FQAS 2006»
13 years 11 months ago
Partition-Based Approach to Processing Batches of Frequent Itemset Queries
We consider the problem of optimizing processing of batches of frequent itemset queries. The problem is a particular case of multiple-query optimization, where the goal is to minim...
Przemyslaw Grudzinski, Marek Wojciechowski, Maciej...
ICDM
2005
IEEE
139views Data Mining» more  ICDM 2005»
14 years 1 months ago
Approximate Inverse Frequent Itemset Mining: Privacy, Complexity, and Approximation
In order to generate synthetic basket data sets for better benchmark testing, it is important to integrate characteristics from real-life databases into the synthetic basket data ...
Yongge Wang, Xintao Wu