Streaming Algorithms for News and Scientific Literature Recommendation: Monotone Submodular Maximization With a d-Knapsack Constraint
Yu, Qilian1; Xu, Li2; Cui, Shuguang1
刊名IEEE ACCESS
2018
卷号6页码:53736-53747
关键词Submodular optimization streaming algorithm news recommendation scientific literature recommendation
ISSN号2169-3536
DOI10.1109/ACCESS.2018.2871668
英文摘要Submodular optimization plays a significant role in combinatorial problems, since it captures the structure of the edge cuts in graphs, the coverage of sets, and so on. Many data mining and machine learning problems can be cast as submodular maximization problems with applications in recommendation systems and data diversification. In this paper, we focus on the problem of maximizing a monotone submodular function subject to a d-knapsack constraint, for which we propose a streaming algorithm that achieves a ((1/1 + 2d) - epsilon)-approximation of the optimal value, while it only needs one single pass through the data set 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.
资助项目DoD[HDTRA1-13-1-0029] ; NSFC[61328102] ; NSFC[61629101] ; NSFC[91746301] ; NSF[DMS-1622433] ; NSF[AST-1547436] ; NSF[ECCS-1508051/1659025] ; NSF[CNS-1343155]
WOS研究方向Computer Science ; Engineering ; Telecommunications
语种英语
出版者IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
WOS记录号WOS:000447994500001
内容类型期刊论文
源URL[http://119.78.100.204/handle/2XEOYT63/4863]  
专题中国科学院计算技术研究所期刊论文_英文
通讯作者Cui, Shuguang
作者单位1.Univ Calif Davis, Dept Elect & Comp Engn, Davis, CA 95616 USA
2.Chinese Acad Sci, Inst Comp Technol, Beijing 100190, Peoples R China
推荐引用方式
GB/T 7714
Yu, Qilian,Xu, Li,Cui, Shuguang. Streaming Algorithms for News and Scientific Literature Recommendation: Monotone Submodular Maximization With a d-Knapsack Constraint[J]. IEEE ACCESS,2018,6:53736-53747.
APA Yu, Qilian,Xu, Li,&Cui, Shuguang.(2018).Streaming Algorithms for News and Scientific Literature Recommendation: Monotone Submodular Maximization With a d-Knapsack Constraint.IEEE ACCESS,6,53736-53747.
MLA Yu, Qilian,et al."Streaming Algorithms for News and Scientific Literature Recommendation: Monotone Submodular Maximization With a d-Knapsack Constraint".IEEE ACCESS 6(2018):53736-53747.
个性服务
查看访问统计
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。


©版权所有 ©2017 CSpace - Powered by CSpace