Advertisement

Data Mining on Desktop Grid Platforms

  • Valerie Fiolet
  • Richard Olejnik
  • Eryk Laskowski
  • Łukasz Masko
  • Marek Tudruj
  • Bernard Toursel
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4967)

Abstract

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 DisDaMin (Distributed Data Mining) project, which proposes distributed knowledge discovery through parallelization of data mining tasks. DisDaMin 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.

Keywords

Data Mining Association Rule Mining Association Rule Data Fragmentation Data Mining Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Agrawal, R., Imielinski, T., Swami, A.: Database mining: A performance perspective. In IEEE Trans. on Knowledge and Data Engineering: Special issue on learning and discovery in knowledge–based databases 5(6), 914–925 (1993)Google Scholar
  2. 2.
    Alshabani, I., Olejnik, R., Toursel, B.: Parallel Tools for a Distributed Component Framework. In: 1st International Conference on Information & Communication Technologies: from Theory to Applications (ICTTA 2004), Damascus, Syria (April 2004)Google Scholar
  3. 3.
    Agrawal, R., Srikant, R.: Fast algorithms for mining associations rules in large databases. In: Proc. of the 20th Int. Conf. on Very Large Data Bases (VLDB 1994), pp. 478–499 (September 1994)Google Scholar
  4. 4.
    Fiolet, V., Toursel, B.: Distributed Data Mining. In Scalable Computing: Practice and Experiences 6(1), 99–109 (2005)Google Scholar
  5. 5.
    Fiolet, V., Toursel, B.: Progressive Clustering for Database Distribution on a Grid. In: Proc. of ISPDC 2005, July 2005, pp. 282–289. IEEE Computer Society, Los Alamitos (2005)Google Scholar
  6. 6.
    Fiolet, V., Lefait, G., Olejnik, R., Toursel, B.: Optimal Grid Exploitation Algorithms for Data Mining. In: Proc. of ISPDC 2006, July 2006, pp. 246–252. IEEE Computer Society, Los Alamitos (2006)Google Scholar
  7. 7.
    Olejnik, R., Toursel, B., Tudruj, M., Laskowski, E., Alshabani, I.: Application of DG-ADAJ environment in Desktop Grid. Future Generation Computer Systems 23(8), 977–982 (2007)CrossRefGoogle Scholar
  8. 8.
    Olejnik, R., Bouchi, A., Toursel, B.: Object observation for a java adaptative distributed application platform. In: Intl. Conference on Parallel Computing in Electrical Engineering PARELEC 2002, Warsaw, Poland, pp. 171–176 (September 2002)Google Scholar
  9. 9.
    Park, J.S., Chen, M.-S., Yu, P.S.: Efficient parallel data mining for association rules. In: Proc. of the 4th Int. Conf. on Information and Knowledge Management, pp. 31–36 (1995)Google Scholar
  10. 10.
    Srikant, R.: Fast algorithms for mining association rules and sequential patterns. PhD thesis, University of Wisconsin (1996)Google Scholar
  11. 11.
    Shintani, T., Kitsuregawa, M.: Hash-Based Parallel Algorithms fir Mining Association Rules. In: Proc. of the Int. Conf. on Parallel and Distributed Information Systems (1996)Google Scholar
  12. 12.
    Savasere, A., Omiecinski, E., Navathe, S.: An efficient algorithm for mining association rules in large databses. In: Proc. of the 21st VLDB Int. Conf (VLDB 1995), pp. 432–444 (September 1995)Google Scholar
  13. 13.
    Congiusta, A., Talia, D., Trunfioa, P.: Distributed data mining services leveraging WSRF. Future Generation Computing Systems 23(1), 34–41 (2007)CrossRefGoogle Scholar
  14. 14.
    Zaki, M.J.: Parallel and Distributed Association Mining: A survey. In IEEE Concurrency, special issue on Parallel Mechanisms for Data Mining 7(4), 14–25 (1999)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Valerie Fiolet
    • 1
  • Richard Olejnik
    • 1
  • Eryk Laskowski
    • 2
  • Łukasz Masko
    • 2
  • Marek Tudruj
    • 2
  • Bernard Toursel
    • 1
  1. 1.Laboratoire d’Informatique Fondamentale de Lille (LIFL UMR CNRS 8022)Université des Sciences et Technologies de Lille (USTL)LilleFrance
  2. 2.Institute of Computer Science Polish Academy of SciencesWarsawPoland

Personalised recommendations