dc.contributor.author | Mumin, D | |
dc.contributor.author | Shi, L-L | |
dc.contributor.author | Liu, L | |
dc.contributor.author | Han, Z-X | |
dc.contributor.author | Jiang, L | |
dc.contributor.author | Wu, Y | |
dc.date.accessioned | 2024-07-03T12:49:37Z | |
dc.date.issued | 2024-05-16 | |
dc.date.updated | 2024-07-03T12:07:52Z | |
dc.description.abstract | Object ratings in recommendation algorithms are used to represent the extent to which a user likes an object. Most existing recommender systems use
these ratings to recommend the top-K objects to a target user. To improve the
accuracy and diversity of recommender systems, we proposed a neighbourhoodbased diffusion recommendation algorithm (NBD) that distributes the resources
among objects using the rating scores of the objects based on the likings of the
target user neighbours. Specifically, the Adamic-Adar similarity index is used to
calculate the similarity between the target user and other users to select the top K
similar neighbours to begin the diffusion process. In this approach, greater significance is put on common neighbours with fewer neighbour nodes. This is to
reduce the effect of popular objects. At the end of the diffusion process, a modified redistribution algorithm using the sigmoid function is explored to finally redistribute the resources to the objects. This is to ensure that the objects recommended are personalized to target users. The evaluation has been conducted
through experiments using four real-world datasets (Friendfeed, Epinions, MovieLens-100K, and Netflix). The experiment results show that the performance of
our proposed NBD algorithm is better in terms of accuracy when compared with
the state-of-the-art algorithms. | en_GB |
dc.description.sponsorship | National Natural Science Foundation of China | en_GB |
dc.description.sponsorship | China Postdoctoral Science Foundation | en_GB |
dc.description.sponsorship | Natural Science Foundation of the Jiangsu Higher Education Institutions | en_GB |
dc.description.sponsorship | Jiangsu University Innovative Research Project | en_GB |
dc.format.extent | 1-20 | |
dc.identifier.citation | Published online 16 May 2024 | en_GB |
dc.identifier.doi | https://doi.org/10.1007/s10115-024-02127-1 | |
dc.identifier.grantnumber | 62302199 | en_GB |
dc.identifier.grantnumber | 2023M731368 | en_GB |
dc.identifier.grantnumber | 22KJB520016 | en_GB |
dc.identifier.grantnumber | KYCX22_3671 | en_GB |
dc.identifier.uri | http://hdl.handle.net/10871/136559 | |
dc.language.iso | en | en_GB |
dc.publisher | Springer | en_GB |
dc.rights.embargoreason | Under embargo until 16 May 2025 in compliance with publisher policy | en_GB |
dc.rights | © 2024, The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature | en_GB |
dc.subject | Recommender system | en_GB |
dc.subject | Personalized recommendation | en_GB |
dc.subject | Neighborhood-based recommendation | en_GB |
dc.subject | Diffusion-based recommendation | en_GB |
dc.subject | item recommendation | en_GB |
dc.title | A new neighbourhood-based diffusion algorithm for personalized recommendation | en_GB |
dc.type | Article | en_GB |
dc.date.available | 2024-07-03T12:49:37Z | |
dc.identifier.issn | 0219-1377 | |
dc.description | This is the author accepted manuscript. The final version is available from Springer via the DOI in this record | en_GB |
dc.identifier.eissn | 0219-3116 | |
dc.identifier.journal | Knowledge and Information Systems | en_GB |
dc.relation.ispartof | Knowledge and Information Systems | |
dc.rights.uri | http://www.rioxx.net/licenses/all-rights-reserved | en_GB |
dcterms.dateAccepted | 2024-04-16 | |
rioxxterms.version | AM | en_GB |
rioxxterms.licenseref.startdate | 2024-05-16 | |
rioxxterms.type | Journal Article/Review | en_GB |
refterms.dateFCD | 2024-07-03T12:45:02Z | |
refterms.versionFCD | AM | |
refterms.panel | B | en_GB |
refterms.dateFirstOnline | 2024-05-16 | |