Efficient parallel data mining for association rules
CIKM '95 Proceedings of the fourth international conference on Information and knowledge management
Hash based parallel algorithms for mining association rules
DIS '96 Proceedings of the fourth international conference on on Parallel and distributed information systems
Parallel and Distributed Association Mining: A Survey
IEEE Concurrency
Database Mining: A Performance Perspective
IEEE Transactions on Knowledge and Data Engineering
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
An Efficient Algorithm for Mining Association Rules in Large Databases
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
An Object Observation for a Java Adaptative Distributed Application Platform
PARELEC '02 Proceedings of the International Conference on Parallel Computing in Electrical Engineering
Fast algorithms for mining association rules and sequential patterns
Fast algorithms for mining association rules and sequential patterns
Progressive Clustering for Database Distribution on a Grid
ISPDC '05 Proceedings of the The 4th International Symposium on Parallel and Distributed Computing
Optimal Grid Exploitation Algorithms for Data Mining
ISPDC '06 Proceedings of the Proceedings of The Fifth International Symposium on Parallel and Distributed Computing
Distributed data mining services leveraging WSRF
Future Generation Computer Systems - Special section: Data mining in grid computing environments
Byte-code scheduling of Java programs with branches for desktop grid
Future Generation Computer Systems
| Hi-index | 0.01 |
Very large data volumes and high computation costs in data mining applications justify the use for them of Grid-level massive parallelism. The paper concerns Grid-oriented implementation of the Dis-DaMin (Distributed Data Mining) project, which proposes distributed knowledge discovery through parallelization of data mining tasks. Dis-DaMin solves data mining problems by using new distributed algorithms based on special clusterized data decomposition and asynchronous task processing, which match the Grid computing features. The DisDaMin algorithms are embedded inside the DG-ADAJ (Desktop-Grid Adaptative Application in Java) system, which is a middleware platform for Desktop Grid. It provides adaptive control of distributed applications written in Java for Grid or Desktop Grid. It allows an optimized distribution of applications on clusters of Java Virtual Machines, monitoring of application execution and dynamic on-line balancing of processing and communication. Simulations were performed to prove the efficiency of the proposed mechanisms. They were carried on using the French national project Grid'5000 (part of the CoreGrid project) and the DG-ADAJ.