Memetic particle swarm optimisation for missing value imputation

R. Sivaraj and R. DeviPriya

International Journal of Data Analysis Techniques and Strategies, 2019, vol. 11, issue 3, 273-289

Abstract: Incomplete values in databases stand as a major concern for data analysts and many methods have been devised to handle them in different missing scenarios. Many researchers are increasingly using evolutionary algorithms for handling them. In this paper, a memetic algorithm based approach is proposed which integrates the principles of particle swarm optimisation and simulated annealing, a local search method. A novel initialisation strategy for PSO is also proposed in order to seed good particles into the population. Simulated annealing prevents PSO from premature convergence and helps it in reaching global optimum. PSO algorithm exhibits explorative behaviour and SA exhibits exploitative behaviour and serves as the right combination for memetic algorithm implementation. The proposed algorithm is implemented in different datasets to estimate the missing values and the imputation accuracy and the time taken for execution is found to be better than other standard methods.

Keywords: memetic algorithm; tournament selection; Bayesian probability; simulated annealing. (search for similar items in EconPapers)
Date: 2019
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=101156 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:injdan:v:11:y:2019:i:3:p:273-289

Access Statistics for this article

More articles in International Journal of Data Analysis Techniques and Strategies from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().