2019
DOI: 10.1016/j.is.2019.07.001
|View full text |Cite
|
Sign up to set email alerts
|

Bridging the gap between linked open data-based recommender systems and distributed representations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
3
1
1
1

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(8 citation statements)
references
References 26 publications
(47 reference statements)
0
8
0
Order By: Relevance
“…Existing research generally uses contextual information with latent factor methods, especially MF, to achieve the relationship between users and items [Basile et al,2019]. The recommendation algorithm presented a multidimensional approach through the scattered linear method and MF [Sun et al,2020].…”
Section: Hybridmentioning
confidence: 99%
See 1 more Smart Citation
“…Existing research generally uses contextual information with latent factor methods, especially MF, to achieve the relationship between users and items [Basile et al,2019]. The recommendation algorithm presented a multidimensional approach through the scattered linear method and MF [Sun et al,2020].…”
Section: Hybridmentioning
confidence: 99%
“…Finally, a single value decomposition matrix called FCSVD is presented. Regarding that, formula (12) calculates the actual value of r uic . The approximate rate of user u to item i with c context is the actual value of r uic .…”
Section: Context Similarity Singular Value Decomposition (Fcsvd)mentioning
confidence: 99%
“…Existing knowledge graph-based recommendation methods can be classified into embedding-based and path-based methods. The former methods incorporate a knowledge graph into the recommendation by learning representations of entities and relations in the knowledge graph and then incorporating the learned representations into a recommendation framework (Basile et al , 2019; Cao et al , 2019; He et al , 2019; Ren et al , 2019). The latter methods use explicit connections between entities in a knowledge graph to enrich profiles by adding relevant entities or to measure entity similarities by using graph analysis techniques (Chaudhari et al , 2017; Deng et al , 2019; Pla Karidi et al , 2018).…”
Section: Theoretical Background and Literature Reviewmentioning
confidence: 99%
“…Collaborative (CL) systems make recommendations based on groups of users with similar preferences. The similarity between users is normally computed by comparing the ratings that they give to some of the items [66]. Next, the results obtained over the MovieLens 1M and MovieLens 10M datasets are shown in Figures 5 and 6.…”
Section: -3-comparison Of Utv To Other Recommender System Modelsmentioning
confidence: 99%
“…The results obtained over both datasets on all the four examined criteria suggest the higher efficiency of UTV than that of the other recommender system algorithms. In this subsection, the method presented in this research is compared to a number of other models presented for recommender systems based on the RMSE and Accuracy criteria over MovieLens 1M and MovieLens 10M, as follows: In the paper [66], authors propose a Content-based Recommender System that exploits knowledge graph embedding for representing items. The embedding are built by leveraging on triples extracted from Wikidata and their approach for computing a user profile based on knowledge base embedding.…”
Section: -3-comparison Of Utv To Other Recommender System Modelsmentioning
confidence: 99%