Sciweavers

36 search results - page 1 / 8
» Distribution-Based Synthetic Database Generation Techniques ...
Sort
View
IDEAS
2005
IEEE
99views Database» more  IDEAS 2005»
13 years 11 months ago
Distribution-Based Synthetic Database Generation Techniques for Itemset Mining
The resource requirements of frequent pattern mining algorithms depend mainly on the length distribution of the mined patterns in the database. Synthetic databases, which are used...
Ganesh Ramesh, Mohammed Javeed Zaki, William Mania...
JCIT
2008
128views more  JCIT 2008»
13 years 5 months ago
OPAM-An Efficient One Pass Association Mining Technique without Candidate Generation
This paper presents an efficient One Pass Association Mining technique i.e. OPAM, which finds all the frequent itemsets without generating any candidate sets. OPAM is basically an...
S. Roy, D. K. Bhattacharyya
ICDM
2005
IEEE
139views Data Mining» more  ICDM 2005»
13 years 11 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
KDD
2012
ACM
202views Data Mining» more  KDD 2012»
11 years 7 months ago
UFIMT: an uncertain frequent itemset mining toolbox
In recent years, mining frequent itemsets over uncertain data has attracted much attention in the data mining community. Unlike the corresponding problem in deterministic data, th...
Yongxin Tong, Lei Chen 0002, Philip S. Yu
PODS
2003
ACM
151views Database» more  PODS 2003»
14 years 5 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...