Skip to main content

A Learning Interests Oriented Model for Cold Start Recommendation

  • Conference paper
  • First Online:
  • 321 Accesses

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1373))

Abstract

In recent years, with the increasing importance of education and the development of technology such as the internet and big data, more and more researchers have applied big data research to the field of education. Although big data contains high value, it can easily lead to information overload. Therefore, researchers have developed an education recommendation system that combines education with big data to find valuable information from massive data. Based on the user's historical behavior, the recommendation system can find out the user's interest characteristics, analyze the user's needs and interests, and thereby recommend content that the user is interested in. But when it comes to new users or new products, the recommendation system can not find information about their preferences, which can easily cause data sparseness and cold start problem. In this paper, we propose a cold-start recommendation model for interests, which can enhance the usability of user-related data. The model first uses the Pearson coefficient to calculate the learning interest perception relationship between users with temporal context. Second, based on this model, we use neural network to analyze the semantics of relevant data. In order to find suitable relevant data for recommendation, we use the KNN algorithm by reducing the number of neural network outputs. Finally, the experimental results are proved from the real data of Douban book, experiments show that cold-start recommendation model for learning interests solves the problem of data sparseness and cold start to a certain extent that is compared with the traditional recommendation model based on collaborative filtering algorithm.

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

Buying options

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   54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Learn about institutional subscriptions

References

  1. Rocio, C., Pablo, C.: Should I follow the crowd? A probabilistic analysis of the effectiveness of popularity in recommender systems. In: The 41st International ACM SIGIR Conference on Research & Development in Information Retrieval, Ann Arbor, pp. 415–424. ACM (2018)

    Google Scholar 

  2. Liu, M.-J., Wang, W., Li, Y.: AttentionRank+: a graph recommendation algorithm based on attention relationship and multi-user behavior. Chin. J. Comput. 40, 102–116 (2017)

    Google Scholar 

  3. Zhao, T., Mcauley, J., King, I.: Leveraging social connections to improve personalized ranking for collaborative filtering. In: Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management, Shanghai, pp. 261–270. ACM (2014)

    Google Scholar 

  4. Dao, T.H., Jeong, S.R., Ahn, H.: A novel recommendation model of location-based advertising: context-aware collaborative filtering using GA approach. Expert Syst. Appl. 39, 3731–3739 (2012)

    Google Scholar 

  5. Yu, Y., Qiu, G.: Friends recommendation algorithm for online social networks based on local random walks. Syst. Eng. 51–58 (2013)

    Google Scholar 

  6. Koren, Y.: Factorization meets the neighborhood: a multifaceted collaborative filtering model. In: Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Nevada, pp. 426–434. ACM (2008)

    Google Scholar 

  7. Wang, H., Wang, N., Yeung, D.Y.: Collaborative deep learning for recommender systems. In: Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Sydney, pp. 261–270. ACM (2015)

    Google Scholar 

  8. Komai, Y., Sasaki, Y., Hara, T., Nishio, S.: A KNN query processing method in mobile ad hoc networks. IEEE Trans. Mob. Comput. 13, 1090–1103 (2014)

    Article  Google Scholar 

  9. Lu, D., Ning, M., Zang, J.: Improved KNN algorithm based on BP neural network decision. Comput. Appl. 37, 65–68 (2017)

    Article  Google Scholar 

  10. Lu, Y., Hong, L.: A recommendation system algorithm based on real value and topology neural networks in social networks. J. San Ming Univ. 36–42 (2018)

    Google Scholar 

  11. Feng, W., Zhu, Q., Zhuang, J., Yu, S.: An expert recommendation algorithm based on Pearson correlation coefficient and FP-growth. Clust. Comput. 22(3), 7401–7412 (2018). https://doi.org/10.1007/s10586-017-1576-y

    Article  Google Scholar 

  12. Chen, G., Wang, H.: Personalized recommendation algorithm based on improved Pearson correlation coefficient. J. Shandong Agric. Univ. (Nat. Sci. Edn.) 940–944 (2016)

    Google Scholar 

  13. Adamic, L., Adar, E.: How to search a social network. Soc. Netw. 27, 187–203 (2005)

    Article  Google Scholar 

  14. Guy, I., Ronen, I., Wilcox, E.: Do you know? Recommending people to invite into your social network. In: Proceedings of the 14th International Conference on Intelligent User Interfaces, Florida, pp. 77–86. ACM (2009)

    Google Scholar 

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

    Article  Google Scholar 

  16. Cheng, L., Gao, M.: Recommendation algorithm based on deep neural network. Mod. Comput. (Prof. Ed.) 5–9 (2018)

    Google Scholar 

  17. Sun, J., Ma, J., Liu, Z.: Leveraging content and connections for scientific article recommendation in social computing contexts. Comput. J. 57, 1331–1342 (2014)

    Article  Google Scholar 

  18. Ma, H., Yang, H., Lyu, M.R.: SoRec: social recommendation using probabilistic matrix factorization. In: Proceedings of the 17th ACM Conference on Information and Knowledge Management, pp. 931–940. ACM (2008)

    Google Scholar 

  19. Zhao, H., Yao, Q., Li, J.: Meta-graph based recommendation fusion over heterogeneous information networks. In: Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Halifax, pp. 635–644. ACM (2017)

    Google Scholar 

  20. Shen, Y., Jin, R.: Learning personal + social latent factor model for social recommendation. In: Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Beijing, pp. 1303–1311. ACM (2012)

    Google Scholar 

Download references

Acknowledgement

This research was supported by the National Key Research and Development Program of China under Grant No. 2019YFB1406002, the Joint Funds of the National Natural Science Foundation of China under Grant No. U1811261, the National Natural Science Foundation of China No. 61702345, 61702346, 61702381, the Project of Liaoning Provincial Public Opinion and Network Security Big Data System Engineering Laboratory.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xiaoli Li .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Du, Y., Yan, T., Li, X., Zhou, J., Wang, Y., Shan, J. (2021). A Learning Interests Oriented Model for Cold Start Recommendation. In: Chen, Q., Li, J. (eds) Web and Big Data. APWeb-WAIM 2020 International Workshops. APWeb-WAIM 2020. Communications in Computer and Information Science, vol 1373. Springer, Singapore. https://doi.org/10.1007/978-981-16-0479-9_7

Download citation

  • DOI: https://doi.org/10.1007/978-981-16-0479-9_7

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-16-0478-2

  • Online ISBN: 978-981-16-0479-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics