Venue2Vec: An efficient embedding model for fine-grained user location prediction in geo-social networks

Geo-Social Networks (GSN) significantly improve location-aware capability of services by offering geo-located content based on the huge volumes of data generated in the GSN. The problem of user location prediction based on user-generated data in GSN has been extensively studied. However, existing studies are either concerning predicting users' next check-in location or predicting their future check-in location at a given time with coarse granularity. A unified model that can predict both scenarios with fine granularity is quite rare. Also, due to the heterogeneity of multiple factors associated with both locations and users, how to efficiently incorporate these information still remains challenging. Inspired by the recent success of word embedding in natural language processing, in this paper, we propose a novel embedding model called Venue2Vec which automatically incorporates temporal-spatial context, semantic information, and sequential relations for fine-grained user location prediction. Locations of the same type, and those that are geographically close or often visited successively by users will be situated closer within the embedding space. Based on our proposed Venue2Vec model, we design techniques that allow for predicting a user's next check-in location, and also their future check-in location at a given time. We conduct experiments on three real-world GSN datasets to verify the performance of the proposed model. Experimental results on both tasks show that Venue2Vec model outperforms several state-of-the-art models on various evaluation metrics. Furthermore, we show how the Venue2Vec model can be more time-efficient due to being parallelizable

The Shortest Path to Happiness: Recommending Beautiful, Quiet, and Happy Routes in the City

When providing directions to a place, web and mobile mapping services are all able to suggest the shortest route. The goal of this work is to automatically suggest routes that are not only short but also emotionally pleasant. To quantify the extent to which urban locations are pleasant, we use data from a crowd-sourcing platform that shows two street scenes in London (out of hundreds), and a user votes on which one looks more beautiful, quiet, and happy. We consider votes from more than 3.3K individuals and translate them into quantitative measures of location perceptions. We arrange those locations into a graph upon which we learn pleasant routes. Based on a quantitative validation, we find that, compared to the shortest routes, the recommended ones add just a few extra walking minutes and are indeed perceived to be more beautiful, quiet, and happy. To test the generality of our approach, we consider Flickr metadata of more than 3.7M pictures in London and 1.3M in Boston, compute proxies for the crowdsourced beauty dimension (the one for which we have collected the most votes), and evaluate those proxies with 30 participants in London and 54 in Boston. These participants have not only rated our recommendations but have also carefully motivated their choices, providing insights for future work.Comment: 11 pages, 7 figures, Proceedings of ACM Hypertext 201

SgWalk: Location Recommendation by User Subgraph-Based Graph Embedding

Popularity of Location-based Social Networks (LBSNs) provides an opportunity to collect massive multi-modal datasets that contain geographical information, as well as time and social interactions. Such data is a useful resource for generating personalized location recommendations. Such heterogeneous data can be further extended with notions of trust between users, the popularity of locations, and the expertise of users. Recently the use of Heterogeneous Information Network (HIN) models and graph neural architectures have proven successful for recommendation problems. One limitation of such a solution is capturing the contextual relationships between the nodes in the heterogeneous network. In location recommendation, spatial context is a frequently used consideration such that users prefer to get recommendations within their spatial vicinity. To solve this challenging problem, we propose a novel Heterogeneous Information Network (HIN) embedding technique, SgWalk, which explores the proximity between users and locations and generates location recommendations via subgraph-based node embedding. SgWalk follows four steps: building users subgraphs according to location context, generating random walk sequences over user subgraphs, learning embeddings of nodes in LBSN graph, and generating location recommendations using vector representation of the nodes. SgWalk is differentiated from existing techniques relying on meta-path or bi-partite graphs by means of utilizing the contextual user subgraph. In this way, it is aimed to capture contextual relationships among heterogeneous nodes more effectively. The recommendation accuracy of SgWalk is analyzed through extensive experiments conducted on benchmark datasets in terms of top-n location recommendations. The accuracy evaluation results indicate minimum 23% (@5 recommendation) average improvement in accuracy compared to baseline techniques and the state-of-the-art heterogeneous graph embedding techniques in the literature

Recommender Systems for Online and Mobile Social Networks: A survey

Recommender Systems (RS) currently represent a fundamental tool in online services, especially with the advent of Online Social Networks (OSN). In this case, users generate huge amounts of contents and they can be quickly overloaded by useless information. At the same time, social media represent an important source of information to characterize contents and users' interests. RS can exploit this information to further personalize suggestions and improve the recommendation process. In this paper we present a survey of Recommender Systems designed and implemented for Online and Mobile Social Networks, highlighting how the use of social context information improves the recommendation task, and how standard algorithms must be enhanced and optimized to run in a fully distributed environment, as opportunistic networks. We describe advantages and drawbacks of these systems in terms of algorithms, target domains, evaluation metrics and performance evaluations. Eventually, we present some open research challenges in this area

