【24h】

Sum Conditioned Poisson Factorization

机译:总和条件泊松分解

获取原文

摘要

We develop an extension to Poisson factorization, to model Multinomial data using a moment parametrization. Our construction is an alternative to the canonical construction of generalized linear models. This is achieved by defining K component Poisson Factorization models and constraining the sum of observation tensors across components. A family of fully conjugate tensor decomposition models for binary, ordinal or multinomial data is devised as a result, which can be used as a generic building block in hierarchical models for arrays of such data. We give parameter estimation and approximate inference procedures based on Expectation Maximization and variational inference. The flexibility of the resulting model on binary and ordinal matrix factorizations is illustrated. Empirical evaluation is performed for movie recommendation on ordinal ratings matrix, and for knowledge graph completion on binary tensors. The model is tested for both prediction and producing ranked lists.
机译:我们开发了对泊松分解的扩展,以使用矩参数化对多项式数据进行建模。我们的构造是广义线性模型规范构造的替代方法。这是通过定义K个分量泊松分解模型并约束各个分量之间的观测张量之和来实现的。结果,设计了一系列用于二进制,序数或多项式数据的全共轭张量分解模型,这些模型可以用作此类数据阵列的分层模型中的通用构件。我们基于期望最大化和变分推理给出参数估计和近似推理程序。说明了生成的模型在二进制和有序矩阵分解中的灵活性。对有序评级矩阵上的电影推荐以及对二进制张量上的知识图完成进行经验评估。对模型进行了预测和生成排名列表的测试。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号