图 书 馆
张量完备的一种新的凸松弛方法A New Convex Relaxation for Tensor Completion |
|
| 课程网址: | http://videolectures.net/lsoldm2013_romera_paredes_tensor_complet... |
| 主讲教师: | Bernardino Romera-Paredes |
| 开课单位: | 牛津大学 |
| 开课时间: | 2013-11-07 |
| 课程语种: | 英语 |
| 中文简介: |  |
| 课程简介: | Tensor factorization has received a lot of interest recently in the collaborative filtering field, as a natural extension of matrix completion. That is due to the capability of tensors to model the relationships between more than two entities, such as users, products, aspects, and time. In my research, I study the case where contextual information is available about the products (as in conjoint analysis). This scenario is modeled as a multitask learning problem where the input data are products descriptions so that tasks are learned for all combinations of the remaining entities, that is, in the previous example, a task will be learned to predict how each aspect of a product is valued by each user at a given time. Multilinear algebra concepts are used to describe the resultant problem. I will discuss different approaches to solve it and the challenges that they pose when managing large data sets. |
| 关 键 词: | 矩阵; 张量分解; 大型数据集 |
| 课程来源: | 视频讲座网 |
| 数据采集: | 2021-04-11：nkq |
| 最后编审: | 2021-04-11：nkq |
| 阅读次数: | 52 |