288 search results - page 3 / 58 » Estimating the number of frequent itemsets in a large databa... |
KDD
2006
ACM
14 years 6 months ago
2006
ACM
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...
ICTAI
2003
IEEE
13 years 11 months ago
2003
IEEE
In this paper, we propose a parallel algorithm for mining maximal frequent itemsets from databases. A frequent itemset is maximal if none of its supersets is frequent. The new par...
KDID
2003
13 years 7 months ago
2003
d abstract) Floris Geerts, Bart Goethals, and Taneli Mielik¨ainen HIIT Basic Research Unit Department of Computer Science University of Helsinki, Finland Abstract. Recent studies ...
AMT
2006
Springer
13 years 7 months ago
2006
Springer
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...
ISCI
2008
13 years 5 months ago
2008
The use of frequent itemsets has been limited by the high computational cost as well as the large number of resulting itemsets. In many real-world scenarios, however, it is often ...