Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Friending

  • Chapter
  • First Online:
Nonlinear Combinatorial Optimization

Part of the book series: Springer Optimization and Its Applications ((SOIA,volume 147))

Abstract

The friending is a popular and important operation in online social networks. In this article, we discuss various optimization problems about friending. They can be formulated into nonlinear combinatorial optimization problems.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 49.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 69.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Bai, W., Bilmes, J.A.: Greed is still good: maximizing monotone submodular+ supermodular functions (2018). Preprint. arXiv:1801.07413

    Google Scholar 

  2. Bharathi, S., Kempe, D., Salek, M.: Competitive influence maximization in social networks. In: International Workshop on Web and Internet Economics, pp. 306–311. Springer, Berlin (2007)

    Google Scholar 

  3. Bi, Y., Wu, W., Wang, A., Fan, L.: Community expansion model based on charged system theory. In: International Computing and Combinatorics Conference, pp. 780–790. Springer, Berlin (2013)

    Google Scholar 

  4. Bi, Y., Wu, W., Wang, L.: Community expansion in social network. In: International Conference on Database Systems for Advanced Applications, pp. 41–55. Springer, Berlin (2013)

    Chapter  Google Scholar 

  5. Bi, Y., Wu, W., Zhu, Y., Fan, L., Wang, A.: A nature-inspired influence propagation model for the community expansion problem. J. Comb. Optim. 28(3), 513–528 (2014)

    Article  MathSciNet  Google Scholar 

  6. Chen, H., Xu, W., Zhai, X., Bi, Y., Wang, A., Du, D.-Z.: How could a boy influence a girl? In: 2014 10th International Conference on Mobile Ad-hoc and Sensor Networks (MSN), pp. 279–287. IEEE, Piscataway (2014)

    Google Scholar 

  7. Chen, W., Lin, T., Tan, Z., Zhao, M., Zhou, X.: Robust influence maximization. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 795–804. ACM, New York (2016)

    Google Scholar 

  8. Clauset, A., Moore, C., Newman, M.E.J.: Hierarchical structure and the prediction of missing links in networks. Nature 453(7191), 98 (2008)

    Article  Google Scholar 

  9. Du, D.-Z., Ko, K.-I., Hu, X.: Design and Analysis of Approximation Algorithms, vol. 62. Springer Science & Business Media, New York (2011)

    Google Scholar 

  10. Feige, U., Peleg, D., Kortsarz, G.: The dense k-subgraph problem. Algorithmica 29(3), 410–421 (2001)

    Article  MathSciNet  Google Scholar 

  11. Iyer, R., Bilmes, J.: Algorithms for approximate minimization of the difference between submodular functions, with applications (2012). Preprint. arXiv:1207.0560

    Google Scholar 

  12. Kashima, H., Abe, N.: A parameterized probabilistic model of network evolution for supervised link prediction. In: Sixth International Conference on Data Mining, 2006. ICDM’06, pp. 340–349. IEEE, Washington (2006)

    Google Scholar 

  13. Kempe, D., Kleinberg, J., Tardos, É: Maximizing the spread of influence through a social network. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 137–146. ACM, New York (2003)

    Google Scholar 

  14. Kunegis, J., Lommatzsch, A.: Learning spectral graph transformations for link prediction. In: Proceedings of the 26th Annual International Conference on Machine Learning, pp. 561–568. ACM, New York (2009)

    Google Scholar 

  15. Leung, C.W., Lim, E.-P., Lo, D., Weng, J.: Mining interesting link formation rules in social networks. In: Proceedings of the 19th ACM International Conference on Information and Knowledge Management, pp. 209–218. ACM, New York (2010)

    Google Scholar 

  16. Liben-Nowell, D., Kleinberg, J.: The link-prediction problem for social networks. J. Am. Soc. Inf. Sci. Technol. 58(7), 1019–1031 (2007)

    Article  Google Scholar 

  17. Lu, W., Chen, W., Lakshmanan, L.V.S.: From competition to complementarity: comparative influence diffusion and maximization. Proc. VLDB Endow. 9(2), 60–71 (2015)

    Article  Google Scholar 

  18. Lu, Z., Zhang, Z., Wu, W.: Solution of Bharathi–Kempe–Salek conjecture for influence maximization on arborescence. J. Comb. Optim. 33(2), 803–808 (2017)

    Article  MathSciNet  Google Scholar 

  19. Mokken, R.J.: Cliques, clubs and clans. Qual. Quant. 13(2), 161–173 (1979)

    Article  Google Scholar 

  20. Narasimhan, M., Bilmes, J.: A submodular-supermodular procedure with applications to discriminative structure learning. In: Proceedings of the Twenty-First Conference on Uncertainty in Artificial Intelligence, pp. 404–412. AUAI Press, Arlington (2005)

    Google Scholar 

  21. Shang, Y., Wah, B.W.: A discrete Lagrangian-based global-search method for solving satisfiability problems. J. Glob. Optim. 12(1), 61–99 (1998)

    Article  MathSciNet  Google Scholar 

  22. Shen, C.-Y., Yang, D.-N., Lee, W.-C., Chen, M.-S.: Maximizing friend-making likelihood for social activity organization. In: Pacific-Asia Conference on Knowledge Discovery and Data Mining, pp. 3–15. Springer, Cham (2015)

    Chapter  Google Scholar 

  23. Shuai, H.-H., Yang, D.-N., Yu, P.S., Chen, M.-S.: Willingness optimization for social group activity. Proc. VLDB Endow. 7(4), 253–264 (2013)

    Article  Google Scholar 

  24. Surian, D., Liu, N., Lo, D., Tong, H., Lim, E.-P., Faloutsos, C.: Recommending people in developers’ collaboration network. In: 2011 18th Working Conference on Reverse Engineering (WCRE), pp. 379–388. IEEE, Washington (2011)

    Google Scholar 

  25. Tong, A., Du, D.-Z., Wu, W.: On misinformation containment in online social networks. In: Advances in Neural Information Processing Systems, pp. 339–349 (2018)

    Google Scholar 

  26. Wan, P.-J., Du, D.-Z., Pardalos, P., Wu, W.: Greedy approximations for minimum submodular cover with submodular cost. Comput. Optim. Appl. 45(2), 463–474 (2010)

    Article  MathSciNet  Google Scholar 

  27. Wang, A., Wu, W., Cui, L.: On Bharathi–Kempe–Salek conjecture for influence maximization on arborescence. J. Comb. Optim. 31(4), 1678–1684 (2016)

    Article  MathSciNet  Google Scholar 

  28. Wang, Z., Yang, Y., Pei, J., Chu, L., Chen, E.: Activity maximization by effective information diffusion in social networks. IEEE Trans. Knowl. Data Eng. 29(11), 2374–2387 (2017)

    Article  Google Scholar 

  29. Wasserman, S., Faust, K.: Social Network Analysis: Methods and Applications, vol. 8. Cambridge University Press, Cambridge (1994)

    Book  Google Scholar 

  30. Wolsey, L.A.: An analysis of the greedy algorithm for the submodular set covering problem. Combinatorica 2(4), 385–393 (1982)

    Article  MathSciNet  Google Scholar 

  31. Wu, W., Zhang, Z., Du, D.-Z.: Set function optimization. J. Oper. Res. Soc. China 1–11, (2018)

    Google Scholar 

  32. Yang, D.-N., Chen, Y.-L., Lee, W.-C., Chen, M.-S.: On social-temporal group query with acquaintance constraint. Proc. VLDB Endow. 4(6), 397–408 (2011)

    Article  Google Scholar 

  33. Yang, D.-N., Shen, C.-Y., Lee, W.-C., Chen, M.-S.: On socio-spatial group query for location-based social networks. In: Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 949–957. ACM, New York (2012)

    Google Scholar 

  34. Yang, D.-N., Hung, H.-J., Lee, W.-C., Chen, W.: Maximizing acceptance probability for active friending in online social networks. In: Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 713–721. ACM, New York (2013)

    Google Scholar 

  35. Yuan, J., Wu, W., Li, Y., Du, D.: Active friending in online social networks. In: Proceedings of the Fourth IEEE/ACM International Conference on Big Data Computing, Applications and Technologies, pp. 139–148. ACM, New York (2017)

    Google Scholar 

  36. Zhu, Q., Hu, H., Xu, C., Xu, J., Lee, W.-C.: Geo-social group queries with minimum acquaintance constraint (2014). Preprint. arXiv:1406.7367

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, The University of Texas at Dallas, Richardson, TX, USA

    Shuyang Gu & Ding-Zhu Du

  2. Department of Computer Science and Technology, Harbin Institute of Technology Shenzhen Graduate School, Shenzhen, China

    Hongwei Du

  3. Department of Computer and Information Science and Engineering, University of Florida, Gainesville, FL, USA

    My T. Thai

Authors
  1. Shuyang Gu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hongwei Du
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. My T. Thai
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Ding-Zhu Du
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Shuyang Gu .

Editor information

Editors and Affiliations

  1. Department of Computer Science, The University of Texas at Dallas, Richardson, TX, USA

    Ding-Zhu Du

  2. Department of Industrial & Systems Engineering, University of Florida, Gainesville, FL, USA

    Panos M. Pardalos

  3. Department of Computer Science, Zhejiang Normal University, Jinhua, Zhejiang, China

    Zhao Zhang

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Gu, S., Du, H., Thai, M.T., Du, DZ. (2019). Friending. In: Du, DZ., Pardalos, P., Zhang, Z. (eds) Nonlinear Combinatorial Optimization. Springer Optimization and Its Applications, vol 147. Springer, Cham. https://doi.org/10.1007/978-3-030-16194-1_12

Download citation

Publish with us

Policies and ethics

Search

Navigation