Restricted Boltzmann Machine-driven Interactive Estimation of Distribution Algorithm for personalized search

2020 ◽  
Vol 200 ◽  
pp. 106030
Author(s):  
Lin Bao ◽  
Xiaoyan Sun ◽  
Yang Chen ◽  
Dunwei Gong ◽  
Yongwei Zhang
Complexity ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-13 ◽  
Author(s):  
Lin Bao ◽  
Xiaoyan Sun ◽  
Yang Chen ◽  
Guangyi Man ◽  
Hui Shao

A novel algorithm, called restricted Boltzmann machine-assisted estimation of distribution algorithm, is proposed for solving computationally expensive optimization problems with discrete variables. First, the individuals are evaluated using expensive fitness functions of the complex problems, and some dominant solutions are selected to construct the surrogate model. The restricted Boltzmann machine (RBM) is built and trained with the dominant solutions to implicitly extract the distributed representative information of the decision variables in the promising subset. The visible layer’s probability of the RBM is designed as the sampling probability model of the estimation of distribution algorithm (EDA) and is updated dynamically along with the update of the dominant subsets. Second, according to the energy function of the RBM, a fitness surrogate is developed to approximate the expensive individual fitness evaluations and participates in the evolutionary process to reduce the computational cost. Finally, model management is developed to train and update the RBM model with newly dominant solutions. A comparison of the proposed algorithm with several state-of-the-art surrogate-assisted evolutionary algorithms demonstrates that the proposed algorithm effectively and efficiently solves complex optimization problems with smaller computational cost.


2017 ◽  
Vol 21 (4) ◽  
pp. 588-600 ◽  
Author(s):  
Yang Chen ◽  
Xiaoyan Sun ◽  
Dunwei Gong ◽  
Yong Zhang ◽  
Jong Choi ◽  
...  

Author(s):  
Jayashree R. ◽  
Vaithyasubramanian S.

In this chapter, restricted Boltzmann machine-driven (RBM) algorithm is presented with an enhanced interactive estimation of distribution (IED) method for websites. Indian matrimonial websites are famous intermediates for finding marriage-partners. Matchmaking is one of the most pursued objectives in matrimonial websites. The complex evaluations and full of zip user preferences are the challenges. An interactive evolutionary algorithm with powerful evolutionary strategies is a good choice for matchmaking. Initially, an IED is generated as a probability model for the estimation of a user preference and then two RBM models, one for interested and the other for not-interested, is generated to endow with a set of appropriate matches simultaneously. In the proposed matchmaking method, the RBM model is combined with social group knowledge. Some benchmarks from the matrimonial internet site are pragmatic to empirically reveal the pre-eminence of the anticipated method.


Sign in / Sign up

Export Citation Format

Share Document