@inproceedings { , title = {Information core optimization using Evolutionary Algorithm with Elite Population in recommender systems}, abstract = {Recommender system (RS) plays an important role in helping users find the information they are interested in and providing accurate personality recommendation. It has been found that among all the users, there are some user groups called “core users” or “information core” whose historical behavior data are more reliable, objective and positive for making recommendations. Finding the information core is of great interests to greatly increase the speed of online recommendation. There is no general method to identify core users in the existing literatures. In this paper, a general method of finding information core is proposed by modelling this problem as a combinatorial optimization problem. A novel Evolutionary Algorithm with Elite Population (EA-EP) is presented to search for the information core, where an elite population with a new crossover mechanism named as ordered crossover is used to accelerate the evolution. Experiments are conducted on Movielens (100k) to validate the effectiveness of our proposed algorithm. Results show that EA-EP is able to effectively identify core users and leads to better recommendation accuracy compared to several existing greedy methods and the conventional collaborative filter (CF). In addition, EA-EP is shown to significantly reduce the time of online recommendation.}, conference = {2017 IEEE Congress on Evolutionary Computation (CEC 2017)}, note = {No ISSN seems to have been given to this series. This appeared to be non-compliant as it was mistakenly entered as a submitted version. This was corrected on 11 Jan 2018 and so that appears to be the first compliant deposit.}, organization = {San Sebastian, Spain}, publicationstatus = {Published}, url = {https://nottingham-repository.worktribe.com/output/871598}, keyword = {evolutionary algorithm, elite population, recommender system, core users}, year = {2017}, author = {Mu, Caihong and Cheng, Huiwen and Feng, Wei and Liu, Yi and Qu, Rong} }