Please use this identifier to cite or link to this item:
|Title:||An investigation on sampling technique for multi-objective restricted Boltzmann machine|
|Citation:||Shim, V.A.,Tan, K.C.,Chia, J.Y. (2010). An investigation on sampling technique for multi-objective restricted Boltzmann machine. 2010 IEEE World Congress on Computational Intelligence, WCCI 2010 - 2010 IEEE Congress on Evolutionary Computation, CEC 2010 : -. ScholarBank@NUS Repository. https://doi.org/10.1109/CEC.2010.5586469|
|Abstract:||Estimation of distribution algorithms are increasingly gaining research interest due to their linkage information exploration feature. Two main mechanisms which contribute towards the success of the algorithms are probabilistic modeling and sampling method. Recent attention has been directed towards the development of probabilistic building technique. However, research on the sampling approach is less developed. Thus, this paper carries out an investigation on sampling technique for a novel multi-objective estimation of distribution algorithm - multi-objective restricted Boltzmann machine. Two variants of a new sampling technique based on energy value of the solutions in the trained network are proposed to improve the efficiency of the algorithm. Probabilistic information which is usually clamped into marginal probability distribution may hinder the algorithm in producing solutions that have high linkage dependency between variables. The proposed approach will overcome this limitation of probabilistic modeling in restricted Boltzmann machine. The empirical investigation shows that the proposed algorithm gives promising result in term of convergence and convergence rate. © 2010 IEEE.|
|Source Title:||2010 IEEE World Congress on Computational Intelligence, WCCI 2010 - 2010 IEEE Congress on Evolutionary Computation, CEC 2010|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jan 16, 2019
checked on Oct 6, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.