<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Joint Representation Learning of Text and Knowledge for Knowledge Graph Completion · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1611.04125/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/1611.04125/feed.xml" rel="self" type="application/rss+xml" /><item><title>Joint Representation Learning of Text and Knowledge for Knowledge Graph Completion — mentioned by mulletboy</title><link>https://news.ycombinator.com/item?id=19581179</link><guid isPermaLink="false">urn:hackerpapers:mention:1611.04125:19581179</guid><pubDate>Fri, 05 Apr 2019 10:18:17 GMT</pubDate><description>&lt;p&gt;&amp;gt; what are possible inputs to ampligraph? Any knowledge graph will do (i.e. directed, labeled multigraph, with or without schema). We have APIs to read graphs serialised as CSV files or RDF (any serialisation will do): http://docs.ampligraph.org/en/1.0.1/ampligraph.datasets.html... &amp;gt; the main use-case is plugging in an existing knowledge graph, and it filling in the gaps Correct. That is known as Link Prediction. There are other machine learning tasks you can do, though: for example you can generate embeddings and then cluster them. Or you can use embeddings to see if distinct entities are…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1611.04125/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item></channel></rss>
