|
Title:
|
A NEW AND OPTIMAL ARCHITECTURE FOR APPLYING ASSOCIATION RULE MINING ALGORITHMS ON GRID |
|
Author(s):
|
Asgarali Bouyer , Bahman Arasteh , Mohammad Bager Karimi , Mohammad Javad Hoseyni , Ali Bouyer |
|
ISBN:
|
978-972-8924-40-9 |
|
Editors:
|
Jörg Roth, Jairo Gutiérrez and Ajith P. Abraham (series editors: Piet Kommers, Pedro Isaías and Nian-Shing Chen) |
|
Year:
|
2007 |
|
Edition:
|
Single |
|
Keywords:
|
Grid, Data mining, Cluster computing, Association Rule, Horizontal distribution, middleware |
|
Type:
|
Poster/Demonstration |
|
First Page:
|
230 |
|
Last Page:
|
232 |
|
Language:
|
English |
|
Cover:
|
|
|
Full Contents:
|
click to dowload 
|
|
Paper Abstract:
|
Grid computing is the on-demand sharing of computing resources with in a tightly-coupled network to solve certain
problems. One of the main topics is knowledge discovery and data mining. By using grid computing, we can solve this
problem. To achieve these very ambitious goals, we present an architecture for applying Association rule mining
algorithms on grid environment. Association rule mining seeks to discover associations among transactions encoded in a
database on each machine and then send result to related coordinator.
This new architecture is powerful and rapid. We tried to compare our method with a serial processing. Our experimental
results show that by using the new architecture on our desired sample, we will get a better speedup with high confidence. |
|
|
|
|
|
|
