Sciweavers

174 search results - page 11 / 35
» Probabilistic frequent itemset mining in uncertain databases
Sort
View
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
14 years 8 months ago
Dense itemsets
Frequent itemset mining has been the subject of a lot of work in data mining research ever since association rules were introduced. In this paper we address a problem with frequen...
Heikki Mannila, Jouni K. Seppänen
ICDE
2001
IEEE
163views Database» more  ICDE 2001»
14 years 9 months ago
MAFIA: A Maximal Frequent Itemset Algorithm for Transactional Databases
We present a new algorithm for mining maximal frequent itemsets from a transactional database. Our algorithm is especially efficient when the itemsets in the database are very lon...
Douglas Burdick, Manuel Calimlim, Johannes Gehrke
PODS
2004
ACM
130views Database» more  PODS 2004»
14 years 7 months ago
Computational Complexity of Itemset Frequency Satisfiability
Computing frequent itemsets is one of the most prominent problems in data mining. We introduce a new, related problem, called FREQSAT: given some itemset-interval pairs, does ther...
Toon Calders
DATAMINE
2006
230views more  DATAMINE 2006»
13 years 7 months ago
Mining top-K frequent itemsets from data streams
Frequent pattern mining on data streams is of interest recently. However, it is not easy for users to determine a proper frequency threshold. It is more reasonable to ask users to ...
Raymond Chi-Wing Wong, Ada Wai-Chee Fu
CIKM
2006
Springer
13 years 11 months ago
An integer programming approach for frequent itemset hiding
The rapid growth of transactional data brought, soon enough, into attention the need of its further exploitation. In this paper, we investigate the problem of securing sensitive k...
Aris Gkoulalas-Divanis, Vassilios S. Verykios