scholarly journals Exploiting Rating Abstention Intervals for Addressing Concept Drift in Social Network Recommender Systems

Informatics ◽  
2018 ◽  
Vol 5 (2) ◽  
pp. 21 ◽  
Author(s):  
Dionisis Margaris ◽  
Costas Vassilakis
2018 ◽  
Vol 51 (1) ◽  
pp. 1-28 ◽  
Author(s):  
Zhijun Ding ◽  
Xiaolun Li ◽  
Changjun Jiang ◽  
Mengchu Zhou

2018 ◽  
pp. 823-862
Author(s):  
Ming Yang ◽  
William H. Hsu ◽  
Surya Teja Kallumadi

In this chapter, the authors survey the general problem of analyzing a social network in order to make predictions about its behavior, content, or the systems and phenomena that generated it. They begin by defining five basic tasks that can be performed using social networks: (1) link prediction; (2) pathway and community formation; (3) recommendation and decision support; (4) risk analysis; and (5) planning, especially causal interventional planning. Next, they discuss frameworks for using predictive analytics, availability of annotation, text associated with (or produced within) a social network, information propagation history (e.g., upvotes and shares), trust, and reputation data. They also review challenges such as imbalanced and partial data, concept drift especially as it manifests within social media, and the need for active learning, online learning, and transfer learning. They then discuss general methodologies for predictive analytics involving network topology and dynamics, heterogeneous information network analysis, stochastic simulation, and topic modeling using the abovementioned text corpora. They continue by describing applications such as predicting “who will follow whom?” in a social network, making entity-to-entity recommendations (person-to-person, business-to-business [B2B], consumer-to-business [C2B], or business-to-consumer [B2C]), and analyzing big data (especially transactional data) for Customer Relationship Management (CRM) applications. Finally, the authors examine a few specific recommender systems and systems for interaction discovery, as part of brief case studies.


Author(s):  
Dalia Sulieman ◽  
Maria Malek ◽  
Hubert Kadima ◽  
Dominique Laurent

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.


Sign in / Sign up

Export Citation Format

Share Document