Sciweavers

296 search results - page 26 / 60
» Privacy-preserving algorithms for distributed mining of freq...
Sort
View
PODS
2004
ACM
130views Database» more  PODS 2004»
14 years 9 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
KDD
2003
ACM
194views Data Mining» more  KDD 2003»
14 years 9 months ago
Finding recent frequent itemsets adaptively over online data streams
A data stream is a massive unbounded sequence of data elements continuously generated at a rapid rate. Consequently, the knowledge embedded in a data stream is more likely to be c...
Joong Hyuk Chang, Won Suk Lee
JIIS
2008
133views more  JIIS 2008»
13 years 9 months ago
Maintaining frequent closed itemsets over a sliding window
In this paper, we study the incremental update of Frequent Closed Itemsets (FCIs) over a sliding window in a high-speed data stream. We propose the notion of semi-FCIs, which is to...
James Cheng, Yiping Ke, Wilfred Ng
DAWAK
2006
Springer
14 years 21 days ago
A Greedy Approach to Concurrent Processing of Frequent Itemset Queries
We consider the problem of concurrent execution of multiple frequent itemset queries. If such data mining queries operate on overlapping parts of the database, then their overall I...
Pawel Boinski, Marek Wojciechowski, Maciej Zakrzew...
SIGMOD
2010
ACM
260views Database» more  SIGMOD 2010»
14 years 1 months ago
Towards proximity pattern mining in large graphs
Mining graph patterns in large networks is critical to a variety of applications such as malware detection and biological module discovery. However, frequent subgraphs are often i...
Arijit Khan, Xifeng Yan, Kun-Lung Wu