Enhancing social collaborative filtering through the application of non-negative matrix factorization and exponential random graph models

Social collaborative filtering recommender systems extend the traditional user-to-item interaction with explicit user-to-user relationships, thereby allowing for a wider exploration of correlations among users and items, that potentially lead to better recommendations. A number of methods have been...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Data mining and knowledge discovery Ročník 31; číslo 4; s. 1031 - 1059
Hlavní autoři: Alexandridis, Georgios, Siolas, Georgios, Stafylopatis, Andreas
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer US 01.07.2017
Springer Nature B.V
Témata:
Algorithms
Artificial Intelligence
Chemistry and Earth Sciences
Clustering
Collaboration
Computer Science
Correlation
Data Mining and Knowledge Discovery
Factorization
Filtration
Graph theory
Information Storage and Retrieval
Logic
Physics
Recommendations
Recommender systems
Stars
Statistics for Engineering
Exponential random graph models
Social collaborative filtering
Non-negative matrix factorization
Recommender systems
ISSN:1384-5810, 1573-756X
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Social collaborative filtering recommender systems extend the traditional user-to-item interaction with explicit user-to-user relationships, thereby allowing for a wider exploration of correlations among users and items, that potentially lead to better recommendations. A number of methods have been proposed in the direction of exploring the social network, either locally (i.e. the vicinity of each user) or globally. In this paper, we propose a novel methodology for collaborative filtering social recommendation that tries to combine the merits of both the aforementioned approaches, based on the soft-clustering of the Friend-of-a-Friend (FoaF) network of each user. This task is accomplished by the non-negative factorization of the adjacency matrix of the FoaF graph, while the edge-centric logic of the factorization algorithm is ameliorated by incorporating more general structural properties of the graph, such as the number of edges and stars, through the introduction of the exponential random graph models. The preliminary results obtained reveal the potential of this idea.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1384-5810
1573-756X
DOI:10.1007/s10618-017-0504-3