On Approximate Reasoning Capabilities of Low-Rank Vector Spaces
暂无分享,去创建一个
Guillaume Bouchard | Sameer Singh | Théo Trouillon | Guillaume Bouchard | Théo Trouillon | Sameer Singh
[1] H. Law. Research methods for multimode data analysis , 1984 .
[2] Vojtech Rödl,et al. Geometrical realization of set systems and probabilistic communication complexity , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[3] Matthew Richardson,et al. Markov logic networks , 2006, Machine Learning.
[4] Sameer Singh,et al. Low-Dimensional Embeddings of Logic , 2014, ACL 2014.
[5] Nathan Linial,et al. Complexity measures of sign matrices , 2007, Comb..
[6] Mark Steedman,et al. Combined Distributional and Logical Semantics , 2013, TACL.
[7] Tamara G. Kolda,et al. All-at-once Optimization for Coupled Matrix and Tensor Factorizations , 2011, ArXiv.
[8] Geoffrey J. Gordon,et al. Relational learning via collective matrix factorization , 2008, KDD.
[9] Janos Simon,et al. Probabilistic Communication Complexity , 1986, J. Comput. Syst. Sci..
[10] Ruslan Salakhutdinov,et al. Probabilistic Matrix Factorization , 2007, NIPS.
[11] Hans-Peter Kriegel,et al. A Three-Way Model for Collective Learning on Multi-Relational Data , 2011, ICML.