Three Essays on Friend Recommendation Systems for Online Social Networks

Social networking sites (SNSs) first appeared in the mid-90s. In recent years, however, Web 2.0 technologies have made modern SNSs increasingly popular and easier to use, and social networking has expanded explosively across the web. This brought a massive number of new users. Two of the most popular SNSs, Facebook and Twitter, have reached one billion users and exceeded half billion users, respectively. Too many new users may cause the cold start problem. Users sign up on a SNS and discover they do not have any friends. Normally, SNSs solve this problem by recommending potential friends. The current major methods for friend recommendations are profile matching and “friends-of-friends.” The profile matching method compares two users’ profiles. This is relatively inflexible because it ignores the changing nature of users. It also requires complete profiles. The friends-of-friends method can only find people who are likely to be previously known to each other and neglects many users who share the same interests. To the best of my knowledge, existing research has not proposed guidelines for building a better recommendation system based on context information (location information) and user-generated content (UGC). This dissertation consists of three essays. The first essay focuses on location information and then develops a framework for using location to recommend friends--a framework that is not limited to making only known people recommendations but that also adds stranger recommendations. The second essay employs UGC by developing a text analytic framework that discovers users’ interests and personalities and uses this information to recommend friends. The third essay discusses friend recommendations in a certain type of online community – health and fitness social networking sites, physical activities and health status become more important factors in this case. Essay 1: Location-sensitive Friend Recommendations in Online Social Networks GPS-embedded smart devices and wearable devices such as smart phones, tablets, smart watches, etc., have significantly increased in recent years. Because of them, users can record their location at anytime and anyplace. SNSs such as Foursquare, Facebook, and Twitter all have developed their own location-based services to collect users’ location check-in data and provide location-sensitive services such as location-based promotions. None of these sites, however, have used location information to make friend recommendations. In this essay, we investigate a new model to make friend recommendations. This model includes location check-in data as predictors and calculates users’ check-in histories--users’ life patterns--to make friend recommendations. The results of our experiment show that this novel model provides better performance in making friend recommendations. Essay 2: Novel Friend Recommendations Based on User-generated Contents More and more users have joined and contributed to SNSs. Users share stories of their daily life (such as having delicious food, enjoying shopping, traveling, hanging out, etc.) and leave comments. This huge amount of UGC could provide rich data for building an accurate, adaptable, effective, and extensible user model that reflects users’ interests, their sentiments about different type of locations, and their personalities. From the computer-supported social matching process, these attributes could influence friend matches. Unfortunately, none of the previous studies in this area have focused on using these extracted meta-text features for friend recommendation systems. In this study, we develop a text analytic framework and apply it to UGCs on SNSs. By extracting interests and personality features from UGCs, we can make text-based friend recommendations. The results of our experiment show that text features could further improve recommendation performance. Essay 3: Friend Recommendations in Health/Fitness Social Networking Sites Thanks to the growing number of wearable devices, online health/fitness communities are becoming more and more popular. This type of social networking sites offers individuals the opportunity to monitor their diet process and motivating them to change their lifestyles. Users can improve their physical activity level and health status by receiving information, advice and supports from their friends in the social networks. Many studies have confirmed that social network structure and the degree of homophily in a network will affect how health behavior and innovations are spread. However, very few studies have focused on the opposite, the impact from users’ daily activities for building friendships in a health/fitness social networking site. In this study, we track and collect users’ daily activities from Record, a famous online fitness social networking sites. By building an analytic framework, we test and evaluate how people’s daily activities could help friend recommendations. The results of our experiment have shown that by using the helps from these information, friend recommendation systems become more accurate and more precise

Modeling user mobility via user psychological and geographical behaviors towards point of-interest recommendation

© Springer International Publishing Switzerland 2016. The pervasive employments of Location-based Social Network call for precise and personalized Point-of-Interest (POI) recommendation to predict which places the users prefer. Modeling user mobility, as an important component of understanding user preference, plays an essential role in POI recommendation. However, existing methods mainly model user mobility through analyzing the check-in data and formulating a distribution without considering why a user checks in at a specific place from psychological perspective. In this paper, we propose a POI recommendation algorithm modeling user mobility by considering check-in data and geographical information. Specifically, with check-in data, we propose a novel probabilistic latent factor model to formulate user psychological behavior from the perspective of utility theory, which could help reveal the inner information underlying the comparative choice behaviors of users. Geographical behavior of all the historical check-ins captured by a power law distribution is then combined with probabilistic latent factor model to form the POI recommendation algorithm. Extensive evaluation experiments conducted on two real-world datasets confirm the superiority of our approach over state-of-the-art methods