Discovering and Profiling Overlapping Communities in Location-Based Social Networks

With the recent surge of location-based social networks (LBSNs, e.g., Foursquare, Facebook Places), huge amount of digital footprints about users’ locations, profiles as well as their online social connections become accessible to service providers. Different from social networks (e.g., Flickr, Facebook) which have explicit groups for users to subscribe or join, LBSNs usually have no explicit community structure. In order to capitalize on the large number of potential users, quality community detection approach is needed so as to enable applications such as direct marketing, group tracking, etc. The diversity of people’s interests and behaviors when using LBSNs suggests that their community structures overlap. In this paper, based on the user-venue check-in relationship and user/venue attributes, we come out with a novel multi-mode multi-attribute edge-centric co-clustering (M 2 Clustering) framework to discover the overlapping communities of LBSNs users. By employing inter-mode/intra-mode features, the proposed framework is able to group like-minded users from different social perspectives. The efficacy of our approach is validated by intensive empirical evaluations using the collected Foursquare dataset of 266,838 users with 9,803,764 check-ins over 2,477,122 venues worldwide.KeywordsCommunity DetectionOverlapping CommunityEdge- ClusteringLocation-Based Social Networks

Searching for a community based on query nodes in a graph is a fundamental problem and has been extensively investigated. Most of the existing approaches focus on finding a community in a social network, and very few studies consider location-based social networks where users can check in locations. In this paper we propose the GeoSocial Community Search problem (GCS) which aims to find a social community and a cluster of spatial locations that are densely connected in a location-based social network simultaneously. The GCS can be useful for marketing and user/location recommendation. To the best of our knowledge, this is the first work to find a social community and a cluster of spatial locations that are densely connected from location-based social networks. We prove that the problem is NP-hard, and is not in APX, unless P = NP. To solve this problem, we propose three algorithms: core-based basic algorithm, top-down greedy removing algorithm, and an expansion algorithm. Finally, we report extensive experimental studies that offer insights into the efficiency and effectiveness of the proposed solutions.

Location-Based Social Networks (LBSNs), such as Foursquare, Yelp and Facebook Place, have attracted many people, including business owners who use LBSNs to promote their businesses. A physical location is called a venue or a place of interest in an LBSN. Associated with each venue are several attributes, such as its latitude and longitude values, and the discounts/coupons users can use. LBSN users usually tend to trust venues, which is becoming a key focus of various attacks [7, 10]. By manipulating attributes related to venues, however, an attacker can deceive users, compromise their privacy and destroy the reputation of the venues in an LBSN. In this paper, we call the attacks targeting venues as venue attacks. We first investigate and characterize such attacks in Foursquare, Yelp and Facebook Place. We then study what makes such attacks successful and discuss potential defense approaches against these attacks. To the best of our knowledge, we are the first to characterize various venue attacks in LBSNs.

New developments in mobile computing, wireless networking and social networking leverage opportunities to create location-based social networks (LBSNs) such as Foursquare, Gowalla, Facebook Place. Pointof-interest (POI) recommendation is a significant task in LBSNs, since it provides recommendations that respect personal preferences and capture social and environmental parameters. Moreover, employing Wireless Sensor Networks (WSNs) in POIs enables to improve recommendation accuracy. Most of existing POI recommendation methods deals with the only single domain, whereas the use of information available from other application domains potentially provides better POI recommendation results. This is particularly relevant for the newly launched LBSNs, where little check in information is available. In this paper, to the best of our knowledge, we are the first to propose a cross domain POI recommendation method in LBSNs and apply transfer learning for this purpose. To this end, we first incorporate both user and POI knowledge in auxiliary domains by discovering the principle coordinates. Next, we transfer them to the target domain and then make predictions using the transferred knowledge. The experimental results demonstrate high performance of our method and the merits of cross-domain POI recommendation in LBSNs.

Location-based social network (LBSN) is a highly used social network at present. Detecting the community structures in LBSN plays a significant role in analyzing the network comprehensively. Modularity optimization is a traditional social network community detection method which has excellent performance. Whereas, resolution limit is an inherent problem of it. Some existing community detection methods for LBSN fail to take account of the full network information. To solve above problems, a network weighting scheme is proposed in this paper. Firstly, we combine a network embedding method that named walk2friends with this paper. In view of the shortcoming of walk2friends, we proposes a collaborative filtering method based on social relationship to improve it. Then, the learned similarity is obtained by improved walk2friends and the structural similarity is obtained by a random walk method. These two similarities are fused and then transformed into edge weight. Finally, the undirected unweighted graph is preprocessed as an undirected weighted graph. Experimental results on real networks show that when using modularity optimization method for optimization the weighting scheme not only can avoid the resolution limit but also applicable to LBSN . The mined community is more cohesive than the existing work on LBSN.

