Welcome to the InfoSci Platform
Reference Hub6
Toward Social-Semantic Recommender Systems

Toward Social-Semantic Recommender Systems

Dalia Sulieman, Maria Malek, Hubert Kadima, Dominique Laurent
Copyright: © 2016 |Volume: 7 |Issue: 1 |Pages: 30
ISSN: 1941-868X|EISSN: 1941-8698|EISBN13: 9781466690202|DOI: 10.4018/IJISSC.2016010101
Cite Article Cite Article

MLA

Sulieman, Dalia, et al. "Toward Social-Semantic Recommender Systems." IJISSC vol.7, no.1 2016: pp.1-30. http://doi.org/10.4018/IJISSC.2016010101

APA

Sulieman, D., Malek, M., Kadima, H., & Laurent, D. (2016). Toward Social-Semantic Recommender Systems. International Journal of Information Systems and Social Change (IJISSC), 7(1), 1-30. http://doi.org/10.4018/IJISSC.2016010101

Chicago

Sulieman, Dalia, et al. "Toward Social-Semantic Recommender Systems," International Journal of Information Systems and Social Change (IJISSC) 7, no.1: 1-30. http://doi.org/10.4018/IJISSC.2016010101

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

In this article, the authors consider the basic problem of recommender systems that is identifying a set of users to whom a given item is to be recommended. In practice recommender systems are run against huge sets of users, and the problem is then to avoid scanning the whole user set in order to produce the recommendation list. To cope with problem, they consider that users are connected through a social network and that taxonomy over the items has been defined. These two kinds of information are respectively called social and semantic information. In their contribution the authors suggest combining social information with semantic information in one algorithm in order to compute recommendation lists by visiting a limited part of the social network. In their experiments, the authors use two real data sets, namely Amazon.com and MovieLens, and they compare their algorithms with the standard item-based collaborative filtering and hybrid recommendation algorithms. The results show satisfying accuracy values and a very significant improvement of performance, by exploring a small part of the graph instead of exploring the whole graph.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.