2024 : 2 : 23
Parham Moradi

Parham Moradi

Academic rank: Associate Professor
Education: PhD.
ScopusId: 654
Faculty: Faculty of Engineering
Address: Department of Computer Engineering, Faculty of Engineering, University of Kurdistan


A Trust-based Recommender System by Integration of Graph Clustering and Ant Colony Optimization
Collaborative Filtering, Recommender Systems, Graph Clustering, Ant Colony Optimization
Researchers Parham Moradi ، Mohammad Hatami ، Sabah Robitan Mahmood


Recommender systems (RSs) are intelligent systems to help e-commerce users to find their preferred items among millions of available items by considering the profiles of both users and items. These systems need to predict the unknown ratings and then recommend a set of high rated items. Among the others, Collaborative Filtering (CF) is a successful recommendation approach and has been utilized in many real-world systems. CF methods seek to predict missing ratings by considering the preferences of those users who are similar to the target user. A major task in Collaborative Filtering is to identify an accurate set of users and employing them in the rating prediction process. Most of the CF-based methods suffer from the cold-start issue which arising from an insufficient number of ratings in the prediction process. This is due to the fact that users only comment on a few items and thus CF methods faced with a sparse user-item matrix. To tackle this issue, a new collaborative filtering method is proposed that has a trust-aware strategy. The proposed method employs the trust relationships of users as additional information to help the CF tackle the cold-start issue. To this end, the proposed integrated trust relationships in the prediction process by using the Ant Colony Optimization (ACO). The proposed method has four main steps. The aim of the first step is ranking users based on their similarities to the target user. This step uses trust relationships and the available rating values in its process. Then in the second step, graph clustering methods are used to cluster the trust graph to group similar users. In the third step, the users are weighted based on their similarities to the target users. To this end, an ACO process is employed on the users' graph. Finally, those of top users with high similarity to the target user are used in the rating prediction process. The superiority of our method has been shown in the experimental results in comparison with well-known a...