Projects per year
Abstract
An important and challenging data mining application in marketing is to learn models for predicting potential customers who contribute large profits to a company under resource constraints. In this chapter, we first formulate this learning problem as a constrained optimization problem and then convert it to an unconstrained multi-objective optimization problem (MOP), which can be handled by some multi-objective evolutionary algorithms (MOEAs). However, MOEAs may execute for a long time for theMOP, because several evaluations must be performed. A promising approach to overcome this limitation is to parallelize these algorithms. Thus we propose a parallel MOEA on consumer-level graphics processing units (GPU) to tackle the MOP. We perform experiments on a real-life direct marketing problem to compare the proposed method with the parallel hybrid genetic algorithm, the DMAX approach, and a sequential MOEA. It is observed that the proposed method is much more effective and efficient than the other approaches.
Original language | English |
---|---|
Title of host publication | Massively Parallel Evolutionary Computation on GPGPUs |
Publisher | Springer-Verlag GmbH and Co. KG |
Pages | 287-307 |
Number of pages | 21 |
ISBN (Print) | 9783642379581 |
DOIs | |
Publication status | Published - 1 Jan 2013 |
Fingerprint
Dive into the research topics of 'Data mining using parallel multi-objective evolutionary algorithms on graphics processing units'. Together they form a unique fingerprint.Projects
- 1 Finished
-
Adaptive Grammar-Based Genetic Programming with Dependence Learning (基於文法及依存關係學習的適應性遺傳編程法)
WONG, M. L. (PI) & LEUNG, K. S. (CoI)
Research Grants Council (HKSAR)
1/01/12 → 30/06/15
Project: Grant Research