<rdf:RDF
 xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
 xmlns="http://purl.org/rss/1.0/"
 xmlns:dc="http://purl.org/dc/elements/1.1/"
 xmlns:cc="http://web.resource.org/cc/"
 >
<!--
	This ontology document is licensed under the Creative Commons
	Attribution License. To view a copy of this license, visit
	http://creativecommons.org/licenses/by/2.0/ or send a letter to
	Creative Commons, 559 Nathan Abbott Way, Stanford, California
	94305, USA.
-->
 <channel rdf:about="http://ebiquity.umbc.edu//tags/html/?t=multi-relational+data">
  <cc:license rdf:resource="http://creativecommons.org/licenses/by/2.0/" />
  <title><![CDATA[UMBC ebiquity RSS Tag Search]]></title>
  <link><![CDATA[http://ebiquity.umbc.edu//tags/html/?t=multi-relational+data]]></link>
  <description><![CDATA[UMBC ebiquity RSS Tag Search for multi-relational data]]></description>
  <items>
    <rdf:Seq>
      <rdf:li resource="http://ebiquity.umbc.edu/paper/html/id/766/Inferring-Relations-in-Knowledge-Graphs-with-Tensor-Decompositions"/>
    </rdf:Seq>
  </items>
 </channel>
 <item rdf:about="http://ebiquity.umbc.edu/paper/html/id/766/Inferring-Relations-in-Knowledge-Graphs-with-Tensor-Decompositions">
  <title><![CDATA[Inferring Relations in Knowledge Graphs with Tensor Decompositions]]></title>
  <link>http://ebiquity.umbc.edu/paper/html/id/766/Inferring-Relations-in-Knowledge-Graphs-with-Tensor-Decompositions</link>
  <description><![CDATA[Multi-relational data, like knowledge graphs, are generated from multiple data sources by extracting entities and their relationships. We often want to include inferred, implicit or likely relationships that are not explicitly stated, which can be viewed as link-prediction in a graph. Tensor decomposition models have been shown to produce state-of-the-art results in link-prediction tasks. We describe a simple but novel extension to an existing tensor decomposition model to predict missing lin...]]></description>
  <dc:date>2016-12-05</dc:date>
 </item>
</rdf:RDF>
