ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1603.05614
98
10
v1v2v3 (latest)

Streaming Algorithms for News and Scientific Literature Recommendation: Submodular Maximization with a ddd-Knapsack Constraint

17 March 2016
Qilian Yu
Easton Li Xu
Shuguang Cui
ArXiv (abs)PDFHTML
Abstract

Submodular maximization problems belong to the family of combinatorial optimization problems and enjoy wide applications. In this paper, we focus on the problem of maximizing a monotone submodular function subject to a ddd-knapsack constraint, for which we propose a streaming algorithm that achieves a (11+d−ϵ)\left(\frac{1}{1+d}-\epsilon\right)(1+d1​−ϵ)-approximation of the optimal value, while it only needs one single pass through the dataset without storing all the data in the memory. In our experiments, we extensively evaluate the effectiveness of our proposed algorithm via two applications: news recommendation and scientific literature recommendation. It is observed that the proposed streaming algorithm achieves both execution speedup and memory saving by several orders of magnitude, compared with existing approaches.

View on arXiv
Comments on this paper