Learning to Hash for Recommendation with Tensor Data
Yin, Qiyue; Wu, Shu; Wang, Liang
2015
会议日期2015-09-18
会议地点Guangzhou, China
页码292-303
英文摘要Recommender systems usually need to compare user interests and item characteristics in the context of large user and item space, making hashing based algorithms a promising strategy to speed up recommendation. Existing hashing based recommendation methods only model the users and items and dealing with the matrix data, e.g., user-item rating matrix. In practice, recommendation scenarios can be rather complex, e.g., collaborative retrieval and personalized tag recommendation. The above scenarios generally need fast search for one type of entities (target entities) using multiple types of entities (source entities). The resulting three or higher order tensor data makes conventional hashing algorithms fail for the above scenarios. In this paper, a novel hashing method is accordingly proposed to solve the above problem, where the tensor data is approached by properly designing the similarities between the source entities and target entities in Hamming space. Besides, operator matrices are further developed to explore the relationship between different types of source entities, resulting in auxiliary codes for source entities. Extensive experiments on two tasks, i.e., personalized tag recommendation and collaborative retrieval, demonstrate that the proposed method performs well for tensor data.
内容类型会议论文
源URL[http://ir.ia.ac.cn/handle/173211/14065]  
专题自动化研究所_智能感知与计算研究中心
作者单位中国科学院自动化研究所
推荐引用方式
GB/T 7714
Yin, Qiyue,Wu, Shu,Wang, Liang. Learning to Hash for Recommendation with Tensor Data[C]. 见:. Guangzhou, China. 2015-09-18.
个性服务
查看访问统计
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

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


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