23 October 2019 in Complex & Intelligent Systems
In recent years, application of recommendation algorithm in real life such as Amazon, Taobao is getting universal, but it is not perfect yet. A few problems need to be solved such as sparse data and low recommended accuracy. Collaborative filtering is a mature algorithm in the recommended systems, but there are still some problems. In this paper, a novel collaborative filtering recommendation algorithm based on user correlation and evolutionary clustering is presented. Firstly, score matrix is pre-processed with normalization and dimension reduction, to obtain denser score data. Based on these processed data, clustering principle is generated and dynamic evolutionary clustering is implemented. Secondly, the search for the nearest neighbors with highest similar interest is considered. A measurement about the relationship between users is proposed, called user correlation, which applies the satisfaction of users and the potential information. In each user group, user correlation is applied to choose the nearest neighbors to predict ratings. The proposed method is evaluated using the Movielens dataset. Diversity experimental results demonstrate that the proposed method has outstanding performance in predicted accuracy and recommended precision.
1 April 2016 in Physica A: Statistical Mechanics and its Applications
10 May 2024 in IEEE Transactions on Evolutionary Computation
Since severe environmental problem in manufacturing industries is becoming increasingly prominent, energy-efficient production scheduling has gained more and more attentions. This paper studies an energy-efficient distributed fuzzy hybrid blocking flow-shop scheduling problem (EEDFHBFSP), where processing time and setup time are uncertain. The objective is to minimize fuzzy makespan and total fuzzy energy consumption simultaneously. To solve such problem, a mixed-integer linear programming model is firstly presented to format it. Then, a meta-Q-learning-based multi-objective metaheuristic (MQL-MM) is proposed. In MQL-MM, a machine-position-based dispatch rule is designed as the decoding scheme. A decomposition-based constructive heuristic is employed to generate the initial population with high quality and diversity. Several problem-specific search operators are developed to explore and exploit the solution space. A meta-Q-learning-based multi-objective search framework is presented to guide the using of search operators, which includes a meta-training phase and an adaptive search phase. The meta-training phase is employed to train the search operators to construct the Q-learning model. The adaptation search phase utilizes such model to conduct the automatic selection of the search operators. Moreover, an energy saving strategy is designed to improve the candidate solutions. Finally, we conduct extensive experiments. The experimental results show that the designs of MQL-MM are effective, and MQL-MM performs better than several well-performing methods on solving EEDFHBFSP.
19 May 2022 in Expert Systems with Applications
1 September 2018 in Chaos, Solitons & Fractals
19 July 2022 in IEEE Transactions on Emerging Topics in Computational Intelligence
In order to alleviate the network information overload, recommender system becomes widespread in personalized recommendation. However, due to the increase of the number of users and items in the network, the rating data gets increasingly sparse. At this time, it is necessary to use a variety of clustering algorithms to divide nodes into different communities, and then make recommendations in each community, which can improve the performance of recommendations and reduce the time complexity of algorithms. In this paper, we propose a game-based evolutionary clustering with historical information aggregation for personal recommendation. Firstly, a payoff function of game theory is introduced into the evolutionary clustering to accelerate the stability of the algorithm. In this clustering approach, the next state value of each node is related not only to the current state value, but also to the historical states, hence, it achieve better prediction results. Meanwhile, the clustering method is theoretically proved to be stable by Lyapunov stability theory. And then, we predict the possible ratings by the user-based collaborate filtering method, and recommend items for target users according to the preferences of neighbors. Finally, diverse experiments are executed on seven real recommendation datasets to verify our recommendation results are better than several compared algorithms.