A new method to find neighbor users that improves the performance of Collaborative Filtering |
| |
| Affiliation: | 1. Department of Systems and Energy, University of Campinas – UNICAMP, Campinas, São Paulo, Brazil;2. Department of Computer Science, Federal University of São Carlos – UFSCar, Sorocaba, São Paulo, Brazil;1. College of Computer Science and Technology, University South China, Hengyang 421001, China;2. Department of Computer Science and Technology, Tsinghua University, Beijing 100084, China;1. Department of Software Engineering, University of Granada, 18071 Granada, Spain;2. Department of Marketing and Market Research, Complutense University of Madrid, 28015 Madrid, Spain;3. Department of Computer Science and Artificial Intelligence, University of Granada, 18071 Granada, Spain;4. Department of Electrical and Computer Engineering, King Abdulaziz University, 21589 Jeddah, Saudi Arabia;5. Centre for Computational Intelligence, De Montfort University, LE1 9BH Leicester, UK;1. Instituto Superior Politécnico José Antonio Echeverría, Calle 114 No. 11901, Marianao, La Habana C.P. 19390, Cuba;2. Instituto Nacional de Astrofísica, Óptica y Electrónica, Luis Enrique Erro No. 1, Sta. María Tonanzintla, Puebla C.P. 72840, México;3. Centro de Bioplantas, Universidad de Ciego de Ávila, Carretera a Morón km 9, Ciego de Ávila C.P. 69450, Cuba |
| |
| Abstract: | Recommender Systems (RS) are used to help people reduce the amount of time they spend to find the items they are looking for. One of the most successful techniques used in RS is called Collaborative Filtering (CF). It looks into the choices made by other users to find items that are most similar to the target user. Data sparsity and high dimensionality which are common in the RS domains have negatively affected the efficiency of CF. The current paper seeks to solve the mentioned problems through a neighbor user finding method which has been derived from the subspace clustering approach. In this method, the authors extract different subspaces of rated items under the categories of Interested, Neither Interested Nor Uninterested, and Uninterested. Based on subspaces, tree structures of neighbor users are drawn for the target user. Furthermore, a new similarity method is proposed to compute the similarity value. This new method has been tested via the Movielens 100K, Movielens 1M and Jester datasets in order to make a comparison with the traditional techniques. The results have indicated that the proposed method can enhance the performance of the Recommender Systems. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
