Sciweavers

288 search results - page 6 / 58
» Estimating the number of frequent itemsets in a large databa...
Sort
View
FIMI
2003
95views Data Mining» more  FIMI 2003»
15 years 1 months ago
Probabilistic Iterative Expansion of Candidates in Mining Frequent Itemsets
A simple new algorithm is suggested for frequent itemset mining, using item probabilities as the basis for generating candidates. The method first finds all the frequent items, an...
Attila Gyenesei, Jukka Teuhola
KDD
2009
ACM
168views Data Mining» more  KDD 2009»
15 years 7 months ago
Cartesian contour: a concise representation for a collection of frequent sets
In this paper, we consider a novel scheme referred to as Cartesian contour to concisely represent the collection of frequent itemsets. Different from the existing works, this sche...
Ruoming Jin, Yang Xiang, Lin Liu
VLDB
1995
ACM
135views Database» more  VLDB 1995»
15 years 3 months ago
Sampling-Based Estimation of the Number of Distinct Values of an Attribute
We provide several new sampling-based estimators of the number of distinct values of an attribute in a relation. We compare these new estimators to estimators from the database an...
Peter J. Haas, Jeffrey F. Naughton, S. Seshadri, L...
ICDM
2007
IEEE
150views Data Mining» more  ICDM 2007»
15 years 6 months ago
Connections between Mining Frequent Itemsets and Learning Generative Models
Frequent itemsets mining is a popular framework for pattern discovery. In this framework, given a database of customer transactions, the task is to unearth all patterns in the for...
Srivatsan Laxman, Prasad Naldurg, Raja Sripada, Ra...
ICDM
2007
IEEE
166views Data Mining» more  ICDM 2007»
15 years 6 months ago
Mining Statistical Information of Frequent Fault-Tolerant Patterns in Transactional Databases
Constraints applied on classic frequent patterns are too strict and may cause interesting patterns to be missed. Hence, researchers have proposed to mine a more relaxed version of...
Ardian Kristanto Poernomo, Vivekanand Gopalkrishna...