Sciweavers

295 search results - page 21 / 59
» Frequent regular itemset mining
Sort
View
KDD
2000
ACM
118views Data Mining» more  KDD 2000»
15 years 3 months ago
Generating non-redundant association rules
The traditional association rule mining framework produces many redundant rules. The extent of redundancy is a lot larger than previously suspected. We present a new framework for...
Mohammed Javeed Zaki
PODS
2004
ACM
130views Database» more  PODS 2004»
15 years 12 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»
16 years 7 days 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
DAWAK
2005
Springer
15 years 5 months ago
A Decremental Algorithm for Maintaining Frequent Itemsets in Dynamic Databases
Data mining and machine learning must confront the problem of pattern maintenance because data updating is a fundamental operation in data management. Most existing data-mining alg...
Shichao Zhang, Xindong Wu, Jilian Zhang, Chengqi Z...
JIIS
2008
133views more  JIIS 2008»
14 years 11 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