LFM-C: A Friend Recommendation Algorithm for Campus Mutual Aid System

  • Conference paper
  • First Online:
Web Information Systems and Applications (WISA 2022)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 13579))

Included in the following conference series:

  • 1024 Accesses

Abstract

At present, the campus mutual aid system in colleges and universities is increasingly prevalent, but generally, such systems lack the function of customized friend recommendations. Based on the LFM algorithm and the cosine similarity algorithm, a friend recommendation algorithm, LFM-C, is proposed in this paper. Taking the current students and alumni as data sets, this algorithm establishes connections between current students and alumni and effectively recommends the alumni who graduated from the majors at the universities that are of interest to the current students. The algorithm gives full play to the role of alumni as a mentor and helps students who are preparing to pursue postgraduate studies. Experiments show that the LFM-C algorithm is more accurate and efficient than User-CF.

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

Access this chapter

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 89.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 119.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free ship** worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Bradley, P.S., Fayyad, U.M.: Refining initial points for k-means clustering. In: Proceedings of the Fifteenth International Conference on Machine Learning ICML, pp. 91–99 (1998)

    Google Scholar 

  2. Joo, Y.J., So, H., Kim, N.H.: Examination of relationships among students’ self-determination, technology acceptance, satisfaction, and continuance intention to use K-MOOCs. Comput. Educ. 122, 260–272 (2018)

    Article  Google Scholar 

  3. Tang, F., Zhang, B., Zheng, J., Gu, Y.: Friend recommendation based on the similarity of micro-blog user model. In: Proceedings of the 2013 IEEE International Conference on Green Computing and Communications and IEEE Internet of Things and IEEE Cyber, Physical and Social Computing, pp. 2200–2204 (2013)

    Google Scholar 

  4. Li, B., et al.: Link prediction friends recommendation algorithm for online social networks named JAFLink. J. Chin. Comput. Syst. 38(08), 1741–1745 (2017)

    Google Scholar 

  5. Lu, L., Zhou, T.: Link prediction in complex networks: a survey. Physica A Stat. Mech. Appl. 390(6), 1150–1170 (2011)

    Article  Google Scholar 

  6. Tang, F., Zhang, B., Zheng, J., Gu, Y.: Friend recommendation based on the similarity of micro-blog user model. In: Proceedings of the 2013 IEEE International Conference on Green Computing and Communications and IEEE Internet of Things and IEEECyber, Physical and Social Computing, pp. 2200–2204 (2013)

    Google Scholar 

  7. **e, F., Chen, Z., Shang, J., Feng, X., Li, J.: A link prediction approach for item recommendation with complex number. Knowl. Based Syst. 81, 148–158 (2015)

    Article  Google Scholar 

  8. Kang, J., Zhang, J., Song, W., Yang, X.: Friend relationships recommendation algorithm in online education platform. In: **ng, C., Fu, X., Zhang, Y., Zhang, G., Borjigin, C. (eds.) WISA 2021. LNCS, vol. 12999, pp. 592–604. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-87571-8_51

    Chapter  Google Scholar 

  9. Zhao, H., Chen, J., Xu, L.: Semantic web service discovery based on LDA clustering. In: Ni, W., Wang, X., Song, W., Li, Y. (eds.) WISA 2019. LNCS, vol. 11817, pp. 239–250. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-30952-7_25

    Chapter  Google Scholar 

  10. Zou, W., Hu, X., Pan, Z., Li, C., Cai, Y., Liu, M.: Exploring the relationship between social presence and learners’ prestige in MOOC discussion forums using automated content analysis and social network analysis. Comput. Hum. Behav. 115, 106582 (2021)

    Article  Google Scholar 

  11. Li, X., Wang, M., Liang, T.P.: A multi-theoretical kernel-based approach to social network-based recommendation. Decis. Support Syst. 65(5), 95–104 (2014)

    Article  Google Scholar 

  12. Quijano-sánchez, L., Díaz-agudo, B., Recio-garcía, J.A.: Development of a group recommender application in a social network. Knowl. Based Syst. 71(S1), 72–85 (2014)

    Article  Google Scholar 

  13. Li, Y.M., Hsiao, H.W., Lee, Y.L.: Recommending social network applications via social filtering mechanisms. Inf. Sci. 239(4), 18–30 (2013)

    Google Scholar 

  14. Chaturved, A.: An efficient modified common neighbor approach for link prediction in social networks. IOSR J. Comput. Eng. 12(3), 25–34 (2013)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Lufeng Han .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Han, L. (2022). LFM-C: A Friend Recommendation Algorithm for Campus Mutual Aid System. In: Zhao, X., Yang, S., Wang, X., Li, J. (eds) Web Information Systems and Applications. WISA 2022. Lecture Notes in Computer Science, vol 13579. Springer, Cham. https://doi.org/10.1007/978-3-031-20309-1_50

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-20309-1_50

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-20308-4

  • Online ISBN: 978-3-031-20309-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Navigation