Conflict-aware multilingual knowledge graph completion
Knowledge graph completion (KGC), a task that aims at predicting missing links with existing information inside a knowledge graph (KG), has emerged as a popular research area in recent years. While many existing works have demonstrated effectiveness on a single knowledge graph KGC, limited effort ha...
Ausführliche Beschreibung
Autor*in: |
Zhang, Weihang [verfasserIn] Şerban, Ovidiu [verfasserIn] Sun, Jiahao [verfasserIn] Guo, Yike [verfasserIn] |
---|
Format: |
E-Artikel |
---|---|
Sprache: |
Englisch |
Erschienen: |
2023 |
---|
Schlagwörter: |
---|
Übergeordnetes Werk: |
Enthalten in: Knowledge-based systems - Amsterdam [u.a.] : Elsevier Science, 1987, 281 |
---|---|
Übergeordnetes Werk: |
volume:281 |
DOI / URN: |
10.1016/j.knosys.2023.111070 |
---|
Katalog-ID: |
ELV065411897 |
---|
LEADER | 01000naa a22002652 4500 | ||
---|---|---|---|
001 | ELV065411897 | ||
003 | DE-627 | ||
005 | 20231103093252.0 | ||
007 | cr uuu---uuuuu | ||
008 | 231103s2023 xx |||||o 00| ||eng c | ||
024 | 7 | |a 10.1016/j.knosys.2023.111070 |2 doi | |
035 | |a (DE-627)ELV065411897 | ||
035 | |a (ELSEVIER)S0950-7051(23)00820-1 | ||
040 | |a DE-627 |b ger |c DE-627 |e rda | ||
041 | |a eng | ||
082 | 0 | 4 | |a 004 |q VZ |
084 | |a 54.72 |2 bkl | ||
100 | 1 | |a Zhang, Weihang |e verfasserin |0 (orcid)0000-0002-6244-5748 |4 aut | |
245 | 1 | 0 | |a Conflict-aware multilingual knowledge graph completion |
264 | 1 | |c 2023 | |
336 | |a nicht spezifiziert |b zzz |2 rdacontent | ||
337 | |a Computermedien |b c |2 rdamedia | ||
338 | |a Online-Ressource |b cr |2 rdacarrier | ||
520 | |a Knowledge graph completion (KGC), a task that aims at predicting missing links with existing information inside a knowledge graph (KG), has emerged as a popular research area in recent years. While many existing works have demonstrated effectiveness on a single knowledge graph KGC, limited effort has been devoted to exploring the potentially complementary nature of multiple KGs. In this work, we proposed a novel method called CA-MKGC (Conflict-aware Multilingual Knowledge Graph Completion) for multiple knowledge graph completion (MKGC), aiming to alleviate the sparseness of a single knowledge graph by leveraging information from other knowledge graphs. We designed an intra-KG graph convolutional network encoder that regards the seed alignments between KGs as edges for intra-KG message propagation to model all KGs in a unified model while also adopting an iterative mechanism to progressively incorporate newly predicted alignments along with the newly inferred facts into the learning process. Additionally, we employed an active learning mechanism and a greedy approximation to a semi-constrained optimization problem to focus on learning the structural prior knowledge that is difficult to learn in semantic space, limiting the propagation of error in the iterative training process. Experimental results on multilingual KG datasets demonstrated that our method achieved state-of-the-art results. | ||
650 | 4 | |a Knowledge graph | |
650 | 4 | |a Knowledge graph completion | |
650 | 4 | |a Knowledge representation | |
650 | 4 | |a Knowledge transfer | |
650 | 4 | |a Active learning | |
700 | 1 | |a Şerban, Ovidiu |e verfasserin |4 aut | |
700 | 1 | |a Sun, Jiahao |e verfasserin |4 aut | |
700 | 1 | |a Guo, Yike |e verfasserin |4 aut | |
773 | 0 | 8 | |i Enthalten in |t Knowledge-based systems |d Amsterdam [u.a.] : Elsevier Science, 1987 |g 281 |h Online-Ressource |w (DE-627)320580024 |w (DE-600)2017495-0 |w (DE-576)253018722 |x 0950-7051 |7 nnns |
773 | 1 | 8 | |g volume:281 |
912 | |a GBV_USEFLAG_U | ||
912 | |a GBV_ELV | ||
912 | |a SYSFLAG_U | ||
912 | |a GBV_ILN_20 | ||
912 | |a GBV_ILN_22 | ||
912 | |a GBV_ILN_23 | ||
912 | |a GBV_ILN_24 | ||
912 | |a GBV_ILN_31 | ||
912 | |a GBV_ILN_32 | ||
912 | |a GBV_ILN_40 | ||
912 | |a GBV_ILN_60 | ||
912 | |a GBV_ILN_62 | ||
912 | |a GBV_ILN_65 | ||
912 | |a GBV_ILN_69 | ||
912 | |a GBV_ILN_70 | ||
912 | |a GBV_ILN_73 | ||
912 | |a GBV_ILN_74 | ||
912 | |a GBV_ILN_90 | ||
912 | |a GBV_ILN_95 | ||
912 | |a GBV_ILN_100 | ||
912 | |a GBV_ILN_101 | ||
912 | |a GBV_ILN_105 | ||
912 | |a GBV_ILN_110 | ||
912 | |a GBV_ILN_150 | ||
912 | |a GBV_ILN_151 | ||
912 | |a GBV_ILN_187 | ||
912 | |a GBV_ILN_213 | ||
912 | |a GBV_ILN_224 | ||
912 | |a GBV_ILN_230 | ||
912 | |a GBV_ILN_370 | ||
912 | |a GBV_ILN_602 | ||
912 | |a GBV_ILN_702 | ||
912 | |a GBV_ILN_2001 | ||
912 | |a GBV_ILN_2003 | ||
912 | |a GBV_ILN_2004 | ||
912 | |a GBV_ILN_2005 | ||
912 | |a GBV_ILN_2007 | ||
912 | |a GBV_ILN_2008 | ||
912 | |a GBV_ILN_2009 | ||
912 | |a GBV_ILN_2010 | ||
912 | |a GBV_ILN_2011 | ||
912 | |a GBV_ILN_2014 | ||
912 | |a GBV_ILN_2015 | ||
912 | |a GBV_ILN_2020 | ||
912 | |a GBV_ILN_2021 | ||
912 | |a GBV_ILN_2025 | ||
912 | |a GBV_ILN_2026 | ||
912 | |a GBV_ILN_2027 | ||
912 | |a GBV_ILN_2034 | ||
912 | |a GBV_ILN_2044 | ||
912 | |a GBV_ILN_2048 | ||
912 | |a GBV_ILN_2049 | ||
912 | |a GBV_ILN_2050 | ||
912 | |a GBV_ILN_2055 | ||
912 | |a GBV_ILN_2056 | ||
912 | |a GBV_ILN_2059 | ||
912 | |a GBV_ILN_2061 | ||
912 | |a GBV_ILN_2064 | ||
912 | |a GBV_ILN_2088 | ||
912 | |a GBV_ILN_2106 | ||
912 | |a GBV_ILN_2110 | ||
912 | |a GBV_ILN_2111 | ||
912 | |a GBV_ILN_2112 | ||
912 | |a GBV_ILN_2122 | ||
912 | |a GBV_ILN_2129 | ||
912 | |a GBV_ILN_2143 | ||
912 | |a GBV_ILN_2152 | ||
912 | |a GBV_ILN_2153 | ||
912 | |a GBV_ILN_2190 | ||
912 | |a GBV_ILN_2232 | ||
912 | |a GBV_ILN_2336 | ||
912 | |a GBV_ILN_2470 | ||
912 | |a GBV_ILN_2507 | ||
912 | |a GBV_ILN_4035 | ||
912 | |a GBV_ILN_4037 | ||
912 | |a GBV_ILN_4112 | ||
912 | |a GBV_ILN_4125 | ||
912 | |a GBV_ILN_4242 | ||
912 | |a GBV_ILN_4249 | ||
912 | |a GBV_ILN_4251 | ||
912 | |a GBV_ILN_4305 | ||
912 | |a GBV_ILN_4306 | ||
912 | |a GBV_ILN_4307 | ||
912 | |a GBV_ILN_4313 | ||
912 | |a GBV_ILN_4322 | ||
912 | |a GBV_ILN_4323 | ||
912 | |a GBV_ILN_4324 | ||
912 | |a GBV_ILN_4325 | ||
912 | |a GBV_ILN_4326 | ||
912 | |a GBV_ILN_4333 | ||
912 | |a GBV_ILN_4334 | ||
912 | |a GBV_ILN_4338 | ||
912 | |a GBV_ILN_4393 | ||
912 | |a GBV_ILN_4700 | ||
936 | b | k | |a 54.72 |j Künstliche Intelligenz |q VZ |
951 | |a AR | ||
952 | |d 281 |
author_variant |
w z wz o ş oş j s js y g yg |
---|---|
matchkey_str |
article:09507051:2023----::ofitwrmliigakolder |
hierarchy_sort_str |
2023 |
bklnumber |
54.72 |
publishDate |
2023 |
allfields |
10.1016/j.knosys.2023.111070 doi (DE-627)ELV065411897 (ELSEVIER)S0950-7051(23)00820-1 DE-627 ger DE-627 rda eng 004 VZ 54.72 bkl Zhang, Weihang verfasserin (orcid)0000-0002-6244-5748 aut Conflict-aware multilingual knowledge graph completion 2023 nicht spezifiziert zzz rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Knowledge graph completion (KGC), a task that aims at predicting missing links with existing information inside a knowledge graph (KG), has emerged as a popular research area in recent years. While many existing works have demonstrated effectiveness on a single knowledge graph KGC, limited effort has been devoted to exploring the potentially complementary nature of multiple KGs. In this work, we proposed a novel method called CA-MKGC (Conflict-aware Multilingual Knowledge Graph Completion) for multiple knowledge graph completion (MKGC), aiming to alleviate the sparseness of a single knowledge graph by leveraging information from other knowledge graphs. We designed an intra-KG graph convolutional network encoder that regards the seed alignments between KGs as edges for intra-KG message propagation to model all KGs in a unified model while also adopting an iterative mechanism to progressively incorporate newly predicted alignments along with the newly inferred facts into the learning process. Additionally, we employed an active learning mechanism and a greedy approximation to a semi-constrained optimization problem to focus on learning the structural prior knowledge that is difficult to learn in semantic space, limiting the propagation of error in the iterative training process. Experimental results on multilingual KG datasets demonstrated that our method achieved state-of-the-art results. Knowledge graph Knowledge graph completion Knowledge representation Knowledge transfer Active learning Şerban, Ovidiu verfasserin aut Sun, Jiahao verfasserin aut Guo, Yike verfasserin aut Enthalten in Knowledge-based systems Amsterdam [u.a.] : Elsevier Science, 1987 281 Online-Ressource (DE-627)320580024 (DE-600)2017495-0 (DE-576)253018722 0950-7051 nnns volume:281 GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_105 GBV_ILN_110 GBV_ILN_150 GBV_ILN_151 GBV_ILN_187 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2088 GBV_ILN_2106 GBV_ILN_2110 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_2336 GBV_ILN_2470 GBV_ILN_2507 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4242 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4338 GBV_ILN_4393 GBV_ILN_4700 54.72 Künstliche Intelligenz VZ AR 281 |
spelling |
10.1016/j.knosys.2023.111070 doi (DE-627)ELV065411897 (ELSEVIER)S0950-7051(23)00820-1 DE-627 ger DE-627 rda eng 004 VZ 54.72 bkl Zhang, Weihang verfasserin (orcid)0000-0002-6244-5748 aut Conflict-aware multilingual knowledge graph completion 2023 nicht spezifiziert zzz rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Knowledge graph completion (KGC), a task that aims at predicting missing links with existing information inside a knowledge graph (KG), has emerged as a popular research area in recent years. While many existing works have demonstrated effectiveness on a single knowledge graph KGC, limited effort has been devoted to exploring the potentially complementary nature of multiple KGs. In this work, we proposed a novel method called CA-MKGC (Conflict-aware Multilingual Knowledge Graph Completion) for multiple knowledge graph completion (MKGC), aiming to alleviate the sparseness of a single knowledge graph by leveraging information from other knowledge graphs. We designed an intra-KG graph convolutional network encoder that regards the seed alignments between KGs as edges for intra-KG message propagation to model all KGs in a unified model while also adopting an iterative mechanism to progressively incorporate newly predicted alignments along with the newly inferred facts into the learning process. Additionally, we employed an active learning mechanism and a greedy approximation to a semi-constrained optimization problem to focus on learning the structural prior knowledge that is difficult to learn in semantic space, limiting the propagation of error in the iterative training process. Experimental results on multilingual KG datasets demonstrated that our method achieved state-of-the-art results. Knowledge graph Knowledge graph completion Knowledge representation Knowledge transfer Active learning Şerban, Ovidiu verfasserin aut Sun, Jiahao verfasserin aut Guo, Yike verfasserin aut Enthalten in Knowledge-based systems Amsterdam [u.a.] : Elsevier Science, 1987 281 Online-Ressource (DE-627)320580024 (DE-600)2017495-0 (DE-576)253018722 0950-7051 nnns volume:281 GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_105 GBV_ILN_110 GBV_ILN_150 GBV_ILN_151 GBV_ILN_187 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2088 GBV_ILN_2106 GBV_ILN_2110 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_2336 GBV_ILN_2470 GBV_ILN_2507 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4242 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4338 GBV_ILN_4393 GBV_ILN_4700 54.72 Künstliche Intelligenz VZ AR 281 |
allfields_unstemmed |
10.1016/j.knosys.2023.111070 doi (DE-627)ELV065411897 (ELSEVIER)S0950-7051(23)00820-1 DE-627 ger DE-627 rda eng 004 VZ 54.72 bkl Zhang, Weihang verfasserin (orcid)0000-0002-6244-5748 aut Conflict-aware multilingual knowledge graph completion 2023 nicht spezifiziert zzz rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Knowledge graph completion (KGC), a task that aims at predicting missing links with existing information inside a knowledge graph (KG), has emerged as a popular research area in recent years. While many existing works have demonstrated effectiveness on a single knowledge graph KGC, limited effort has been devoted to exploring the potentially complementary nature of multiple KGs. In this work, we proposed a novel method called CA-MKGC (Conflict-aware Multilingual Knowledge Graph Completion) for multiple knowledge graph completion (MKGC), aiming to alleviate the sparseness of a single knowledge graph by leveraging information from other knowledge graphs. We designed an intra-KG graph convolutional network encoder that regards the seed alignments between KGs as edges for intra-KG message propagation to model all KGs in a unified model while also adopting an iterative mechanism to progressively incorporate newly predicted alignments along with the newly inferred facts into the learning process. Additionally, we employed an active learning mechanism and a greedy approximation to a semi-constrained optimization problem to focus on learning the structural prior knowledge that is difficult to learn in semantic space, limiting the propagation of error in the iterative training process. Experimental results on multilingual KG datasets demonstrated that our method achieved state-of-the-art results. Knowledge graph Knowledge graph completion Knowledge representation Knowledge transfer Active learning Şerban, Ovidiu verfasserin aut Sun, Jiahao verfasserin aut Guo, Yike verfasserin aut Enthalten in Knowledge-based systems Amsterdam [u.a.] : Elsevier Science, 1987 281 Online-Ressource (DE-627)320580024 (DE-600)2017495-0 (DE-576)253018722 0950-7051 nnns volume:281 GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_105 GBV_ILN_110 GBV_ILN_150 GBV_ILN_151 GBV_ILN_187 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2088 GBV_ILN_2106 GBV_ILN_2110 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_2336 GBV_ILN_2470 GBV_ILN_2507 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4242 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4338 GBV_ILN_4393 GBV_ILN_4700 54.72 Künstliche Intelligenz VZ AR 281 |
allfieldsGer |
10.1016/j.knosys.2023.111070 doi (DE-627)ELV065411897 (ELSEVIER)S0950-7051(23)00820-1 DE-627 ger DE-627 rda eng 004 VZ 54.72 bkl Zhang, Weihang verfasserin (orcid)0000-0002-6244-5748 aut Conflict-aware multilingual knowledge graph completion 2023 nicht spezifiziert zzz rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Knowledge graph completion (KGC), a task that aims at predicting missing links with existing information inside a knowledge graph (KG), has emerged as a popular research area in recent years. While many existing works have demonstrated effectiveness on a single knowledge graph KGC, limited effort has been devoted to exploring the potentially complementary nature of multiple KGs. In this work, we proposed a novel method called CA-MKGC (Conflict-aware Multilingual Knowledge Graph Completion) for multiple knowledge graph completion (MKGC), aiming to alleviate the sparseness of a single knowledge graph by leveraging information from other knowledge graphs. We designed an intra-KG graph convolutional network encoder that regards the seed alignments between KGs as edges for intra-KG message propagation to model all KGs in a unified model while also adopting an iterative mechanism to progressively incorporate newly predicted alignments along with the newly inferred facts into the learning process. Additionally, we employed an active learning mechanism and a greedy approximation to a semi-constrained optimization problem to focus on learning the structural prior knowledge that is difficult to learn in semantic space, limiting the propagation of error in the iterative training process. Experimental results on multilingual KG datasets demonstrated that our method achieved state-of-the-art results. Knowledge graph Knowledge graph completion Knowledge representation Knowledge transfer Active learning Şerban, Ovidiu verfasserin aut Sun, Jiahao verfasserin aut Guo, Yike verfasserin aut Enthalten in Knowledge-based systems Amsterdam [u.a.] : Elsevier Science, 1987 281 Online-Ressource (DE-627)320580024 (DE-600)2017495-0 (DE-576)253018722 0950-7051 nnns volume:281 GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_105 GBV_ILN_110 GBV_ILN_150 GBV_ILN_151 GBV_ILN_187 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2088 GBV_ILN_2106 GBV_ILN_2110 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_2336 GBV_ILN_2470 GBV_ILN_2507 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4242 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4338 GBV_ILN_4393 GBV_ILN_4700 54.72 Künstliche Intelligenz VZ AR 281 |
allfieldsSound |
10.1016/j.knosys.2023.111070 doi (DE-627)ELV065411897 (ELSEVIER)S0950-7051(23)00820-1 DE-627 ger DE-627 rda eng 004 VZ 54.72 bkl Zhang, Weihang verfasserin (orcid)0000-0002-6244-5748 aut Conflict-aware multilingual knowledge graph completion 2023 nicht spezifiziert zzz rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Knowledge graph completion (KGC), a task that aims at predicting missing links with existing information inside a knowledge graph (KG), has emerged as a popular research area in recent years. While many existing works have demonstrated effectiveness on a single knowledge graph KGC, limited effort has been devoted to exploring the potentially complementary nature of multiple KGs. In this work, we proposed a novel method called CA-MKGC (Conflict-aware Multilingual Knowledge Graph Completion) for multiple knowledge graph completion (MKGC), aiming to alleviate the sparseness of a single knowledge graph by leveraging information from other knowledge graphs. We designed an intra-KG graph convolutional network encoder that regards the seed alignments between KGs as edges for intra-KG message propagation to model all KGs in a unified model while also adopting an iterative mechanism to progressively incorporate newly predicted alignments along with the newly inferred facts into the learning process. Additionally, we employed an active learning mechanism and a greedy approximation to a semi-constrained optimization problem to focus on learning the structural prior knowledge that is difficult to learn in semantic space, limiting the propagation of error in the iterative training process. Experimental results on multilingual KG datasets demonstrated that our method achieved state-of-the-art results. Knowledge graph Knowledge graph completion Knowledge representation Knowledge transfer Active learning Şerban, Ovidiu verfasserin aut Sun, Jiahao verfasserin aut Guo, Yike verfasserin aut Enthalten in Knowledge-based systems Amsterdam [u.a.] : Elsevier Science, 1987 281 Online-Ressource (DE-627)320580024 (DE-600)2017495-0 (DE-576)253018722 0950-7051 nnns volume:281 GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_105 GBV_ILN_110 GBV_ILN_150 GBV_ILN_151 GBV_ILN_187 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2088 GBV_ILN_2106 GBV_ILN_2110 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_2336 GBV_ILN_2470 GBV_ILN_2507 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4242 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4338 GBV_ILN_4393 GBV_ILN_4700 54.72 Künstliche Intelligenz VZ AR 281 |
language |
English |
source |
Enthalten in Knowledge-based systems 281 volume:281 |
sourceStr |
Enthalten in Knowledge-based systems 281 volume:281 |
format_phy_str_mv |
Article |
bklname |
Künstliche Intelligenz |
institution |
findex.gbv.de |
topic_facet |
Knowledge graph Knowledge graph completion Knowledge representation Knowledge transfer Active learning |
dewey-raw |
004 |
isfreeaccess_bool |
false |
container_title |
Knowledge-based systems |
authorswithroles_txt_mv |
Zhang, Weihang @@aut@@ Şerban, Ovidiu @@aut@@ Sun, Jiahao @@aut@@ Guo, Yike @@aut@@ |
publishDateDaySort_date |
2023-01-01T00:00:00Z |
hierarchy_top_id |
320580024 |
dewey-sort |
14 |
id |
ELV065411897 |
language_de |
englisch |
fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000naa a22002652 4500</leader><controlfield tag="001">ELV065411897</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20231103093252.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">231103s2023 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.knosys.2023.111070</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)ELV065411897</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ELSEVIER)S0950-7051(23)00820-1</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">54.72</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Zhang, Weihang</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(orcid)0000-0002-6244-5748</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Conflict-aware multilingual knowledge graph completion</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2023</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zzz</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Knowledge graph completion (KGC), a task that aims at predicting missing links with existing information inside a knowledge graph (KG), has emerged as a popular research area in recent years. While many existing works have demonstrated effectiveness on a single knowledge graph KGC, limited effort has been devoted to exploring the potentially complementary nature of multiple KGs. In this work, we proposed a novel method called CA-MKGC (Conflict-aware Multilingual Knowledge Graph Completion) for multiple knowledge graph completion (MKGC), aiming to alleviate the sparseness of a single knowledge graph by leveraging information from other knowledge graphs. We designed an intra-KG graph convolutional network encoder that regards the seed alignments between KGs as edges for intra-KG message propagation to model all KGs in a unified model while also adopting an iterative mechanism to progressively incorporate newly predicted alignments along with the newly inferred facts into the learning process. Additionally, we employed an active learning mechanism and a greedy approximation to a semi-constrained optimization problem to focus on learning the structural prior knowledge that is difficult to learn in semantic space, limiting the propagation of error in the iterative training process. Experimental results on multilingual KG datasets demonstrated that our method achieved state-of-the-art results.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Knowledge graph</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Knowledge graph completion</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Knowledge representation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Knowledge transfer</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Active learning</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Şerban, Ovidiu</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Sun, Jiahao</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Guo, Yike</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Knowledge-based systems</subfield><subfield code="d">Amsterdam [u.a.] : Elsevier Science, 1987</subfield><subfield code="g">281</subfield><subfield code="h">Online-Ressource</subfield><subfield code="w">(DE-627)320580024</subfield><subfield code="w">(DE-600)2017495-0</subfield><subfield code="w">(DE-576)253018722</subfield><subfield code="x">0950-7051</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:281</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ELV</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_32</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_74</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_90</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_100</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_101</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_150</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_187</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_224</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_702</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2001</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2003</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2004</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2007</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2008</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2009</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2010</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2011</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2015</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2020</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2025</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2026</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2027</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2034</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2044</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2048</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2049</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2050</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2055</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2056</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2059</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2061</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2064</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2088</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2106</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2111</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2122</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2129</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2143</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2152</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2153</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2190</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2232</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2336</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2470</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2507</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4035</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4242</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4251</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4326</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4333</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4334</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4393</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">54.72</subfield><subfield code="j">Künstliche Intelligenz</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">281</subfield></datafield></record></collection>
|
author |
Zhang, Weihang |
spellingShingle |
Zhang, Weihang ddc 004 bkl 54.72 misc Knowledge graph misc Knowledge graph completion misc Knowledge representation misc Knowledge transfer misc Active learning Conflict-aware multilingual knowledge graph completion |
authorStr |
Zhang, Weihang |
ppnlink_with_tag_str_mv |
@@773@@(DE-627)320580024 |
format |
electronic Article |
dewey-ones |
004 - Data processing & computer science |
delete_txt_mv |
keep |
author_role |
aut aut aut aut |
collection |
elsevier |
remote_str |
true |
illustrated |
Not Illustrated |
issn |
0950-7051 |
topic_title |
004 VZ 54.72 bkl Conflict-aware multilingual knowledge graph completion Knowledge graph Knowledge graph completion Knowledge representation Knowledge transfer Active learning |
topic |
ddc 004 bkl 54.72 misc Knowledge graph misc Knowledge graph completion misc Knowledge representation misc Knowledge transfer misc Active learning |
topic_unstemmed |
ddc 004 bkl 54.72 misc Knowledge graph misc Knowledge graph completion misc Knowledge representation misc Knowledge transfer misc Active learning |
topic_browse |
ddc 004 bkl 54.72 misc Knowledge graph misc Knowledge graph completion misc Knowledge representation misc Knowledge transfer misc Active learning |
format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
format_main_str_mv |
Text Zeitschrift/Artikel |
carriertype_str_mv |
cr |
hierarchy_parent_title |
Knowledge-based systems |
hierarchy_parent_id |
320580024 |
dewey-tens |
000 - Computer science, knowledge & systems |
hierarchy_top_title |
Knowledge-based systems |
isfreeaccess_txt |
false |
familylinks_str_mv |
(DE-627)320580024 (DE-600)2017495-0 (DE-576)253018722 |
title |
Conflict-aware multilingual knowledge graph completion |
ctrlnum |
(DE-627)ELV065411897 (ELSEVIER)S0950-7051(23)00820-1 |
title_full |
Conflict-aware multilingual knowledge graph completion |
author_sort |
Zhang, Weihang |
journal |
Knowledge-based systems |
journalStr |
Knowledge-based systems |
lang_code |
eng |
isOA_bool |
false |
dewey-hundreds |
000 - Computer science, information & general works |
recordtype |
marc |
publishDateSort |
2023 |
contenttype_str_mv |
zzz |
author_browse |
Zhang, Weihang Şerban, Ovidiu Sun, Jiahao Guo, Yike |
container_volume |
281 |
class |
004 VZ 54.72 bkl |
format_se |
Elektronische Aufsätze |
author-letter |
Zhang, Weihang |
doi_str_mv |
10.1016/j.knosys.2023.111070 |
normlink |
(ORCID)0000-0002-6244-5748 |
normlink_prefix_str_mv |
(orcid)0000-0002-6244-5748 |
dewey-full |
004 |
author2-role |
verfasserin |
title_sort |
conflict-aware multilingual knowledge graph completion |
title_auth |
Conflict-aware multilingual knowledge graph completion |
abstract |
Knowledge graph completion (KGC), a task that aims at predicting missing links with existing information inside a knowledge graph (KG), has emerged as a popular research area in recent years. While many existing works have demonstrated effectiveness on a single knowledge graph KGC, limited effort has been devoted to exploring the potentially complementary nature of multiple KGs. In this work, we proposed a novel method called CA-MKGC (Conflict-aware Multilingual Knowledge Graph Completion) for multiple knowledge graph completion (MKGC), aiming to alleviate the sparseness of a single knowledge graph by leveraging information from other knowledge graphs. We designed an intra-KG graph convolutional network encoder that regards the seed alignments between KGs as edges for intra-KG message propagation to model all KGs in a unified model while also adopting an iterative mechanism to progressively incorporate newly predicted alignments along with the newly inferred facts into the learning process. Additionally, we employed an active learning mechanism and a greedy approximation to a semi-constrained optimization problem to focus on learning the structural prior knowledge that is difficult to learn in semantic space, limiting the propagation of error in the iterative training process. Experimental results on multilingual KG datasets demonstrated that our method achieved state-of-the-art results. |
abstractGer |
Knowledge graph completion (KGC), a task that aims at predicting missing links with existing information inside a knowledge graph (KG), has emerged as a popular research area in recent years. While many existing works have demonstrated effectiveness on a single knowledge graph KGC, limited effort has been devoted to exploring the potentially complementary nature of multiple KGs. In this work, we proposed a novel method called CA-MKGC (Conflict-aware Multilingual Knowledge Graph Completion) for multiple knowledge graph completion (MKGC), aiming to alleviate the sparseness of a single knowledge graph by leveraging information from other knowledge graphs. We designed an intra-KG graph convolutional network encoder that regards the seed alignments between KGs as edges for intra-KG message propagation to model all KGs in a unified model while also adopting an iterative mechanism to progressively incorporate newly predicted alignments along with the newly inferred facts into the learning process. Additionally, we employed an active learning mechanism and a greedy approximation to a semi-constrained optimization problem to focus on learning the structural prior knowledge that is difficult to learn in semantic space, limiting the propagation of error in the iterative training process. Experimental results on multilingual KG datasets demonstrated that our method achieved state-of-the-art results. |
abstract_unstemmed |
Knowledge graph completion (KGC), a task that aims at predicting missing links with existing information inside a knowledge graph (KG), has emerged as a popular research area in recent years. While many existing works have demonstrated effectiveness on a single knowledge graph KGC, limited effort has been devoted to exploring the potentially complementary nature of multiple KGs. In this work, we proposed a novel method called CA-MKGC (Conflict-aware Multilingual Knowledge Graph Completion) for multiple knowledge graph completion (MKGC), aiming to alleviate the sparseness of a single knowledge graph by leveraging information from other knowledge graphs. We designed an intra-KG graph convolutional network encoder that regards the seed alignments between KGs as edges for intra-KG message propagation to model all KGs in a unified model while also adopting an iterative mechanism to progressively incorporate newly predicted alignments along with the newly inferred facts into the learning process. Additionally, we employed an active learning mechanism and a greedy approximation to a semi-constrained optimization problem to focus on learning the structural prior knowledge that is difficult to learn in semantic space, limiting the propagation of error in the iterative training process. Experimental results on multilingual KG datasets demonstrated that our method achieved state-of-the-art results. |
collection_details |
GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_105 GBV_ILN_110 GBV_ILN_150 GBV_ILN_151 GBV_ILN_187 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2088 GBV_ILN_2106 GBV_ILN_2110 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_2336 GBV_ILN_2470 GBV_ILN_2507 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4242 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4338 GBV_ILN_4393 GBV_ILN_4700 |
title_short |
Conflict-aware multilingual knowledge graph completion |
remote_bool |
true |
author2 |
Şerban, Ovidiu Sun, Jiahao Guo, Yike |
author2Str |
Şerban, Ovidiu Sun, Jiahao Guo, Yike |
ppnlink |
320580024 |
mediatype_str_mv |
c |
isOA_txt |
false |
hochschulschrift_bool |
false |
doi_str |
10.1016/j.knosys.2023.111070 |
up_date |
2024-07-06T22:56:30.285Z |
_version_ |
1803872203216781312 |
fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000naa a22002652 4500</leader><controlfield tag="001">ELV065411897</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20231103093252.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">231103s2023 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.knosys.2023.111070</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)ELV065411897</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ELSEVIER)S0950-7051(23)00820-1</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">54.72</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Zhang, Weihang</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(orcid)0000-0002-6244-5748</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Conflict-aware multilingual knowledge graph completion</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2023</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zzz</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Knowledge graph completion (KGC), a task that aims at predicting missing links with existing information inside a knowledge graph (KG), has emerged as a popular research area in recent years. While many existing works have demonstrated effectiveness on a single knowledge graph KGC, limited effort has been devoted to exploring the potentially complementary nature of multiple KGs. In this work, we proposed a novel method called CA-MKGC (Conflict-aware Multilingual Knowledge Graph Completion) for multiple knowledge graph completion (MKGC), aiming to alleviate the sparseness of a single knowledge graph by leveraging information from other knowledge graphs. We designed an intra-KG graph convolutional network encoder that regards the seed alignments between KGs as edges for intra-KG message propagation to model all KGs in a unified model while also adopting an iterative mechanism to progressively incorporate newly predicted alignments along with the newly inferred facts into the learning process. Additionally, we employed an active learning mechanism and a greedy approximation to a semi-constrained optimization problem to focus on learning the structural prior knowledge that is difficult to learn in semantic space, limiting the propagation of error in the iterative training process. Experimental results on multilingual KG datasets demonstrated that our method achieved state-of-the-art results.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Knowledge graph</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Knowledge graph completion</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Knowledge representation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Knowledge transfer</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Active learning</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Şerban, Ovidiu</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Sun, Jiahao</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Guo, Yike</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Knowledge-based systems</subfield><subfield code="d">Amsterdam [u.a.] : Elsevier Science, 1987</subfield><subfield code="g">281</subfield><subfield code="h">Online-Ressource</subfield><subfield code="w">(DE-627)320580024</subfield><subfield code="w">(DE-600)2017495-0</subfield><subfield code="w">(DE-576)253018722</subfield><subfield code="x">0950-7051</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:281</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ELV</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_32</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_74</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_90</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_100</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_101</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_150</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_187</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_224</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_702</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2001</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2003</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2004</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2007</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2008</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2009</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2010</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2011</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2015</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2020</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2025</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2026</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2027</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2034</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2044</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2048</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2049</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2050</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2055</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2056</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2059</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2061</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2064</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2088</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2106</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2111</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2122</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2129</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2143</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2152</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2153</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2190</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2232</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2336</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2470</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2507</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4035</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4242</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4251</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4326</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4333</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4334</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4393</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">54.72</subfield><subfield code="j">Künstliche Intelligenz</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">281</subfield></datafield></record></collection>
|
score |
7.4011545 |