بهبود عملکرد سیستم های پیشنهاد دهنده با استفاده از هستی شناسی

Recommender systems have emerged in the e-commerce domain and have been developed to actively recommend appropriate items to online users. The use of recently developed hybrid recommendation systems has helped overcome the main drawbacks of Content-Based Filtering (CBF) and Collaborative Filtering (CF). In hybrid recommendation systems that combine CF and CBF, the CF part uses two methods, including memory- and model-based approaches. Both approaches have some advantages and disadvantages for item recommendation. Sparsity has been one of the main difficulties associated with these approaches, whereas recommendation with high accuracy has been one of the important advantages of the memory-based approach. However, this approach is not scalable for current recommendation systems as their databases include huge numbers of items and users. In contrast, the model-based approach generates recommendations with low accuracy but is scalable for large databases in e-commerce recommender systems. Accordingly, to address this problem and take advantage of both approaches, in this work, we propose a new hybrid recommendation method and evaluate it using a real-world dataset. The aim is to improve efficiency and accuracy by designing a heuristic hybrid recommender method that combines memory-based and model-based approaches. Specifically, we use ontology in the CF part and improve ontology structure by eliminating uniformity of edges of the hierarchical relation between concepts (IS-A relation) in item ontology in the CBF part. Ontology structure is considered for improving accuracy; according to this, a new method for measuring semantic similarity that is more accurate than the traditional methods is presented. This new method can enhance the accuracy of CF and CBF in our method. In addition, the number of searches required to find similar clusters and neighbor users of the target user is decreased significantly using ontology, enhanced clustering and the new proposed algorithm. We evaluate the proposed method using a real-world dataset. The experimental results show that our method is more scalable and accurate than the benchmark k-Nearest Neighbor (k-NN) and model-based recommendation methods.