Abstract
Location-Based Services (LBSs) are becoming more social and Social Networks (SNs) are increasingly including location components. Geo-Social Networks are bridging the gap between virtual and physical social networks. In this paper, we propose a new type of query called Circle of Friend Query (CoFQ) to allow finding a group of friends in a Geo-Social network whose members are close to each other both socially and geographically. More specifically, the members in the group have tight social relationships with each other and they are constrained in a small region in the geospatial space as measured by a “diameter” that integrates the two aspects. We prove that algorithms for finding the Circle of Friends (CoF) of size k is NP-hard and then propose an ε-approximate solution. The proposed ε-approximate algorithm is guaranteed to produce a group of friends with diameter within ε of the optimal solution. The performance of our algorithm is tested on the real dataset from Foursquare. The experimental results show that our algorithm is efficient and scalable: the ε-approximate algorithm runs in polynomial time and retrieves around 95% of the optimal answers for small ε.
This research is supported in part by the National Natural Science Foundation of China (NSFC) under grant 61073001.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aggarwal, A., Imai, H., Katoh, N., Suri, S.: Finding k points with minimum diameter and related problems. Journal of Algorithms 12(1), 38–56 (1991)
Cao, X., Cong, G., Jensen, C.S., Ooi, B.C.: Collective spatial keyword querying. In: SIGMOD, pp. 373–384. ACM (2011)
Chow, C.Y., Bao, J., Mokbel, M.F.: Towards location-based social networking services. In: LBSN, pp. 31–38. ACM (2010)
Doytsher, Y., Galon, B., Kanza, Y.: Querying geo-social data by bridging spatial networks and social networks. In: LBSN, pp. 39–46. ACM (2010)
Fagin, R., Lotem, A., Naor, M.: Optimal aggregation algorithms for middleware. In: PODS, pp. 102–113. ACM (2001)
Guttman, A.: R-trees: a dynamic index structure for spatial searching, vol. 14. ACM (1984)
Hjaltason, G.R., Samet, H.: Distance browsing in spatial databases. TODS 24(2), 265–318 (1999)
Hung, C.C., Chang, C.W., Peng, W.C.: Mining trajectory profiles for discovering user communities. In: LBSN, pp. 1–8. ACM (2009)
Jøsang, A., Gray, E., Kinateder, M.: Simplification and analysis of transitive trust networks. Web Intelligence and Agent Systems 4(2), 139–161 (2006)
Jøsang, A., Pope, S.: Semantic constraints for trust transitivity. In: APCCM, vol. 43, pp. 59–68. Australian Computer Society, Inc. (2005)
Lee, M.-J., Chung, C.-W.: A User Similarity Calculation Based on the Location for Social Network Services. In: Yu, J.X., Kim, M.H., Unland, R. (eds.) DASFAA 2011, Part I. LNCS, vol. 6587, pp. 38–52. Springer, Heidelberg (2011)
Newman, M.E.J.: Scientific collaboration networks. ii. shortest paths, weighted networks, and centrality. Physical Review E 64(1), 016132 (2001)
Papadias, D., Shen, Q., Tao, Y., Mouratidis, K.: Group nearest neighbor queries. In: ICDE, p. 301. IEEE Computer Society (2004)
Scellato, S., Mascolo, C., Musolesi, M., Latora, V.: Distance matters: Geo-social metrics for online social networks. In: Proceedings of the 3rd Conference on Online Social Networks, p. 8. USENIX Association (2010)
Singla, P., Richardson, M.: Yes, there is a correlation:-from social networks to personal behavior on the web. In: WWW, pp. 655–664. ACM (2008)
Watts, D., Strogatz, S.: Collective dynamics of small-world networks. Nature 393(6684), 440–442 (1998)
Yang, D.N., Chen, Y.L., Lee, W.C., Chen, M.S.: On social-temporal group query with acquaintance constraint. VLDB 4(6), 397–408 (2011)
Ye, M., Yin, P., Lee, W.C.: Location recommendation for location-based social networks. In: SIGSPATIAL GIS, pp. 458–461. ACM (2010)
Yiu, M.L., Mamoulis, N., Papadias, D.: Aggregate nearest neighbor queries in road networks. TKDE, 820–833 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liu, W., Sun, W., Chen, C., Huang, Y., Jing, Y., Chen, K. (2012). Circle of Friend Query in Geo-Social Networks. In: Lee, Sg., Peng, Z., Zhou, X., Moon, YS., Unland, R., Yoo, J. (eds) Database Systems for Advanced Applications. DASFAA 2012. Lecture Notes in Computer Science, vol 7239. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29035-0_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-29035-0_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29034-3
Online ISBN: 978-3-642-29035-0
eBook Packages: Computer ScienceComputer Science (R0)