With the proliferation of social network services (e.g., Facebook, Twitter, and Instagram), identifying cohesive subgraphs in networks is a key and fundamental problem to understand users' activity. Recently this problem has received extensive research attention. Identifying cohesive subgraph structures in networks has many applications such as recommendation, detecting fraudsters, event organization, and graph analysis. In this thesis, we study three important problems of finding cohesive subgraphs. Our studies include finding a query-based cohesive subgraph search in social networks and location-based social networks, and detecting all cohesive subgraphs in attributed bipartite networks. In our study of Density Modularity based Community Search (DMCS), we propose the modularity-based community search problem in networks. Modularity is a widely used measure of the structure of networks which checks the strength of partition of a network into communities. Most of the existing community search models only focus on the internal cohesiveness of a community. However, a high-quality community often has high modularity, which implies dense connections inside communities and sparse connections to the nodes outside the community. Hence, we conduct a pioneer study on searching for a community with high modularity. We point out that while modularity has been used in community detection (unrelated to query nodes), its application in community search (related to query nodes) brings in different challenges named free-rider effect and resolution limit problems. Both problems indicate that intrinsically optimizing the modularity can fail to find a small-sized community as a result for the community search problem. We mitigate these problems by designing a new graph modularity function named Density Modularity. To the best of our knowledge, this is the first work on the community search problem by using the graph modularity. The community search based on the density modularity, termed as DMCS, is to find a community in a social network that contains all the query nodes and has high density modularity. We prove that the DMCS problem is NP-hard, and thus there is no exact algorithm that is scalable to large graphs. To efficiently address DMCS, we present new algorithms that run in log-linear time to the graph size. We conduct extensive experimental studies in real-world and synthetic networks, which offer insights into the efficiency and effectiveness of our approximate algorithms. In our study of GeoSocial Community Search(GCS) problem, we propose the community search problem in location-based social networks. Specifically, we aim at finding a social community and a location cluster that are densely connected in a location-based social network. GCS can be useful for finding marketing targets and user/location recommendations. To the best of our knowledge, this is the first work to find a social community and a location cluster that are densely connected from location-based social networks. We prove that the GCS problem is NP-hard and is not in APX, unless P = NP. To solve GCS problem, we propose three effective and efficient algorithms: Core-based Basic Algorithm, Top-down Greedy Removing Algorithm, and Bottom-up Greedy Expansion Algorithms. Finally, we report extensive experimental studies that offer insights into the efficiency and effectiveness of the proposed solutions. In our study of Attributed Bipartite Co-clustering (ABC), we propose the co-clustering problem in attributed bipartite networks. Co-clustering in bipartite networks is a fundamental and important problem. Specifically, we unify two main concepts: (i) bipartite modularity optimization, and (ii) attribute cohesiveness. To the best of our knowledge, this is the first work to find a set of co-clusters while considering the attribute cohesiveness. We prove that ABC problem is NP-hard and propose three effective and efficient algorithms: (1) Top-Down Algorithm; (2) Bottom-Up Algorithm; and (3) Group-based Matching Algorithm. Finally, extensive experimental results on real-world attributed bipartite networks demonstrate the efficiency and effectiveness of our algorithms.

In the last two decades, the issue of Influence Maximization (IM) in traditional online social networks has been extensively studied since it was proposed. It is to find a seed set which has maximum influence spread under a specific network transmission model. However, in real life, the information can be spread not only through online social networks, but also between neighbors who are close to each other in the physical world. Location-Based Social Network (LBSN) is a new type of social network which is emerging increasingly nowadays. In a LBSN, users can not only make friends, but also share the events they participate in at different locations by checking in. In this paper, we aim to study the IM in LBSNs, where we consider both the influence of online and offline interactions. A two-layer network model and an information propagation model are proposed. Also, we formalize the IM problem in LBSNs and present an algorithm obtaining an approximation factor of \((1 - 1/e - \epsilon \)) in near-linear expected time. The experimental results show that the algorithm is efficient meanwhile offering strong theoretical guarantees.

Trust-aware location recommendation in location-based social networks: A graph-based approach

