O Impacto de Estratégias de Embeddings de Grafos na Explicabilidade de Sistemas de Recomendação

Explanations in recommender systems are essential in improving trust, transparency, and persuasion. Recently, using Knowledge Graphs (KG) to generate explanations gained attention due to the semantic representation of information in which items and their attributes are represented as nodes, connected by edges, representing connections among them. Model-agnostic KG explainable algorithms can be based on syntactic approaches or graph embeddings. The impact of graph embedding strategies in generating meaningful explanations still needs to be studied in the literature. To fill this gap, in this work, we evaluate the quality of explanations provided by different graph embeddings and compare them with traditional syntactic strategies. The quality of explanations was assessed using three metrics from the literature: diversity, popularity and recency. Results indicate that the embedding algorithm chosen impacts the quality of explanations and generates more balanced results regarding popularity and explanation diversity compared to syntactic approaches.

Authors

Institutions

Publication Details

Published
2024-10-14
DOI
https://doi.org/10.5753/webmedia.2024.241857
Citations
3
Primary Topic
Recommender Systems and Techniques
Type
article
Field-Weighted Citation Impact
2.34
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

O Impacto de Estratégias de Embeddings de Grafos na Explicabilidade de Sistemas de Recomendação

André Levi Zanon, Leonardo Rocha, Marcelo Garcia Manzato
3 citations
Recommender Systems and Techniques
2.34
article

O Impacto de Estratégias de Embeddings de Grafos na Explicabilidade de Sistemas de Recomendação

André Levi Zanon, Leonardo Rocha, Marcelo Garcia Manzato
article en
3 citations

Abstract

Explanations in recommender systems are essential in improving trust, transparency, and persuasion. Recently, using Knowledge Graphs (KG) to generate explanations gained attention due to the semantic representation of information in which items and their attributes are represented as nodes, connected by edges, representing connections among them. Model-agnostic KG explainable algorithms can be based on syntactic approaches or graph embeddings. The impact of graph embedding strategies in generating meaningful explanations still needs to be studied in the literature. To fill this gap, in this work, we evaluate the quality of explanations provided by different graph embeddings and compare them with traditional syntactic strategies. The quality of explanations was assessed using three metrics from the literature: diversity, popularity and recency. Results indicate that the embedding algorithm chosen impacts the quality of explanations and generates more balanced results regarding popularity and explanation diversity compared to syntactic approaches.

Federal University of São João del-Rei (BR), Universidad San Pedro (PE)
Openalex Percentile: Top 9%
Recommender Systems and Techniques
2.34
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

O Impacto de Estratégias de Embeddings de Grafos na Explicabilidade de Sistemas de Recomendação — André Levi Zanon, Leonardo Rocha, et al. · (2024) | TGRS Research Map | TGRS