File size: 80,120 Bytes
6fa4bc9 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589 1590 1591 1592 1593 1594 1595 1596 1597 1598 1599 1600 1601 1602 1603 1604 1605 1606 1607 1608 1609 1610 1611 1612 1613 1614 1615 1616 1617 1618 1619 1620 1621 1622 1623 1624 1625 1626 1627 1628 1629 1630 1631 1632 1633 1634 1635 1636 1637 1638 1639 1640 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650 1651 1652 1653 1654 1655 1656 1657 1658 1659 1660 1661 1662 1663 1664 1665 1666 1667 1668 1669 1670 1671 1672 1673 1674 1675 1676 1677 1678 1679 1680 1681 1682 1683 1684 1685 1686 1687 1688 1689 1690 1691 1692 1693 1694 1695 1696 1697 1698 1699 1700 1701 1702 1703 1704 1705 1706 1707 1708 1709 1710 1711 1712 1713 1714 1715 1716 1717 1718 1719 1720 1721 1722 1723 1724 1725 1726 1727 1728 1729 1730 1731 1732 1733 1734 1735 1736 1737 1738 1739 1740 1741 1742 1743 1744 1745 1746 1747 1748 1749 1750 1751 1752 1753 1754 1755 1756 1757 1758 1759 1760 1761 1762 1763 | {
"paper_id": "2020",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T07:58:02.078377Z"
},
"title": "Relation Specific Transformations for Open World Knowledge Graph Completion",
"authors": [
{
"first": "Haseeb",
"middle": [],
"last": "Shah",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "University of Alberta",
"location": {}
},
"email": "hshah1@ualberta.ca"
},
{
"first": "Johannes",
"middle": [],
"last": "Villmow",
"suffix": "",
"affiliation": {},
"email": "johannes.villmow@hs-rm.de"
},
{
"first": "Adrian",
"middle": [],
"last": "Ulges",
"suffix": "",
"affiliation": {},
"email": "adrian.ulges@hs-rm.de"
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "We propose an open-world knowledge graph completion model that can be combined with common closed-world approaches (such as ComplEx) and enhance them to exploit text-based representations for entities unseen in training. Our model learns relation-specific transformation functions from text-based embedding space to graph-based embedding space, where the closedworld link prediction model can be applied. We demonstrate state-of-the-art results on common open-world benchmarks and show that our approach benefits from relation-specific transformation functions (RST), giving substantial improvements over a relation-agnostic approach.",
"pdf_parse": {
"paper_id": "2020",
"_pdf_hash": "",
"abstract": [
{
"text": "We propose an open-world knowledge graph completion model that can be combined with common closed-world approaches (such as ComplEx) and enhance them to exploit text-based representations for entities unseen in training. Our model learns relation-specific transformation functions from text-based embedding space to graph-based embedding space, where the closedworld link prediction model can be applied. We demonstrate state-of-the-art results on common open-world benchmarks and show that our approach benefits from relation-specific transformation functions (RST), giving substantial improvements over a relation-agnostic approach.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "Knowledge graphs are an interesting source of information that can be exploited by retrieval (Dong et al., 2014) and question answering systems (Ferrucci et al., 2010) . They are, however, known to be inherently sparse (Paulheim, 2017) . To overcome this problem, knowledge graph completion (KGC) enriches graphs with new triples. While most existing approaches require all entities to be part of the training graph, for many applications it is of interest to infer knowledge about entities not present in the graph i.e. open-world entities. Here, approaches usually assume some text describing the target entity to be given, from which an entity representations can be inferred, for example via text embeddings (Mikolov et al., 2013; Devlin et al., 2018) . To the best of our knowledge, only a few such open-world KGC approaches have been proposed so far (Xie et al., 2016; Shi and Weninger, 2017a; Shah et al., 2019) .",
"cite_spans": [
{
"start": 93,
"end": 112,
"text": "(Dong et al., 2014)",
"ref_id": "BIBREF2"
},
{
"start": 144,
"end": 167,
"text": "(Ferrucci et al., 2010)",
"ref_id": "BIBREF3"
},
{
"start": 219,
"end": 235,
"text": "(Paulheim, 2017)",
"ref_id": "BIBREF11"
},
{
"start": 712,
"end": 734,
"text": "(Mikolov et al., 2013;",
"ref_id": "BIBREF9"
},
{
"start": 735,
"end": 755,
"text": "Devlin et al., 2018)",
"ref_id": "BIBREF1"
},
{
"start": 856,
"end": 874,
"text": "(Xie et al., 2016;",
"ref_id": "BIBREF20"
},
{
"start": 875,
"end": 899,
"text": "Shi and Weninger, 2017a;",
"ref_id": "BIBREF13"
},
{
"start": 900,
"end": 918,
"text": "Shah et al., 2019)",
"ref_id": "BIBREF12"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "We suggest a simple yet effective approach towards open-world KGC 1 : Similar to Shah et al. (2019) 's OWE model, our approach enables existing KGC models to perform open-world prediction: Given an open-world entity, its name and description are aggregated into a text-based entity representation, and a transformation from text-based embedding space to graph-based embedding space is learned, where the closed-world KGC model can be applied. However, while OWE's transformation only takes the open-world entity into account, our approach also utilizes the target triple's relation, such that specific mappings are learned for different relations such as birthplace, spouse, or located in (see Figure 1) . We demonstrate that this extension comes with strong improvements, yielding state-of-the-art results on common open-world datasets.",
"cite_spans": [
{
"start": 81,
"end": 99,
"text": "Shah et al. (2019)",
"ref_id": "BIBREF12"
}
],
"ref_spans": [
{
"start": 694,
"end": 703,
"text": "Figure 1)",
"ref_id": null
}
],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Interest in KGC has increased recently, with most of the work focusing on embedding-based approaches. Earlier approaches (Nickel et al., 2016) have recently been complemented by other models such as DistMult (Yang et al., 2014) , TransR (Lin et al., 2015) , ComplEx (Trouillon et al., 2016) , ProjE (Shi and Weninger, 2017b) and RotatE (Sun et al., 2019) . The above models estimate the probability of triples (head, rel, tail) using a scoring function \u03c6(u head , u rel , u tail ), where u x denotes the embedding of entity/relation x and is a real-valued or complex-valued vector. \u03c6 depends on the model and varies from simple translation (Bordes et al., 2013) over bilinear forms (Yang et al., 2014) Figure 1 : Our approach first trains a KGC model on the graph without using textual information (bottom left). For every annotated entity, we extract a text-based embedding v by aggregating the word embeddings for tokens in the entity's name and description (top left). A transformation \u03a8 is trained to map v to the space of graph-based embeddings (center). The learned mapping can then be applied to unknown entities, thus allowing the trained KGC model to be applied (right).",
"cite_spans": [
{
"start": 121,
"end": 142,
"text": "(Nickel et al., 2016)",
"ref_id": "BIBREF10"
},
{
"start": 208,
"end": 227,
"text": "(Yang et al., 2014)",
"ref_id": "BIBREF23"
},
{
"start": 237,
"end": 255,
"text": "(Lin et al., 2015)",
"ref_id": "BIBREF8"
},
{
"start": 266,
"end": 290,
"text": "(Trouillon et al., 2016)",
"ref_id": "BIBREF18"
},
{
"start": 299,
"end": 324,
"text": "(Shi and Weninger, 2017b)",
"ref_id": "BIBREF14"
},
{
"start": 336,
"end": 354,
"text": "(Sun et al., 2019)",
"ref_id": "BIBREF16"
},
{
"start": 640,
"end": 661,
"text": "(Bordes et al., 2013)",
"ref_id": "BIBREF0"
},
{
"start": 682,
"end": 701,
"text": "(Yang et al., 2014)",
"ref_id": "BIBREF23"
}
],
"ref_spans": [
{
"start": 702,
"end": 710,
"text": "Figure 1",
"ref_id": null
}
],
"eq_spans": [],
"section": "Related Work",
"sec_num": "2"
},
{
"text": "forms (Trouillon et al., 2016) . Training happens by learning to discriminate real triples from perturbed ones, typically by negative sampling (Nickel et al., 2016) .",
"cite_spans": [
{
"start": 6,
"end": 30,
"text": "(Trouillon et al., 2016)",
"ref_id": "BIBREF18"
},
{
"start": 143,
"end": 164,
"text": "(Nickel et al., 2016)",
"ref_id": "BIBREF10"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "2"
},
{
"text": "While the knowledge graph completion models described above leverage only the structure of the graph, some approaches combine text with graph information, typically using embeddings that represent terms, sentences or documents (Goldberg, 2016) . Embeddings are usually derived from language models, either in static form (Mikolov et al., 2013) or by contextualized models (Devlin et al., 2018) . KGC models can employ such textual information for entities scarcely linked in the graph (Gesese et al., 2019) . Most approaches combine a textual embedding with structural KGC approaches, either by initializing structural embeddings from text (Socher et al., 2013; Wang and Li, 2016) , interpolating between textual and structural embeddings (Xu et al., 2017) , sometimes with a joined loss (Toutanova and Chen, 2015) and gating mechanisms (Kristiadi et al., 2019) . Others perform a fine-tuning for KGC based on textual labels of the entities and relations (Yao et al., 2019) .",
"cite_spans": [
{
"start": 227,
"end": 243,
"text": "(Goldberg, 2016)",
"ref_id": "BIBREF5"
},
{
"start": 321,
"end": 343,
"text": "(Mikolov et al., 2013)",
"ref_id": "BIBREF9"
},
{
"start": 372,
"end": 393,
"text": "(Devlin et al., 2018)",
"ref_id": "BIBREF1"
},
{
"start": 485,
"end": 506,
"text": "(Gesese et al., 2019)",
"ref_id": null
},
{
"start": 640,
"end": 661,
"text": "(Socher et al., 2013;",
"ref_id": "BIBREF15"
},
{
"start": 662,
"end": 680,
"text": "Wang and Li, 2016)",
"ref_id": "BIBREF19"
},
{
"start": 739,
"end": 756,
"text": "(Xu et al., 2017)",
"ref_id": "BIBREF21"
},
{
"start": 788,
"end": 814,
"text": "(Toutanova and Chen, 2015)",
"ref_id": "BIBREF17"
},
{
"start": 837,
"end": 861,
"text": "(Kristiadi et al., 2019)",
"ref_id": "BIBREF7"
},
{
"start": 955,
"end": 973,
"text": "(Yao et al., 2019)",
"ref_id": "BIBREF24"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "2"
},
{
"text": "Only few other works have addressed open-world KGC so far. Xie et al. (2016) proposed DKRL with a joint training of graph-based embeddings (TransE) and text-based embeddings while regularizing both types of embeddings to be aligned using an additional loss. ConMask (Shi and Weninger, 2017a) is a text-centric approach where text-based embeddings for entities and relations are derived by an attention model over names and descriptions. Closest to our work is OWE (Shah et al., 2019) , which trains graph and text embeddings independently and then learns a mapping between the two embedding spaces (more details are provided in Section 3). While OWE's mapping only take entities into account, our extended model's mapping is learned given both the entity and relation when predicting a triple. Orthogonal to our work, WOWE (Zhou et al., 2020) extends the OWE approach by replacing the averaging aggregator with a weighted attention mechanism and can be combined with our approach.",
"cite_spans": [
{
"start": 59,
"end": 76,
"text": "Xie et al. (2016)",
"ref_id": "BIBREF20"
},
{
"start": 266,
"end": 291,
"text": "(Shi and Weninger, 2017a)",
"ref_id": "BIBREF13"
},
{
"start": 464,
"end": 483,
"text": "(Shah et al., 2019)",
"ref_id": "BIBREF12"
},
{
"start": 823,
"end": 842,
"text": "(Zhou et al., 2020)",
"ref_id": "BIBREF25"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "2"
},
{
"text": "Given a knowledge graph G \u2282 E\u00d7R\u00d7E containing triples (h, r, t) (E and R denote finite sets of entities and relations), KGC models can perform tail prediction as follows: Given a pair of head and relation (h, r), the tail is estimated as",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Approach",
"sec_num": "3"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "t * = arg max t\u2208E \u03c6(u h , u r , u t )",
"eq_num": "(1)"
}
],
"section": "Approach",
"sec_num": "3"
},
{
"text": "where u h , u r , u t are entity/relation embeddings and \u03c6 is a model-specific scoring function. Note that this approach -and our extension -can be applied for head prediction accordingly.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Approach",
"sec_num": "3"
},
{
"text": "We address an open-world setting, where the triple's head is not a part of the knowledge graph, i.e. h \u2208 E. However, h is assumed to come with a textual description. Our approach (Figure 1 ) transforms this text into a token sequence W h = (w 1 , w 2 , ..., w n ), from which a sequence of embeddings",
"cite_spans": [],
"ref_spans": [
{
"start": 179,
"end": 188,
"text": "(Figure 1",
"ref_id": null
}
],
"eq_spans": [],
"section": "Approach",
"sec_num": "3"
},
{
"text": "(v w 1 , v w 2 , ..., v wn )",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Approach",
"sec_num": "3"
},
{
"text": "is derived using a textual embedding model pre-trained on a large text corpus. We experimented with BERT (Devlin et al., 2018) but did not achieve major improvements over static embeddings, likely because descriptions on KGC datasets tend to be short. Instead we use Wikipedia2Vec (Yamada et al., 2016), which contains phrase embeddings for entity names like \"Sheila Walsh\". If no phrase embedding is available, we use token-wise embeddings instead. If no embedding is available for a token, we use a vector of zeros as an \"unknown\" token. The resulting sequence of embeddings is aggregated by average pooling to obtain a single text-based embedding vector of the head entity",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Approach",
"sec_num": "3"
},
{
"text": "v h \u2208 R d .",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Approach",
"sec_num": "3"
},
{
"text": "The key step of our approach is to learn transformation functions \u03a8 r that align the text-based and graph-based embedding spaces such that \u03a8 r (v h )\u2248u h . When applying this mapping, the open-world entity's text-based embedding v h is transformed into a graph-based proxy embedding \u03a8 r (v h ). Triples with h are scored by applying the KGC model from Equation 1 to \u03a8 r (v h ):",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Approach",
"sec_num": "3"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "t * = arg max t\u2208E \u03c6 \u03a8 r (v h ), u r , u t",
"eq_num": "(2)"
}
],
"section": "Approach",
"sec_num": "3"
},
{
"text": "Like OWE (Shah et al., 2019) , we use an affine transformation \u03a8 r (v) = A r \u2022v + b r . Our focus of this paper is to deal with relation specificity, for which we propose the following two strategies:",
"cite_spans": [
{
"start": 9,
"end": 28,
"text": "(Shah et al., 2019)",
"ref_id": "BIBREF12"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Approach",
"sec_num": "3"
},
{
"text": "Relation Specific Transformation (RST) While the OWE model consists of a global transformation function (\u03a8), our proposed RST approach trains a separate transformation function per relation (\u03a8 r ): Our hypothesis is that when predicting a tail (h, r, ?), including information on the relation r may be beneficial. Have a look at Table 1 , where the transformation \u03a8 birthP lace maps v Shiela W alsh to a completely different region in the graph embedding space than \u03a8 recordLabel . Therefore, we learn a separate transformation \u03a8 r for each relation r\u2208R, containing a separate learnable matrix A r and vector b r . For a fair comparison with OWE, we use the ComplEx KGC model (Trouillon et al., 2016) in our experiments and use separate parameters for the real and imaginary parts.",
"cite_spans": [
{
"start": 676,
"end": 700,
"text": "(Trouillon et al., 2016)",
"ref_id": "BIBREF18"
}
],
"ref_spans": [
{
"start": 329,
"end": 336,
"text": "Table 1",
"ref_id": "TABREF2"
}
],
"eq_spans": [],
"section": "Approach",
"sec_num": "3"
},
{
"text": "Relation Clustering Transformation (RCT) Our second approach -Relation Clustering Transformation (RCT) -aggregates relations to clusters and then learns a separate transformation \u03a8 C for each cluster C. We use an agglomerative clustering approach (pseudo-code in Figure 2 ), which first initializes each cluster with a single relation r\u2208R and conducts \u03b7 fusion steps, each joining \"similar\" clusters: Let t(C) denote the set of tails attached to any relation r in C. Clusters C, C are fused if the number of shared tails, divided by size of the smaller cluster, exceeds a threshold S: on the full graph G, obtaining graph-based entity embeddings u 1 , ..., u n . We then choose the subset E t of all entities in the graph with textual descriptions, and define G t := G \u2229 (E t \u00d7R\u00d7E) as all triplets containing heads with text. We then minimize the following loss:",
"cite_spans": [],
"ref_spans": [
{
"start": 263,
"end": 271,
"text": "Figure 2",
"ref_id": "FIGREF0"
}
],
"eq_spans": [],
"section": "Approach",
"sec_num": "3"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "|t(C) \u2229 t(C )| min(|t(C)|, |t(C )|) > S",
"eq_num": "(3)"
}
],
"section": "Approach",
"sec_num": "3"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "L(\u0398) = (h,r,t)\u2208G t dist \u03a8 r (v h ), u h",
"eq_num": "(4)"
}
],
"section": "Approach",
"sec_num": "3"
},
{
"text": "with dist() referring either to Euclidean or cosine distance between the graph-and text-based head embeddings. As we use ComplEx, where embeddings u h contain real and imaginary parts, the above loss is summed for both parts. Since the number of entities in the datasets used is limited and overfitting is expected to be an issue, we neither fine-tune into the graph nor the text-embeddings.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Approach",
"sec_num": "3"
},
{
"text": "We evaluate our model on FB20k (Xie et al., 2016) , DBPedia50k (Shi and Weninger, 2017a) and FB15k-237-OWE (Shah et al., 2019 ) and compare our model with the state of the art on the task in open-world tail prediction. Results are illustrated in Table 2 . Due to the lack of an open-world validation set on FB20k, we remove random 10% of the test triples and use them as a validation set. Hyperparameters were optimized using a grid search (details in the appendix). We use the same evaluation criteria as Shah et al. (2019) , and evaluate our results only on ComplEx to provide a fair comparison with the OWE models. For training the closed-world KGC models, we utilize OpenKE (Han et al., 2018) . Additionally, we use the target filtering approach (Shi and Weninger, 2017a) on any results reported. The Target Filtering Baseline is evaluated by assigning random scores to all targets that pass the target filtering criterion.",
"cite_spans": [
{
"start": 31,
"end": 49,
"text": "(Xie et al., 2016)",
"ref_id": "BIBREF20"
},
{
"start": 63,
"end": 88,
"text": "(Shi and Weninger, 2017a)",
"ref_id": "BIBREF13"
},
{
"start": 107,
"end": 125,
"text": "(Shah et al., 2019",
"ref_id": "BIBREF12"
},
{
"start": 506,
"end": 524,
"text": "Shah et al. (2019)",
"ref_id": "BIBREF12"
},
{
"start": 678,
"end": 696,
"text": "(Han et al., 2018)",
"ref_id": "BIBREF6"
},
{
"start": 750,
"end": 775,
"text": "(Shi and Weninger, 2017a)",
"ref_id": "BIBREF13"
}
],
"ref_spans": [
{
"start": 246,
"end": 253,
"text": "Table 2",
"ref_id": "TABREF4"
}
],
"eq_spans": [],
"section": "Evaluation",
"sec_num": "4"
},
{
"text": "Results We observe that the ComplEx-RST outperforms all other approaches -including OWE -by a margin on all metrics except Hits@10 on DBPedia50k. ComplEx-RCT (relation clusters) performs competitively with the ComplEx-RST (one mapping per relation), while the number of transformation functions is reduced from 351 to 279 in case of DBPedia50k, from 235 to 114 in case of FB15k-237-OWE and from 1341 to 522 in case of FB20k. The values of \u03b7 and S were optimized to achieve the greatest reduction in number of clusters at a negligible negative impact on accuracy. We also note that the improvement achieved by utilizing the relation information is higher in DBPedia50k and FB20k, both of which use very long descriptions compared to FB15k-237-OWE. We believe that this is because the longer descriptions often have more pieces of information relevant to the relation, which the relationspecific transformations are able to extract and utilize. Finally, in Figure 2 (right) we investigate which relations benefit strongest from relation-specific mappings: Each point represents a relation in FB15k-237-OWE. We observe that points to the left (rare relations) tend to benefit stronger from learning a transformation of their own (RST). Those scarce relations seem to be underrepresented in the training data and -accordingly -in the global mapping.",
"cite_spans": [],
"ref_spans": [
{
"start": 955,
"end": 963,
"text": "Figure 2",
"ref_id": "FIGREF0"
}
],
"eq_spans": [],
"section": "Evaluation",
"sec_num": "4"
},
{
"text": "Input: Training set G, similarity factor S \u2208 R, iterations \u03b7 \u2208 Z Output: We see that this improvement tends to be higher for scarce relations (left on the x-axis).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Evaluation",
"sec_num": "4"
},
{
"text": "Clusters C = {c1, c2, . . . , cm} for i \u2190 1 . . . |R| do ci \u2190 {ri} Procedure make clusters(C, \u03b7) if \u03b7 = 0 then return C for i \u2190 1 . . . |C| do t(ci) \u2190 get tails(ci, G) for j = i+1 . . . |C| do t(cj) \u2190 get tails(cj, G) if |t(c i )\u2229t(c j )| min(|t(c i )|,",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Evaluation",
"sec_num": "4"
},
{
"text": "We have proposed a simple approach to incorporate relation-specific information into open-world knowledge graph completion. Our approach achieves state-of-the-art results on common open-source benchmarks and offers strong improvements over relation-agnostic state-of-the-art methods. An interesting direction for future work will be to adapt our model to longer textual inputs, e.g. by using attention to enable the model to select relevant passages (similar to ConMask (Shi and Weninger, 2017a) ).",
"cite_spans": [
{
"start": 470,
"end": 495,
"text": "(Shi and Weninger, 2017a)",
"ref_id": "BIBREF13"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusion",
"sec_num": "5"
},
{
"text": "We make our code available under https://github.com/haseebs/RST-OWE This work is licensed under a Creative Commons Attribution 4.0 International License. License details: http:// creativecommons.org/licenses/by/4.0/.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
}
],
"back_matter": [
{
"text": "This work was funded by German Federal Ministry of Education and Research (Program FHprofUnt, Project DeepCA (13FH011PX6)).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Acknowledgements",
"sec_num": null
}
],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "Translating Embeddings for Modeling Multi-relational Data",
"authors": [
{
"first": "Antoine",
"middle": [],
"last": "Bordes",
"suffix": ""
},
{
"first": "Nicolas",
"middle": [],
"last": "Usunier",
"suffix": ""
},
{
"first": "Alberto",
"middle": [],
"last": "Garcia-Duran",
"suffix": ""
},
{
"first": "Jason",
"middle": [],
"last": "Weston",
"suffix": ""
},
{
"first": "Oksana",
"middle": [],
"last": "Yakhnenko",
"suffix": ""
}
],
"year": 2013,
"venue": "Adv. in Neural Information Processing Systems",
"volume": "",
"issue": "",
"pages": "2787--2795",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Antoine Bordes, Nicolas Usunier, Alberto Garcia-Duran, Jason Weston, and Oksana Yakhnenko. 2013. Translat- ing Embeddings for Modeling Multi-relational Data. In Adv. in Neural Information Processing Systems, pages 2787-2795.",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "Bert: Pre-training of deep bidirectional transformers for language understanding",
"authors": [
{
"first": "Jacob",
"middle": [],
"last": "Devlin",
"suffix": ""
},
{
"first": "Ming-Wei",
"middle": [],
"last": "Chang",
"suffix": ""
},
{
"first": "Kenton",
"middle": [],
"last": "Lee",
"suffix": ""
},
{
"first": "Kristina",
"middle": [],
"last": "Toutanova",
"suffix": ""
}
],
"year": 2018,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"arXiv": [
"arXiv:1810.04805"
]
},
"num": null,
"urls": [],
"raw_text": "Jacob Devlin, Ming-Wei Chang, Kenton Lee, and Kristina Toutanova. 2018. Bert: Pre-training of deep bidirec- tional transformers for language understanding. arXiv preprint arXiv:1810.04805.",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "Knowledge vault: A web-scale approach to probabilistic knowledge fusion",
"authors": [
{
"first": "Xin",
"middle": [],
"last": "Dong",
"suffix": ""
},
{
"first": "Evgeniy",
"middle": [],
"last": "Gabrilovich",
"suffix": ""
},
{
"first": "Geremy",
"middle": [],
"last": "Heitz",
"suffix": ""
},
{
"first": "Wilko",
"middle": [],
"last": "Horn",
"suffix": ""
},
{
"first": "Ni",
"middle": [],
"last": "Lao",
"suffix": ""
},
{
"first": "Kevin",
"middle": [],
"last": "Murphy",
"suffix": ""
},
{
"first": "Thomas",
"middle": [],
"last": "Strohmann",
"suffix": ""
},
{
"first": "Shaohua",
"middle": [],
"last": "Sun",
"suffix": ""
},
{
"first": "Wei",
"middle": [],
"last": "Zhang",
"suffix": ""
}
],
"year": 2014,
"venue": "Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '14",
"volume": "",
"issue": "",
"pages": "601--610",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Xin Dong, Evgeniy Gabrilovich, Geremy Heitz, Wilko Horn, Ni Lao, Kevin Murphy, Thomas Strohmann, Shaohua Sun, and Wei Zhang. 2014. Knowledge vault: A web-scale approach to probabilistic knowledge fusion. In Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '14, page 601-610, New York, NY, USA. Association for Computing Machinery.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "Building Watson: An Overview of the DeepQA Project",
"authors": [
{
"first": "David",
"middle": [],
"last": "Ferrucci",
"suffix": ""
},
{
"first": "Eric",
"middle": [],
"last": "Brown",
"suffix": ""
},
{
"first": "Jennifer",
"middle": [],
"last": "Chu-Carroll",
"suffix": ""
},
{
"first": "James",
"middle": [],
"last": "Fan",
"suffix": ""
},
{
"first": "David",
"middle": [],
"last": "Gondek",
"suffix": ""
},
{
"first": "Aditya",
"middle": [
"A"
],
"last": "Kalyanpur",
"suffix": ""
},
{
"first": "Adam",
"middle": [],
"last": "Lally",
"suffix": ""
},
{
"first": "J",
"middle": [
"William"
],
"last": "Murdock",
"suffix": ""
},
{
"first": "Eric",
"middle": [],
"last": "Nyberg",
"suffix": ""
},
{
"first": "John",
"middle": [],
"last": "Prager",
"suffix": ""
},
{
"first": "Nico",
"middle": [],
"last": "Schlaefer",
"suffix": ""
},
{
"first": "Chris",
"middle": [],
"last": "Welty",
"suffix": ""
}
],
"year": 2010,
"venue": "AI Magazine",
"volume": "31",
"issue": "3",
"pages": "59--79",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "David Ferrucci, Eric Brown, Jennifer Chu-Carroll, James Fan, David Gondek, Aditya A. Kalyanpur, Adam Lally, J. William Murdock, Eric Nyberg, John Prager, Nico Schlaefer, and Chris Welty. 2010. Building Watson: An Overview of the DeepQA Project. AI Magazine, 31(3):59-79.",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "Mehwish Alam, and Harald Sack. 2019. A survey on knowledge graph embeddings with literals: Which model links better literal-ly",
"authors": [
{
"first": "Russa",
"middle": [],
"last": "Genet Asefa Gesese",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Biswas",
"suffix": ""
}
],
"year": null,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Genet Asefa Gesese, Russa Biswas, Mehwish Alam, and Harald Sack. 2019. A survey on knowledge graph embeddings with literals: Which model links better literal-ly?",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "A Primer on Neural Network Models for Natural Language Processing",
"authors": [
{
"first": "Yoav",
"middle": [],
"last": "Goldberg",
"suffix": ""
}
],
"year": 2016,
"venue": "J. Artif. Int. Res",
"volume": "57",
"issue": "1",
"pages": "345--420",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Yoav Goldberg. 2016. A Primer on Neural Network Models for Natural Language Processing. J. Artif. Int. Res., 57(1):345-420, September.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "Openke: An open toolkit for knowledge embedding",
"authors": [
{
"first": "Xu",
"middle": [],
"last": "Han",
"suffix": ""
},
{
"first": "Shulin",
"middle": [],
"last": "Cao",
"suffix": ""
},
{
"first": "Lv",
"middle": [],
"last": "Xin",
"suffix": ""
},
{
"first": "Yankai",
"middle": [],
"last": "Lin",
"suffix": ""
},
{
"first": "Zhiyuan",
"middle": [],
"last": "Liu",
"suffix": ""
},
{
"first": "Maosong",
"middle": [],
"last": "Sun",
"suffix": ""
},
{
"first": "Juanzi",
"middle": [],
"last": "Li",
"suffix": ""
}
],
"year": 2018,
"venue": "Proceedings of EMNLP",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Xu Han, Shulin Cao, Lv Xin, Yankai Lin, Zhiyuan Liu, Maosong Sun, and Juanzi Li. 2018. Openke: An open toolkit for knowledge embedding. In Proceedings of EMNLP.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "Incorporating literals into knowledge graph embeddings",
"authors": [
{
"first": "Agustinus",
"middle": [],
"last": "Kristiadi",
"suffix": ""
},
{
"first": "Mohammad",
"middle": [
"Asif"
],
"last": "Khan",
"suffix": ""
},
{
"first": "Denis",
"middle": [],
"last": "Lukovnikov",
"suffix": ""
},
{
"first": "Jens",
"middle": [],
"last": "Lehmann",
"suffix": ""
},
{
"first": "Asja",
"middle": [],
"last": "Fischer",
"suffix": ""
}
],
"year": 2019,
"venue": "The Semantic Web -ISWC 2019 -18th International Semantic Web Conference",
"volume": "",
"issue": "",
"pages": "347--363",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Agustinus Kristiadi, Mohammad Asif Khan, Denis Lukovnikov, Jens Lehmann, and Asja Fischer. 2019. Incor- porating literals into knowledge graph embeddings. In The Semantic Web -ISWC 2019 -18th International Semantic Web Conference, Auckland, New Zealand, October 26-30, 2019, Proceedings, Part I, pages 347-363.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "Learning entity and relation embeddings for knowledge graph completion",
"authors": [
{
"first": "Yankai",
"middle": [],
"last": "Lin",
"suffix": ""
},
{
"first": "Zhiyuan",
"middle": [],
"last": "Liu",
"suffix": ""
},
{
"first": "Maosong",
"middle": [],
"last": "Sun",
"suffix": ""
},
{
"first": "Yang",
"middle": [],
"last": "Liu",
"suffix": ""
},
{
"first": "Xuan",
"middle": [],
"last": "Zhu",
"suffix": ""
}
],
"year": 2015,
"venue": "Twenty-ninth AAAI conference on artificial intelligence",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Yankai Lin, Zhiyuan Liu, Maosong Sun, Yang Liu, and Xuan Zhu. 2015. Learning entity and relation embeddings for knowledge graph completion. In Twenty-ninth AAAI conference on artificial intelligence.",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "Distributed representations of words and phrases and their compositionality. CoRR",
"authors": [
{
"first": "Tomas",
"middle": [],
"last": "Mikolov",
"suffix": ""
},
{
"first": "Ilya",
"middle": [],
"last": "Sutskever",
"suffix": ""
},
{
"first": "Kai",
"middle": [],
"last": "Chen",
"suffix": ""
},
{
"first": "Greg",
"middle": [],
"last": "Corrado",
"suffix": ""
},
{
"first": "Jeffrey",
"middle": [],
"last": "Dean",
"suffix": ""
}
],
"year": 2013,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Tomas Mikolov, Ilya Sutskever, Kai Chen, Greg Corrado, and Jeffrey Dean. 2013. Distributed representations of words and phrases and their compositionality. CoRR, abs/1310.4546.",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "A Review of Relational Machine Learning for Knowledge Graphs",
"authors": [
{
"first": "Maximilian",
"middle": [],
"last": "Nickel",
"suffix": ""
},
{
"first": "Kevin",
"middle": [],
"last": "Murphy",
"suffix": ""
},
{
"first": "Volker",
"middle": [],
"last": "Tresp",
"suffix": ""
},
{
"first": "Evgeniy",
"middle": [],
"last": "Gabrilovich",
"suffix": ""
}
],
"year": 2016,
"venue": "Proceedings of the IEEE",
"volume": "104",
"issue": "1",
"pages": "11--33",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Maximilian Nickel, Kevin Murphy, Volker Tresp, and Evgeniy Gabrilovich. 2016. A Review of Relational Ma- chine Learning for Knowledge Graphs. Proceedings of the IEEE, 104(1):11-33.",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"title": "Knowledge Graph Refinement: A Survey of Approaches and Evaluation Methods. Semantic Web",
"authors": [
{
"first": "Heiko",
"middle": [],
"last": "Paulheim",
"suffix": ""
}
],
"year": 2017,
"venue": "",
"volume": "8",
"issue": "",
"pages": "489--508",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Heiko Paulheim. 2017. Knowledge Graph Refinement: A Survey of Approaches and Evaluation Methods. Se- mantic Web, 8(3):489-508.",
"links": null
},
"BIBREF12": {
"ref_id": "b12",
"title": "An open-world extension to knowledge graph completion models",
"authors": [
{
"first": "Haseeb",
"middle": [],
"last": "Shah",
"suffix": ""
},
{
"first": "Johannes",
"middle": [],
"last": "Villmow",
"suffix": ""
},
{
"first": "Adrian",
"middle": [],
"last": "Ulges",
"suffix": ""
},
{
"first": "Ulrich",
"middle": [],
"last": "Schwanecke",
"suffix": ""
},
{
"first": "Faisal",
"middle": [],
"last": "Shafait",
"suffix": ""
}
],
"year": 2019,
"venue": "The Thirty-Third AAAI Conference on Artificial Intelligence",
"volume": "",
"issue": "",
"pages": "3044--3051",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Haseeb Shah, Johannes Villmow, Adrian Ulges, Ulrich Schwanecke, and Faisal Shafait. 2019. An open-world ex- tension to knowledge graph completion models. In The Thirty-Third AAAI Conference on Artificial Intelligence, pages 3044-3051.",
"links": null
},
"BIBREF13": {
"ref_id": "b13",
"title": "Open-World Knowledge Graph Completion. CoRR",
"authors": [
{
"first": "Baoxu",
"middle": [],
"last": "Shi",
"suffix": ""
},
{
"first": "Tim",
"middle": [],
"last": "Weninger",
"suffix": ""
}
],
"year": 2017,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Baoxu Shi and Tim Weninger. 2017a. Open-World Knowledge Graph Completion. CoRR, abs/1711.03438.",
"links": null
},
"BIBREF14": {
"ref_id": "b14",
"title": "ProjE: Embedding Projection for Knowledge Graph Completion",
"authors": [
{
"first": "Baoxu",
"middle": [],
"last": "Shi",
"suffix": ""
},
{
"first": "Tim",
"middle": [],
"last": "Weninger",
"suffix": ""
}
],
"year": 2017,
"venue": "Proc. AAAI",
"volume": "",
"issue": "",
"pages": "1236--1242",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Baoxu Shi and Tim Weninger. 2017b. ProjE: Embedding Projection for Knowledge Graph Completion. In Proc. AAAI, pages 1236-1242.",
"links": null
},
"BIBREF15": {
"ref_id": "b15",
"title": "Reasoning with neural tensor networks for knowledge base completion",
"authors": [
{
"first": "Richard",
"middle": [],
"last": "Socher",
"suffix": ""
},
{
"first": "Danqi",
"middle": [],
"last": "Chen",
"suffix": ""
},
{
"first": "Christopher",
"middle": [
"D"
],
"last": "Manning",
"suffix": ""
},
{
"first": "Andrew",
"middle": [
"Y"
],
"last": "Ng",
"suffix": ""
}
],
"year": 2013,
"venue": "Proceedings of the 26th International Conference on Neural Information Processing Systems",
"volume": "1",
"issue": "",
"pages": "926--934",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Richard Socher, Danqi Chen, Christopher D. Manning, and Andrew Y. Ng. 2013. Reasoning with neural tensor networks for knowledge base completion. In Proceedings of the 26th International Conference on Neural Information Processing Systems -Volume 1, NIPS'13, pages 926-934, USA. Curran Associates Inc.",
"links": null
},
"BIBREF16": {
"ref_id": "b16",
"title": "Rotate: Knowledge graph embedding by relational rotation in complex space",
"authors": [
{
"first": "Zhiqing",
"middle": [],
"last": "Sun",
"suffix": ""
},
{
"first": "Zhi-Hong",
"middle": [],
"last": "Deng",
"suffix": ""
},
{
"first": "Jian-Yun",
"middle": [],
"last": "Nie",
"suffix": ""
},
{
"first": "Jian",
"middle": [],
"last": "Tang",
"suffix": ""
}
],
"year": 2019,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"arXiv": [
"arXiv:1902.10197"
]
},
"num": null,
"urls": [],
"raw_text": "Zhiqing Sun, Zhi-Hong Deng, Jian-Yun Nie, and Jian Tang. 2019. Rotate: Knowledge graph embedding by relational rotation in complex space. arXiv preprint arXiv:1902.10197.",
"links": null
},
"BIBREF17": {
"ref_id": "b17",
"title": "Observed Versus Latent Features for Knowledge Base and Text Inference",
"authors": [
{
"first": "Kristina",
"middle": [],
"last": "Toutanova",
"suffix": ""
},
{
"first": "Danqi",
"middle": [],
"last": "Chen",
"suffix": ""
}
],
"year": 2015,
"venue": "3rd Workshop on Continuous Vector Space Models and Their Compositionality",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Kristina Toutanova and Danqi Chen. 2015. Observed Versus Latent Features for Knowledge Base and Text Inference. In 3rd Workshop on Continuous Vector Space Models and Their Compositionality, July.",
"links": null
},
"BIBREF18": {
"ref_id": "b18",
"title": "Complex Embeddings for Simple Link Prediction",
"authors": [
{
"first": "Th\u00e9o",
"middle": [],
"last": "Trouillon",
"suffix": ""
},
{
"first": "Johannes",
"middle": [],
"last": "Welbl",
"suffix": ""
},
{
"first": "Sebastian",
"middle": [],
"last": "Riedel",
"suffix": ""
},
{
"first": "\u00c9ric",
"middle": [],
"last": "Gaussier",
"suffix": ""
},
{
"first": "Guillaume",
"middle": [],
"last": "Bouchard",
"suffix": ""
}
],
"year": 2016,
"venue": "Int. Conference on Machine Learning",
"volume": "",
"issue": "",
"pages": "2071--2080",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Th\u00e9o Trouillon, Johannes Welbl, Sebastian Riedel,\u00c9ric Gaussier, and Guillaume Bouchard. 2016. Complex Embeddings for Simple Link Prediction. In Int. Conference on Machine Learning, pages 2071-2080.",
"links": null
},
"BIBREF19": {
"ref_id": "b19",
"title": "Text-enhanced Representation Learning for Knowledge Graph",
"authors": [
{
"first": "Zhigang",
"middle": [],
"last": "Wang",
"suffix": ""
},
{
"first": "Juanzi",
"middle": [],
"last": "Li",
"suffix": ""
}
],
"year": 2016,
"venue": "Proc. International Joint Conference on Artificial Intelligence",
"volume": "",
"issue": "",
"pages": "1293--1299",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Zhigang Wang and Juanzi Li. 2016. Text-enhanced Representation Learning for Knowledge Graph. In Proc. International Joint Conference on Artificial Intelligence, pages 1293-1299.",
"links": null
},
"BIBREF20": {
"ref_id": "b20",
"title": "Representation Learning of Knowledge Graphs with Entity Descriptions",
"authors": [
{
"first": "Ruobing",
"middle": [],
"last": "Xie",
"suffix": ""
},
{
"first": "Zhiyuan",
"middle": [],
"last": "Liu",
"suffix": ""
},
{
"first": "Jia",
"middle": [],
"last": "Jia",
"suffix": ""
},
{
"first": "Huanbo",
"middle": [],
"last": "Luan",
"suffix": ""
},
{
"first": "Maosong",
"middle": [],
"last": "Sun",
"suffix": ""
}
],
"year": 2016,
"venue": "Proc. AAAI",
"volume": "",
"issue": "",
"pages": "2659--2665",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ruobing Xie, Zhiyuan Liu, Jia Jia, Huanbo Luan, and Maosong Sun. 2016. Representation Learning of Knowl- edge Graphs with Entity Descriptions. In Proc. AAAI, pages 2659-2665.",
"links": null
},
"BIBREF21": {
"ref_id": "b21",
"title": "Knowledge Graph Representation with Jointly Structural and Textual Encoding",
"authors": [
{
"first": "Jiacheng",
"middle": [],
"last": "Xu",
"suffix": ""
},
{
"first": "Xipeng",
"middle": [],
"last": "Qiu",
"suffix": ""
},
{
"first": "Kan",
"middle": [],
"last": "Chen",
"suffix": ""
},
{
"first": "Xuanjing",
"middle": [],
"last": "Huang",
"suffix": ""
}
],
"year": 2017,
"venue": "Proc. Int. Joint Conference on Artificial Intelligence",
"volume": "",
"issue": "",
"pages": "1318--1324",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Jiacheng Xu, Xipeng Qiu, Kan Chen, and Xuanjing Huang. 2017. Knowledge Graph Representation with Jointly Structural and Textual Encoding. In Proc. Int. Joint Conference on Artificial Intelligence, pages 1318-1324.",
"links": null
},
"BIBREF22": {
"ref_id": "b22",
"title": "Joint Learning of the Embedding of Words and Entities for Named Entity Disambiguation",
"authors": [
{
"first": "Ikuya",
"middle": [],
"last": "Yamada",
"suffix": ""
},
{
"first": "Hiroyuki",
"middle": [],
"last": "Shindo",
"suffix": ""
},
{
"first": "Hideaki",
"middle": [],
"last": "Takeda",
"suffix": ""
},
{
"first": "Yoshiyasu",
"middle": [],
"last": "Takefuji",
"suffix": ""
}
],
"year": 2016,
"venue": "Proc. SIGNLL Conference on Computational Natural Language Learning",
"volume": "",
"issue": "",
"pages": "250--259",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ikuya Yamada, Hiroyuki Shindo, Hideaki Takeda, and Yoshiyasu Takefuji. 2016. Joint Learning of the Embedding of Words and Entities for Named Entity Disambiguation. In Proc. SIGNLL Conference on Computational Natural Language Learning, pages 250-259, Berlin, Germany, August.",
"links": null
},
"BIBREF23": {
"ref_id": "b23",
"title": "Embedding Entities and Relations for Learning and Inference in Knowledge Bases",
"authors": [
{
"first": "Bishan",
"middle": [],
"last": "Yang",
"suffix": ""
},
{
"first": "Wen-Tau",
"middle": [],
"last": "Yih",
"suffix": ""
},
{
"first": "Xiaodong",
"middle": [],
"last": "He",
"suffix": ""
},
{
"first": "Jianfeng",
"middle": [],
"last": "Gao",
"suffix": ""
},
{
"first": "Li",
"middle": [],
"last": "Deng",
"suffix": ""
}
],
"year": 2014,
"venue": "CoRR",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Bishan Yang, Wen-tau Yih, Xiaodong He, Jianfeng Gao, and Li Deng. 2014. Embedding Entities and Relations for Learning and Inference in Knowledge Bases. CoRR, abs/1412.6575.",
"links": null
},
"BIBREF24": {
"ref_id": "b24",
"title": "Kg-bert: Bert for knowledge graph completion",
"authors": [
{
"first": "Liang",
"middle": [],
"last": "Yao",
"suffix": ""
},
{
"first": "Chengsheng",
"middle": [],
"last": "Mao",
"suffix": ""
},
{
"first": "Yuan",
"middle": [],
"last": "Luo",
"suffix": ""
}
],
"year": 2019,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Liang Yao, Chengsheng Mao, and Yuan Luo. 2019. Kg-bert: Bert for knowledge graph completion.",
"links": null
},
"BIBREF25": {
"ref_id": "b25",
"title": "Weighted aggregator for the open-world knowledge graph completion",
"authors": [
{
"first": "Yueyang",
"middle": [],
"last": "Zhou",
"suffix": ""
},
{
"first": "Shumin",
"middle": [],
"last": "Shi",
"suffix": ""
},
{
"first": "Heyan",
"middle": [],
"last": "Huang",
"suffix": ""
}
],
"year": 2020,
"venue": "Data Science",
"volume": "",
"issue": "",
"pages": "283--291",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Yueyang Zhou, Shumin Shi, and Heyan Huang. 2020. Weighted aggregator for the open-world knowledge graph completion. In Data Science, pages 283-291, Singapore. Springer Singapore.",
"links": null
}
},
"ref_entries": {
"FIGREF0": {
"uris": null,
"num": null,
"type_str": "figure",
"text": "|t(c j )|) > S then ci \u2190 ci \u222a cj delete cj from C break make clusters(C, \u03b7 \u2212 1) end make clusters({c1 . . . c |R| }, \u03b7) The algorithm (left) outlines our implementation of the RCT approach in pseudo code. The plot (right) visualizes the improvement in MRR of ComplEx-RST compared to ComplEx-OWE on the y-axis. Each point is a relation in FB15k-237-OWE. The size of the point represents the number of test triples containing the relation. The x-axis shows the number of training triples containing the relation."
},
"TABREF0": {
"num": null,
"content": "<table><tr><td/><td>Sheila Walsh</td><td/></tr><tr><td>word embeddings</td><td>Scottish contemporary Vocalist and songwriter.</td><td>text-based</td></tr><tr><td/><td>average pooling</td><td/></tr><tr><td>knowledge graph</td><td/><td>graph-based</td></tr><tr><td/><td>train KGC model</td><td/></tr><tr><td/><td/><td>to complex-valued</td></tr></table>",
"html": null,
"type_str": "table",
"text": ""
},
"TABREF1": {
"num": null,
"content": "<table><tr><td>Test Entity v h</td><td>Relation r</td><td>Nearest Neighbors to \u03a8 r (v h )</td><td>Test Entity v h</td><td/><td/></tr><tr><td/><td/><td>1. Nigel McGuiness (British)</td><td/><td/><td>1. Park Ji-yeon (singer)</td></tr><tr><td>Sheila Walsh</td><td>birthPlace</td><td>2. Darren Burridge (British)</td><td>Ferlyn Wong</td><td>occupation</td><td>2. Kim Sae-ron (actress)</td></tr><tr><td>(Scottish contemporary</td><td/><td>3. Kim Newman (British)</td><td>(Singaporean singer,</td><td/><td>3. Park Shin-hye (actress)</td></tr><tr><td>vocalist and songwriter)</td><td/><td>1. Picture this live (album)</td><td>dancer and actress)</td><td/><td>1. Tony An (singer)</td></tr><tr><td/><td>recordLabel</td><td>2. Thick as a Brick (album)</td><td/><td>genre</td><td>2. Exodus (album)</td></tr><tr><td/><td/><td>3. Whiplash Smile (album)</td><td/><td/><td>3. S.E.S. (band)</td></tr></table>",
"html": null,
"type_str": "table",
"text": "Relation r Nearest Neighbors to \u03a8 r (v h )"
},
"TABREF2": {
"num": null,
"content": "<table/>",
"html": null,
"type_str": "table",
"text": "Relation-specific transformations map entities to corresponding regions in embedding space: When mapping Sheila Walsh with the birthplace relation, the resulting embedding lies in a cluster of British people. When mapping with the recordLabel relation, the resulting embedding lies close to pop albums (which also have a recordLabel relation)."
},
"TABREF4": {
"num": null,
"content": "<table><tr><td>The Relation Specific</td></tr></table>",
"html": null,
"type_str": "table",
"text": "Comparison with other open-world KGC models on tail prediction."
}
}
}
} |