Sciweavers

263 search results - page 23 / 53
» kDCI: a Multi-Strategy Algorithm for Mining Frequent Sets
Sort
View
DKE
2008
113views more  DKE 2008»
14 years 9 months ago
An efficient algorithm for mining closed inter-transaction itemsets
In this paper, we propose an efficient algorithm, called ICMiner (Inter-transaction Closed patterns Miner), for mining closed inter-transaction itemsets. Our proposed algorithm co...
Anthony J. T. Lee, Chun-sheng Wang, Wan-Yu Weng, Y...
KDD
2012
ACM
217views Data Mining» more  KDD 2012»
13 years 2 days ago
The long and the short of it: summarising event sequences with serial episodes
An ideal outcome of pattern mining is a small set of informative patterns, containing no redundancy or noise, that identifies the key structure of the data at hand. Standard freq...
Nikolaj Tatti, Jilles Vreeken
JIIS
2008
133views more  JIIS 2008»
14 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
157
Voted
ICDE
2006
IEEE
164views Database» more  ICDE 2006»
15 years 11 months ago
A Partition-Based Approach to Graph Mining
Existing graph mining algorithms typically assume that databases are relatively static and can fit into the main memory. Mining of subgraphs in a dynamic environment is currently ...
Junmei Wang, Wynne Hsu, Mong-Li Lee, Chang Sheng
82
Voted
KAIS
2008
114views more  KAIS 2008»
14 years 9 months ago
A new concise representation of frequent itemsets using generators and a positive border
A complete set of frequent itemsets can get undesirably large due to redundancy when the minimum support threshold is low or when the database is dense. Several concise representat...
Guimei Liu, Jinyan Li, Limsoon Wong