Download:
|
by Adriano Veloso, Wagner Meira, Srinivasan Parthasarathy
http://www.dcc.ufmg.br/~adrianov/papers/SBAC03/Veloso-sbac03.ps.gz
Add To MetaCart
Abstract:
Frequent itemset mining is a classic problem in data mining. It is a non-supervised process which concerns in finding frequent patterns (or itemsets) hidden in large volumes of data in order to produce compact summaries or models of the database. These models are typically used to generate association rules, but recently they have also been used in far reaching domains like e-commerce and bio-informatics. Because databases are increasing in terms of both dimension (number of attributes) and size (number of records), one of the main issues in a frequent itemset mining algorithm is the ability to analyze very large databases. Sequential algorithms do not have this ability, especially in terms of run-time performance, for such very large databases. Therefore, we must rely on high performance parallel and distributed computing. We present new parallel algorithms for frequent itemset mining. Their efficiency is proven through a series of experiments on different parallel environments, that range from shared-memory multiprocessors machines to a set of SMP clusters connected together through a high speed network. 1.
Citations
|
1606
|
Fast algorithms for mining association rules
– Agrawal, Srikant
- 1994
|
|
157
|
Parallel Mining of Association Rules
– Agrawal, Shafer
- 1996
|
|
138
|
Active Cache: Caching dynamic contents on the Web
– Cao, Zhang, et al.
- 1999
|
|
125
|
Scalable parallel data mining for association rules
– Han, Karypis, et al.
- 1997
|
|
114
|
Measuring the Capacity of a Web Server
– Banga, Druschel
- 1997
|
|
58
|
Rules of Thumb in Data Engineering
– Gray, Shenoy
|
|
51
|
Parallel Data Mining for Association Rules on Shared-Memory Systems
– Parthasarathy, Zaki, et al.
|
|
43
|
W.Li. Parallel algorithms for fast discovery of association rules
– Zaki, Parthasarathy, et al.
- 1997
|
|
22
|
Mining frequent itemsets in evolving databases
– Veloso
- 2002
|
|
22
|
A localized algorithm for parallel association mining
– Zaki, Parthasarathy, et al.
- 1997
|
|
22
|
Squid Internet Object Cache
– Wessels
- 1996
|
|
15
|
Software caching on cache-coherent multiprocessors
– Bianchini, LeBlanc
- 1992
|
|
10
|
Effect of data distribution in parallel mining of associations
– Cheung, Xiao
- 1999
|
|
3
|
Efficient parallel algorithms for mining associations
– Joshi, Han, et al.
|
|
3
|
Parallel, incremental and interactive frequent itemset mining
– Veloso, Meira, et al.
- 2003
|
|
3
|
Efficiency analysis of e-brokers in the electronic marketplace
– Almeida, Jr, et al.
- 1999
|
|
2
|
New algorithms for mining association rules
– Zaki, Parthasarathy, et al.
- 1997
|
|
1
|
Web Caching - An Introduction. http://www.cs.ubc.ca/spider/mjmccut/webcache.html
– McCutcheon
|
