About | Contact Us | Register | Login
ProceedingsSeriesJournalsSearchEAI
Communications and Networking. 14th EAI International Conference, ChinaCom 2019, Shanghai, China, November 29 – December 1, 2019, Proceedings, Part II

Research Article

Content Recommendation Algorithm Based on Double Lists in Heterogeneous Network

Download(Requires a free EAI acccount)
4 downloads
Cite
BibTeX Plain Text
  • @INPROCEEDINGS{10.1007/978-3-030-41117-6_12,
        author={Jianing Chen and Xi Li and Hong Ji and Heli Zhang},
        title={Content Recommendation Algorithm Based on Double Lists in Heterogeneous Network},
        proceedings={Communications and Networking. 14th EAI International Conference, ChinaCom 2019, Shanghai, China, November 29 -- December 1, 2019, Proceedings, Part II},
        proceedings_a={CHINACOM PART 2},
        year={2020},
        month={2},
        keywords={Recommendation algorithm User preferences Maximum likelihood estimate Multiple content dimensions},
        doi={10.1007/978-3-030-41117-6_12}
    }
    
  • Jianing Chen
    Xi Li
    Hong Ji
    Heli Zhang
    Year: 2020
    Content Recommendation Algorithm Based on Double Lists in Heterogeneous Network
    CHINACOM PART 2
    Springer
    DOI: 10.1007/978-3-030-41117-6_12
Jianing Chen1,*, Xi Li1, Hong Ji1, Heli Zhang1
  • 1: Key Laboratory of Universal Wireless Communications, Ministry of Education
*Contact email: chenjianing@bupt.edu.cn

Abstract

Applying recommendation algorithms in mobile edge caching can further improve the utilization of the caching and relieve the pressure of the backhaul links. The key is to capture accurate user preferences which are usually influenced by the user’s request record and current request. In this paper, we propose a content recommendation algorithm based on both history request record and current interest. The content, user preferences and user’s requests are modeled as vectors from multiple content dimensions. Based on user’s request record, we capture the user preferences vector (Pre-Vector) by using the maximum likelihood estimation. The Pre-Vector accurately reflects user preference but has hysteresis. The user current request vector (Req-Vector) can reflect the user’s current interest but its accuracy is not stable. We propose the preference-based recommendation list and the request-based recommendation list based on the Pre-Vector and the Req-Vector respectively. In order to ensure the accuracy of the recommendation list, the final recommendation list is generated based on the Pre-Vector and the Req-Vector’s cosine similarity. The simulation results show that, the proposed algorithm has improved caching hit rate compared with existing recommendation algorithms.

Keywords
Recommendation algorithm User preferences Maximum likelihood estimate Multiple content dimensions
Published
2020-02-27
Appears in
SpringerLink
http://dx.doi.org/10.1007/978-3-030-41117-6_12
Copyright © 2019–2025 ICST
EBSCOProQuestDBLPDOAJPortico
EAI Logo

About EAI

  • Who We Are
  • Leadership
  • Research Areas
  • Partners
  • Media Center

Community

  • Membership
  • Conference
  • Recognition
  • Sponsor Us

Publish with EAI

  • Publishing
  • Journals
  • Proceedings
  • Books
  • EUDL