arXiv (Cornell University)· 2018· Preprint
SimplE Embedding for Link Prediction in Knowledge Graphs
- 395citations
- 2018year
Short summary
A new method called SimplE enhances Canonical Polyadic (CP) decomposition for knowledge graph link prediction by learning dependent entity embeddings, significantly outperforming existing tensor factorization techniques.
AI-generated from the title and abstract; the full text is not read.
TakeawaysIn the app
Key pointsIn the app
Ask the paperIn the app
The rest is in the Pofolia app
Takeaways, key points and questions to the paper; new summaries every day for your field. Free.
Sign in on the web to openField: Computational Mathematics
Computational MathematicsMathematics