Sciweavers

74 search results - page 2 / 15
» The complexity of mining maximal frequent itemsets and maxim...
Sort
View
PKDD
2007
Springer
147views Data Mining» more  PKDD 2007»
13 years 11 months ago
MINI: Mining Informative Non-redundant Itemsets
Frequent itemset mining assists the data mining practitioner in searching for strongly associated items (and transactions) in large transaction databases. Since the number of frequ...
Arianna Gallo, Tijl De Bie, Nello Cristianini
PODS
2004
ACM
130views Database» more  PODS 2004»
14 years 5 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
ICDE
2008
IEEE
192views Database» more  ICDE 2008»
14 years 6 months ago
Verifying and Mining Frequent Patterns from Large Windows over Data Streams
Mining frequent itemsets from data streams has proved to be very difficult because of computational complexity and the need for real-time response. In this paper, we introduce a no...
Barzan Mozafari, Hetal Thakkar, Carlo Zaniolo
SDM
2009
SIAM
157views Data Mining» more  SDM 2009»
14 years 2 months ago
MUSK: Uniform Sampling of k Maximal Patterns.
Recent research in frequent pattern mining (FPM) has shifted from obtaining the complete set of frequent patterns to generating only a representative (summary) subset of frequent ...
Mohammad Al Hasan, Mohammed Javeed Zaki