2020
DOI: 10.1109/tnse.2018.2862948
|View full text |Cite
|
Sign up to set email alerts
|

A Parallel Recommender System Using a Collaborative Filtering Algorithm with Correntropy for Social Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
4
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
5
1
1
1

Relationship

2
6

Authors

Journals

citations
Cited by 20 publications
(4 citation statements)
references
References 56 publications
0
4
0
Order By: Relevance
“…Furthermore, motivated by some successful work [ 46 , 47 , 48 , 49 ], we introduce the parallel structure into the proposed algorithm to make full use of computing resources and reduce the running time. Generally, parallel models of the common GA can be divided into four categories, including the master-slave model, coarse-grained model, fine-grained model, and hybrid model [ 47 ].…”
Section: The Proposed Solution Methods Using the Pa-jaya Algorithmmentioning
confidence: 99%
“…Furthermore, motivated by some successful work [ 46 , 47 , 48 , 49 ], we introduce the parallel structure into the proposed algorithm to make full use of computing resources and reduce the running time. Generally, parallel models of the common GA can be divided into four categories, including the master-slave model, coarse-grained model, fine-grained model, and hybrid model [ 47 ].…”
Section: The Proposed Solution Methods Using the Pa-jaya Algorithmmentioning
confidence: 99%
“…Item-based Collaborative Filtering (IBCF) is another strategy based on favorite items of a given user. Similar to UBCF, it suffers from the dispersion of rates and stagnation, which is defined as the system's failure to recommend recently added items until some users rate them [33].…”
Section: Content-based Filtering (Cbf)mentioning
confidence: 99%
“…Collaborative filtering mainly has two types: user-based and item-based [ [5]]. Userbased algorithms recommend items that users with similar interests have liked but the target user has not purchased, while item-based algorithms recommend items similar to those that the target user likes [ [6]].…”
Section: Introductionmentioning
confidence: 99%