Graph Searching Algorithms for Semantic-Social Recommendation

In this paper we present two recommendation algorithms, called Node-Edge-Based and Node-Based recommendation algorithms. These algorithms are designed to recommend items to users connected via social network. Our algorithms are based on three main features: a social network analysis measure (degree centrality), the graph searching algorithm (Depth First Search algorithm), and the semantic similarity measure (which measures the closeness between the input item and users). We apply these algorithms to a real dataset (Amazon dataset) and we compare them with item-based collaborative filtering and hybrid recommendation algorithms. Our results show good precision as well as in a good performance in terms of runtime. Moreover, Node-Edge-Based and Node-Based algorithms search a small part of the dataset, compared to item-based and hybrid recommendation algorithms.