Chapter

Advances in Intelligent Data Analysis Reasoning about Data

Volume 1280 of the series Lecture Notes in Computer Science pp 437-445

Date:

Parallel induction algorithms for data mining

  • John DarlingtonAffiliated withDepartment of Computing, Imperial College
  • , Yi -ke GuoAffiliated withDepartment of Computing, Imperial College
  • , Janjao SutiwaraphunAffiliated withDepartment of Computing, Imperial College
  • , Hing Wing ToAffiliated withDepartment of Computing, Imperial College

* Final gross prices may vary according to local VAT.

Get Access

Abstract

In the last decade, there has been an explosive growth in the generation and collection of data. Nonetheless, the quality of information inferred from this voluminous data has not been proportional to its size. One of the reasons for this is that the computational complexities of the algorithms used to extract information from the data are normally proportional to the number of input data items resulting in prohibitive execution time on large data sets. Parallelism is one solution to this problem. In this paper we present preliminary results on experiments in parallelising C4.5, a classification-rule learning system using decision-trees as a model representation, which has been used as a base model for investigating methods for parallelising induction algorithms. The experiments assess the potential for improving the execution time by exploiting parallelism in the algorithm.