Abstract
The social presence theory in social psychology suggests that computer-mediated online interactions are inferior to face-to-face, in-person interactions. In this paper, we consider the scenarios of organizing in person friend-making social activities via online social networks (OSNs) and formulate a new research problem, namely, Hop-bounded Maximum Group Friending (HMGF), by modeling both existing friendships and the likelihood of new friend making. To find a set of attendees for socialization activities, HMGF is unique and challenging due to the interplay of the group size, the constraint on existing friendships and the objective function on the likelihood of friend making. We prove that HMGF is NP-Hard, and no approximation algorithm exists unless \(P=NP\). We then propose an error-bounded approximation algorithm to efficiently obtain the solutions very close to the optimal solutions. We conduct a user study to validate our problem formulation and perform extensive experiments on real datasets to demonstrate the efficiency and effectiveness of our proposed algorithm.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Shen, C.-Y., Yang, D.-N., Lee, W.-C., Chen, M.-S.: Maximizing Friend-Making Likelihood for Social Activity Organization (2015). arXiv:1502.06682
Wasserman, S., Faust, K.: Social Network Anlysis: Methods and Applications. Cambridge University Press (1994)
Feige, U., Kortsarz, G., Peleg, D.: The Dense k-Subgraph Problem. Algorithmica (2001)
Mokken, R.: Cliques, Clubs and Clans. Quality and Quantity: International Journal of Methodology (1979)
Yang, D.-N., Chen, Y.-L., Lee, W.-C., Chen, M.-S.: On Social-Temporal Group Query with Acquaintance Constraint. VLDB (2011)
Yang, D.-N., Shen, C.-Y., Lee, W.-C., Chen, M.-S.: On socio-spatial group query for location-based social networks. In: KDD (2012)
Zhu, Q., Hu, H., Xu, J., Lee, W.C.: Geo-Social Group Queries with Minimum Acquaintance Constraint (2014). arXiv:1406.7367v1
Shuai, H.-H., Yang, D.-N., Yu, P.S., Chen, M.-S.: Willingness Optimization for Social Group Activity. VLDB (2014)
Surian, D., Liu, N., Lo, D., Tong, H., Lim, E.-P., Faloutsos, C.: Recommending people in developers’ collaboration network. In: WCRE (2011)
Kashima, H., Abe, N: A parameterized probabilistic model of network evolution for supervised link prediction. In: ICDM (2006)
Liben-Nowell, D., Kleinberg, J.: The Link Prediction Problem for Social Networks. Journal of the American Soceity for Information Science and Technology (2007)
Clause, A., Moore, C., Newman, M.: Hierarchical Structure and the Prediction of Missing Links in Network. Nature (2008)
Kunegis, J., Lommatzsch, A.: Learning spectral graph transformations for link prediction. In: ICML (2009)
Leung, C., Lim, E.-P., Lo, D., Weng, J.: Mining interesting link formation rules in social networks. In: CIKM (2010)
Viswanath, B., Mislove, A., Cha, M., Gummadi, K.: On the evolution of userinteraction in facebook. In: WOSN (2009)
Short, J., Williams, E., Christie, B.: The Social Psychology of Telecommunications. Wiley, London (1976)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Shen, CY., Yang, DN., Lee, WC., Chen, MS. (2015). Maximizing Friend-Making Likelihood for Social Activity Organization. In: Cao, T., Lim, EP., Zhou, ZH., Ho, TB., Cheung, D., Motoda, H. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2015. Lecture Notes in Computer Science(), vol 9077. Springer, Cham. https://doi.org/10.1007/978-3-319-18038-0_1
Download citation
DOI: https://doi.org/10.1007/978-3-319-18038-0_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-18037-3
Online ISBN: 978-3-319-18038-0
eBook Packages: Computer ScienceComputer Science (R0)