Sign in
Author
|
Conference
|
Journal
|
Organization
|
Year
|
DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all fields of study
Limit my searches in the following fields of study
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Keywords
(7)
Association Rule
cumulant
Data Mining
Efficient Algorithm
Experimental Study
Incremental Mining
Sliding Window
Related Publications
(14)
Fast Algorithms for Mining Association Rules in Large Databases
Mining association rules between sets of items in large databases
Models and issues in data stream systems
Maintenance of Discovered Association Rules in Large Databases: An Incremental Updating Technique
A Sliding Window Method for Finding Recently Frequent Itemsets over Online Data Streams
Subscribe
Academic
Publications
Sliding-window filtering: an efficient algorithm for incremental mining
Sliding-window filtering: an efficient algorithm for incremental mining,10.1145/502585.502630,Chang-Hung Lee,Cheng-Ru Lin,Ming-Syan Chen
Edit
Sliding-window filtering: an efficient algorithm for incremental mining
(
Citations: 60
)
BibTex
|
RIS
|
RefWorks
Download
Chang-Hung Lee
,
Cheng-Ru Lin
,
Ming-Syan Chen
We explore in this paper an effective sliding-window filtering (abbreviatedly as SWF) algorithm for
incremental mining
of association rules. In essence, by partitioning a transaction database into several partitions, algorithm SWF employs a filtering threshold in each partition to deal with the candidate itemset generation. Under SWF, the cumulative information of mining previous partitions is selectively carried over toward the generation of candidate itemsets for the subsequent partitions. Algorithm SWF not only significantly reduces I/O and CPU cost by the concepts of cumulative filtering and scan reduction techniques but also effectively controls memory utilization by the technique of sliding-window partition. Algorithm SWF is particularly powerful for efficient
incremental mining
for an ongoing time-variant transaction database. By utilizing proper scan reduction techniques, only one scan of the incremented dataset is needed by algorithm SWF. The I/O cost of SWF is, in orders of magnitude, smaller than those required by prior methods, thus resolving the performance bottleneck. Experimental studies are performed to evaluate performance of algorithm SWF. It is noted that the improvement achieved by algorithm SWF is even more prominent as the incremented portion of the dataset increases and also as the size of the database increases.
Conference:
International Conference on Information and Knowledge Management - CIKM
, pp. 263-270, 2001
DOI:
10.1145/502585.502630
Cumulative
Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
(
portal.acm.org
)
(
portal.acm.org
)
(
www2.ee.ntu.edu.tw
)
(
widit.slis.indiana.edu
)
(
portal.acm.org
)
(
www.informatik.uni-trier.de
)
(
arbor.ee.ntu.edu.tw
)
More »
Citation Context
(38)
...The incremental mining process of THUI-Mine is based on algorithms Two-Phase [18 ]a nd SWF [
13
]...
Hua-Fu Li
,
et al.
Fast and memory efficient mining of high-utility itemsets from data st...
...The SWF is proposed by Lee, C.H. et al. [
14
]...
Bi-ru Dai
,
et al.
iTM: An Efficient Algorithm for Frequent Pattern Mining in the Increme...
...Then several research works [5, 7, 12,
17
, 21, 26] have proposed several incremental algorithms to deal with this problem...
Ratchadaporn Amornchewin
,
et al.
False Positive Item set Algorithm for Incremental Association Rule Dis...
...Sliding window model [4,
5
] is the most representative method for finding the frequent itemsets in the recent transactions of data streams...
Bo Li
.
Fining Frequent Itemsets from Uncertain Transaction Streams
...Some prior work on streaming algorithms for mining FIs include Carma [26 ]a ndSWF [
30
]...
James Cheng
,
et al.
A survey on algorithms for mining frequent itemsets over data streams
References
(28)
Mining Generalized Association Rules
(
Citations: 931
)
Ramakrishnan Srikant
,
Rakesh Agrawal
Conference:
Very Large Data Bases - VLDB
, pp. 407-419, 1995
Algorithms for association rule mining — a general survey and comparison
(
Citations: 297
)
Jochen Hipp
,
Ulrich Güntzer
,
Gholamreza Nakhaeizadeh
Journal:
Sigkdd Explorations
, vol. 2, no. 1, pp. 58-64, 2000
Mining association rules between sets of items in large databases
(
Citations: 4908
)
Rakesh Agrawal
,
Tomasz Imieliński
,
Arun N. Swami
Journal:
Sigmod Record
, vol. 22, no. 2, pp. 207-216, 1993
FreeSpan: frequent pattern-projected sequential pattern mining
(
Citations: 265
)
Jiawei Han
,
Jian Pei
,
Behzad Mortazavi-Asl
,
Qiming Chen
,
Umeshwar Dayal
,
Mei-Chun Hsu
Conference:
Knowledge Discovery and Data Mining - KDD
, pp. 355-359, 2000
Sampling Large Databases for Association Rules
(
Citations: 590
)
Hannu Toivonen
Conference:
Very Large Data Bases - VLDB
, pp. 134-145, 1996
Sort by:
Citations
(60)
Fast and memory efficient mining of high-utility itemsets from data streams: with and without negative item profits
(
Citations: 1
)
Hua-Fu Li
,
Hsin-Yun Huang
,
Suh-Yin Lee
Journal:
Knowledge and Information Systems - KAIS
, vol. 28, no. 3, pp. 495-522, 2011
MHUI-max: An efficient algorithm for discovering high-utility itemsets from data streams
Hua-Fu Li
Journal:
Journal of Information Science
, vol. 37, no. 5, pp. 532-545, 2011
Mining frequent closed itemsets over data stream based on Bitvector and digraph
Guanglu Zhang
,
Jingsheng Lei
,
Xinghui Wu
Conference:
International Conference on Future Computer and Communication - ICFCC
, 2010
Feature-preserved sampling over streaming data
(
Citations: 1
)
Kun-ta Chuang
,
Hung-leng Chen
,
Ming-syan Chen
Journal:
ACM Transactions on Knowledge Discovery From Data - TKDD
, vol. 2, no. 4, pp. 1-45, 2009
Mining Dynamic Databases using Probability-Based Incremental Association Rule Discovery Algorithm
Ratchadaporn Amornchewin
,
Worapoj Kreesuradej
Journal:
Journal of Universal Computer Science - J.UCS
, vol. 15, no. 12, pp. 2409-2428, 2009