Abstract
The mainstream cold start scheme in social network mainly deals with the problems of information overload and the accuracy and efficiency of recommendation. However, the problem of information overload is quite different from the problem of information transmission delay caused by insufficient contact of nodes in the mobile Opportunistic network. And in the campus collaborative learning environment, learner nodes often have a lack of awareness of their own needs of learning resources and lack of search ability for learning resources, in order to solve the above problems, this paper for the mobile social network cold start stage definition and stage division, On this basis, the paper provides solutions to the file transfer strategies in the cold start-up stage and the community operation stage of the nodes respectively, And according to the high degree of activity nodes can often be contact more information, the higher intimacy between nodes means that the nodes are more familiar and higher transmission success rate characteristics, In this paper, a learning resource recommendation mechanism based on node activity and social intimacy is proposed, and the algorithm has been tested and verified to have high accuracy for the recommendation mechanism based on message attributes.
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
Similar content being viewed by others
References
Hao, Y.: Mining and prediction of service cooperation relationship of cold start in service system. J. Tsinghua Univ. (Nat. Sci. Ed.) 59(11), 917–924 (2019)
Yu, H.: A recommended algorithm to solve the cold start problem of new projects. J. Softw. 26(06), 1395–1408 (2015)
Wang, L.C.: Context-aware recommender systems: a survey of the state-of-the-art and possible extensions. J. Softw. 23(1), 1–20 (2012)
Tang, J., Wang, K.: Personalized top-N sequential recommendation via convolutional sequence embedding. In: WSDM 2018, pp. 565–573. ACM, Marina Del Rey (2018)
Huang, K.: Recommendation in an evolving service ecosystem based on network prediction. IEEE Trans. Autom. Sci. Eng. 11(3), 906–920 (2014)
Song, L.: Online learning in large-scale contextual recommender systems. IEEE Trans. Serv. Comput. 9(3), 433–445 (2017)
Zhang, Y.: A service recommendation algorithm based on modeling of implicit demands. In: ICWS 2016, pp. 17–24. IEEE Computer Society, San Francisco (2016)
Resnick, P.: Recommender systems. Commun. ACM 40(3), 56–58 (1997)
Rabbany, R.: Relative validity criteria for community mining algorithms. In: Advances in Social Networks Analysis and Mining (ASONAM), pp. 258–265. IEEE Computer Society, Istanbul (2012)
Li, S.: Detecting community structure via synchronous label propagation. Neurocomputing 151, 1063–1075 (2015)
Wang, L.: Dynamic community discovery and evolution of online social networks. J. Comput. Sci. 38(02), 219–237 (2015)
Han, Z.: Discovery algorithm of important nodes in weighted social networks. Comput. Appl. 33(06), 1553–1562 (2013)
Feng, J.: An adaptive backoff algorithm based on neighbor activity in ad hoc networks. J. Syst. Simul. 2008(05), 1348–1352 (2008)
Fu, R.: Overlapping community discovery algorithm based on node importance and similarity. Comput. Eng. 44(09), 192–198 (2018)
Yu, L., Chen, L., Cai, Z., Shen, H., Liang, Y., Pan, Y.: Stochastic load balancing for virtual resource management in datacenters. IEEE Trans. Cloud Comput. 8(2), 459–472 (2020)
Wang, Y., Yin, G., Cai, Z., Dong, Y., Dong, H.: A trust-based probabilistic recommendation model for social networks. J. Netw. Comput. Appl. 55, 59–67 (2015)
Liang, Y., Cai, Z., Yu, J., Han, Q., Li, Y.: Deep learning based inference of private information using embedded sensors in smart devices. IEEE Netw. Mag. 32(4), 8–14 (2018)
Pang, J., Huang, Y., Xie, Z., Han, Q., Cai, Z.: Realizing the heterogeneity: a self-organized federated learning framework for IoT. IEEE Internet Things J. https://doi.org/10.1109/jiot.2020.3007662
Zhang, L., Cai, Z., Wang, X.: FakeMask: a novel privacy preserving approach for smartphones. IEEE Trans. Netw. Serv. Manag. 13(2), 335–348 (2016)
Acknowledgement
This work was supported by the National Natural Science Foundation of China under Grant No. 61877037, 61872228, 61977044, the National Key R&D Program of China under grant No. 2017YFB1402102, the Key R & D Program of Shaanxi Province under grant No. 2020GY-221, 2019ZDLSF07-01, 2020ZDLGY10-05, the Natural Science Basis Research Plan in Shaanxi Province of China under Grant No. 2020JM-303, 2020JM-302, 2017JM6060, the S&T Plan of Xi’an City of China under Grant No. 2019216914GXRC005CG006-GXYD5.1, the Fundamental Research Funds for the Central Universities of China under Grant No. GK201903090, GK201801004,the Shaanxi Normal University Foundational Education Course Research Center of Ministry of Education of China under Grant No. 2019-JCJY009.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Liu, H. et al. (2020). Cold Start and Learning Resource Recommendation Mechanism Based on Opportunistic Network in the Context of Campus Collaborative Learning. In: Yu, D., Dressler, F., Yu, J. (eds) Wireless Algorithms, Systems, and Applications. WASA 2020. Lecture Notes in Computer Science(), vol 12384. Springer, Cham. https://doi.org/10.1007/978-3-030-59016-1_26
Download citation
DOI: https://doi.org/10.1007/978-3-030-59016-1_26
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-59015-4
Online ISBN: 978-3-030-59016-1
eBook Packages: Computer ScienceComputer Science (R0)