期刊文献+

因子分解机模型研究综述 被引量:12

Survey on Factorization Machines Model
下载PDF
导出
摘要 传统矩阵分解方法因其算法的高可扩展性和较好的性能等特点,在预测、推荐等领域有着广泛的应用.然而大数据环境下,更多上下文因素的获取变得可能,传统矩阵分解方法缺乏对上下文信息的有效利用.在此背景下,因子分解机模型提出并流行.为了更好地把握因子分解机模型的发展脉络,促进因子分解机模型与应用相结合,针对因子分解机模型及其算法进行了综述.首先,对因子分解机模型的提出进行了溯源,介绍了从传统矩阵分解到因子分解机模型的演化过程;其次,从模型准确率和效率两方面对因子分解机模型存在的基本问题和近年来的研究进展进行了总结,然后综述了适用于因子分解机模型求解的4种代表性优化算法;最后分析了因子分解机模型目前仍存在的问题,提出了可能的解决思路,并对未来的研究方向进行了展望. The traditional matrix factorization method has a wide range of applications in prediction and recommendation tasks because of its high scalability and good performance. In the big data era, more and more contextual features can be obtained easily, while the traditional matrix factorization approach lacks effective use of context information. In this context, Factorization Machines (FM) is proposed and popular. To better grasp the development process of FM model and adapt FM approach to the real application, this paper reviews existing FM models and their optimization algorithms. First, it introduces the evolution process from traditional Matrix Factorization (MF) to FM model. Second, the paper summarizes the existing researches on FM method from the perspective of model accuracy and efficiency;Third, the paper presents the studies of four representative optimization algorithms, which are suitable for various FM models. Finally, the paper analyzes the challenges in the current FM model, proposes possible solutions for these problems, and discusses the future work.
作者 赵衎衎 张良富 张静 李翠平 陈红 ZHAO Kan-Kan;ZHANG Liang-Fu;ZHANG Jing;LI Cui-Ping;CHEN Hong(School of Information, Renmin University of China, Beijing 100872, China;Key Laboratory of Data Engineering and Knowledge Engineering of Ministry of Education (Renmin University of China), Beijing100872, China)
出处 《软件学报》 EI CSCD 北大核心 2019年第3期799-821,共23页 Journal of Software
基金 国家自然科学基金(61772537 61772536 61702522 61532021)~~
关键词 因子分解机 高阶交互 特征选择 概率模型 凸优化 分布式框架 优化方法 factorization machine high-order interaction feature selection probability model convex optimization distributed framework optimization algorithm
  • 相关文献

参考文献5

二级参考文献106

  • 1Chatterjee P, Hoffman DL, Novak TP. Modeling the clickstream: Implications for Web-based advertising efforts. Marketing Science, 2003,22(4):520-541. [doi: 10.1287/mksc.22.4.520.24906].
  • 2Wang C, Zhang P, Choi R, D'Eredita M. Understanding consumers' attitude toward advertising. In: Proc. of the 8th Americas Conf. on Information System. 2002. 1143-1148.
  • 3Ribeiro-Neto B, Cristo M, Golgher PB, Moura ES. Impedance coupling in content-targeted advertising. In: Proe. of the SIGIR 2605. New York: ACM Press, 2005. 496-503. [doi: 10.1145/1076034.1076119].
  • 4Lacerda A, Cristo M, Goncalves MA, Fan WG, Ziviani N, Ribeiro-Neto B. Learning to advertise. In: Proc. of the SIGIR 2006. New York: ACM Press, 2006. 549-556. [doi: 10.1145/1148170.1148265].
  • 5Broder AZ, Fontoura M, Josifovski V, Riedel L. A semantic approach to contextual advertising. In: Proc. of the SIGIR. 2007. 559-566. [doi: 10.1145/1277741.1277837].
  • 6Chakrabarti D, Agarwal D, Josifovski V. Contextual advertising by combining relevance with click feedback. In: Proc. of the 17th Int'l Con1: on World Wide Web (WWW 2008). Beijing: ACM Press, 2008.417-426. [doi: 10.1145/1367497.1367554].
  • 7Yih W, Goodman J, Carvalho VR. Finding advertising keywords on Web pages. In: Proc. of the 15th Int'l Conf. on World Wide Web (WWW 2006). New York: ACM Press, 2006. 213-222. [doi: 10.1145/1135777.1135813].
  • 8Belkin N, Croft B. Information filtering and information retrieval. Communications of the ACM, 1992,35(12):29-37. [doi: 10.1145/138859.138861].
  • 9Balabanovic M, Shoham Y. Fab: Content-based collaborative recommendation. Communications of the ACM, 1997,40(3):66-72. [doi: 10.1145/245108.245124].
  • 10Resnick P, Iacovou N, Suchak M, Bergstrom P, Riedl J. Grouplens: An open architecture for collaborative filtering of netnews. In: Proc. of the CSCW'94, 1994. [doi: 10.1145/192844.192905].

共引文献514

同被引文献80

引证文献12

二级引证文献23

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部