scholarly journals Enhancing explanations in recommender systems with knowledge graphs

2018 ◽  
Vol 137 ◽  
pp. 211-222 ◽  
Author(s):  
Vincent Lully ◽  
Philippe Laublet ◽  
Milan Stankovic ◽  
Filip Radulovic
Author(s):  
Navin Tatyaba Gopal ◽  
Anish Raj Khobragade

The Knowledge graphs (KGs) catches structured data and relationships among a bunch of entities and items. Generally, constitute an attractive origin of information that can advance the recommender systems. But, present methodologies of this area depend on manual element thus don’t permit for start to end training. This article proposes, Knowledge Graph along with Label Smoothness (KG-LS) to offer better suggestions for the recommender Systems. Our methodology processes user-specific entities by prior application of a function capability that recognizes key KG-relationships for a specific user. In this manner, we change the KG in a specific-user weighted graph followed by application of a graph neural network to process customized entity embedding. To give better preliminary predisposition, label smoothness comes into picture, which places items in the KG which probably going to have identical user significant names/scores. Use of, label smoothness gives regularization above the edge weights thus; we demonstrate that it is comparable to a label propagation plan on the graph. Additionally building-up a productive usage that symbolizes solid adaptability concerning the size of knowledge graph. Experimentation on 4 datasets shows that our strategy beats best in class baselines. This process likewise accomplishes solid execution in cold start situations where user-entity communications remain meager.


IEEE Access ◽  
2019 ◽  
Vol 7 ◽  
pp. 110563-110579 ◽  
Author(s):  
Mohammed Alshammari ◽  
Olfa Nasraoui ◽  
Scott Sanders

2021 ◽  
Author(s):  
Renzo Arturo Alva Principe ◽  
Andrea Maurino ◽  
Matteo Palmonari ◽  
Michele Ciavotta ◽  
Blerina Spahiu

AbstractProcessing large-scale and highly interconnected Knowledge Graphs (KG) is becoming crucial for many applications such as recommender systems, question answering, etc. Profiling approaches have been proposed to summarize large KGs with the aim to produce concise and meaningful representation so that they can be easily managed. However, constructing profiles and calculating several statistics such as cardinality descriptors or inferences are resource expensive. In this paper, we present ABSTAT-HD, a highly distributed profiling tool that supports users in profiling and understanding big and complex knowledge graphs. We demonstrate the impact of the new architecture of ABSTAT-HD by presenting a set of experiments that show its scalability with respect to three dimensions of the data to be processed: size, complexity and workload. The experimentation shows that our profiling framework provides informative and concise profiles, and can process and manage very large KGs.


2021 ◽  
Author(s):  
Vito Walter Anelli ◽  
Tommaso Di Noia ◽  
Eugenio Di Sciascio ◽  
Antonio Ferrara ◽  
Alberto Carlo Maria Mancino

2021 ◽  
Author(s):  
Xing Wei ◽  
Jiangjiang Liu

Knowledge Graph (KG) related recommendation method is advanced in dealing with cold start problems and sparse data. Knowledge Graph Convolutional Network (KGCN) is an end-to-end framework that has been proved to have the ability to capture latent item-entity features by mining their associated attributes on the KG. In KGCN, aggregator plays a key role for extracting information from the high-order structure. In this work, we proposed Knowledge Graph Processor (KGP) for pre-processing data and building corresponding knowledge graphs. A knowledge graph for the Yelp Open dataset was constructed with KGP. In addition, we investigated the impacts of various aggregators with three nonlinear functions on KGCN with Yelp Open dataset KG.


IEEE Access ◽  
2019 ◽  
Vol 7 ◽  
pp. 136951-136961 ◽  
Author(s):  
Shuai Wang ◽  
Chenchen Huang ◽  
Juanjuan Li ◽  
Yong Yuan ◽  
Fei-Yue Wang

Sign in / Sign up

Export Citation Format

Share Document