These proceedings contain the papers selected for presentation at the seventh edition of the ACM SIGSPATIAL Workshop on Location-Based Social Networks (LBSN 2014) which is being held in conjunction with the ACM SIGSPATIAL GIS conference in 2014. Social networks have been prevalent on the Internet and become a hot research topic attracting many professionals from a variety of fields. The advances in location-acquisition and mobile communication technologies empower people to use location data with existing online social networks. The dimension of location helps bridge the gap between the physical world and online social networking services. Furthermore, people in an existing social network can expand their social structure with the new interdependency derived from their locations. As location is one of the most important components of user context, extensive knowledge about an individual's interests, behaviors, and relationships with others can be learned from locations. These kinds of location-embedded and location-driven social structures are known as location-based social networks. The objective of this workshop is to provide professionals, researchers, and technologists with a single forum where they can discuss and share the state-of-the-art of LBSN development and applications, present their ideas and contributions, and set future directions in emerging innovative research for location based social networks. This year program is composed of two tracks of predominantly "social" and "spatial" views on LBSNs.

Friend recommendation is an important real-world application in Location-based Social Networks (LBSN), helping users discover potential friends and enhance their overall happiness. LBSN mainly comprises two distinct data structures: spatio-temporal data for human mobility and graph data for social networks. These two data structures make it challenging to model the complex relationships between them, which are essential for comprehensively understanding users’ lives. Previous studies have either modeled user trajectories and social networks separately or used classical simple graph-based methods, where a simple edge links only two nodes, failing to capture the multiple relationships inherent in LBSN. Furthermore, most studies have relied on Euclidean space to train their graph models, which could result in significant distortion because of tree-like social network data structure. To address these limitations, we propose a novel heterogeneous LBSN hypergraph that represents user check-in records and continuous trajectories—comprising multiple Points of Interest (POI)—as hyperedges, enabling the representation of complex spatio-temporal relationships. This approach enables us to link multiple nodes of different types by hyperedges and use hyperbolic spaces to create more efficient graph representations. Additionally, we devise a new type-specific attention mechanism for our Heterogeneous Hyperbolic Hypergraph Neural Network (H 3 GNN), which is end-to-end trainable and employs supervised contrastive learning to learn hypergraph node embeddings for the subsequent friend recommendation task with the help of hyperbolic space. Finally, our model H 3 GNN achieves better results than existing methods on six real-world city datasets, and our ablation studies demonstrate the effectiveness of each component. Additionally, our experiments indicate that H 3 GNN requires less data storage and training time compared to previous methods.

One of the most attractive problems of social network analysis is the link prediction. Social networks' user growth is mostly supported with data driven friend recommendations which are provided by link predictors. Previously, we had studied new features to improve prediction accuracy in Location Based Social Networks (LBSNs) where users share temporal location information with check-in interactions. In this paper, we focused on the efficiency of link predictors as the speed of prediction is as critical as its accuracy in LBSNs. Extraction time costs and prediction accuracy of individual LBSN features are mined to pick a feature subset that is achieving faster link prediction while not losing from accuracy.

NationTelescope: Monitoring and visualizing large-scale collective behavior in LBSNs

Heterogeneous graph-based joint representation learning for users and POIs in location-based social network

This paper presents an adaptive e-learning system which supports collaborative learning based on a location-based social network and semantic modeling. In the system, a social network among e-learning learners is dynamically constructed on the basis of the location information of learners using GPS sensors for collaborative learning. In addition, user modeling for semantic social network and adaptive e-learning is supported. For these, a mechanism that supports the construction of a dynamic social network using the location information of smart phones is provided. The user modeling for the construction of a semantic social network and the support of adaptive e-learning considers the information such as the users' achievement, preference, and learning goal. Through this system, e-learners can find mentors who are able to facilitate their learning and create communities for collaborative learning offline and online. The support of a location-based social network service and semantic user model in our system would increase interactions among e-learners and improve satisfaction regarding their mobile learning environment.

The task of points-of-interest (POI) recommendations has become an essential feature in location-based social networks (LBSNs) with the significant growth of shared data on LBSNs. However it remains a challenging problem, because the decision process of a user choosing to visit a POI depends on numerous factors. The high level of sparsity of the data in LBSNs makes the POI recommendation problem even more challenging, especially for large geographical areas and worldwide datasets. Moreover, in this context the mobility behavior of the users is very heterogeneous, ranging from urban to worldwide mobility. In this paper, we explore the impact of spatial clustering on the recommendation quality. The proposed approach combines spatial clustering with users' influences. It is based on a Poisson factorization model built on an implicit social network, inferred from the geographical mobility patterns. We conduct a comprehensive performance evaluation of our approach on the YFCC dataset (a very large-scale real-world dataset). The experiments show that our approach achieves a significantly superior recommendation quality compared to other state-of-the-art recommendation techniques.