123 citations · 148 across the 2 of their papers we have counts for
Showing stat.MLShow all
2 papers · 1 filter
stat.ML2020★ 123 cited
Tensor Decompositions for temporal knowledge base completion
Timothée Lacroix, Guillaume Obozinski, Nicolas Usunier
Most algorithms for representation learning and link prediction in relational data have been designed for static data. However, the data they are applied to usually evolves with ti…
stat.ML2018
Canonical Tensor Decomposition for Knowledge Base Completion
Timothée Lacroix, Nicolas Usunier, Guillaume Obozinski
The problem of Knowledge Base Completion can be framed as a 3rd-order binary tensor completion problem. In this light, the Canonical Tensor Decomposition (CP) (Hitchcock, 1927) see…