Learning Embeddings from Knowledge Graphs With Numeric Edge Attributes
Numeric values associated to edges of a knowledge graph have been used to represent uncertainty, edge importance, and even out-of-band knowledge in a growing number of scenarios, ranging from genetic data to social networks. Nevertheless, traditional knowledge graph embedding models are not designed...
Gespeichert in:
Hauptverfasser: | , |
---|---|
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | |
---|---|
container_issue | |
container_start_page | |
container_title | |
container_volume | |
creator | Pai, Sumit Costabello, Luca |
description | Numeric values associated to edges of a knowledge graph have been used to
represent uncertainty, edge importance, and even out-of-band knowledge in a
growing number of scenarios, ranging from genetic data to social networks.
Nevertheless, traditional knowledge graph embedding models are not designed to
capture such information, to the detriment of predictive power. We propose a
novel method that injects numeric edge attributes into the scoring layer of a
traditional knowledge graph embedding architecture. Experiments with publicly
available numeric-enriched knowledge graphs show that our method outperforms
traditional numeric-unaware baselines as well as the recent UKGE model. |
doi_str_mv | 10.48550/arxiv.2105.08683 |
format | Article |
fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2105_08683</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2105_08683</sourcerecordid><originalsourceid>FETCH-LOGICAL-a673-d1b75d9489f611077e25381ce14fdc11d4c8eebf1e85294b772d551dedfd57413</originalsourceid><addsrcrecordid>eNotz81uwjAQBGBfOFS0D9BT_QIJ3tiOnSNCgVaN6AWpx8jOrsESCcgJ_Xn7FtrTjDTSSB9jjyByZbUWC5e-4kdegNC5sKWVd2zdkEtDHPa87j0h_raRh3Tq-etw-jwS7olvkjsfRv4epwPfXnpKseP1dVhOU4r-MtF4z2bBHUd6-M85263r3eo5a942L6tlk7nSyAzBG42VslUoAYQxVGhpoSNQATsAVJ0l8gHI6qJS3pgCtQYkDKiNAjlnT3-3N0h7TrF36bu9gtobSP4A0SxFxw</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Learning Embeddings from Knowledge Graphs With Numeric Edge Attributes</title><source>arXiv.org</source><creator>Pai, Sumit ; Costabello, Luca</creator><creatorcontrib>Pai, Sumit ; Costabello, Luca</creatorcontrib><description>Numeric values associated to edges of a knowledge graph have been used to
represent uncertainty, edge importance, and even out-of-band knowledge in a
growing number of scenarios, ranging from genetic data to social networks.
Nevertheless, traditional knowledge graph embedding models are not designed to
capture such information, to the detriment of predictive power. We propose a
novel method that injects numeric edge attributes into the scoring layer of a
traditional knowledge graph embedding architecture. Experiments with publicly
available numeric-enriched knowledge graphs show that our method outperforms
traditional numeric-unaware baselines as well as the recent UKGE model.</description><identifier>DOI: 10.48550/arxiv.2105.08683</identifier><language>eng</language><subject>Computer Science - Artificial Intelligence</subject><creationdate>2021-05</creationdate><rights>http://creativecommons.org/licenses/by-sa/4.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2105.08683$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2105.08683$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Pai, Sumit</creatorcontrib><creatorcontrib>Costabello, Luca</creatorcontrib><title>Learning Embeddings from Knowledge Graphs With Numeric Edge Attributes</title><description>Numeric values associated to edges of a knowledge graph have been used to
represent uncertainty, edge importance, and even out-of-band knowledge in a
growing number of scenarios, ranging from genetic data to social networks.
Nevertheless, traditional knowledge graph embedding models are not designed to
capture such information, to the detriment of predictive power. We propose a
novel method that injects numeric edge attributes into the scoring layer of a
traditional knowledge graph embedding architecture. Experiments with publicly
available numeric-enriched knowledge graphs show that our method outperforms
traditional numeric-unaware baselines as well as the recent UKGE model.</description><subject>Computer Science - Artificial Intelligence</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2021</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotz81uwjAQBGBfOFS0D9BT_QIJ3tiOnSNCgVaN6AWpx8jOrsESCcgJ_Xn7FtrTjDTSSB9jjyByZbUWC5e-4kdegNC5sKWVd2zdkEtDHPa87j0h_raRh3Tq-etw-jwS7olvkjsfRv4epwPfXnpKseP1dVhOU4r-MtF4z2bBHUd6-M85263r3eo5a942L6tlk7nSyAzBG42VslUoAYQxVGhpoSNQATsAVJ0l8gHI6qJS3pgCtQYkDKiNAjlnT3-3N0h7TrF36bu9gtobSP4A0SxFxw</recordid><startdate>20210518</startdate><enddate>20210518</enddate><creator>Pai, Sumit</creator><creator>Costabello, Luca</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20210518</creationdate><title>Learning Embeddings from Knowledge Graphs With Numeric Edge Attributes</title><author>Pai, Sumit ; Costabello, Luca</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a673-d1b75d9489f611077e25381ce14fdc11d4c8eebf1e85294b772d551dedfd57413</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2021</creationdate><topic>Computer Science - Artificial Intelligence</topic><toplevel>online_resources</toplevel><creatorcontrib>Pai, Sumit</creatorcontrib><creatorcontrib>Costabello, Luca</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Pai, Sumit</au><au>Costabello, Luca</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Learning Embeddings from Knowledge Graphs With Numeric Edge Attributes</atitle><date>2021-05-18</date><risdate>2021</risdate><abstract>Numeric values associated to edges of a knowledge graph have been used to
represent uncertainty, edge importance, and even out-of-band knowledge in a
growing number of scenarios, ranging from genetic data to social networks.
Nevertheless, traditional knowledge graph embedding models are not designed to
capture such information, to the detriment of predictive power. We propose a
novel method that injects numeric edge attributes into the scoring layer of a
traditional knowledge graph embedding architecture. Experiments with publicly
available numeric-enriched knowledge graphs show that our method outperforms
traditional numeric-unaware baselines as well as the recent UKGE model.</abstract><doi>10.48550/arxiv.2105.08683</doi><oa>free_for_read</oa></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | DOI: 10.48550/arxiv.2105.08683 |
ispartof | |
issn | |
language | eng |
recordid | cdi_arxiv_primary_2105_08683 |
source | arXiv.org |
subjects | Computer Science - Artificial Intelligence |
title | Learning Embeddings from Knowledge Graphs With Numeric Edge Attributes |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-09T04%3A32%3A21IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Learning%20Embeddings%20from%20Knowledge%20Graphs%20With%20Numeric%20Edge%20Attributes&rft.au=Pai,%20Sumit&rft.date=2021-05-18&rft_id=info:doi/10.48550/arxiv.2105.08683&rft_dat=%3Carxiv_GOX%3E2105_08683%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |