Abstract
Distributed computing based on P2P (peer-to-peer) networks is a technology attainable at a relatively low cost. This enables us to propose a flexible approach based on "Parution" algorithm as an extension of "Aprion"' algorithm to efficiently mine association rules by cooperatively partitioning and distributing processes to nodes on a virtually tree-like P2P network topology. The concept of cooperation here means that any internal node contributes to the control of the whole processes. First, we describe the general design of our basic approach and compare it with related techniques. We explain the basic algorithm (without load balancing) implemented as experimental programs in detail. Next, we explain simulation settings and discuss evaluation results, which can validate the effectiveness of our basic approach. Further, we describe and evaluate the algorithm with load balancing as an extension to the basic algorithm.
| Original language | English |
|---|---|
| Pages (from-to) | 178-188 |
| Number of pages | 11 |
| Journal | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| Volume | 3213 |
| Publication status | Published - 2004 |
| Externally published | Yes |
Fingerprint
ASJC Scopus subject areas
- Computer Science(all)
- Biochemistry, Genetics and Molecular Biology(all)
- Theoretical Computer Science
Cite this
A Peer-to-Peer Approach to Parallel Association Rule Mining. / Ishikawa, Hiroshi; Shioya, Yasuo; Omi, Takeshi; Ohta, Manabu; Katayama, Kaoru.
In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 3213, 2004, p. 178-188.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - A Peer-to-Peer Approach to Parallel Association Rule Mining
AU - Ishikawa, Hiroshi
AU - Shioya, Yasuo
AU - Omi, Takeshi
AU - Ohta, Manabu
AU - Katayama, Kaoru
PY - 2004
Y1 - 2004
N2 - Distributed computing based on P2P (peer-to-peer) networks is a technology attainable at a relatively low cost. This enables us to propose a flexible approach based on "Parution" algorithm as an extension of "Aprion"' algorithm to efficiently mine association rules by cooperatively partitioning and distributing processes to nodes on a virtually tree-like P2P network topology. The concept of cooperation here means that any internal node contributes to the control of the whole processes. First, we describe the general design of our basic approach and compare it with related techniques. We explain the basic algorithm (without load balancing) implemented as experimental programs in detail. Next, we explain simulation settings and discuss evaluation results, which can validate the effectiveness of our basic approach. Further, we describe and evaluate the algorithm with load balancing as an extension to the basic algorithm.
AB - Distributed computing based on P2P (peer-to-peer) networks is a technology attainable at a relatively low cost. This enables us to propose a flexible approach based on "Parution" algorithm as an extension of "Aprion"' algorithm to efficiently mine association rules by cooperatively partitioning and distributing processes to nodes on a virtually tree-like P2P network topology. The concept of cooperation here means that any internal node contributes to the control of the whole processes. First, we describe the general design of our basic approach and compare it with related techniques. We explain the basic algorithm (without load balancing) implemented as experimental programs in detail. Next, we explain simulation settings and discuss evaluation results, which can validate the effectiveness of our basic approach. Further, we describe and evaluate the algorithm with load balancing as an extension to the basic algorithm.
UR - http://www.scopus.com/inward/record.url?scp=35048839082&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=35048839082&partnerID=8YFLogxK
M3 - Article
AN - SCOPUS:35048839082
VL - 3213
SP - 178
EP - 188
JO - Lecture Notes in Computer Science
JF - Lecture Notes in Computer Science
SN - 0302-9743
ER -