File size: 150,258 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 1764 1765 1766 1767 1768 1769 1770 1771 1772 1773 1774 1775 1776 1777 1778 1779 1780 1781 1782 1783 1784 1785 1786 1787 1788 1789 1790 1791 1792 1793 1794 1795 1796 1797 1798 1799 1800 1801 1802 1803 1804 1805 1806 1807 1808 1809 1810 1811 1812 1813 1814 1815 1816 1817 1818 1819 1820 1821 1822 1823 1824 1825 1826 1827 1828 1829 1830 1831 1832 1833 1834 1835 1836 1837 1838 1839 1840 1841 1842 1843 1844 1845 1846 1847 1848 1849 1850 1851 1852 1853 1854 1855 1856 1857 1858 1859 1860 1861 1862 1863 1864 1865 1866 1867 1868 1869 1870 1871 1872 1873 1874 1875 1876 1877 1878 1879 1880 1881 1882 1883 1884 1885 1886 1887 1888 1889 1890 1891 1892 1893 1894 1895 1896 1897 1898 1899 1900 1901 1902 1903 1904 1905 1906 1907 1908 1909 1910 1911 1912 1913 1914 1915 1916 1917 1918 1919 1920 1921 1922 1923 1924 1925 1926 1927 1928 1929 1930 1931 1932 1933 1934 1935 1936 1937 1938 1939 1940 1941 1942 1943 1944 1945 1946 1947 1948 1949 1950 1951 1952 1953 1954 1955 1956 1957 1958 1959 1960 1961 1962 1963 1964 1965 1966 1967 1968 1969 1970 1971 1972 1973 1974 1975 1976 1977 1978 1979 1980 1981 1982 1983 1984 1985 1986 1987 1988 1989 1990 1991 1992 1993 1994 1995 1996 1997 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009 2010 2011 2012 2013 2014 2015 2016 2017 2018 2019 2020 2021 2022 2023 2024 2025 2026 2027 2028 2029 2030 2031 2032 2033 2034 2035 2036 2037 2038 2039 2040 2041 2042 2043 2044 2045 2046 2047 2048 2049 2050 2051 2052 2053 2054 2055 2056 2057 2058 2059 2060 2061 2062 2063 2064 2065 2066 2067 2068 2069 2070 2071 2072 2073 2074 2075 2076 2077 2078 2079 2080 2081 2082 2083 2084 2085 2086 2087 2088 2089 2090 2091 2092 2093 2094 2095 2096 2097 2098 2099 2100 2101 2102 2103 2104 2105 2106 2107 2108 2109 2110 2111 2112 2113 2114 2115 2116 2117 2118 2119 2120 2121 2122 2123 2124 2125 2126 2127 2128 2129 2130 2131 2132 2133 2134 2135 2136 2137 2138 2139 2140 2141 2142 2143 2144 2145 2146 2147 2148 2149 2150 2151 2152 2153 2154 2155 2156 2157 2158 2159 2160 2161 2162 2163 2164 2165 2166 2167 2168 2169 2170 2171 2172 2173 2174 2175 2176 2177 2178 2179 2180 2181 2182 2183 2184 2185 2186 2187 2188 2189 2190 2191 2192 2193 2194 2195 2196 2197 2198 2199 2200 2201 2202 2203 2204 2205 2206 2207 2208 2209 2210 2211 2212 2213 2214 2215 2216 2217 2218 2219 2220 2221 2222 2223 2224 2225 2226 2227 2228 2229 2230 2231 2232 2233 2234 2235 2236 2237 2238 2239 2240 2241 2242 2243 2244 2245 2246 2247 2248 2249 2250 2251 2252 2253 2254 2255 2256 2257 2258 2259 2260 2261 2262 2263 2264 2265 2266 2267 2268 2269 2270 2271 2272 2273 2274 2275 2276 2277 2278 2279 2280 2281 2282 2283 2284 2285 2286 2287 2288 2289 2290 2291 2292 2293 2294 2295 2296 2297 2298 2299 2300 2301 2302 2303 2304 2305 2306 2307 2308 2309 2310 2311 2312 2313 2314 2315 2316 2317 2318 2319 2320 2321 2322 2323 2324 2325 2326 2327 2328 2329 2330 2331 2332 2333 2334 2335 2336 2337 2338 2339 2340 2341 2342 2343 2344 2345 2346 2347 2348 2349 2350 2351 2352 2353 2354 2355 2356 2357 2358 2359 2360 2361 2362 2363 2364 2365 2366 2367 2368 2369 2370 2371 2372 2373 2374 2375 2376 2377 2378 2379 2380 2381 2382 2383 2384 2385 2386 2387 2388 2389 2390 2391 2392 2393 2394 2395 2396 2397 2398 2399 2400 2401 2402 2403 2404 2405 2406 2407 2408 2409 2410 2411 2412 2413 2414 2415 2416 2417 2418 2419 2420 2421 2422 2423 2424 2425 2426 2427 2428 2429 2430 2431 2432 2433 2434 2435 2436 2437 2438 2439 2440 2441 2442 2443 2444 2445 2446 2447 2448 2449 2450 2451 2452 2453 2454 2455 2456 2457 2458 2459 2460 2461 2462 2463 2464 2465 2466 2467 2468 2469 2470 2471 2472 2473 2474 2475 2476 2477 2478 2479 2480 2481 2482 2483 2484 2485 2486 2487 2488 2489 2490 2491 2492 2493 2494 2495 2496 2497 2498 2499 2500 2501 2502 2503 2504 2505 2506 2507 2508 2509 2510 2511 2512 2513 2514 2515 2516 2517 2518 2519 2520 2521 2522 2523 2524 2525 2526 2527 2528 2529 2530 2531 2532 2533 2534 2535 2536 2537 2538 2539 2540 2541 2542 2543 2544 2545 2546 2547 2548 2549 2550 2551 2552 2553 2554 2555 2556 2557 2558 2559 2560 2561 2562 2563 2564 2565 2566 2567 2568 2569 2570 2571 2572 2573 2574 2575 2576 2577 2578 2579 2580 2581 2582 2583 2584 2585 2586 2587 2588 2589 2590 2591 2592 2593 2594 2595 2596 2597 2598 2599 2600 2601 2602 2603 2604 2605 2606 2607 2608 2609 2610 2611 2612 2613 2614 2615 2616 2617 2618 2619 2620 2621 2622 2623 2624 2625 2626 2627 2628 2629 2630 2631 2632 2633 2634 2635 2636 2637 2638 2639 2640 2641 2642 2643 2644 2645 2646 2647 2648 2649 2650 2651 2652 2653 2654 2655 2656 2657 2658 2659 2660 2661 2662 2663 2664 2665 2666 2667 2668 2669 2670 2671 2672 2673 2674 2675 2676 2677 2678 2679 2680 2681 2682 2683 2684 2685 2686 2687 2688 2689 2690 2691 2692 2693 2694 2695 2696 2697 2698 2699 2700 2701 2702 2703 2704 2705 2706 2707 2708 2709 2710 2711 2712 2713 2714 2715 2716 2717 2718 2719 2720 2721 2722 2723 2724 2725 2726 2727 2728 2729 2730 2731 2732 2733 2734 2735 2736 2737 2738 2739 2740 2741 2742 2743 2744 2745 2746 2747 2748 2749 2750 2751 2752 2753 2754 2755 2756 2757 2758 2759 2760 2761 2762 2763 2764 2765 2766 2767 2768 2769 2770 2771 2772 2773 2774 2775 2776 2777 2778 2779 2780 2781 2782 2783 2784 2785 2786 2787 2788 2789 2790 2791 2792 2793 2794 2795 2796 2797 2798 2799 2800 2801 2802 2803 2804 2805 2806 2807 2808 2809 2810 2811 2812 2813 2814 2815 2816 2817 2818 2819 2820 2821 2822 2823 2824 2825 2826 2827 2828 2829 2830 2831 2832 2833 2834 2835 2836 2837 2838 2839 2840 2841 2842 2843 2844 2845 2846 2847 2848 2849 2850 2851 2852 2853 2854 2855 2856 2857 2858 2859 2860 2861 2862 2863 2864 2865 2866 2867 2868 2869 2870 2871 2872 2873 2874 2875 2876 2877 2878 2879 2880 2881 2882 2883 2884 2885 2886 2887 2888 2889 2890 2891 2892 2893 2894 2895 2896 2897 2898 2899 2900 2901 2902 2903 2904 2905 2906 2907 2908 2909 2910 2911 2912 2913 2914 2915 2916 2917 2918 | {
"paper_id": "2021",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T07:58:16.222322Z"
},
"title": "Keyword Extraction Using Unsupervised Learning on the Document's Adjacency Matrix",
"authors": [
{
"first": "Eirini",
"middle": [],
"last": "Papagiannopoulou",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Aristotle University of Thessaloniki",
"location": {
"postCode": "54124",
"settlement": "Thessaloniki",
"country": "Greece"
}
},
"email": ""
},
{
"first": "Grigorios",
"middle": [],
"last": "Tsoumakas",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Aristotle University of Thessaloniki",
"location": {
"postCode": "54124",
"settlement": "Thessaloniki",
"country": "Greece"
}
},
"email": ""
},
{
"first": "Apostolos",
"middle": [
"N"
],
"last": "Papadopoulos",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Aristotle University of Thessaloniki",
"location": {
"postCode": "54124",
"settlement": "Thessaloniki",
"country": "Greece"
}
},
"email": ""
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "This work revisits the information given by the graph-of-words and its typical utilization through graph-based ranking approaches in the context of keyword extraction. Recent, well-known graph-based approaches typically employ the knowledge from word vector representations during the ranking process via popular centrality measures (e.g., PageRank) without giving the primary role to vectors' distribution. We consider the adjacency matrix that corresponds to the graph-of-words of a target text document as the vector representation of its vocabulary. We propose the distributionbased modeling of this adjacency matrix using unsupervised (learning) algorithms. The efficacy of the distribution-based modeling approaches compared to state-of-the-art graphbased methods is confirmed by an extensive experimental study according to the F 1 score. Our code is available on GitHub 1 .",
"pdf_parse": {
"paper_id": "2021",
"_pdf_hash": "",
"abstract": [
{
"text": "This work revisits the information given by the graph-of-words and its typical utilization through graph-based ranking approaches in the context of keyword extraction. Recent, well-known graph-based approaches typically employ the knowledge from word vector representations during the ranking process via popular centrality measures (e.g., PageRank) without giving the primary role to vectors' distribution. We consider the adjacency matrix that corresponds to the graph-of-words of a target text document as the vector representation of its vocabulary. We propose the distributionbased modeling of this adjacency matrix using unsupervised (learning) algorithms. The efficacy of the distribution-based modeling approaches compared to state-of-the-art graphbased methods is confirmed by an extensive experimental study according to the F 1 score. Our code is available on GitHub 1 .",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "Automatic Keyword Extraction (AKE) intends to discover a limited but concise set of words that reflect the main topics discussed within a text document, avoiding the expensive and time-consuming process of manual annotation by experts (Vega-Oliveros et al., 2019) . Besides, many keyphrase extraction methods form and rank the candidate phrases using the previously scored candidate unigrams by a keyword extractor, as keyphrases consist of n-grams with n \u2265 1 (Wan and Xiao, 2008a; Hasan and Ng, 2014; Florescu and Caragea, 2017) .",
"cite_spans": [
{
"start": 235,
"end": 263,
"text": "(Vega-Oliveros et al., 2019)",
"ref_id": "BIBREF42"
},
{
"start": 460,
"end": 481,
"text": "(Wan and Xiao, 2008a;",
"ref_id": "BIBREF43"
},
{
"start": 482,
"end": 501,
"text": "Hasan and Ng, 2014;",
"ref_id": "BIBREF16"
},
{
"start": 502,
"end": 529,
"text": "Florescu and Caragea, 2017)",
"ref_id": "BIBREF13"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Both supervised and unsupervised approaches are quite famous for the AKE task . During the last two years, the research community pays significant attention on (supervised) deep learning methods Zhao and Zhang, 2019; Chen et al., 2020) as the performance of the unsupervised ones shows a relative stagnation (or minimal improvements) compared to the supervised techniques. The use of standard external tools for grammatical/syntactic analysis and information sources such as (pre-trained) static word embeddings (Bennani-Smires et al., 2018; Mahata et al., 2018) that have a bias over the corpora domains used for training may also exacerbate the problem. Moreover, most methods suggest a fixed or relative with the document length number of keywords dissociating the number of returned keywords from the number of topics discussed in the document (Rousseau and Vazirgiannis, 2015) . However, unsupervised methods are of timeless interest. They often are domain or language-independent and do not need any labelled data to train models compared to the supervised ones. The graph-based approaches (i.e., the most popular category of the unsupervised AKE) consider the \"central\" nodes of a graph-of-words as the most representative ones usually according to (variations of) the PageRank (Brin and Page, 1998) centrality, i.e., the most effective graph-based ranking method employed by the majority of the state-of-the-art (Mihalcea and Tarau, 2004; Wan and Xiao, 2008b; Florescu and Caragea, 2017; Vega-Oliveros et al., 2019) . Additionally, traditional (semi-)supervised, or even deep learning approaches (Wang and Li, 2017; Gollapalli et al., 2017; Ye and Wang, 2018) utilize the unsupervised methods mentioned earlier to improve their performance.",
"cite_spans": [
{
"start": 195,
"end": 216,
"text": "Zhao and Zhang, 2019;",
"ref_id": "BIBREF49"
},
{
"start": 217,
"end": 235,
"text": "Chen et al., 2020)",
"ref_id": "BIBREF10"
},
{
"start": 512,
"end": 541,
"text": "(Bennani-Smires et al., 2018;",
"ref_id": "BIBREF2"
},
{
"start": 542,
"end": 562,
"text": "Mahata et al., 2018)",
"ref_id": "BIBREF23"
},
{
"start": 848,
"end": 881,
"text": "(Rousseau and Vazirgiannis, 2015)",
"ref_id": "BIBREF36"
},
{
"start": 1285,
"end": 1306,
"text": "(Brin and Page, 1998)",
"ref_id": "BIBREF7"
},
{
"start": 1420,
"end": 1446,
"text": "(Mihalcea and Tarau, 2004;",
"ref_id": "BIBREF25"
},
{
"start": 1447,
"end": 1467,
"text": "Wan and Xiao, 2008b;",
"ref_id": "BIBREF44"
},
{
"start": 1468,
"end": 1495,
"text": "Florescu and Caragea, 2017;",
"ref_id": "BIBREF13"
},
{
"start": 1496,
"end": 1523,
"text": "Vega-Oliveros et al., 2019)",
"ref_id": "BIBREF42"
},
{
"start": 1604,
"end": 1623,
"text": "(Wang and Li, 2017;",
"ref_id": "BIBREF45"
},
{
"start": 1624,
"end": 1648,
"text": "Gollapalli et al., 2017;",
"ref_id": "BIBREF15"
},
{
"start": 1649,
"end": 1667,
"text": "Ye and Wang, 2018)",
"ref_id": "BIBREF48"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "This work takes a novel unsupervised path to keyword extraction revisiting the information provided by the graph-of-words and its conventional utilization via PageRank. Inspired by the recent approach of , we investigate the effectiveness of the distributionbased modeling of the adjacency matrix, that corresponds to various versions of the (unweighted, weighted or/and enhanced with positional information) graph-of-words for the target document. We also propose the use of more advanced unsupervised algorithms to model the main distribution of the adjacency matrix, determine the number of the retrieved keywords at document level, and score/rank the corresponding candidate keywords. To the best of our knowledge, this is the first work that proposes such modeling of the adjacency matrix using unsupervised machine learning approaches in the context of keyword extraction. Our empirical study confirms the efficacy of the distribution-based modeling approaches (regarding the F 1 score) on six datasets (full-texts of scientific publications, paper abstracts and news articles) compared to state-of-the-art graph-based methods.",
"cite_spans": [
{
"start": 342,
"end": 354,
"text": "(unweighted,",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "The main contributions of this work are as follows: (a) We propose multiple ways for the distribution-based modeling of the adjacency matrix that corresponds to various versions of the graph-of-words for a target document. Specifically, we investigate the use of unsupervised (learning) algorithms to model the distribution of the adjacency matrix, score the candidate words, and (b) discover the appropriate number of keywords (Section 3). (c) Our empirical study provides strong evidence about the relationship between the graphbased techniques and the proposed ones emphasizing the cases that the distribution-based modeling is more promising (Section 4). Finally, Section 2 and 5 present related work on unsupervised AKE (issues/trends) as well as conclusions and future directions of our work, respectively.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Issues. The comprehensive representation of the information via graphs and the efficiency of the graph-based ranking methods (e.g., PageRank (Brin and Page, 1998) , HITS (Kleinberg, 1999) , etc.) in many applications (including keyword extraction) led the research community to show a preference to graph-based AKE using unsupervised approaches . The popular TextRank (Mihalcea and Tarau, 2004) first builds an undirected, unweighted graphof-words representation and runs the PageRank algorithm until convergence. In this vein, SingleRank (Wan and Xiao, 2008b) , RAKE (Rose et al., 2010) , ExpandRank (Wan and Xiao, 2008b) , and CollabRank (Wan and Xiao, 2008a) are extensions of TextRank. The first two methods add weights to edges, equal to the number of co-occurrences of the two corresponding words within the predefined window, whereas, the last ones incorporate information from relevant documents. Much later, Po-sitionRank (Florescu and Caragea, 2017) achieved significantly higher performance proposing a biased PageRank that considers both the word-word co-occurrences and the word's positions. Then, Biswas et al. (2018) and Vega-Oliveros et al. (2019) proposed graph-based keyword extraction methods that combine multiple centrality measures.",
"cite_spans": [
{
"start": 141,
"end": 162,
"text": "(Brin and Page, 1998)",
"ref_id": "BIBREF7"
},
{
"start": 170,
"end": 187,
"text": "(Kleinberg, 1999)",
"ref_id": "BIBREF19"
},
{
"start": 368,
"end": 394,
"text": "(Mihalcea and Tarau, 2004)",
"ref_id": "BIBREF25"
},
{
"start": 539,
"end": 560,
"text": "(Wan and Xiao, 2008b)",
"ref_id": "BIBREF44"
},
{
"start": 568,
"end": 587,
"text": "(Rose et al., 2010)",
"ref_id": "BIBREF35"
},
{
"start": 601,
"end": 622,
"text": "(Wan and Xiao, 2008b)",
"ref_id": "BIBREF44"
},
{
"start": 640,
"end": 661,
"text": "(Wan and Xiao, 2008a)",
"ref_id": "BIBREF43"
},
{
"start": 931,
"end": 959,
"text": "(Florescu and Caragea, 2017)",
"ref_id": "BIBREF13"
},
{
"start": 1105,
"end": 1131,
"text": "Then, Biswas et al. (2018)",
"ref_id": "BIBREF3"
},
{
"start": 1136,
"end": 1163,
"text": "Vega-Oliveros et al. (2019)",
"ref_id": "BIBREF42"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "2"
},
{
"text": "Another important issue is choosing the right number of keywords for a document. Rousseau and Vazirgiannis (2015) apply the concept of K-Core on the graph-of-words of a document retaining only the nodes from the main core as keywords. Their method is parameter-free as the K-Core principle adjusts the number of keywords concerning each graph's structure. Later, Tixier et al. (2016) show that retaining only the main core (or truss (Cohen, 2008) ) is suboptimal as the complete set of a document's gold keywords cannot appear within a single subgraph and propose alternative heuristics (stopping criteria) to remove undesired words.",
"cite_spans": [
{
"start": 81,
"end": 113,
"text": "Rousseau and Vazirgiannis (2015)",
"ref_id": "BIBREF36"
},
{
"start": 363,
"end": 383,
"text": "Tixier et al. (2016)",
"ref_id": "BIBREF41"
},
{
"start": 433,
"end": 446,
"text": "(Cohen, 2008)",
"ref_id": "BIBREF11"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "2"
},
{
"text": "Trends. Information coming from word embeddings (Mikolov et al., 2013) proved useful for the AKE task. Numerous AKE methods use word embeddings (Mnih and Hinton, 2007; as an (external) semantic knowledge source. Representative graphbased approaches are the one of Wang et al. (2015) and Key2Vec (Mahata et al., 2018 ) that incorporate semantic information from pre-trained distributed word representations and word embeddings trained on a domain-specific corpus, respectively. Both methods utilize the information from word embeddings through the usual way of graph-based ranking without giving to the vector representation of terms the primary role. On the contrary, Papagiannopoulou and Tsoumakas (2018) present the Reference Vector Algorithm (RVA) that uses local GloVe (Pennington et al., 2014) word vectors (i.e., trained only on the target document). Em-bedRank (Bennani-Smires et al., 2018) uses pretrained sentence embeddings, Sent2Vec (Pagliardini et al., 2018) , to embed both candidate terms and documents in the same high-dimensional vector space. Finally, proposed an unsupervised AKE method that uses the weighted adjacency matrix's rows as word vectors to model their distribution. The authors show that the centre of the distribution is closer to the non-keywords, as the main bulk of words are neutral or slightly relevant to the documents' topics.",
"cite_spans": [
{
"start": 48,
"end": 70,
"text": "(Mikolov et al., 2013)",
"ref_id": "BIBREF26"
},
{
"start": 144,
"end": 167,
"text": "(Mnih and Hinton, 2007;",
"ref_id": "BIBREF27"
},
{
"start": 264,
"end": 282,
"text": "Wang et al. (2015)",
"ref_id": "BIBREF46"
},
{
"start": 295,
"end": 315,
"text": "(Mahata et al., 2018",
"ref_id": "BIBREF23"
},
{
"start": 773,
"end": 798,
"text": "(Pennington et al., 2014)",
"ref_id": "BIBREF33"
},
{
"start": 944,
"end": 970,
"text": "(Pagliardini et al., 2018)",
"ref_id": "BIBREF29"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "2"
},
{
"text": "3 Our Approach 3.1 Document Pre-processing First, we eliminate from the target document punctuation marks and words that (a) are stopwords , (b) consist only of numbers, (c) have length less than two characters to avoid trivial or insignificant terms. Before we get the final set of candidate words as keywords, we use stemming.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "2"
},
{
"text": "The majority of the graph-based approaches measure the importance of the graph-of-words' nodes using PageRank (see Section 2) that adds more value to a node connected with high-scoring nodes rather than low-scoring ones through an iterative process. However, our approach follows a different direction by identifying the most central (i.e., significant) words of the graph-of-words via the distribution-based modeling of the corresponding adjacency matrix.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Creation of the Adjacency Matrix",
"sec_num": "3.2"
},
{
"text": "We investigate our approach's effectiveness on three distinct versions of the adjacency matrix that correspond to three variants of the graph-of-words (i.e., unweighted, weighted with/without enhanced with positional information) for a target document. Specifically, given a set of unique, valid words of the text, d \u2208 D, we could have one of the following types of word vectors (each row of the adjacency matrix constitutes a vector representation of a specific word): a. Unweighted adjacency matrix, A N \u00d7N where N = |D|. The A N \u00d7N matrix represents the undirected 2 unweighted graph-of-words G = (U, E), U is the set of vertices (that correspond to the set of words d \u2208 D) and E is the set of edges; Each element A i,j is 1 when there is an edge from vertex u i to vertex u j (u i = u j ) of G, i.e., the corresponding words d i and d j co-occur within a window of T words, and 0 when there is no edge,",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Creation of the Adjacency Matrix",
"sec_num": "3.2"
},
{
"text": "i, j \u2208 [1..N ].",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Creation of the Adjacency Matrix",
"sec_num": "3.2"
},
{
"text": "b. Weighted adjacency matrix, A N \u00d7N with N = |D|. The A N \u00d7N matrix represents the undirected weighted graph-of-words G = 2 i.e., the adjacency matrix is symmetric.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Creation of the Adjacency Matrix",
"sec_num": "3.2"
},
{
"text": "(U, E ), U is the set of vertices and E is the set of edges; Each element A i,j contains the weight of the edge from vertex u i to vertex u j (u i = u j ), i.e., the number of co-occurrences of the corresponding words",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Creation of the Adjacency Matrix",
"sec_num": "3.2"
},
{
"text": "d i and d j within a window of T words, i, j \u2208 [1..N ].",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Creation of the Adjacency Matrix",
"sec_num": "3.2"
},
{
"text": "In case that there is no edge connecting the two nodes,",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Creation of the Adjacency Matrix",
"sec_num": "3.2"
},
{
"text": "A i,j = 0. c. Weighted adjacency matrix with positional information, Q N \u00d7N where N = |D|.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Creation of the Adjacency Matrix",
"sec_num": "3.2"
},
{
"text": "The Q N \u00d7N matrix represents the undirected weighted graph-of-words A = (U, E ) but also incorporates positional information, i.e.,",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Creation of the Adjacency Matrix",
"sec_num": "3.2"
},
{
"text": "Q = A P",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Creation of the Adjacency Matrix",
"sec_num": "3.2"
},
{
"text": "where is the element-wise multiplication symbol, A is the weighted adjacency matrix, A N \u00d7N , detailed in (b) and P N \u00d7N is a positional matrix such that each element is defined as:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Creation of the Adjacency Matrix",
"sec_num": "3.2"
},
{
"text": "P i,j = 1 s(d i ) + s(d j )",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Creation of the Adjacency Matrix",
"sec_num": "3.2"
},
{
"text": "where s(d) gives the first sentence where the word d occurs in the document.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Creation of the Adjacency Matrix",
"sec_num": "3.2"
},
{
"text": "The next step of our approach is the distributionbased modeling of the adjacency matrix that corresponds to one of the various versions of the target document's graph-of-words described above (Section 3.2) and the candidate words' scoring. In this section, we detail three distribution-based modeling alternatives describing the intuition behind each one approach and the scoring functions used to give the final ranking of the words as keywords.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Distribution-based Modeling and Candidates Scoring",
"sec_num": "3.3"
},
{
"text": "Papagiannopoulou et al. 2020proposed Local Vectors (LV), an unsupervised AKE method that uses the weighted adjacency matrix of the graphof-words as word vectors to model the distribution of the target document's words by averaging the corresponding vectors (i.e., rows of the matrix). The authors show that the centre of the distribution is closer to the non-keywords, as the main bulk of words are neutral or slightly relevant to the documents' topics. Moreover, in the same work, they show through an empirical study that the local word vectors coming from the weighted adjacency matrix mentioned above encode statistical information equivalent to the one encoded by the local run of GloVe on a single document proposed in Papagiannopoulou and Tsoumakas (2018) . Particularly, in this work, we consider the sample's estimated mean \u00b5 of the corresponding vector matrix, i.e., the A N \u00d7N or A N \u00d7N or Q N \u00d7N , as the distribution's center (each word participates once in the computation). Then, we score each word with a value S, according to the following formula:",
"cite_spans": [
{
"start": 725,
"end": 762,
"text": "Papagiannopoulou and Tsoumakas (2018)",
"ref_id": "BIBREF30"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "The Mean Vector Approach",
"sec_num": "3.3.1"
},
{
"text": "S(x) = d(\u00b5, x), where d(\u00b5, x)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The Mean Vector Approach",
"sec_num": "3.3.1"
},
{
"text": "is the Euclidean distance between the mean vector \u00b5 and the vector representation x of the word, as distance metrics that incorporate the vectors' magnitude capture the similar behaviour of the non-keywords' vectors over the keywords' ones ",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The Mean Vector Approach",
"sec_num": "3.3.1"
},
{
"text": ", i.e., d(\u00b5, x) = N i=1 (x i \u2212 \u00b5 i ) 2 ,",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The Mean Vector Approach",
"sec_num": "3.3.1"
},
{
"text": "where N is the number of dimensions. The higher the score S, the more important the word for the document, i.e., we are interested in words with high distance values, as most of the words, which determine the distribution's center, are non-keywords. The main difference with the approach proposed by Papagiannopoulou et al. 2020is that we score the words based only on their distance from the mean vector without involving any external heuristics such as the word's position. This way, we consider in advance any positional information via the Q adjacency matrix (i.e., incorporated in the vector representation).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The Mean Vector Approach",
"sec_num": "3.3.1"
},
{
"text": "One-Class SVM. Instead of calculating the distribution's center of the adjacency matrix by averaging its rows, we could use geometric concepts such as hyperspheres or hyperplanes to delimit the area of space that includes most of the word vectors (i.e., the main bulk of unimportant words) and, then, score the candidates using functions that express the vectors' deviation from the main distribution. According to this approach, the most important words are the most outlying ones (i.e., outliers) as most words are neutral or slightly relevant to the documents' topics (i.e., inliers). Tax and Duin (1999a,b) proposed a method based on SVM (Cortes and Vapnik, 1995) , called One-Class SVM, that seeks the smallest hypersphere consisting of all the dataset points. Thus, training this model may reject a fraction of the positively-labelled training objects when this adequately minimizes the hypersphere volume.",
"cite_spans": [
{
"start": 588,
"end": 610,
"text": "Tax and Duin (1999a,b)",
"ref_id": null
},
{
"start": 642,
"end": 667,
"text": "(Cortes and Vapnik, 1995)",
"ref_id": "BIBREF12"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Unsupervised Learning Approaches",
"sec_num": "3.3.2"
},
{
"text": "There are also other approaches, such as the one of Sch\u00f6lkopf et al. (1999) , which is similar, but instead of using a small hypersphere, it uses a hyperplane which is far from the origin (this is the version implemented by scikit-learn 3 and used in our study). This algorithm employs a function f that takes the value +1 in a \"small\" region, covering most of the data points, and -1 elsewhere. Formally, suppose the dataset consists of the word vectors (samples) x coming from the corresponding adjacency matrix X N \u00d7N (i.e., X N \u00d7N can be one of the A N \u00d7N , A N \u00d7N , Q N \u00d7N ). Let \u03a6 be a feature map X \u2192 F 4 , i.e., a specific dot product space. Then, we can separate the dataset's word vectors from the origin by solving the following quadratic optimization problem:",
"cite_spans": [
{
"start": 52,
"end": 75,
"text": "Sch\u00f6lkopf et al. (1999)",
"ref_id": "BIBREF37"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Unsupervised Learning Approaches",
"sec_num": "3.3.2"
},
{
"text": "min w,\u03be,\u03c1 1 2 ||w|| 2 + 1 \u03bdl i \u03be i \u2212 \u03c1 subject to (w \u2022 \u03a6(x i )) \u2265 \u03c1 \u2212 \u03be i , \u03be i \u2265 0",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Unsupervised Learning Approaches",
"sec_num": "3.3.2"
},
{
"text": "where i represents the i th sample, l = N , \u03bd is the percentage of samples considered as outliers (the expected keywords' ratio), \u03be i are the slack variables that relax the constraints, \u03c1 refers to the distance of the hyperplane from the origin 5 and w represent the parameters of the SVM that define the hyperplane (we need to learn them using the dataset's samples) 6 . Then, the decision function f (x) = sgn((w \u2022 \u03a6(x)) \u2212 \u03c1) will be positive for the most samples x i in the dataset. In our case, an ideal scoring function that ranks the corresponding document's words is the signed distance to the separating hyperplane that will be positive for the main bulk of words and negative for the different ones. We consider only the words with a negative score as candidate keywords (the lower the value, the higher the word's importance).",
"cite_spans": [
{
"start": 368,
"end": 369,
"text": "6",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Unsupervised Learning Approaches",
"sec_num": "3.3.2"
},
{
"text": "We have experimented with various kernel functions, e.g., polynomial, sigmoid, etc. but the most suitable in our case is the Radial Base Function (RBF). Formally, The RBF kernel on two samples x and x is defined as:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Unsupervised Learning Approaches",
"sec_num": "3.3.2"
},
{
"text": "K(x, x ) = exp \u2212 ||x \u2212 x || 2 2\u03c3 2",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Unsupervised Learning Approaches",
"sec_num": "3.3.2"
},
{
"text": "Figure 1: An isolation tree built based on the adjacency matrix's word vector representations for the article entitled \"On the Tradeoff between Privacy and Utility in Data Publishing\" with golden keywords: anonymity, data, publishing, privacy. The isolation tree recursively divides the 20 samples (i.e., words used to train the tree) by randomly selecting an attribute (matrix dimension) b and a split value m until either the node has only one instance or all node's data have the same values. Keywords tend to have shorter path lengths than the nonkeywords that constitute the main bulk of (unimportant) words.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Unsupervised Learning Approaches",
"sec_num": "3.3.2"
},
{
"text": "where \u03c3 \u2208 R is a kernel parameter and ||x \u2212 x || 2 can be considered as the squared Euclidean distance between the two word vectors. These distances between the pairs of the word feature vectors incorporated by the RBF kernel make it the best choice. Moreover, distance metrics that consider the vectors' magnitude (e.g., the Euclidean distance) can capture the non-keywords' vectors' similar behavior over the keywords' ones as mentioned earlier in Section 3.3.1. Isolation Forest. Instead of modeling the vectors' distribution and then estimating the distance from a reference point (e.g., the mean vector or the hyperplane), we propose to detect and rank the few different (important) word vectors via the mechanism of isolation Liu et al. (2008, 2012) utilizing the binary tree structure, called isolation tree. Because of the susceptibility to isolation, the few outlying word vectors (i.e., expected to be the important ones) are more prone to be isolated closer to the root of an isolation tree than the common ones. An isolation forest builds an ensemble of isolation trees for the given set of word vectors. The forest of random trees collectively produces shorter path lengths 7 for the outlier samples, i.e., the ones we search. In other words, isolation forest is a tree-based algorithm built around the theory of decision trees and random forests. It also creates many isolation (decision) trees, but it calculates the path length necessary to isolate an observation in the tree. The idea is that keywords as a minority in a document can be treated as anomalies and thus are easier to be isolated because there are fewer conditions required to separate them from the \"normal\" nonkeywords. Therefore, outliers (i.e., keywords) will have shorter paths than the \"normal\" non-keywords and reside closer to the tree's root. When many isolation trees are created, the forest is necessary to average the corresponding scores (path length calculations), providing a sense about the words that are indeed outliers. Figure 1 shows an isolation tree built based on the Q adjacency matrix's word vector representations for a computer science abstract from the KDD collection . The article entitled \"On the Tradeoff between Privacy and Utility in Data Publishing\" is accompanied by the following golden keywords: anonymity, data, publishing, privacy. The number of samples to draw from X to train each base estimator is equal to 20. We also applied PCA on X and use the two first principal components to facilitate visualization. The isolation tree recursively divides the 20 samples by randomly selecting an attribute b and a split value m, until either the node has only one instance or all data at the node have the same values. We notice that keywords tend to have shorter path lengths than the non-keywords. Similar isolation trees, supportive of our crucial intuition, are obtained from other documents, too.",
"cite_spans": [
{
"start": 743,
"end": 749,
"text": "(2008,",
"ref_id": null
},
{
"start": 750,
"end": 755,
"text": "2012)",
"ref_id": null
}
],
"ref_spans": [
{
"start": 2019,
"end": 2027,
"text": "Figure 1",
"ref_id": null
}
],
"eq_spans": [],
"section": "Unsupervised Learning Approaches",
"sec_num": "3.3.2"
},
{
"text": "A more in-depth view of the Isolation Forest scoring function reveals that itself defines a \"natural\" threshold that determines whether a sample belongs to inliers or not by borrowing the analysis of Binary Search Trees (BSTs) as isolation trees have an equivalent structure (Preiss, 2000) . This property is remarkable as the number of topics a document discusses should determine the corresponding number of keywords instead of suggesting a fixed or proportional to the text size number of keywords as most methods do. According to the theory, the average path length c(\u03c8) of unsuccessful searches in a BST (i.e., the equivalent of external node terminations in an isolation tree) given a sample set of \u03c8 instances is:",
"cite_spans": [
{
"start": 275,
"end": 289,
"text": "(Preiss, 2000)",
"ref_id": "BIBREF34"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Unsupervised Learning Approaches",
"sec_num": "3.3.2"
},
{
"text": "c(\u03c8) = \uf8f1 \uf8f4 \uf8f2 \uf8f4 \uf8f3 2H(\u03c8 \u2212 1) \u2212 2 \u03c8\u22121 n , \u03c8 > 2, 1, \u03c8 = 2, 0, otherwise.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Unsupervised Learning Approaches",
"sec_num": "3.3.2"
},
{
"text": "where H(i) is the harmonic number (estimated by ln(i)+ the Euler's constant). Hence, the Isolation Forest scoring function is:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Unsupervised Learning Approaches",
"sec_num": "3.3.2"
},
{
"text": "s(x, \u03c8) = 2 \u2212 E(h(x)) c(\u03c8)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Unsupervised Learning Approaches",
"sec_num": "3.3.2"
},
{
"text": "where x is the sample, h(x) is the path length of x and E(h(x)) is the average of h(x) for a collection of isolation trees. The above function ensures that samples with scores close to 1 imply diversity from the majority (i.e., E(h(x)) \u2192 0), whereas scores much lower than 0.5 indicate normal samples (i.e., E(h(x)) \u2192 \u03c8 \u2212 1). Also, suppose all instances have a score of approximately equal to 0.5. In that case, we can consider the whole sample as a set of normal instances (i.e., E(h(x)) \u2192 c(\u03c8)).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Unsupervised Learning Approaches",
"sec_num": "3.3.2"
},
{
"text": "The above findings transform the value 0.5 into an especially important threshold for determining a case as different from the whole sample or not.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Unsupervised Learning Approaches",
"sec_num": "3.3.2"
},
{
"text": "We choose six popular datasets: three collections with full-text publications, i.e., NUS (Nguyen and Kan, 2007) , Semeval (SE) (Kim et al., 2010), and ACM (Krapivin et al., 2008) with 211, 244, and 2304 documents, respectively, two with scientific abstracts, i.e., KDD and WWW (Gollapalli and Caragea, 2014) with 755, and 1330 documents, respectively, and one with news texts, i.e., DUC-2001 (DUC) (Wan and Xiao, 2008b) with 308 documents. This way, we include to our study both long and short texts, either scientific or news articles. SE is already separated into training (144) and test (100) sets, and for the ACM separation, most works choose the first 400 papers from the ACM following Meng et al. (2017) as test set. However, there are no guidelines for separating the NUS, KDD, WWW, and DUC datasets. Thus, we pick the first 330 from WWW, the last 100 papers from NUS , and the last 100 from DUC, alphabetically ordered as the test data. We use the whole KDD dataset as test set as we do not use it for parameters' tuning.",
"cite_spans": [
{
"start": 89,
"end": 111,
"text": "(Nguyen and Kan, 2007)",
"ref_id": "BIBREF28"
},
{
"start": 155,
"end": 178,
"text": "(Krapivin et al., 2008)",
"ref_id": "BIBREF20"
},
{
"start": 383,
"end": 397,
"text": "DUC-2001 (DUC)",
"ref_id": null
},
{
"start": 398,
"end": 419,
"text": "(Wan and Xiao, 2008b)",
"ref_id": "BIBREF44"
},
{
"start": 692,
"end": 710,
"text": "Meng et al. (2017)",
"ref_id": "BIBREF24"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Setup",
"sec_num": "4.1"
},
{
"text": "In addition to the proposed approaches for AKE, i.e., the new version of LV, the Isolation Forest (IF) and the One-Class SVM (OC), four state-of-the-art unsupervised graph-based AKE methods participate in this empirical study: K-Core (K) (Seidman, 1983; Batagelj and Zaversnik, 2011) , PageRank (P) (Mihalcea and Tarau, 2004; Wan and Xiao, 2008b) , Betweenness (B), and Node degree (N) (the last one proposed first by Rose et al. (2010) . We present the experimental results organized in three groups based on the type of information used to run (Tables 2, 3). The first two groups include the methods' runs on the unweighted and weighted graphs-ofwords/adjacency matrices, i.e., with an A and A subscript on the right of each method according to the notation introduced in Section 3.2, respectively (e.g., K A means that K method runs on an unweighted graph-of-words, whereas K A runs on the weighted one, i.e., weighted K-Core of Batagelj and Zaversnik (2011) ). The third group includes the proposed methods' runs on the Q adjacency matrix (weighted with words' co-occurrences and positional information) and a Personalized weighted variant of PageRank that considers both node as well as the typical edge weights (P A ). The node weight is equal to 1 s , where s is the first sentence's index that the corresponding word occurs in the document. In all cases, the methods build the graph-of-words following the pre-processing steps described in Section 3.1.",
"cite_spans": [
{
"start": 238,
"end": 253,
"text": "(Seidman, 1983;",
"ref_id": "BIBREF38"
},
{
"start": 254,
"end": 283,
"text": "Batagelj and Zaversnik, 2011)",
"ref_id": "BIBREF0"
},
{
"start": 299,
"end": 325,
"text": "(Mihalcea and Tarau, 2004;",
"ref_id": "BIBREF25"
},
{
"start": 326,
"end": 346,
"text": "Wan and Xiao, 2008b)",
"ref_id": "BIBREF44"
},
{
"start": 418,
"end": 436,
"text": "Rose et al. (2010)",
"ref_id": "BIBREF35"
},
{
"start": 932,
"end": 961,
"text": "Batagelj and Zaversnik (2011)",
"ref_id": "BIBREF0"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Setup",
"sec_num": "4.1"
},
{
"text": "After splitting the golden keyphrases into unigrams, we use exact string matching to determine the number of correctly matched words with the golden ones for a document following the paradigm of Tixier et al. (2016) . We also apply stemming to the output of the methods and the article's golden unigrams as a pre-processing step before the evaluation process. We employ the authors' keywords as a gold evaluation standard for all academic documents (long/short) except for the news dataset where only the readers' keywords are available. We used the IsolationForest and OneClassSVM classes from the scikit-learn 8 library for the IF and OC, respectively. For the implementation of the competitive approaches, we employ the PKE toolkit (Boudin, 2016) , the NetworkX 9 and the gowpy 10 python libraries.",
"cite_spans": [
{
"start": 195,
"end": 215,
"text": "Tixier et al. (2016)",
"ref_id": "BIBREF41"
},
{
"start": 735,
"end": 749,
"text": "(Boudin, 2016)",
"ref_id": "BIBREF5"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Setup",
"sec_num": "4.1"
},
{
"text": "We use one dataset per text category (fulltexts, abstracts, news), i.e., the training sets of NUS, WWW, DUC, to determine IF and OC models' tuning parameters to optimize the F 1 score. The parameters chosen for the experiments on test sets are for the IF n estimators =200, max samples =auto, max f eatures =0.75 and the OC kernel=rbf, gamma=scale. The best percentages for the IF's contamination and OC's nu parameters (related to outliers' ratio) are 0.05, 0.1, 0.2 for the full-text publications, news texts and abstracts, respectively (used in the context of F 1 @20 scores calculation, see Table 2 ). Furthermore, we compute the F 1 scores in Table 3 based on the number of keywords returned by the K A , K A , IF A , IF A and IF Q (the value of the IF's contamination parameter is equal to auto 11 ) approaches, i.e., F 1 @|K",
"cite_spans": [],
"ref_spans": [
{
"start": 595,
"end": 602,
"text": "Table 2",
"ref_id": "TABREF1"
},
{
"start": 648,
"end": 655,
"text": "Table 3",
"ref_id": "TABREF3"
}
],
"eq_spans": [],
"section": "Setup",
"sec_num": "4.1"
},
{
"text": "A |, F 1 @|K A |, F 1 @|IF A |, F 1 @|IF A |, F 1 @|IF Q |, respec- tively.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Setup",
"sec_num": "4.1"
},
{
"text": "The LV approach is parameter-free.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Setup",
"sec_num": "4.1"
},
{
"text": "We follow the paradigm of existing experimental studies from the related task of keyphrase extraction (Wan and Xiao, 2008a; Bougouin et al., 2013) , and set a window size T equal to 10 to construct the graphs-of-words used by the graph-based approaches. Earlier, Wan and Xiao (2008b) show that in the case of weighted graphs-of-words, the greater the window size, the higher the extractor's accuracy (window sizes greater than 10 achieve more or less the same accuracy level). Table 1 : F 1 @20 of the LV, IF and OC keyword extraction methods using different types of adjacency matrix (A, A , Q) created with two different window sizes, T = 5 (T 5 ) and T = 10, on three different datasets (NUS, WWW, DUC). The highest values appear in bold font.",
"cite_spans": [
{
"start": 102,
"end": 123,
"text": "(Wan and Xiao, 2008a;",
"ref_id": "BIBREF43"
},
{
"start": 124,
"end": 146,
"text": "Bougouin et al., 2013)",
"ref_id": "BIBREF6"
},
{
"start": 263,
"end": 283,
"text": "Wan and Xiao (2008b)",
"ref_id": "BIBREF44"
}
],
"ref_spans": [
{
"start": 477,
"end": 484,
"text": "Table 1",
"ref_id": null
}
],
"eq_spans": [],
"section": "Setup",
"sec_num": "4.1"
},
{
"text": "F 1 NUS WWW DUC T 5 T 10 T 5 T 10 T 5 T 10 LV A 0",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Setup",
"sec_num": "4.1"
},
{
"text": "Moreover, Table 1 shows the F 1 @20 scores of LV, IF, and OC on the training sets of three representative datasets NUS, WWW and DUC (one from each category of documents, long/short scientific articles and news texts, respectively) using unweighted (A), weighted (A ), and weighted with positional information (Q) adjacency matrix with two different window sizes, a lower widow size T = 5 (T 5 ) and the usual one T = 10 (T 10 ). The highest F 1 scores are highlighted in bold font. The experimental results confirm that smaller window sizes led to lower F 1 scores for most of the pro-posed methods. However, in few cases where the methods with T 5 give higher F 1 scores compared to those with T 10 , the differences are not statistically significant according to the two-sided Wilcoxon signed-rank nonparametric test. Finally, another reason to consider the same co-occurrence window size for both the state-of-the-art graph-based approaches and the proposed ones is our interest in investigating the methods' efficacy employing the same words' context (captured in a specific window size). Table 2 shows the F 1 @20 scores of various keyword extraction methods, whereas Table 3 presents the F 1 scores calculated based on the returned number of keywords by K A , K A , IF A , IF A , and IF Q on the six datasets using unweighted (A), weighted (A ), and weighted with positional information (Q) graph-of-words or adjacency matrix. The highest F 1 scores in both tables are highlighted in red bold font. Table 2 presents the best scores for each group of methods in bold, whereas the second best are underlined. We have also checked the statistical significance of the results using two-sided Wilcoxon signed-rank nonparametric test between the graph-based (the ones in the gray background) and the distribution-based modeling approaches (LV, IF, OC) at significance level 0.01. Our analysis shows that differences in values > 2% are statistically significant. In case of statistical significance between the values of two methods whose difference is \u22642%, a superscript with the name of the corresponding graph-based method is added on the distribution-based modeling approach. We compute statistical significance separately for the groups of methods that use edge weights, node and edge weights, and no weights, respectively, to facilitate the results' interpretation. Table 2 shows that in most cases except for the news collection (DUC), the more information we consider, i.e., both words' co-occurrences and positional info, the higher F 1 scores we achieve (e.g., OC Q 's high scores compared to the ones of OC A , OC A ). Particularly, the transition from the unweighted graph-of-words/adjacency matrix to their weighted versions slightly improves the performance in almost all methods besides the B's (in all datasets) and LV's scores (in longer documents). IF A outperforms the competitive approaches that consider edge weights to score the candidates (2 nd group of methods with subscript A ) in four out of six datasets (NUS, SE, WWW, KDD) and achieves high scores in ACM and DUC with statistically insignificant differences compared to the competitive methods. Moreover, the addition of positional weights compared to the typical use of edge weights increases most methods' performance remarkably apart from the LV's (in shorter documents) and the P's that remains almost invariable in shorter texts. In the 3 rd group of methods, IF Q ranks first in half datasets (DUC, WWW, KDD) and performs high in NUS and SE (without statistically significant differences from P A ). Additionally, LV achieves quite high F 1 scores as well. Figure 2 shows a visual interpretation of why the additional information facilitates the distributionbased approaches to distinguish the keywords from the non-keywords via heatmaps of the Euclidean distances between the word vectors of the A (2a) and Q (2b), respectively, for a news text. We notice that positions combined with words' cooccurrences help the text's keyword vectors diverge from the main distribution (see the few high distances/yellow or light green values that correspond mostly to the first words of the document that include many keywords). We also see that most vectors (common words -group of inliers) are close to each other (low/dark distance values). However, the distances between word vectors of A do not Figure 2 : The distances between the main bulk of word vectors from the Q adjacency matrix (2b) range in low (dark) values compared to a minority of distant word vectors (yellow/green values). However, the word vectors of A (2a) do not provide such clear separation between the main distribution of common words and the minority of keywords (high and low distances are just as many). reveal any clear separation between the main distribution of common words and the minority of keywords making difficult the outliers' detection.",
"cite_spans": [],
"ref_spans": [
{
"start": 10,
"end": 17,
"text": "Table 1",
"ref_id": null
},
{
"start": 1093,
"end": 1100,
"text": "Table 2",
"ref_id": "TABREF1"
},
{
"start": 1173,
"end": 1180,
"text": "Table 3",
"ref_id": "TABREF3"
},
{
"start": 1505,
"end": 1512,
"text": "Table 2",
"ref_id": "TABREF1"
},
{
"start": 2371,
"end": 2378,
"text": "Table 2",
"ref_id": "TABREF1"
},
{
"start": 3641,
"end": 3649,
"text": "Figure 2",
"ref_id": null
},
{
"start": 4373,
"end": 4381,
"text": "Figure 2",
"ref_id": null
}
],
"eq_spans": [],
"section": "Setup",
"sec_num": "4.1"
},
{
"text": "Note that the words' ids (range from 0 to 363) correspond to the order of the words' presence in the text, confirming the importance of the positional information in the AKE task (keywords tend to appear at the beginning of a document). Similar plots are also obtained from multiple documents. Next, we focus on the AKE methods that determine the number of returned keywords at document level, i.e., the K A , K A , IF A , IF A and IF Q . We study the results of that shows the average numbers of keywords returned by the methods mentioned earlier for each dataset. The last row in Table 4 shows the average number of candidate words |V| per dataset to give an impression for the texts' vocabulary sizes. We are interested in investigating which method returns the most \"accurate\" keywords' sets in terms of the corresponding F 1 scores. However, we should keep in mind that the methods are not evaluated on the same number of keywords. Through this discussion, our goal is to discover which AKE approach is more suitable for each type of documents in a general sense. The low F 1 @|K A | scores of K A compared to the F 1 scores of K A , IF A , IF A and IF Q are plausible due to the low precision scores of K A as the number of the words included in the K-Core of the unweighted graph-of-words is quite high (greater than 70, 53 and 24 returned keywords for the academic full-texts, news texts and scientific abstracts, respectively). In all datasets K A outperforms K A giving reasonable number of keywords. Moreover, in most datasets (scientific full-texts and abstracts), IF Q outputs more accurate keyword sets (i.e., higher F 1 @|IF Q | scores) than those returned by rest approaches. Exceptions are the performance on (a) the DUC (news) dataset where IF A , IF A and IF Q detect lower number of words as keywords compared to the golden ones and (b) the KDD collection where the F 1 @|IF Q | score achieved by IF Q is slightly worse than the one of K A .",
"cite_spans": [],
"ref_spans": [
{
"start": 582,
"end": 589,
"text": "Table 4",
"ref_id": "TABREF5"
}
],
"eq_spans": [],
"section": "Performance Evaluation Results",
"sec_num": "4.2"
},
{
"text": "We also present the correlation according to the Spearman correlation coefficient between the IF's scoring function described in Section 3.3.2 and traditional weighting schemas, i.e., P, N, B, and K, for each information type used by IF and the rest graph-based methods, i.e., unweighted, weighted and weighted with positional information graphsof-words/adjacency matrices. Table 5 shows that there is a very strong positive correlation (\u2265 0.8) between the words' scores returned by IF and those produced by P and N for all information (input) types for almost all datasets, interpreting (partly) the comparable F 1 scores achieved by these methods. In this vein, there is a strong positive correlation (\u2265 0.6) between IF and B in most cases. Moreover, the very strong positive correlation (\u2265 0.8) on the datasets with full-texts of scientific publications goes hand-in-hand with the similar accuracy levels achieved in case there are no weights on the corresponding input. Finally, the K's output does not seem to correlate with the IF's output when no weights are used. However, if the methods use weights, the correlation between them turns into a strong/moderate positive one. Table 5 : Spearman's correlation coefficient (S.C.C.) between the proposed approach IF and traditional graphbased methods.",
"cite_spans": [],
"ref_spans": [
{
"start": 374,
"end": 381,
"text": "Table 5",
"ref_id": null
},
{
"start": 1181,
"end": 1188,
"text": "Table 5",
"ref_id": null
}
],
"eq_spans": [],
"section": "Performance Evaluation Results",
"sec_num": "4.2"
},
{
"text": "In this article, we address the AKE task via the distribution-based modeling of the adjacency matrix that corresponds to various versions of the graph-of-words for a target document. More specifically, we propose capitalizing on unsupervised learning algorithms for the distribution-based modeling and scoring of the candidate words. Based on our performance evaluation, the IF approach shows the best effectiveness results in almost all datasets, concerning the F 1 score determining the number of keywords in document level. There are many interesting future research directions, such as i) improving the scoring functions of the unsupervised learning approaches used in the context of the keyword extraction task, ii) adapting the proposed approach to the keyphrase extraction task , iii) developing novel distributionbased modeling methods that simultaneously utilize the information from one/multiple adjacency matrices , and iv) applying the adjacency matrix's distribution-based modeling in other tasks where only graph-based methods are used to date.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusions and Future Work",
"sec_num": "5"
},
{
"text": "https://github.com/epapagia/KE_ adjacency_matrix_modelling",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "https://scikit-learn.org/stable/index. html 4 F is a dot product space such that the dot product in the image of \u03a6 can be computed by evaluating some kernel.5 This distance is equal to \u03c1 ||w|| . 6 i.e., \u03c1 and w solve the problem.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "The path length of a point x is measured by the number of edges x traverses an isolation tree from the root node until the traversal is terminated at an external node.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "https://scikit-learn.org/stable/index. html 9 https://networkx.org/ 10 https://github.com/GuillaumeDD/gowpy",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "value for the \"natural\" threshold of outliers for IF, see Section 3.3.2",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
}
],
"back_matter": [],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "Fast algorithms for determining (generalized) core groups in social networks",
"authors": [
{
"first": "Vladimir",
"middle": [],
"last": "Batagelj",
"suffix": ""
},
{
"first": "Matjaz",
"middle": [],
"last": "Zaversnik",
"suffix": ""
}
],
"year": 2011,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"DOI": [
"10.1007/s11634-010-0079-y"
]
},
"num": null,
"urls": [],
"raw_text": "Vladimir Batagelj and Matjaz Zaversnik. 2011. Fast al- gorithms for determining (generalized) core groups in social networks.",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "Simple unsupervised keyphrase extraction using sentence embeddings",
"authors": [
{
"first": "Kamil",
"middle": [],
"last": "Bennani-Smires",
"suffix": ""
},
{
"first": "Claudiu",
"middle": [],
"last": "Musat",
"suffix": ""
},
{
"first": "Andreea",
"middle": [],
"last": "Hossmann",
"suffix": ""
},
{
"first": "Michael",
"middle": [],
"last": "Baeriswyl",
"suffix": ""
},
{
"first": "Martin",
"middle": [],
"last": "Jaggi",
"suffix": ""
}
],
"year": 2018,
"venue": "Proceedings of the 22nd Conference on Computational Natural Language Learn",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"DOI": [
"10.18653/v1/K18-1022"
]
},
"num": null,
"urls": [],
"raw_text": "Kamil Bennani-Smires, Claudiu Musat, Andreea Hoss- mann, Michael Baeriswyl, and Martin Jaggi. 2018. Simple unsupervised keyphrase extraction using sen- tence embeddings. In Proceedings of the 22nd Con- ference on Computational Natural Language Learn-",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "A graph based keyword extraction model using collective node weight",
"authors": [
{
"first": "K",
"middle": [],
"last": "Saroj",
"suffix": ""
},
{
"first": "Monali",
"middle": [],
"last": "Biswas",
"suffix": ""
},
{
"first": "Jacob",
"middle": [],
"last": "Bordoloi",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Shreya",
"suffix": ""
}
],
"year": 2018,
"venue": "Expert Syst. Appl",
"volume": "97",
"issue": "",
"pages": "51--59",
"other_ids": {
"DOI": [
"10.1016/j.eswa.2017.12.025"
]
},
"num": null,
"urls": [],
"raw_text": "Saroj K. Biswas, Monali Bordoloi, and Jacob Shreya. 2018. A graph based keyword extraction model using collective node weight. Expert Syst. Appl., 97:51-59.",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "Enriching word vectors with subword information",
"authors": [
{
"first": "Piotr",
"middle": [],
"last": "Bojanowski",
"suffix": ""
},
{
"first": "Edouard",
"middle": [],
"last": "Grave",
"suffix": ""
},
{
"first": "Armand",
"middle": [],
"last": "Joulin",
"suffix": ""
},
{
"first": "Tomas",
"middle": [],
"last": "Mikolov",
"suffix": ""
}
],
"year": 2017,
"venue": "Transactions of the Association for Computational Linguistics",
"volume": "5",
"issue": "",
"pages": "135--146",
"other_ids": {
"DOI": [
"10.1162/tacl_a_00051"
]
},
"num": null,
"urls": [],
"raw_text": "Piotr Bojanowski, Edouard Grave, Armand Joulin, and Tomas Mikolov. 2017. Enriching word vectors with subword information. Transactions of the Associa- tion for Computational Linguistics, 5:135-146.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "pke: an open source pythonbased keyphrase extraction toolkit",
"authors": [
{
"first": "Florian",
"middle": [],
"last": "Boudin",
"suffix": ""
}
],
"year": 2016,
"venue": "Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: System Demonstrations",
"volume": "",
"issue": "",
"pages": "69--73",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Florian Boudin. 2016. pke: an open source python- based keyphrase extraction toolkit. In Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: System Demonstra- tions, pages 69-73, Osaka, Japan. The COLING 2016 Organizing Committee.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "TopicRank: Graph-based topic ranking for keyphrase extraction",
"authors": [
{
"first": "Adrien",
"middle": [],
"last": "Bougouin",
"suffix": ""
},
{
"first": "Florian",
"middle": [],
"last": "Boudin",
"suffix": ""
},
{
"first": "B\u00e9atrice",
"middle": [],
"last": "Daille",
"suffix": ""
}
],
"year": 2013,
"venue": "Proceedings of the Sixth International Joint Conference on Natural Language Processing",
"volume": "",
"issue": "",
"pages": "543--551",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Adrien Bougouin, Florian Boudin, and B\u00e9atrice Daille. 2013. TopicRank: Graph-based topic ranking for keyphrase extraction. In Proceedings of the Sixth In- ternational Joint Conference on Natural Language Processing, pages 543-551, Nagoya, Japan. Asian Federation of Natural Language Processing.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "The anatomy of a large-scale hypertextual web search engine. Comput. Networks",
"authors": [
{
"first": "Sergey",
"middle": [],
"last": "Brin",
"suffix": ""
},
{
"first": "Lawrence",
"middle": [],
"last": "Page",
"suffix": ""
}
],
"year": 1998,
"venue": "",
"volume": "30",
"issue": "",
"pages": "107--117",
"other_ids": {
"DOI": [
"10.1016/S0169-7552(98)00110-X"
]
},
"num": null,
"urls": [],
"raw_text": "Sergey Brin and Lawrence Page. 1998. The anatomy of a large-scale hypertextual web search engine. Com- put. Networks, 30(1-7):107-117.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "Citationenhanced keyphrase extraction from research papers: A supervised approach",
"authors": [
{
"first": "Cornelia",
"middle": [],
"last": "Caragea",
"suffix": ""
},
{
"first": "Adrian",
"middle": [],
"last": "Florin",
"suffix": ""
},
{
"first": "Andreea",
"middle": [],
"last": "Bulgarov",
"suffix": ""
},
{
"first": "Sujatha Das",
"middle": [],
"last": "Godea",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Gollapalli",
"suffix": ""
}
],
"year": 2014,
"venue": "Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP)",
"volume": "",
"issue": "",
"pages": "1435--1446",
"other_ids": {
"DOI": [
"10.3115/v1/D14-1150"
]
},
"num": null,
"urls": [],
"raw_text": "Cornelia Caragea, Florin Adrian Bulgarov, Andreea Godea, and Sujatha Das Gollapalli. 2014. Citation- enhanced keyphrase extraction from research pa- pers: A supervised approach. In Proceedings of the 2014 Conference on Empirical Methods in Nat- ural Language Processing (EMNLP), pages 1435- 1446, Doha, Qatar. Association for Computational Linguistics.",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "Neural keyphrase generation via reinforcement learning with adaptive rewards",
"authors": [
{
"first": "Wang",
"middle": [],
"last": "Hou Pong Chan",
"suffix": ""
},
{
"first": "Lu",
"middle": [],
"last": "Chen",
"suffix": ""
},
{
"first": "Irwin",
"middle": [],
"last": "Wang",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "King",
"suffix": ""
}
],
"year": 2019,
"venue": "Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "2163--2174",
"other_ids": {
"DOI": [
"10.18653/v1/P19-1208"
]
},
"num": null,
"urls": [],
"raw_text": "Hou Pong Chan, Wang Chen, Lu Wang, and Irwin King. 2019. Neural keyphrase generation via reinforce- ment learning with adaptive rewards. In Proceed- ings of the 57th Annual Meeting of the Association for Computational Linguistics, pages 2163-2174, Florence, Italy. Association for Computational Lin- guistics.",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "Exclusive hierarchical decoding for deep keyphrase generation",
"authors": [
{
"first": "Wang",
"middle": [],
"last": "Chen",
"suffix": ""
},
{
"first": "Piji",
"middle": [],
"last": "Hou Pong Chan",
"suffix": ""
},
{
"first": "Irwin",
"middle": [],
"last": "Li",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "King",
"suffix": ""
}
],
"year": 2020,
"venue": "Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "1095--1105",
"other_ids": {
"DOI": [
"10.18653/v1/2020.acl-main.103"
]
},
"num": null,
"urls": [],
"raw_text": "Wang Chen, Hou Pong Chan, Piji Li, and Irwin King. 2020. Exclusive hierarchical decoding for deep keyphrase generation. In Proceedings of the 58th Annual Meeting of the Association for Computa- tional Linguistics, pages 1095-1105, Online. Asso- ciation for Computational Linguistics.",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"title": "Trusses: Cohesive subgraphs for social network analysis",
"authors": [
{
"first": "Jonathan",
"middle": [],
"last": "Cohen",
"suffix": ""
}
],
"year": 2008,
"venue": "National security agency technical report",
"volume": "16",
"issue": "",
"pages": "3--29",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Jonathan Cohen. 2008. Trusses: Cohesive subgraphs for social network analysis. National security agency technical report, 16:3-29.",
"links": null
},
"BIBREF12": {
"ref_id": "b12",
"title": "Supportvector networks",
"authors": [
{
"first": "Corinna",
"middle": [],
"last": "Cortes",
"suffix": ""
},
{
"first": "Vladimir",
"middle": [],
"last": "Vapnik",
"suffix": ""
}
],
"year": 1995,
"venue": "Mach. Learn",
"volume": "20",
"issue": "3",
"pages": "273--297",
"other_ids": {
"DOI": [
"10.1007/BF00994018"
]
},
"num": null,
"urls": [],
"raw_text": "Corinna Cortes and Vladimir Vapnik. 1995. Support- vector networks. Mach. Learn., 20(3):273-297.",
"links": null
},
"BIBREF13": {
"ref_id": "b13",
"title": "Position-Rank: An unsupervised approach to keyphrase extraction from scholarly documents",
"authors": [
{
"first": "Corina",
"middle": [],
"last": "Florescu",
"suffix": ""
},
{
"first": "Cornelia",
"middle": [],
"last": "Caragea",
"suffix": ""
}
],
"year": 2017,
"venue": "Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics",
"volume": "1",
"issue": "",
"pages": "1105--1115",
"other_ids": {
"DOI": [
"10.18653/v1/P17-1102"
]
},
"num": null,
"urls": [],
"raw_text": "Corina Florescu and Cornelia Caragea. 2017. Position- Rank: An unsupervised approach to keyphrase ex- traction from scholarly documents. In Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), pages 1105-1115, Vancouver, Canada. Association for Computational Linguistics.",
"links": null
},
"BIBREF14": {
"ref_id": "b14",
"title": "Extracting keyphrases from research papers using citation networks",
"authors": [
{
"first": "Cornelia",
"middle": [],
"last": "Sujatha Das Gollapalli",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Caragea",
"suffix": ""
}
],
"year": 2014,
"venue": "Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence",
"volume": "",
"issue": "",
"pages": "1629--1635",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Sujatha Das Gollapalli and Cornelia Caragea. 2014. Extracting keyphrases from research papers using citation networks. In Proceedings of the Twenty- Eighth AAAI Conference on Artificial Intelligence, July 27 -31, 2014, Qu\u00e9bec City, Qu\u00e9bec, Canada, pages 1629-1635. AAAI Press.",
"links": null
},
"BIBREF15": {
"ref_id": "b15",
"title": "Incorporating expert knowledge into keyphrase extraction",
"authors": [
{
"first": "Xiaoli",
"middle": [],
"last": "Sujatha Das Gollapalli",
"suffix": ""
},
{
"first": "Peng",
"middle": [],
"last": "Li",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Yang",
"suffix": ""
}
],
"year": 2017,
"venue": "Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence",
"volume": "",
"issue": "",
"pages": "3180--3187",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Sujatha Das Gollapalli, Xiaoli Li, and Peng Yang. 2017. Incorporating expert knowledge into keyphrase ex- traction. In Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, February 4-9, 2017, San Francisco, California, USA, pages 3180- 3187. AAAI Press.",
"links": null
},
"BIBREF16": {
"ref_id": "b16",
"title": "Automatic keyphrase extraction: A survey of the state of the art",
"authors": [
{
"first": "Saidul",
"middle": [],
"last": "Kazi",
"suffix": ""
},
{
"first": "Vincent",
"middle": [],
"last": "Hasan",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Ng",
"suffix": ""
}
],
"year": 2014,
"venue": "Proceedings of the 52nd Annual Meeting of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "1262--1273",
"other_ids": {
"DOI": [
"10.3115/v1/P14-1119"
]
},
"num": null,
"urls": [],
"raw_text": "Kazi Saidul Hasan and Vincent Ng. 2014. Automatic keyphrase extraction: A survey of the state of the art. In Proceedings of the 52nd Annual Meeting of the Association for Computational Linguistics (Vol- ume 1: Long Papers), pages 1262-1273, Baltimore, Maryland. Association for Computational Linguis- tics.",
"links": null
},
"BIBREF17": {
"ref_id": "b17",
"title": "Bag of tricks for efficient text classification",
"authors": [
{
"first": "Armand",
"middle": [],
"last": "Joulin",
"suffix": ""
},
{
"first": "Edouard",
"middle": [],
"last": "Grave",
"suffix": ""
},
{
"first": "Piotr",
"middle": [],
"last": "Bojanowski",
"suffix": ""
},
{
"first": "Tomas",
"middle": [],
"last": "Mikolov",
"suffix": ""
}
],
"year": 2017,
"venue": "Proceedings of the 15th Conference of the European Chapter",
"volume": "2",
"issue": "",
"pages": "427--431",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Armand Joulin, Edouard Grave, Piotr Bojanowski, and Tomas Mikolov. 2017. Bag of tricks for efficient text classification. In Proceedings of the 15th Con- ference of the European Chapter of the Association for Computational Linguistics: Volume 2, Short Pa- pers, pages 427-431, Valencia, Spain. Association for Computational Linguistics.",
"links": null
},
"BIBREF18": {
"ref_id": "b18",
"title": "SemEval-2010 task 5 : Automatic keyphrase extraction from scientific articles",
"authors": [
{
"first": "Nam",
"middle": [],
"last": "Su",
"suffix": ""
},
{
"first": "Olena",
"middle": [],
"last": "Kim",
"suffix": ""
},
{
"first": "Min-Yen",
"middle": [],
"last": "Medelyan",
"suffix": ""
},
{
"first": "Timothy",
"middle": [],
"last": "Kan",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Baldwin",
"suffix": ""
}
],
"year": 2010,
"venue": "Proceedings of the 5th International Workshop on Semantic Evaluation",
"volume": "",
"issue": "",
"pages": "21--26",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Su Nam Kim, Olena Medelyan, Min-Yen Kan, and Timothy Baldwin. 2010. SemEval-2010 task 5 : Au- tomatic keyphrase extraction from scientific articles. In Proceedings of the 5th International Workshop on Semantic Evaluation, pages 21-26, Uppsala, Swe- den. Association for Computational Linguistics.",
"links": null
},
"BIBREF19": {
"ref_id": "b19",
"title": "Authoritative sources in a hyperlinked environment",
"authors": [
{
"first": "Jon",
"middle": [
"M"
],
"last": "Kleinberg",
"suffix": ""
}
],
"year": 1999,
"venue": "J. ACM",
"volume": "46",
"issue": "5",
"pages": "604--632",
"other_ids": {
"DOI": [
"10.1145/324133.324140"
]
},
"num": null,
"urls": [],
"raw_text": "Jon M. Kleinberg. 1999. Authoritative sources in a hy- perlinked environment. J. ACM, 46(5):604-632.",
"links": null
},
"BIBREF20": {
"ref_id": "b20",
"title": "Large dataset for keyphrases extraction",
"authors": [
{
"first": "Mikalai",
"middle": [],
"last": "Krapivin",
"suffix": ""
},
{
"first": "Aliaksandr",
"middle": [],
"last": "Autayeu",
"suffix": ""
},
{
"first": "Maurizio",
"middle": [],
"last": "Marchese",
"suffix": ""
}
],
"year": 2008,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Mikalai Krapivin, Aliaksandr Autayeu, and Maurizio Marchese. 2008. Large dataset for keyphrases ex- traction. In Technical Report DISI-09-055. Trento, Italy.",
"links": null
},
"BIBREF21": {
"ref_id": "b21",
"title": "Isolation forest",
"authors": [
{
"first": "Tony",
"middle": [],
"last": "Fei",
"suffix": ""
},
{
"first": "Kai",
"middle": [
"Ming"
],
"last": "Liu",
"suffix": ""
},
{
"first": "Zhi-Hua",
"middle": [],
"last": "Ting",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Zhou",
"suffix": ""
}
],
"year": 2008,
"venue": "Proceedings of the 8th IEEE International Conference on Data Mining (ICDM 2008)",
"volume": "",
"issue": "",
"pages": "413--422",
"other_ids": {
"DOI": [
"10.1109/ICDM.2008.17"
]
},
"num": null,
"urls": [],
"raw_text": "Fei Tony Liu, Kai Ming Ting, and Zhi-Hua Zhou. 2008. Isolation forest. In Proceedings of the 8th IEEE International Conference on Data Mining (ICDM 2008), December 15-19, 2008, Pisa, Italy, pages 413-422. IEEE Computer Society.",
"links": null
},
"BIBREF22": {
"ref_id": "b22",
"title": "Isolation-based anomaly detection",
"authors": [
{
"first": "Tony",
"middle": [],
"last": "Fei",
"suffix": ""
},
{
"first": "Kai",
"middle": [
"Ming"
],
"last": "Liu",
"suffix": ""
},
{
"first": "Zhi-Hua",
"middle": [],
"last": "Ting",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Zhou",
"suffix": ""
}
],
"year": 2012,
"venue": "ACM Trans. Knowl. Discov. Data",
"volume": "6",
"issue": "1",
"pages": "",
"other_ids": {
"DOI": [
"10.1145/2133360.2133363"
]
},
"num": null,
"urls": [],
"raw_text": "Fei Tony Liu, Kai Ming Ting, and Zhi-Hua Zhou. 2012. Isolation-based anomaly detection. ACM Trans. Knowl. Discov. Data, 6(1):3:1-3:39.",
"links": null
},
"BIBREF23": {
"ref_id": "b23",
"title": "Key2Vec: Automatic ranked keyphrase extraction from scientific articles using phrase embeddings",
"authors": [
{
"first": "Debanjan",
"middle": [],
"last": "Mahata",
"suffix": ""
},
{
"first": "John",
"middle": [],
"last": "Kuriakose",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Rajiv Ratn",
"suffix": ""
},
{
"first": "Roger",
"middle": [],
"last": "Shah",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Zimmermann",
"suffix": ""
}
],
"year": 2018,
"venue": "Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies",
"volume": "2",
"issue": "",
"pages": "634--639",
"other_ids": {
"DOI": [
"10.18653/v1/N18-2100"
]
},
"num": null,
"urls": [],
"raw_text": "Debanjan Mahata, John Kuriakose, Rajiv Ratn Shah, and Roger Zimmermann. 2018. Key2Vec: Auto- matic ranked keyphrase extraction from scientific ar- ticles using phrase embeddings. In Proceedings of the 2018 Conference of the North American Chap- ter of the Association for Computational Linguistics: Human Language Technologies, Volume 2 (Short Pa- pers), pages 634-639, New Orleans, Louisiana. As- sociation for Computational Linguistics.",
"links": null
},
"BIBREF24": {
"ref_id": "b24",
"title": "Deep keyphrase generation",
"authors": [
{
"first": "Rui",
"middle": [],
"last": "Meng",
"suffix": ""
},
{
"first": "Sanqiang",
"middle": [],
"last": "Zhao",
"suffix": ""
},
{
"first": "Shuguang",
"middle": [],
"last": "Han",
"suffix": ""
},
{
"first": "Daqing",
"middle": [],
"last": "He",
"suffix": ""
},
{
"first": "Peter",
"middle": [],
"last": "Brusilovsky",
"suffix": ""
},
{
"first": "Yu",
"middle": [],
"last": "Chi",
"suffix": ""
}
],
"year": 2017,
"venue": "Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics",
"volume": "1",
"issue": "",
"pages": "582--592",
"other_ids": {
"DOI": [
"10.18653/v1/P17-1054"
]
},
"num": null,
"urls": [],
"raw_text": "Rui Meng, Sanqiang Zhao, Shuguang Han, Daqing He, Peter Brusilovsky, and Yu Chi. 2017. Deep keyphrase generation. In Proceedings of the 55th Annual Meeting of the Association for Computa- tional Linguistics (Volume 1: Long Papers), pages 582-592, Vancouver, Canada. Association for Com- putational Linguistics.",
"links": null
},
"BIBREF25": {
"ref_id": "b25",
"title": "TextRank: Bringing order into text",
"authors": [
{
"first": "Rada",
"middle": [],
"last": "Mihalcea",
"suffix": ""
},
{
"first": "Paul",
"middle": [],
"last": "Tarau",
"suffix": ""
}
],
"year": 2004,
"venue": "Proceedings of the 2004 Conference on Empirical Methods in Natural Language Processing",
"volume": "",
"issue": "",
"pages": "404--411",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Rada Mihalcea and Paul Tarau. 2004. TextRank: Bringing order into text. In Proceedings of the 2004 Conference on Empirical Methods in Natural Lan- guage Processing, pages 404-411, Barcelona, Spain. Association for Computational Linguistics.",
"links": null
},
"BIBREF26": {
"ref_id": "b26",
"title": "Efficient estimation of word representations in vector space",
"authors": [
{
"first": "Tomas",
"middle": [],
"last": "Mikolov",
"suffix": ""
},
{
"first": "Kai",
"middle": [],
"last": "Chen",
"suffix": ""
},
{
"first": "Greg",
"middle": [],
"last": "Corrado",
"suffix": ""
},
{
"first": "Jeffrey",
"middle": [],
"last": "Dean",
"suffix": ""
}
],
"year": 2013,
"venue": "1st International Conference on Learning Representations",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Tomas Mikolov, Kai Chen, Greg Corrado, and Jeffrey Dean. 2013. Efficient estimation of word represen- tations in vector space. In 1st International Con- ference on Learning Representations, ICLR 2013, Scottsdale, Arizona, USA, May 2-4, 2013, Workshop Track Proceedings.",
"links": null
},
"BIBREF27": {
"ref_id": "b27",
"title": "Three new graphical models for statistical language modelling",
"authors": [
{
"first": "Andriy",
"middle": [],
"last": "Mnih",
"suffix": ""
},
{
"first": "Geoffrey",
"middle": [
"E"
],
"last": "Hinton",
"suffix": ""
}
],
"year": 2007,
"venue": "Machine Learning, Proceedings of the Twenty-Fourth International Conference (ICML 2007), Corvallis",
"volume": "227",
"issue": "",
"pages": "641--648",
"other_ids": {
"DOI": [
"10.1145/1273496.1273577"
]
},
"num": null,
"urls": [],
"raw_text": "Andriy Mnih and Geoffrey E. Hinton. 2007. Three new graphical models for statistical language modelling. In Machine Learning, Proceedings of the Twenty- Fourth International Conference (ICML 2007), Cor- vallis, Oregon, USA, June 20-24, 2007, volume 227 of ACM International Conference Proceeding Se- ries, pages 641-648. ACM.",
"links": null
},
"BIBREF28": {
"ref_id": "b28",
"title": "Keyphrase extraction in scientific publications",
"authors": [
{
"first": "Thuy",
"middle": [
"Dung"
],
"last": "Nguyen",
"suffix": ""
},
{
"first": "Min-Yen",
"middle": [],
"last": "Kan",
"suffix": ""
}
],
"year": 2007,
"venue": "Asian Digital Libraries. Looking Back 10 Years and Forging New Frontiers, 10th International Conference on Asian Digital Libraries",
"volume": "4822",
"issue": "",
"pages": "317--326",
"other_ids": {
"DOI": [
"10.1007/978-3-540-77094-7_41"
]
},
"num": null,
"urls": [],
"raw_text": "Thuy Dung Nguyen and Min-Yen Kan. 2007. Keyphrase extraction in scientific publications. In Asian Digital Libraries. Looking Back 10 Years and Forging New Frontiers, 10th International Con- ference on Asian Digital Libraries, ICADL 2007, Hanoi, Vietnam, December 10-13, 2007, Proceed- ings, volume 4822 of Lecture Notes in Computer Sci- ence, pages 317-326. Springer.",
"links": null
},
"BIBREF29": {
"ref_id": "b29",
"title": "Unsupervised learning of sentence embeddings using compositional n-gram features",
"authors": [
{
"first": "Matteo",
"middle": [],
"last": "Pagliardini",
"suffix": ""
},
{
"first": "Prakhar",
"middle": [],
"last": "Gupta",
"suffix": ""
},
{
"first": "Martin",
"middle": [],
"last": "Jaggi",
"suffix": ""
}
],
"year": 2018,
"venue": "Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies",
"volume": "",
"issue": "",
"pages": "528--540",
"other_ids": {
"DOI": [
"10.18653/v1/N18-1049"
]
},
"num": null,
"urls": [],
"raw_text": "Matteo Pagliardini, Prakhar Gupta, and Martin Jaggi. 2018. Unsupervised learning of sentence embed- dings using compositional n-gram features. In Pro- ceedings of the 2018 Conference of the North Amer- ican Chapter of the Association for Computational Linguistics: Human Language Technologies, Vol- ume 1 (Long Papers), pages 528-540, New Orleans, Louisiana. Association for Computational Linguis- tics.",
"links": null
},
"BIBREF30": {
"ref_id": "b30",
"title": "Local word vectors guiding keyphrase extraction",
"authors": [
{
"first": "Eirini",
"middle": [],
"last": "Papagiannopoulou",
"suffix": ""
},
{
"first": "Grigorios",
"middle": [],
"last": "Tsoumakas",
"suffix": ""
}
],
"year": 2018,
"venue": "Inf. Process. Manag",
"volume": "54",
"issue": "6",
"pages": "888--902",
"other_ids": {
"DOI": [
"10.1016/j.ipm.2018.06.004"
]
},
"num": null,
"urls": [],
"raw_text": "Eirini Papagiannopoulou and Grigorios Tsoumakas. 2018. Local word vectors guiding keyphrase extrac- tion. Inf. Process. Manag., 54(6):888-902.",
"links": null
},
"BIBREF31": {
"ref_id": "b31",
"title": "A review of keyphrase extraction",
"authors": [
{
"first": "Eirini",
"middle": [],
"last": "Papagiannopoulou",
"suffix": ""
},
{
"first": "Grigorios",
"middle": [],
"last": "Tsoumakas",
"suffix": ""
}
],
"year": 2020,
"venue": "Wiley Interdiscip. Rev. Data Min. Knowl. Discov",
"volume": "10",
"issue": "2",
"pages": "",
"other_ids": {
"DOI": [
"10.1002/widm.1339"
]
},
"num": null,
"urls": [],
"raw_text": "Eirini Papagiannopoulou and Grigorios Tsoumakas. 2020. A review of keyphrase extraction. Wiley In- terdiscip. Rev. Data Min. Knowl. Discov., 10(2).",
"links": null
},
"BIBREF32": {
"ref_id": "b32",
"title": "Keywords lie far from the mean of all words in local vector space",
"authors": [
{
"first": "Eirini",
"middle": [],
"last": "Papagiannopoulou",
"suffix": ""
},
{
"first": "Grigorios",
"middle": [],
"last": "Tsoumakas",
"suffix": ""
},
{
"first": "Apostolos",
"middle": [
"N"
],
"last": "Papadopoulos",
"suffix": ""
}
],
"year": 2020,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"arXiv": [
"arXiv:2008.09513"
]
},
"num": null,
"urls": [],
"raw_text": "Eirini Papagiannopoulou, Grigorios Tsoumakas, and Apostolos N Papadopoulos. 2020. Keywords lie far from the mean of all words in local vector space. arXiv preprint arXiv:2008.09513.",
"links": null
},
"BIBREF33": {
"ref_id": "b33",
"title": "GloVe: Global vectors for word representation",
"authors": [
{
"first": "Jeffrey",
"middle": [],
"last": "Pennington",
"suffix": ""
},
{
"first": "Richard",
"middle": [],
"last": "Socher",
"suffix": ""
},
{
"first": "Christopher",
"middle": [],
"last": "Manning",
"suffix": ""
}
],
"year": 2014,
"venue": "Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP)",
"volume": "",
"issue": "",
"pages": "1532--1543",
"other_ids": {
"DOI": [
"10.3115/v1/D14-1162"
]
},
"num": null,
"urls": [],
"raw_text": "Jeffrey Pennington, Richard Socher, and Christopher Manning. 2014. GloVe: Global vectors for word representation. In Proceedings of the 2014 Confer- ence on Empirical Methods in Natural Language Processing (EMNLP), pages 1532-1543, Doha, Qatar. Association for Computational Linguistics.",
"links": null
},
"BIBREF34": {
"ref_id": "b34",
"title": "Data Structures and Algorithms with Object-Oriented Design Patterns in Java",
"authors": [
{
"first": "R",
"middle": [],
"last": "Bruno",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Preiss",
"suffix": ""
}
],
"year": 2000,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Bruno R. Preiss. 2000. Data Structures and Algorithms with Object-Oriented Design Patterns in Java. John Wiley & Sons Incorporated.",
"links": null
},
"BIBREF35": {
"ref_id": "b35",
"title": "Automatic keyword extraction from individual documents",
"authors": [
{
"first": "Stuart",
"middle": [],
"last": "Rose",
"suffix": ""
},
{
"first": "Dave",
"middle": [],
"last": "Engel",
"suffix": ""
},
{
"first": "Nick",
"middle": [],
"last": "Cramer",
"suffix": ""
},
{
"first": "Wendy",
"middle": [],
"last": "Cowley",
"suffix": ""
}
],
"year": 2010,
"venue": "Text mining: applications and theory",
"volume": "1",
"issue": "",
"pages": "1--20",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Stuart Rose, Dave Engel, Nick Cramer, and Wendy Cowley. 2010. Automatic keyword extraction from individual documents. Text mining: applications and theory, 1:1-20.",
"links": null
},
"BIBREF36": {
"ref_id": "b36",
"title": "Main core retention on graph-of-words for singledocument keyword extraction",
"authors": [
{
"first": "Fran\u00e7ois",
"middle": [],
"last": "Rousseau",
"suffix": ""
},
{
"first": "Michalis",
"middle": [],
"last": "Vazirgiannis",
"suffix": ""
}
],
"year": 2015,
"venue": "Advances in Information Retrieval -37th European Conference on IR Research",
"volume": "9022",
"issue": "",
"pages": "382--393",
"other_ids": {
"DOI": [
"10.1007/978-3-319-16354-3_42"
]
},
"num": null,
"urls": [],
"raw_text": "Fran\u00e7ois Rousseau and Michalis Vazirgiannis. 2015. Main core retention on graph-of-words for single- document keyword extraction. In Advances in Infor- mation Retrieval -37th European Conference on IR Research, ECIR 2015, Vienna, Austria, March 29 - April 2, 2015. Proceedings, volume 9022 of Lecture Notes in Computer Science, pages 382-393.",
"links": null
},
"BIBREF37": {
"ref_id": "b37",
"title": "Support vector method for novelty detection",
"authors": [
{
"first": "Bernhard",
"middle": [],
"last": "Sch\u00f6lkopf",
"suffix": ""
},
{
"first": "Robert",
"middle": [
"C"
],
"last": "Williamson",
"suffix": ""
},
{
"first": "Alexander",
"middle": [
"J"
],
"last": "Smola",
"suffix": ""
},
{
"first": "John",
"middle": [],
"last": "Shawe-Taylor",
"suffix": ""
},
{
"first": "John",
"middle": [
"C"
],
"last": "Platt",
"suffix": ""
}
],
"year": 1999,
"venue": "Advances in Neural Information Processing Systems 12",
"volume": "",
"issue": "",
"pages": "582--588",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Bernhard Sch\u00f6lkopf, Robert C. Williamson, Alexan- der J. Smola, John Shawe-Taylor, and John C. Platt. 1999. Support vector method for novelty detection. In Advances in Neural Information Processing Sys- tems 12, [NIPS Conference, Denver, Colorado, USA, November 29 -December 4, 1999], pages 582-588. The MIT Press.",
"links": null
},
"BIBREF38": {
"ref_id": "b38",
"title": "Network structure and minimum degree",
"authors": [
{
"first": "B",
"middle": [],
"last": "Stephen",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Seidman",
"suffix": ""
}
],
"year": 1983,
"venue": "Social networks",
"volume": "5",
"issue": "3",
"pages": "269--287",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Stephen B Seidman. 1983. Network structure and min- imum degree. Social networks, 5(3):269-287.",
"links": null
},
"BIBREF39": {
"ref_id": "b39",
"title": "Data domain description using support vectors",
"authors": [
{
"first": "M",
"middle": [
"J"
],
"last": "David",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Tax",
"suffix": ""
},
{
"first": "P",
"middle": [
"W"
],
"last": "Robert",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Duin",
"suffix": ""
}
],
"year": 1999,
"venue": "ESANN 1999, 7th European Symposium on Artificial Neural Networks",
"volume": "",
"issue": "",
"pages": "251--256",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "David M. J. Tax and Robert P. W. Duin. 1999a. Data domain description using support vectors. In ESANN 1999, 7th European Symposium on Artifi- cial Neural Networks, Bruges, Belgium, April 21-23, 1999, Proceedings, pages 251-256.",
"links": null
},
"BIBREF40": {
"ref_id": "b40",
"title": "Support vector domain description",
"authors": [
{
"first": "M",
"middle": [
"J"
],
"last": "David",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Tax",
"suffix": ""
},
{
"first": "P",
"middle": [
"W"
],
"last": "Robert",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Duin",
"suffix": ""
}
],
"year": 1999,
"venue": "Pattern Recognit. Lett",
"volume": "20",
"issue": "",
"pages": "1191--1199",
"other_ids": {
"DOI": [
"10.1016/S0167-8655(99)00087-2"
]
},
"num": null,
"urls": [],
"raw_text": "David M. J. Tax and Robert P. W. Duin. 1999b. Support vector domain description. Pattern Recognit. Lett., 20(11-13):1191-1199.",
"links": null
},
"BIBREF41": {
"ref_id": "b41",
"title": "A graph degeneracy-based approach to keyword extraction",
"authors": [
{
"first": "Antoine",
"middle": [],
"last": "Tixier",
"suffix": ""
},
{
"first": "Fragkiskos",
"middle": [],
"last": "Malliaros",
"suffix": ""
},
{
"first": "Michalis",
"middle": [],
"last": "Vazirgiannis",
"suffix": ""
}
],
"year": 2016,
"venue": "Proceedings of the 2016 Conference on Empirical Methods in Natural Language Processing",
"volume": "",
"issue": "",
"pages": "1860--1870",
"other_ids": {
"DOI": [
"10.18653/v1/D16-1191"
]
},
"num": null,
"urls": [],
"raw_text": "Antoine Tixier, Fragkiskos Malliaros, and Michalis Vazirgiannis. 2016. A graph degeneracy-based ap- proach to keyword extraction. In Proceedings of the 2016 Conference on Empirical Methods in Natu- ral Language Processing, pages 1860-1870, Austin, Texas. Association for Computational Linguistics.",
"links": null
},
"BIBREF42": {
"ref_id": "b42",
"title": "A multi-centrality index for graph-based keyword extraction",
"authors": [
{
"first": "Augusto",
"middle": [],
"last": "Didier",
"suffix": ""
},
{
"first": "Pedro",
"middle": [
"Spoljaric"
],
"last": "Vega-Oliveros",
"suffix": ""
},
{
"first": "Evangelos",
"middle": [
"E"
],
"last": "Gomes",
"suffix": ""
},
{
"first": "Lilian",
"middle": [],
"last": "Milios",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Berton",
"suffix": ""
}
],
"year": 2019,
"venue": "Inf. Process. Manag",
"volume": "",
"issue": "6",
"pages": "",
"other_ids": {
"DOI": [
"10.1016/j.ipm.2019.102063"
]
},
"num": null,
"urls": [],
"raw_text": "Didier Augusto Vega-Oliveros, Pedro Spoljaric Gomes, Evangelos E. Milios, and Lilian Berton. 2019. A multi-centrality index for graph-based keyword ex- traction. Inf. Process. Manag., 56(6).",
"links": null
},
"BIBREF43": {
"ref_id": "b43",
"title": "Col-labRank: Towards a collaborative approach to single-document keyphrase extraction",
"authors": [
{
"first": "Xiaojun",
"middle": [],
"last": "Wan",
"suffix": ""
},
{
"first": "Jianguo",
"middle": [],
"last": "Xiao",
"suffix": ""
}
],
"year": 2008,
"venue": "Proceedings of the 22nd International Conference on Computational Linguistics",
"volume": "",
"issue": "",
"pages": "969--976",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Xiaojun Wan and Jianguo Xiao. 2008a. Col- labRank: Towards a collaborative approach to single-document keyphrase extraction. In Proceed- ings of the 22nd International Conference on Com- putational Linguistics (Coling 2008), pages 969- 976, Manchester, UK. Coling 2008 Organizing Com- mittee.",
"links": null
},
"BIBREF44": {
"ref_id": "b44",
"title": "Single document keyphrase extraction using neighborhood knowledge",
"authors": [
{
"first": "Xiaojun",
"middle": [],
"last": "Wan",
"suffix": ""
},
{
"first": "Jianguo",
"middle": [],
"last": "Xiao",
"suffix": ""
}
],
"year": 2008,
"venue": "Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, AAAI 2008",
"volume": "",
"issue": "",
"pages": "855--860",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Xiaojun Wan and Jianguo Xiao. 2008b. Single document keyphrase extraction using neighborhood knowledge. In Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, AAAI 2008, Chicago, Illinois, USA, July 13-17, 2008, pages 855-860. AAAI Press.",
"links": null
},
"BIBREF45": {
"ref_id": "b45",
"title": "PKU_ICL at SemEval-2017 task 10: Keyphrase extraction with model ensemble and external knowledge",
"authors": [
{
"first": "Liang",
"middle": [],
"last": "Wang",
"suffix": ""
},
{
"first": "Sujian",
"middle": [],
"last": "Li",
"suffix": ""
}
],
"year": 2017,
"venue": "Proceedings of the 11th International Workshop on Semantic Evaluation (SemEval-2017)",
"volume": "",
"issue": "",
"pages": "934--937",
"other_ids": {
"DOI": [
"10.18653/v1/S17-2161"
]
},
"num": null,
"urls": [],
"raw_text": "Liang Wang and Sujian Li. 2017. PKU_ICL at SemEval-2017 task 10: Keyphrase extraction with model ensemble and external knowledge. In Pro- ceedings of the 11th International Workshop on Se- mantic Evaluation (SemEval-2017), pages 934-937, Vancouver, Canada. Association for Computational Linguistics.",
"links": null
},
"BIBREF46": {
"ref_id": "b46",
"title": "Using word embeddings to enhance keyword identification for scientific publications",
"authors": [
{
"first": "Rui",
"middle": [],
"last": "Wang",
"suffix": ""
},
{
"first": "Wei",
"middle": [],
"last": "Liu",
"suffix": ""
},
{
"first": "Chris",
"middle": [],
"last": "Mcdonald",
"suffix": ""
}
],
"year": 2015,
"venue": "Databases Theory and Applications -26th Australasian Database Conference, ADC 2015",
"volume": "9093",
"issue": "",
"pages": "257--268",
"other_ids": {
"DOI": [
"10.1007/978-3-319-19548-3_21"
]
},
"num": null,
"urls": [],
"raw_text": "Rui Wang, Wei Liu, and Chris McDonald. 2015. Using word embeddings to enhance keyword identification for scientific publications. In Databases Theory and Applications -26th Australasian Database Confer- ence, ADC 2015, Melbourne, VIC, Australia, June 4- 7, 2015. Proceedings, volume 9093 of Lecture Notes in Computer Science, pages 257-268. Springer.",
"links": null
},
"BIBREF47": {
"ref_id": "b47",
"title": "Topicaware neural keyphrase generation for social media language",
"authors": [
{
"first": "Yue",
"middle": [],
"last": "Wang",
"suffix": ""
},
{
"first": "Jing",
"middle": [],
"last": "Li",
"suffix": ""
},
{
"first": "Irwin",
"middle": [],
"last": "Hou Pong Chan",
"suffix": ""
},
{
"first": "Michael",
"middle": [
"R"
],
"last": "King",
"suffix": ""
},
{
"first": "Shuming",
"middle": [],
"last": "Lyu",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Shi",
"suffix": ""
}
],
"year": 2019,
"venue": "Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "2516--2526",
"other_ids": {
"DOI": [
"10.18653/v1/P19-1240"
]
},
"num": null,
"urls": [],
"raw_text": "Yue Wang, Jing Li, Hou Pong Chan, Irwin King, Michael R. Lyu, and Shuming Shi. 2019. Topic- aware neural keyphrase generation for social media language. In Proceedings of the 57th Annual Meet- ing of the Association for Computational Linguistics, pages 2516-2526, Florence, Italy. Association for Computational Linguistics.",
"links": null
},
"BIBREF48": {
"ref_id": "b48",
"title": "Semi-supervised learning for neural keyphrase generation",
"authors": [
{
"first": "Hai",
"middle": [],
"last": "Ye",
"suffix": ""
},
{
"first": "Lu",
"middle": [],
"last": "Wang",
"suffix": ""
}
],
"year": 2018,
"venue": "Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing",
"volume": "",
"issue": "",
"pages": "4142--4153",
"other_ids": {
"DOI": [
"10.18653/v1/D18-1447"
]
},
"num": null,
"urls": [],
"raw_text": "Hai Ye and Lu Wang. 2018. Semi-supervised learning for neural keyphrase generation. In Proceedings of the 2018 Conference on Empirical Methods in Nat- ural Language Processing, pages 4142-4153, Brus- sels, Belgium. Association for Computational Lin- guistics.",
"links": null
},
"BIBREF49": {
"ref_id": "b49",
"title": "Incorporating linguistic constraints into keyphrase generation",
"authors": [
{
"first": "Jing",
"middle": [],
"last": "Zhao",
"suffix": ""
},
{
"first": "Yuxiang",
"middle": [],
"last": "Zhang",
"suffix": ""
}
],
"year": 2019,
"venue": "Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "5224--5233",
"other_ids": {
"DOI": [
"10.18653/v1/P19-1515"
]
},
"num": null,
"urls": [],
"raw_text": "Jing Zhao and Yuxiang Zhang. 2019. Incorporat- ing linguistic constraints into keyphrase generation. In Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics, pages 5224-5233, Florence, Italy. Association for Compu- tational Linguistics.",
"links": null
}
},
"ref_entries": {
"FIGREF0": {
"type_str": "figure",
"text": ".319 0.324 0.279 0.282 0.389 0.410 IF A 0.313 0.319 0.294 0.284 0.372 0.377 OC A 0.093 0.126 0.237 0.243 0.265 0.284 LV A 0.311 0.315 0.283 0.285 0.401 0.405 IF A 0.319 0.324 0.313 0.314 0.376 0.395 OC A 0.129 0.142 0.256 0.261 0.282 0.293 LV Q 0.339 0.336 0.280 0.278 0.408 0.416 IF Q 0.338 0.342 0.321 0.335 0.383 0.413 OC Q 0.339 0.338 0.266 0.271 0.344 0.343",
"uris": null,
"num": null
},
"TABREF1": {
"content": "<table><tr><td>: F 1 @20 of various keyword extraction methods</td></tr><tr><td>using different types of graph-of-words/adjacency ma-</td></tr><tr><td>trix (A, A , Q) on six different datasets. Superscripts on</td></tr><tr><td>a method's score show statistical significance between</td></tr><tr><td>the current method and the one whose name appears</td></tr><tr><td>as superscript (see Section 4.2). The highest values ap-</td></tr><tr><td>pear in bold red font. The best scores for each group</td></tr><tr><td>of methods are in bold, whereas the second best are un-</td></tr><tr><td>derlined.</td></tr></table>",
"html": null,
"num": null,
"text": "",
"type_str": "table"
},
"TABREF3": {
"content": "<table/>",
"html": null,
"num": null,
"text": "F 1 @T of K A , K A , IF A , IF A and IF Q methods on the 6 datasets, where T is equal to |K A |, |K A |, |IF A |, |IF A | and |IF Q |, respectively. The highest values appear in red bold font.",
"type_str": "table"
},
"TABREF4": {
"content": "<table><tr><td>, considering Table 4</td></tr></table>",
"html": null,
"num": null,
"text": "",
"type_str": "table"
},
"TABREF5": {
"content": "<table/>",
"html": null,
"num": null,
"text": "Average number of keywords returned by the K and IF methods using different types of information(A, A , Q). The last row shows the average number of candidate words |V| per dataset.",
"type_str": "table"
},
"TABREF6": {
"content": "<table><tr><td/><td/><td>0.82</td><td>0.81</td></tr><tr><td>IF A -N A</td><td>0.92 0.91 0.92 0.84</td><td>0.81</td><td>0.81</td></tr><tr><td>IF A -B A</td><td>0.84 0.82 0.85 0.77</td><td>0.76</td><td>0.75</td></tr><tr><td>IF A -K A</td><td>0.26 0.27 0.27 0.35</td><td>0.32</td><td>0.30</td></tr><tr><td>IF A -P A</td><td>0.91 0.91 0.92 0.85</td><td>0.84</td><td>0.83</td></tr><tr><td>IF A -N A</td><td>0.88 0.88 0.90 0.84</td><td>0.82</td><td>0.81</td></tr><tr><td>IF A -B A</td><td>0.75 0.75 0.78 0.71</td><td>0.63</td><td>0.62</td></tr><tr><td>IF A -K A</td><td>0.71 0.71 0.73 0.51</td><td>0.49</td><td>0.50</td></tr><tr><td>IF Q -P Q</td><td>0.87 0.87 0.88 0.75</td><td>0.81</td><td>0.80</td></tr></table>",
"html": null,
"num": null,
"text": "S.C.C.ACM NUS SE DUC WWW KDD IF A -P A 0.91 0.90 0.92 0.84",
"type_str": "table"
}
}
}
} |