File size: 101,000 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 |
{
"paper_id": "I11-1032",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T07:30:44.731801Z"
},
"title": "Identifying Event Descriptions using Co-training with Online News Summaries",
"authors": [
{
"first": "William",
"middle": [
"Yang"
],
"last": "Wang",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Columbia University",
"location": {}
},
"email": ""
},
{
"first": "Kapil",
"middle": [],
"last": "Thadani",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Columbia University",
"location": {}
},
"email": ""
},
{
"first": "Kathleen",
"middle": [
"R"
],
"last": "Mckeown",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Columbia University",
"location": {}
},
"email": ""
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "Systems that distill information about events from large corpora generally extract sentences that are relevant to a short event query. We present a novel co-training strategy for this task that employs a multidocument news summary corpus featuring 2.5 million unlabeled sentences, thus obviating the need for extensive manual annotation. Our experiments indicate that this technique significantly outperforms standard classification approaches with linear feature combination on this task. An analysis of our approach under various settings reveals how classifier and parameter choice can be used to control runtime overhead while contributing to an absolute increase of 22% in recall.",
"pdf_parse": {
"paper_id": "I11-1032",
"_pdf_hash": "",
"abstract": [
{
"text": "Systems that distill information about events from large corpora generally extract sentences that are relevant to a short event query. We present a novel co-training strategy for this task that employs a multidocument news summary corpus featuring 2.5 million unlabeled sentences, thus obviating the need for extensive manual annotation. Our experiments indicate that this technique significantly outperforms standard classification approaches with linear feature combination on this task. An analysis of our approach under various settings reveals how classifier and parameter choice can be used to control runtime overhead while contributing to an absolute increase of 22% in recall.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "Automatic identification of event descriptions is a crucial, yet difficult, problem with impact on applications such as question answering (QA), query-focused summarization (QS), and text mining (TM) systems. In such applications, a system is given a description of an event in the form of a query and the task is to identify sentences within relevant documents (retrieved by an information retrieval system) that describe the event. We define event-relevant sentences as those describing a unique event as specified in the query, typically occurring at a specific location, on a specific date, or with specific participants. The task is made difficult by the fact that words in the query rarely provide enough identifying information (Xu and Croft, 2000; Chirita et al., 2007) to reliably find descriptive sentences; the query may not specify all named entities and may provide other descriptive terms that are not easily matched. For example, given the query requesting a description of \"the Israeli-Palestinian peace talks\", the sentence \"The discussions between Israelis and Palestinians follow last month's Annapolis meeting where Israeli Prime Minister and Palestinian President Mahmoud Abbas met and agreed to try to negotiate a deal before the end of 2008.\" is eventrelevant, whereas the sentence \"Turkey has close ties to both Israel and the Palestinians.\" is not. Yet both sentences feature the named entities from the query. The term \"peace talks\" does not appear in the event-relevant sentence, but is implied by \"negotiate\".",
"cite_spans": [
{
"start": 735,
"end": 755,
"text": "(Xu and Croft, 2000;",
"ref_id": null
},
{
"start": 756,
"end": 777,
"text": "Chirita et al., 2007)",
"ref_id": "BIBREF3"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Previous approaches have addressed this problem using supervised learning (Mani et al., 2003; Bethard and Martin, 2006; Manshadi et al., 2008) , where the relation between the query and eventrelevant sentences is learned. Still, gathering a large amount of training data is difficult and people often do not agree on what counts as relevant to an event description (Filatova and Hatzivassiloglou, 2003) , making the process of manually labeling sentences as events both time consuming and expensive. This is supported by our own experiments with Amazon Mechanical Turk (AMT); we were only able to obtain 685 labeled event-relevant sentences on which 3 or more AMT users agreed after 16 days of posting. This is a striking contrast with use of AMT for other labeling tasks where thousands of labeled examples can be obtained in a matter of hours (Snow et al., 2008; Marge et al., 2010; Rosenthal et al., 2010) .",
"cite_spans": [
{
"start": 74,
"end": 93,
"text": "(Mani et al., 2003;",
"ref_id": "BIBREF18"
},
{
"start": 94,
"end": 119,
"text": "Bethard and Martin, 2006;",
"ref_id": "BIBREF5"
},
{
"start": 120,
"end": 142,
"text": "Manshadi et al., 2008)",
"ref_id": "BIBREF19"
},
{
"start": 365,
"end": 402,
"text": "(Filatova and Hatzivassiloglou, 2003)",
"ref_id": "BIBREF9"
},
{
"start": 845,
"end": 864,
"text": "(Snow et al., 2008;",
"ref_id": "BIBREF24"
},
{
"start": 865,
"end": 884,
"text": "Marge et al., 2010;",
"ref_id": "BIBREF20"
},
{
"start": 885,
"end": 908,
"text": "Rosenthal et al., 2010)",
"ref_id": "BIBREF25"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "In this paper, we present a novel semisupervised learning method using co-training to classify sentences as salient event descriptions for a given event query. We use a small amount of manually annotated seed data, in the form of (query, sentence) pairs. Critically, we then augment this with a large amount of unlabeled news summaries, spanning nine years, from the Web. We hypothesize that the headline of each summary can be viewed as a single event query, and the corresponding summary sentences include a good number of salient event sentences that directly describe the event, as well as a small number of non-event sentences. We note that such data is abundantly available on the Web given naturallyoccurring news stories as well as mature multidocument summarization systems. We use two relatively simple sets of features, one based on keywords and the other based on named entities, to train two Bayesian network classifiers on seed training data and employ co-training over the collected news summaries to incrementally augment the training set with increasingly robust labeled examples. Experimental results show a significant, absolute gain of 8% over training of the classifiers on the seed data alone.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Our primary contributions in this paper include:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "\u2022 Collection of an online news summary corpus for detecting event relevance 1 that includes 166,435 summaries (2.5M sentences) generated by an online news summarizer in the period 2003-2011.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "\u2022 An efficient co-training strategy for identifying event descriptions using online news summaries and compact, simple feature sets.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "\u2022 An evaluation of the impact of classification techniques, experimental parameters and amount of novel Web data on the accuracy and efficiency of co-training.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "In the following sections, we first present related work on event identification and then present our approach, outlining our hypothesis, the data we used, the co-training strategy and feature sets for this task. Following this, we present experimental results and conclude with a discussion of the implications and limitations of this work.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "The problem of identifying and understanding events in natural language text has been explored in many ways that have produced a variety of perspectives on the challenges involved. Tasks explored have included the mapping of verblevel events into aspectual classes (Siegel and McKeown, 2000) , detection of specific atomic events (Filatova and Hatzivassiloglou, 2003) , supervised event classification (Bethard and Martin, 2006) and unsupervised learning of event schemas (Chambers and Jurafsky, 2009) . The notion of what constitutes an event has similarly 1 http://www.cs.columbia.edu/\u02dckathy/Data/CSC.tar.gz ranged across perspectives, from general verblevel events (Siegel and McKeown, 2000; Chambers and Jurafsky, 2009) and predicate-argument pairs (Manshadi et al., 2008) to more specific news events (Spitters and Kraaij, 2002; Filatova and Hatzivassiloglou, 2003) and public health events (Fisichella et al., 2010) . Our task also adheres to a more specific definition of events: we assume that event queries refer to unique and newsworthy events such \"the Beijing Olympics\", rather than more general lexicallevel events such as \"the game\". Our sentenceretrieval task aligns with the perspective of Filatova and Hatzivassiloglou (2003) who defined the notion of atomic events at the sentence level. They also show how event identification at this level can benefit indexing, summarization, and QA using low-level lexical features (Filatova and Hatzivassiloglou, 2004) .",
"cite_spans": [
{
"start": 265,
"end": 291,
"text": "(Siegel and McKeown, 2000)",
"ref_id": "BIBREF21"
},
{
"start": 330,
"end": 367,
"text": "(Filatova and Hatzivassiloglou, 2003)",
"ref_id": "BIBREF9"
},
{
"start": 402,
"end": 428,
"text": "(Bethard and Martin, 2006)",
"ref_id": "BIBREF5"
},
{
"start": 472,
"end": 501,
"text": "(Chambers and Jurafsky, 2009)",
"ref_id": "BIBREF2"
},
{
"start": 668,
"end": 694,
"text": "(Siegel and McKeown, 2000;",
"ref_id": "BIBREF21"
},
{
"start": 695,
"end": 723,
"text": "Chambers and Jurafsky, 2009)",
"ref_id": "BIBREF2"
},
{
"start": 753,
"end": 776,
"text": "(Manshadi et al., 2008)",
"ref_id": "BIBREF19"
},
{
"start": 806,
"end": 833,
"text": "(Spitters and Kraaij, 2002;",
"ref_id": "BIBREF26"
},
{
"start": 834,
"end": 870,
"text": "Filatova and Hatzivassiloglou, 2003)",
"ref_id": "BIBREF9"
},
{
"start": 896,
"end": 921,
"text": "(Fisichella et al., 2010)",
"ref_id": "BIBREF12"
},
{
"start": 1206,
"end": 1242,
"text": "Filatova and Hatzivassiloglou (2003)",
"ref_id": "BIBREF9"
},
{
"start": 1437,
"end": 1474,
"text": "(Filatova and Hatzivassiloglou, 2004)",
"ref_id": "BIBREF10"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "2"
},
{
"text": "Many event identification tasks rely on supervised learning methods (Siegel and McKeown, 2000; Mani et al., 2003; Bethard and Martin, 2006; Manshadi et al., 2008 ) that can incur high annotation costs. While fully unsupervised methods (Bejan, 2008; Spitters and Kraaij, 2002) for event discovery are not encumbered by the availability of training data, they can produce event clusters or topics which are difficult to interpret. In contrast, our semi-supervised learning approach balances the pros and cons of both supervised and unsupervised approaches.",
"cite_spans": [
{
"start": 68,
"end": 94,
"text": "(Siegel and McKeown, 2000;",
"ref_id": "BIBREF21"
},
{
"start": 95,
"end": 113,
"text": "Mani et al., 2003;",
"ref_id": "BIBREF18"
},
{
"start": 114,
"end": 139,
"text": "Bethard and Martin, 2006;",
"ref_id": "BIBREF5"
},
{
"start": 140,
"end": 161,
"text": "Manshadi et al., 2008",
"ref_id": "BIBREF19"
},
{
"start": 235,
"end": 248,
"text": "(Bejan, 2008;",
"ref_id": "BIBREF0"
},
{
"start": 249,
"end": 275,
"text": "Spitters and Kraaij, 2002)",
"ref_id": "BIBREF26"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "2"
},
{
"text": "We frame the task of selecting event-relevant sentences as a binary classification problem over all sentences in the corpus. The following sections detail the data, features and techniques used.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Our Approach",
"sec_num": "3"
},
{
"text": "Our primary corpus of news documents and queries is derived from the DARPA Global Autonomous Language Exploitation (GALE) distillation training and evaluation sets. Fifty event queries provided for the GALE task were used for our experiments (randomly divided into 30 training queries and 20 test queries), and the set of documents was restricted to those containing at least one keyword bigram from any query in the set 2 . For each query, we consider all sentences from the top 10 retrieved documents and resort to AMT 3 to obtain sentence-level labels.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Corpora Seed Training Data and Test Data Annotation",
"sec_num": "3.1"
},
{
"text": "Each AMT annotation task presented AMT users with four contiguous sentences in conjunction with the query and asked them to indicate whether each of the individual sentences was relevant to the query 4 . The users could also view the entire document for context. Each task was assigned to 5 AMT users and a total of 252 unique users from the United States participated in the tasks. The full study lasted 16 days and had an overall cost of $350. Fig. 1 shows the number of sentences (out of a total of 7161 candidates for all 50 queries) whose classification was agreed upon by a certain proportion of annotators. This result appears to suggest that annotators often agree when labeling eventrelevant sentences 5 . However, these numbers are dominated by the majority class (irrelevant sen-tences), indicating that it is relatively easy for AMT users to agree when a sentence is not relevant. This is confirmed by Fig. 2 , which displays the number of sentences that were specifically tagged as event-relevant for their respective queries. The breakdown for event-relevant sentences shows that about 30% of the sentences were identified as event-relevant by at least one AMT user and only a third of these received a majority vote for the label. This skewed distribution poses a significant challenge to the construction of a balanced training corpus for this task at low cost. Our observations are commensurate with Filatova and Hatzivassiloglou (2003) who note that event annotation is difficult for human annotators.",
"cite_spans": [
{
"start": 1417,
"end": 1453,
"text": "Filatova and Hatzivassiloglou (2003)",
"ref_id": "BIBREF9"
}
],
"ref_spans": [
{
"start": 446,
"end": 452,
"text": "Fig. 1",
"ref_id": "FIGREF0"
},
{
"start": 914,
"end": 920,
"text": "Fig. 2",
"ref_id": "FIGREF1"
}
],
"eq_spans": [],
"section": "Corpora Seed Training Data and Test Data Annotation",
"sec_num": "3.1"
},
{
"text": "Since manual creation of a large set of eventrelevant sentences is difficult, we make use of a semi-supervised technique that employs a large quantity of unlabeled data to iteratively augment the small corpus described above. Unlabeled training data for our task also must comprise event queries and groups of sentences that are both related and unrelated to these events.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Unlabeled News Summary Data",
"sec_num": null
},
{
"text": "We experiment with automatically-generated news summaries as unlabeled training data for identifying event-related sentences. We postulate that the title of each news summary forms a single query and assume that at least some of the sentences in the summary will relate to the event mentioned in the title, while some may not. The choice of summaries of online news documents rather than the documents is prompted by the assumption that the distribution of query-related sentences and query-unrelated sentences is more balanced in short, informative summaries; this allows us to use the data more efficiently and avoid the sparse occurrence of event-specific sentences in online news articles.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Unlabeled News Summary Data",
"sec_num": null
},
{
"text": "The unlabeled dataset used in this work was retrieved from the output of an online news summarization system, Newsblaster http://newsblaster.cs.columbia.edu/, that crawls the Web for news articles, clusters them on specific topics and produces multidocument summaries for each cluster. We collected a total of 166,435 summaries containing 2.5 million sentences and covering 2,129 days in the 2003-2011 period.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Unlabeled News Summary Data",
"sec_num": null
},
{
"text": "As an initial experiment in augmenting the training corpus, we assumed that all summary sentences were relevant to the title query and trained classifiers over a balanced corpus created by directly adding some summary data to the seed corpus. We observed the performance of these classifiers was poorer than that of classifiers trained only on the unaugmented seed corpus, suggesting that the assumption was too strong and that the summaries consist of both query-related and query-unrelated sentences. This supports the use of such a corpus in a semi-supervised setting.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Unlabeled News Summary Data",
"sec_num": null
},
{
"text": "The original co-training framework (Blum and Mitchell, 1998) was introduced in the context of Web page classification where one typically has access to a limited number of labeled pages but to a potentially unlimited number of unlabeled pages. Co-training involves building two independent views (classifiers), letting them automatically label the unlabeled data and incorporating this self-labeled data into the seed training set to improve system performance. Mihalcea (2004) shows that co-training is useful in word sense disamgibuation, Wan (2009) uses SVM for cotraining and shows improvement for cross-lingual sentiment analysis, and recent research has established the effectiveness of co-training for a variety of NLP tasks (Yu and K\u00fcbler, 2011; Li et al., 2011; Bergsma et al., 2011) . In this section, we present our co-training classifiers, as well as an algorithm that is specifically tailored to automatic event identification.",
"cite_spans": [
{
"start": 35,
"end": 60,
"text": "(Blum and Mitchell, 1998)",
"ref_id": "BIBREF6"
},
{
"start": 462,
"end": 477,
"text": "Mihalcea (2004)",
"ref_id": "BIBREF22"
},
{
"start": 541,
"end": 551,
"text": "Wan (2009)",
"ref_id": "BIBREF27"
},
{
"start": 732,
"end": 753,
"text": "(Yu and K\u00fcbler, 2011;",
"ref_id": "BIBREF30"
},
{
"start": 754,
"end": 770,
"text": "Li et al., 2011;",
"ref_id": null
},
{
"start": 771,
"end": 792,
"text": "Bergsma et al., 2011)",
"ref_id": "BIBREF1"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Semi-Supervised Approach",
"sec_num": "3.2"
},
{
"text": "Implementation of the co-training algorithm involves the design of two independent views (classifiers) for the same instance. In the original co-training algorithm for Web page classification, Blum and Mitchell (1998) use hyperlinks and bagof-words as the approximation 6 of two distinct views of a Web page. In our approach, we choose two simple views to represent each candidate sentence for a given event query: (1) keyword features that include unigram and bigram overlaps between a candidate sentence and the event query.",
"cite_spans": [
{
"start": 193,
"end": 217,
"text": "Blum and Mitchell (1998)",
"ref_id": "BIBREF6"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Features",
"sec_num": null
},
{
"text": "(2) named entity features including the number of exact entity (Person, Location, and Organization) matches between a candidate sentence and the query, as well as the total number of co-occurring named entity tags (regardless of the actual entity being tagged) between a candidate sentence and the query. We used the Stanford Named Entity tagger (Finkel et al., 2005) to obtain named entities features from the unlabeled data.",
"cite_spans": [
{
"start": 346,
"end": 367,
"text": "(Finkel et al., 2005)",
"ref_id": "BIBREF11"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Features",
"sec_num": null
},
{
"text": "Note that the second view of our approach is clearly not independent of the first view, as the named entity matching is based on lexical matching. However, named entities are known as an informative source for selecting relevant sentences for a query since they serve as unique identifiers (Parton et al., 2008) . Previous studies (Krogel and Scheffer, 2004) show that if the independence assumption of co-training approach is violated, the co-training approach can yield negative results. However, our results show that co-training yields improvement even though are classifiers are not independent.",
"cite_spans": [
{
"start": 290,
"end": 311,
"text": "(Parton et al., 2008)",
"ref_id": "BIBREF14"
},
{
"start": 331,
"end": 358,
"text": "(Krogel and Scheffer, 2004)",
"ref_id": "BIBREF13"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Features",
"sec_num": null
},
{
"text": "The Co-training Algorithm",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Features",
"sec_num": null
},
{
"text": "The motivation behind our co-training algorithm is to make use of the online summarization data for event identification, and improve recall as well as precision.The pseudo code of this algorithm is provided in Algorithm 1.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Features",
"sec_num": null
},
{
"text": "Given:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Algorithm 1 The co-training algorithm",
"sec_num": null
},
{
"text": "(1) a set S of labeled seed training examples;",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Algorithm 1 The co-training algorithm",
"sec_num": null
},
{
"text": "(2) a set U of unlabeled news summary examples;",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Algorithm 1 The co-training algorithm",
"sec_num": null
},
{
"text": "Initialize the iteration parameter k, pool size u, and leap size v; for i = 1 \u2192 k do Create a temporary pool by randomly choosing u examples from U ; Use L to train a classifier C 1 using only keyword features; Use L to train a classifier C 2 using only named entity features; Run C 1 to label u/2 examples and select v/2 balanced examples; Run C 2 to label u/2 examples and select v/2 balanced examples; Add all selected examples to L; Return the remaining examples back to U ; end for Earlier work (Mihalcea, 2004) indicates that by choosing only high confidence examples from the self-labeled data set, we can improve the cotraining results. However, we disagree with this assumption; if low-confidence examples are re-moved from training, the final co-trained classifier will have problems evaluating difficult examples in the held-out data set 7 .",
"cite_spans": [
{
"start": 500,
"end": 516,
"text": "(Mihalcea, 2004)",
"ref_id": "BIBREF22"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Algorithm 1 The co-training algorithm",
"sec_num": null
},
{
"text": "Our algorithm is a variation of the original cotraining algorithm (Blum and Mitchell, 1998) . In the original algorithm, p represents the number of self-labeled positive cases and n represents the number of self-labeled negative cases in each iteration. We now eliminate the p and n parameters, and use v to measure the leap size, the amount of self-labeled data added to the training set in each iteration. This is to ensure that, in each iteration, balanced selection of unlabeled examples from the two views can be added to the labeled data. We keep the unselected examples and return them to the pool U at the end of each iteration to make sure we use the unlabeled data exhaustively.",
"cite_spans": [
{
"start": 66,
"end": 91,
"text": "(Blum and Mitchell, 1998)",
"ref_id": "BIBREF6"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Algorithm 1 The co-training algorithm",
"sec_num": null
},
{
"text": "We employ a Bayesian network classification scheme for the co-training experiments described in section 4. Previous approaches to co-training have successfully used the well-known naive Bayes classification scheme (Blum and Mitchell, 1998; Mihalcea, 2004) , which assumes conditional independence between features.",
"cite_spans": [
{
"start": 214,
"end": 239,
"text": "(Blum and Mitchell, 1998;",
"ref_id": "BIBREF6"
},
{
"start": 240,
"end": 255,
"text": "Mihalcea, 2004)",
"ref_id": "BIBREF22"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Bayesian Network Classifier",
"sec_num": null
},
{
"text": "A Bayesian network approach is a variation on this probabilistic classification scheme that avoids making strong independence assumptions between features. Building the classifier entails an additional step for estimating the conditional dependencies between the features; this is accomplished by using search algorithms and scoring metrics 8 to learn a DAG structure representing a Bayesian network over the features. Once such structure is estimated, conditional probabilities p(x i |\u03c0 i ) are estimated 9 where \u03c0 i represents the set of features that feature x i is assumed to conditionally depend on. Classification of an unseen example x is performed similarly to the naive Bayes approach with the estimation of arg max y p(y|x ).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Bayesian Network Classifier",
"sec_num": null
},
{
"text": "7 Under the same parameter settings, accuracy was reduced by 1% when training only with high-confidence instances (posteriors > 0.9) or low-confidence instances (posteriors < 0.75).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Bayesian Network Classifier",
"sec_num": null
},
{
"text": "8 In our experiments, we use the K2 hill-climbing search strategy to estimate network structure with the standard Bayesian scoring metric (Cooper and Herskovits, 1992) . 9 Conditional probabilities are obtained using the simple estimation strategy (\u03b1 = 0.5) as implemented in the Weka machine learning toolkit (Witten and Frank, 2000) .",
"cite_spans": [
{
"start": 138,
"end": 167,
"text": "(Cooper and Herskovits, 1992)",
"ref_id": "BIBREF4"
},
{
"start": 170,
"end": 171,
"text": "9",
"ref_id": null
},
{
"start": 310,
"end": 334,
"text": "(Witten and Frank, 2000)",
"ref_id": "BIBREF28"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Bayesian Network Classifier",
"sec_num": null
},
{
"text": "We present four experiments to test system performance. First, we present the comparisons between our approach and other supervised/semisupervised baselines, arbitrarily choosing settings for the number of co-training iterations k and the number of sentences added in each iteration 10 . We then test the trade-off between k and v by fixing the total amount of unlabeled data available, i.e., k * v sentences 11 . In the third experiment, we test the impact of leap size v on both accuracy and efficiency by fixing k, as well as the impact of the iteration parameter k by fixing v. In the final experiment, we empirically choose the best possible v to test the influence of unlabeled data size on the recall and precision of our system. Due to the randomness in our co-training algorithm, we repeat every experiment 5 times and report the average results. Table 1 shows the overall Bayesian network cotraining results in comparison to various baseline systems. Previous work (Blum and Mitchell, 1998; Mihalcea, 2004; Wan, 2009) points out that naive Bayes and SVM classifiers can achieve promising results for co-training, so we use the same co-training settings (k = 50, v = 500) to compare these two classifiers with the Bayesian network classifier. Classifier 1 corresponds to the keyword matching view and Classifier 2 corresponds to the named entity view. When comparing single classifiers using either keyword matching or named entity features, SVM outperforms all other classifiers with an accuracy of 75.3%. When linearly combining all features using the seed data set, the Bayesian network yields a better result of 77.6%. The Bayesian network co-training outperforms the linear kernel SVM 12 co-training algorithm by 12.4% in accuracy, and it is also 55 times faster than SVM co-training algorithm in terms of average runtime. The co-trained result also has an absolute improvement of 8% over a Bayesian network linear combination classifier (Table 1 : Combination).",
"cite_spans": [
{
"start": 975,
"end": 1000,
"text": "(Blum and Mitchell, 1998;",
"ref_id": "BIBREF6"
},
{
"start": 1001,
"end": 1016,
"text": "Mihalcea, 2004;",
"ref_id": "BIBREF22"
},
{
"start": 1017,
"end": 1027,
"text": "Wan, 2009)",
"ref_id": "BIBREF27"
}
],
"ref_spans": [
{
"start": 856,
"end": 863,
"text": "Table 1",
"ref_id": "TABREF1"
},
{
"start": 1952,
"end": 1960,
"text": "(Table 1",
"ref_id": "TABREF1"
}
],
"eq_spans": [],
"section": "Experiments",
"sec_num": "4"
},
{
"text": "Note that in all of our co-training experiments, the performance of the Bayesian network co-Systems Acc. N-Prec. N-Recall N-F1 P-Prec. P-Recall P-F1 Table 1 : Comparing with baseline systems (NB: naive Bayes. SVM: linear kernel support vector machines. Bnet: Bayesian network. N-: the class of sentences unrelated to the event query P-: the class of event-related sentences). The best result in each column is indicated in boldface.",
"cite_spans": [],
"ref_spans": [
{
"start": 149,
"end": 156,
"text": "Table 1",
"ref_id": "TABREF1"
}
],
"eq_spans": [],
"section": "Comparing with Baseline Approaches",
"sec_num": "4.1"
},
{
"text": "trained classifier 1 (Table 1 : Co-training with k = 50andv = 500 improves performance substantially over the Bayesian network classifier using all features (Table 1 : Combination). The performance of co-trained Classifier 2, not shown in the table 13 , does not improve over the linear feature combination. The results suggest that when the keyword view is augmented with Bayesian network co-trained unlabeled data from both views, the co-training approach boosts the results, but the reverse does not hold true. These results are consistent with our previous claim (Section 3.2) that named entity features help the keyword view to identify key information in events. The above results also indicate that although the keyword view and named entity view are not independent, the Bayesian network co-training approach still produces promising results. The strong performance of the Bayesian network classifier in these experiments is partly attributable to the fact that both classification views consist of features that are interdependent and therefore correlated to some degree, as the model assumes. The dramatic performance gains of the Bayesian network co-trained classifier when compared to Naive Bayes are therefore somewhat unsurprising; however, the poor performance of the SVM classifier was unexpected.",
"cite_spans": [
{
"start": 249,
"end": 251,
"text": "13",
"ref_id": null
}
],
"ref_spans": [
{
"start": 21,
"end": 29,
"text": "(Table 1",
"ref_id": "TABREF1"
},
{
"start": 157,
"end": 165,
"text": "(Table 1",
"ref_id": "TABREF1"
}
],
"eq_spans": [],
"section": "Comparing with Baseline Approaches",
"sec_num": "4.1"
},
{
"text": "Although all the basic variants of classifiers us- 13 ing n-gram count features exhibit similar accuracy on the test corpus, we note that the Bayesian classifiers tend to select fewer high-precision event-related sentences resulting in skewed precision/recall numbers. Co-training has the effect of relaxing these models to gradually expand the set of high-precision event sentences (resulting in large gains in P-Recall and N-Precision) using the implicit information gained through new training examples classified by event features. No improvement is observed when co-training for classifiers that start out with balanced precision and recall, i.e., the SVM and all event feature classifiers. We therefore conjecture that this phenomenon of high-precision event sentence extraction is especially helpful in co-training for this task. We aim to further analyze the effect of classifier choice in future work. For all of the following experiments in this section, we only evaluate the performance of the Bayesian network classifier.",
"cite_spans": [
{
"start": 51,
"end": 53,
"text": "13",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Comparing with Baseline Approaches",
"sec_num": "4.1"
},
{
"text": "In this experiment, we evaluate the trade-off between the number of iterations and leap size in our co-training setting given a fixed amount of unlabeled data. A total number of 200,000 unlabeled summary sentences (1 year) are involved in this experiment. Fig. 3 shows the results. The horizontal axis consists of pairs of k and v. We first Figure 3 : Trade-off between co-training parameters k and v with fixed amount of data start with a very small ratio of k vs v (k = 1, v = 200, 000), then we increase k exponentially such that k * v is still equal to 200,000. We see that when k = 8 and v = 25, 000, the system's performance reaches a peak accuracy of 84.2%. In addition, accuracy increases 6% from k = 1 to k = 8 which suggests that our co-training algorithm needs at least 5-10 iterations to achieve satisfactory results. We observe that there is a sudden drop when k = 1024 and v = 195; we explain this in section 4.4 and 4.3 when we test the impact of data diversity. We evaluate the co-training leap size parameter v by fixing the number of iterations k to 10 and also experiment with the diversity of data by using unlabeled data drawn from different years. Fig. 4 shows that the system's performance improves significantly when using higher numbers of v. The best result is 85% accuracy when v = 32, 768, compared to 75.1% accuracy obtained when v = 2. We also notice that using more diverse data from different years helps stabilize system performance and reduce the oscillation in the plot. In terms of efficiency, when using all 9 years of data, the corresponding runtime for v = 4 and v = 32768 are 15 minutes and 20 minutes, which indicates that increasing leap size is an efficient approach. Fig. 6 shows the comprehensive runtime costs from v = 2 to v = 2048. The runtime for varying v is almost a straight line, showing very little added cost as v increases. We fix the leap size v to 500 and vary the number of iterations k to test its impact on the accuracy and efficiency of our system. We notice (Fig. 5 ) that when increasing the number of iterations from k = 1 to 32, our system performance improves significantly. After 32 iterations, the performance reaches a stable state. The best performance of 85.6% accuracy is obtained when k = 128; however, the cost of system runtime grows exponentially as we increase the parameter k. For example, we note that the runtimes corresponding to k = {256, 512, 1024, 2048} are 28 minutes, 76 minutes, 270 minutes and 1829 minutes. Clearly, compared with the runtimes obtained by varying v, increasing k is not a good option. We also test impact of data diversity by using data from different years. Although using one year of data yields the best result, its overall performance is less stable than using 3, 5, or 9 years of input unlabeled data.",
"cite_spans": [],
"ref_spans": [
{
"start": 256,
"end": 262,
"text": "Fig. 3",
"ref_id": null
},
{
"start": 341,
"end": 349,
"text": "Figure 3",
"ref_id": null
},
{
"start": 1170,
"end": 1176,
"text": "Fig. 4",
"ref_id": "FIGREF2"
},
{
"start": 1711,
"end": 1717,
"text": "Fig. 6",
"ref_id": "FIGREF4"
},
{
"start": 2021,
"end": 2028,
"text": "(Fig. 5",
"ref_id": "FIGREF3"
}
],
"eq_spans": [],
"section": "Trade-off between Co-training Parameters",
"sec_num": "4.2"
},
{
"text": "Experiments 4.3 and 4.4 show that increasing leap size v is an efficient method for introducing more data in co-training. Now, given different amounts of unlabeled news summary data from meaningful temporal time frames, we fix k = 10 and dynamically choose the best possible v to represent the amount of input data under consideration. Fig. 7 shows the precision and recall of the eventrelevant class when co-training is performed using input unlabeled data of varying sizes (and temporal ranges). We observe that increasing the dataset size (and therefore drawing from older summaries) yields a dramatic improvement in recall accompanied by a slight decline in precision. Correspondingly, F1 generally increases when more data is added. The difference between minimum and maximum recall over the entire range is as high as 22% while precision drops by about 9%. These results suggest that introducing more unlabeled data in our co-training framework has the biggest impact on recall without sacrificing much precision.",
"cite_spans": [],
"ref_spans": [
{
"start": 336,
"end": 342,
"text": "Fig. 7",
"ref_id": null
}
],
"eq_spans": [],
"section": "Influence of Size of Unlabeled Dataset",
"sec_num": "4.5"
},
{
"text": "Our results show that an approach that only selects sentences with words that match the input query will not work well. As keyword matching might introduce a fair amount of noise, e.g. matched prepositional phrases that do not indicate the importance of the sentence, co-training together with a named entity based classifier can help reduce these errors. Thus when testing on unseen data, significantly better recall can be obtained via co-training. Our experiments also show that our cotraining material, the nine years of news summary documents, is a reliable and effective source to augment the seed dataset, with minimum introduction of new noise or extra overhead.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Discussion",
"sec_num": "5"
},
{
"text": "The experiments show that increasing either the number of co-training iterations k or leap size v leads to improved performance; however, adding unlabeled data by increasing v adds much lower runtime overhead by avoiding repeated training iterations. The parameter trade-off experiment in section 4.2 indicates that beyond a minimum number of iterations k, unlabeled data can largely be introduced through v. This is useful in practice to maintain consistent runtime performance.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Discussion",
"sec_num": "5"
},
{
"text": "Despite the strong relative gains with cotraining, the limited feature sets employed in both views (keyword and named entity) do not allow us to capture event-relevant sentences which don't share words with the event query. Although the relative gains offered by co-training are clear, we wonder if the requirement of agreement in annotation led to a corpus in which sentences that were labeled relevant tended to share keywords with the event query. Although not evident from our experiments, we nevertheless assume that query synonyms are likely occurrences in event-relevant sentences, as are sub-events which entail larger events and vice versa. Therefore, a consideration of semantic and ontological features would be a logical next step for further investigation of this task and may offer interesting new views through which co-training can be utilized.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Discussion",
"sec_num": "5"
},
{
"text": "In this paper, we aim at detecting event-relevant sentences in a news corpus given an event query. In contrast to previous work that needs expensive annotation for query-answer pairs, we use unlabeled news summaries that are readily available in large quantities online and design an efficient semi-supervised learning strategy for event identification based on co-training with Bayesian network classifiers. An analysis of different parameters in the co-training approach shows that increasing leap size is a better way to gain accuracy improvements than increase in number of iterations given efficiency costs. Our findings are applicable to question answering, summarization, and text mining domains where selection of eventrelevant sentences is often critical and large-scale human annotated data is not always available.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusion",
"sec_num": "6"
},
{
"text": "As determined by the information-retrieval pipeline built using Lucene: http://lucene.apache.org",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "http://mturk.com4 We also added an obviously fake sentence to detect sloppy annotators and robots.5 Fleiss' \u03ba = 0.417, generally assumed to indicate moderate agreement between annotators",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "Note that it is very difficult to prove that two views are completely independent of each other.(Du et al., 2010)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "We use k = 50 iterations and v = 500 sentences per iteration11 Here we restrict k * v = 200, 000 sentences12 We have also experimented with polynomial and RBF kernels, but performance was worse than the linear kernel.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
}
],
"back_matter": [],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "Unsupervised Discovery of Event Scenarios from Texts",
"authors": [
{
"first": "Cosmin",
"middle": [],
"last": "Bejan",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Adrian",
"suffix": ""
}
],
"year": 2008,
"venue": "Proceedings of the 21st Florida Artificial Intelligence Research Society International Conference (FLAIRS'08)",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Bejan, Cosmin Adrian. 2008. Unsupervised Discov- ery of Event Scenarios from Texts. Proceedings of the 21st Florida Artificial Intelligence Research Society International Conference (FLAIRS'08), Ap- plied Natural Language Processing track, Coconut Grove, FL, USA, May 2008.",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "Using Large Monolingual and Bilingual Corpora to Improve Coordination Disambiguation",
"authors": [
{
"first": "Shane",
"middle": [],
"last": "Bergsma",
"suffix": ""
},
{
"first": "David",
"middle": [],
"last": "Yarowsky",
"suffix": ""
},
{
"first": "Kenneth",
"middle": [],
"last": "Church",
"suffix": ""
}
],
"year": 2011,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Bergsma, Shane and Yarowsky, David and Church, Kenneth. 2011. Using Large Monolingual and Bilingual Corpora to Improve Coordination Disam- biguation. ACL-HLT.",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "Unsupervised learning of narrative schemas and their participants",
"authors": [
{
"first": "Nathaniel",
"middle": [],
"last": "Chambers",
"suffix": ""
},
{
"first": "Dan",
"middle": [],
"last": "Jurafsky",
"suffix": ""
}
],
"year": 2009,
"venue": "Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP",
"volume": "2",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Chambers, Nathaniel and Jurafsky, Dan. 2009. Un- supervised learning of narrative schemas and their participants. Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th In- ternational Joint Conference on Natural Language Processing of the AFNLP: Volume 2, Suntec, Singa- pore, 2009.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "Personalized query expansion for the web",
"authors": [
{
"first": "Paul -Alexandru",
"middle": [],
"last": "Chirita",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Firan",
"suffix": ""
},
{
"first": "S",
"middle": [],
"last": "Claudiu",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Nejdl",
"suffix": ""
}
],
"year": 2007,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Chirita, Paul -Alexandru and Firan, Claudiu S. and Ne- jdl, Wolfgang 2007. Personalized query expansion for the web. SIGIR '07.",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "A Bayesian method for the induction of probabilistic networks from data",
"authors": [
{
"first": "G",
"middle": [],
"last": "Cooper",
"suffix": ""
},
{
"first": "E",
"middle": [],
"last": "Herskovits",
"suffix": ""
}
],
"year": 1992,
"venue": "Machine Learning",
"volume": "9",
"issue": "",
"pages": "309--347",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Cooper, G. and Herskovits, E.. 1992. A Bayesian method for the induction of probabilistic networks from data. Machine Learning , 9: 309-347, 1992.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "Identification of event mentions and their semantic class",
"authors": [
{
"first": "Steven",
"middle": [],
"last": "Bethard",
"suffix": ""
},
{
"first": "James",
"middle": [
"H"
],
"last": "Martin",
"suffix": ""
}
],
"year": 2006,
"venue": "Proceedings of the 2006 Conference on Empirical Methods in Natural Language Processing (EMNLP)",
"volume": "",
"issue": "",
"pages": "146--154",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Bethard, Steven and Martin, James H.. 2006. Iden- tification of event mentions and their semantic class. Proceedings of the 2006 Conference on Em- pirical Methods in Natural Language Processing (EMNLP), pages 146-154.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "Combining labeled and unlabeled data with co-training. Proceedings of the eleventh annual conference on Computational learning theory",
"authors": [
{
"first": "Avrim",
"middle": [],
"last": "Blum",
"suffix": ""
},
{
"first": "Tom",
"middle": [],
"last": "Mitchell",
"suffix": ""
}
],
"year": 1998,
"venue": "",
"volume": "",
"issue": "",
"pages": "92--100",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Blum, Avrim and Mitchell, Tom. 1998. Combining labeled and unlabeled data with co-training. Pro- ceedings of the eleventh annual conference on Com- putational learning theory, pages 92-100.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "Support-Vector Networks",
"authors": [
{
"first": "Corinna",
"middle": [],
"last": "Cortes",
"suffix": ""
},
{
"first": "V",
"middle": [],
"last": "Vapnik",
"suffix": ""
}
],
"year": 1995,
"venue": "Machine Learning",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Cortes, Corinna and Vapnik, V.. 1995. Support-Vector Networks. Machine Learning, 20.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "When Does Co-Training Work in Real Data",
"authors": [
{
"first": "Jun",
"middle": [],
"last": "Du",
"suffix": ""
},
{
"first": "Charles",
"middle": [
"X"
],
"last": "Ling",
"suffix": ""
},
{
"first": "Zhi-Hua",
"middle": [],
"last": "Zhou",
"suffix": ""
}
],
"year": 2010,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Du, Jun and Ling, Charles X. and Zhou, Zhi-Hua. 2010. When Does Co-Training Work in Real Data? IEEE TKDE.",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "Domain-Independent Detection, Extraction, and Labeling of Atomic Events",
"authors": [
{
"first": "Elena",
"middle": [],
"last": "Filatova",
"suffix": ""
},
{
"first": "Vasileios",
"middle": [],
"last": "Hatzivassiloglou",
"suffix": ""
}
],
"year": 2003,
"venue": "Proceedings of RANLP'03",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Filatova, Elena and Hatzivassiloglou, Vasileios. 2003. Domain-Independent Detection, Extraction, and Labeling of Atomic Events. Proceedings of RANLP'03, 2003.",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "Event-Based Extractive Summarization. Text Summarization Branches Out",
"authors": [
{
"first": "Elena",
"middle": [],
"last": "Filatova",
"suffix": ""
},
{
"first": "Vasileios",
"middle": [],
"last": "Hatzivassiloglou",
"suffix": ""
}
],
"year": 2004,
"venue": "Proceedings of the ACL-04 Workshop",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Filatova, Elena and Hatzivassiloglou, Vasileios. 2004. Event-Based Extractive Summarization. Text Sum- marization Branches Out: Proceedings of the ACL- 04 Workshop, Barcelona, Spain, July 2004.",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"title": "Incorporating Non-local Information into Information Extraction Systems by Gibbs Sampling",
"authors": [
{
"first": "Jenny",
"middle": [],
"last": "Finkel",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Rose",
"suffix": ""
},
{
"first": "Trond",
"middle": [],
"last": "Grenager",
"suffix": ""
},
{
"first": "Christopher",
"middle": [],
"last": "Manning",
"suffix": ""
}
],
"year": 2005,
"venue": "Proceedings of the 43nd Annual Meeting of the Association for Computational Linguistics (ACL 2005)",
"volume": "",
"issue": "",
"pages": "363--370",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Finkel, Jenny Rose and Grenager, Trond and Man- ning, Christopher. 2005. Incorporating Non-local Information into Information Extraction Systems by Gibbs Sampling. Proceedings of the 43nd Annual Meeting of the Association for Computational Lin- guistics (ACL 2005), pages 363-370.",
"links": null
},
"BIBREF12": {
"ref_id": "b12",
"title": "Unsupervised public health event detection for epidemic intelligence",
"authors": [
{
"first": "Marco",
"middle": [],
"last": "Fisichella",
"suffix": ""
},
{
"first": "Avar\u00e9",
"middle": [],
"last": "Stewart",
"suffix": ""
},
{
"first": "Kerstin",
"middle": [],
"last": "Denecke",
"suffix": ""
},
{
"first": "Wolfgang",
"middle": [
";"
],
"last": "Nejdl",
"suffix": ""
}
],
"year": 2010,
"venue": "Proceedings of the 19th ACM international conference on Information and knowledge management (CIKM 2010)",
"volume": "",
"issue": "",
"pages": "1881--1884",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Fisichella, Marco and Stewart, Avar\u00e9 and Denecke, Kerstin and Nejdl, Wolfgang; 2010. Unsupervised public health event detection for epidemic intelli- gence. Proceedings of the 19th ACM international conference on Information and knowledge manage- ment (CIKM 2010), pages 1881-1884, Toronto, ON, Canada.",
"links": null
},
"BIBREF13": {
"ref_id": "b13",
"title": "Multi-Relational Learning, Text Mining, and Semi-Supervised Learning for Functional Genomics",
"authors": [
{
"first": "Marc-A",
"middle": [],
"last": "Krogel",
"suffix": ""
},
{
"first": "Tobias",
"middle": [],
"last": "Scheffer",
"suffix": ""
}
],
"year": 2004,
"venue": "Machine Learning",
"volume": "57",
"issue": "",
"pages": "61--81",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Krogel, Marc-A and Scheffer, Tobias. 2004. Multi- Relational Learning, Text Mining, and Semi- Supervised Learning for Functional Genomics. Ma- chine Learning 57, pages 61-81.",
"links": null
},
"BIBREF14": {
"ref_id": "b14",
"title": "Simultaneous Multilingual Search for Translingual Information Retrieval",
"authors": [
{
"first": "Kristen",
"middle": [],
"last": "Parton",
"suffix": ""
},
{
"first": "Kathleen",
"middle": [
"R"
],
"last": "Mckeown",
"suffix": ""
},
{
"first": "James",
"middle": [],
"last": "Allan",
"suffix": ""
},
{
"first": "Enrique",
"middle": [],
"last": "Henestroza",
"suffix": ""
}
],
"year": 2008,
"venue": "Proceedings of CIKM",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Parton, Kristen and McKeown, Kathleen R. and Allan, James and Henestroza, Enrique.. 2008. Simultane- ous Multilingual Search for Translingual Informa- tion Retrieval. Proceedings of CIKM.",
"links": null
},
"BIBREF15": {
"ref_id": "b15",
"title": "The TIMEBANK Corpus. Proc. of Corpus Linguistics",
"authors": [
{
"first": "James",
"middle": [],
"last": "Pustejovsky",
"suffix": ""
},
{
"first": "Patrick",
"middle": [],
"last": "Hanks",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Saur",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Roser",
"suffix": ""
},
{
"first": "Andrew",
"middle": [],
"last": "See",
"suffix": ""
},
{
"first": "Robert",
"middle": [],
"last": "Gaizauskas",
"suffix": ""
},
{
"first": "Andrea",
"middle": [],
"last": "Setzer",
"suffix": ""
},
{
"first": "Dragomir",
"middle": [],
"last": "Radev",
"suffix": ""
},
{
"first": "Beth",
"middle": [],
"last": "Sundheim",
"suffix": ""
},
{
"first": "David",
"middle": [],
"last": "Day",
"suffix": ""
},
{
"first": "Lisa",
"middle": [],
"last": "Ferro",
"suffix": ""
},
{
"first": "Marcia",
"middle": [],
"last": "Lazo",
"suffix": ""
}
],
"year": 2003,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Pustejovsky, James and Hanks, Patrick and Saur, Roser and See, Andrew and Gaizauskas, Robert and Setzer, Andrea and Radev, Dragomir and Sundheim, Beth and Day, David and Ferro, Lisa and Lazo, Marcia. 2003. The TIMEBANK Corpus. Proc. of Corpus Linguistics.",
"links": null
},
"BIBREF17": {
"ref_id": "b17",
"title": "Semi-supervised Learning for Imbalanced Sentiment Classification",
"authors": [],
"year": null,
"venue": "Proceedings of IJCAI-2011",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Semi-supervised Learning for Imbalanced Senti- ment Classification. Proceedings of IJCAI-2011.",
"links": null
},
"BIBREF18": {
"ref_id": "b18",
"title": "Inferring Temporal Ordering of Events in News",
"authors": [
{
"first": "Inderjeet",
"middle": [],
"last": "Mani",
"suffix": ""
},
{
"first": "Barry",
"middle": [],
"last": "Schiffman",
"suffix": ""
},
{
"first": "Jianping",
"middle": [],
"last": "Zhang",
"suffix": ""
}
],
"year": 2003,
"venue": "Proceedings of the 2003 Human Language Technology Conference of the North American Chapter of the Association for Computational Linguistics (HLT-NAACL)",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Mani, Inderjeet and Schiffman, Barry and Zhang, Jian- ping. 2003. Inferring Temporal Ordering of Events in News. Proceedings of the 2003 Human Lan- guage Technology Conference of the North Ameri- can Chapter of the Association for Computational Linguistics (HLT-NAACL), 2003.",
"links": null
},
"BIBREF19": {
"ref_id": "b19",
"title": "Learning a Probabilistic Model of Event Sequences From Internet Weblog Stories",
"authors": [
{
"first": "Mehdi",
"middle": [],
"last": "Manshadi",
"suffix": ""
},
{
"first": "Reid",
"middle": [],
"last": "Swanson",
"suffix": ""
},
{
"first": "Andrew",
"middle": [
"S"
],
"last": "Gordon",
"suffix": ""
}
],
"year": 2008,
"venue": "Proceedings of the 21st Florida Artificial Intelligence Research Society International Conference (FLAIRS'08)",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Manshadi, Mehdi and Swanson, Reid and Gordon, An- drew S.. 2008. Learning a Probabilistic Model of Event Sequences From Internet Weblog Stories. Proceedings of the 21st Florida Artificial Intelli- gence Research Society International Conference (FLAIRS'08), Applied Natural Language Process- ing track, 2008.",
"links": null
},
"BIBREF20": {
"ref_id": "b20",
"title": "Using the Amazon Mechanical Turk for Transcription of Spoken Language",
"authors": [
{
"first": "Matthew",
"middle": [],
"last": "Marge",
"suffix": ""
},
{
"first": "Satanjeev",
"middle": [],
"last": "Banerjee",
"suffix": ""
},
{
"first": "Alexander",
"middle": [
"I"
],
"last": "Rudnicky",
"suffix": ""
}
],
"year": 2010,
"venue": "Proceedings of ICASSP",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Marge, Matthew and Banerjee, Satanjeev and Rud- nicky, Alexander I. 2010. Using the Amazon Mechanical Turk for Transcription of Spoken Lan- guage. Proceedings of ICASSP, 2010.",
"links": null
},
"BIBREF21": {
"ref_id": "b21",
"title": "Learning methods to combine linguistic indicators: improving aspectual classification and revealing linguistic insights",
"authors": [
{
"first": "Eric",
"middle": [
"V"
],
"last": "Siegel",
"suffix": ""
},
{
"first": "Kathleen",
"middle": [
"R"
],
"last": "Mckeown",
"suffix": ""
}
],
"year": 2000,
"venue": "Comput. Linguist",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Siegel, Eric V. and McKeown, Kathleen R. 2000. Learning methods to combine linguistic indicators: improving aspectual classification and revealing lin- guistic insights. Comput. Linguist., Dec. 2000.",
"links": null
},
"BIBREF22": {
"ref_id": "b22",
"title": "Co-training and self-training for word sense disambiguation",
"authors": [
{
"first": "Rada",
"middle": [],
"last": "Mihalcea",
"suffix": ""
}
],
"year": 2004,
"venue": "Proceedings of CONLL -04",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Mihalcea, Rada. 2004. Co-training and self-training for word sense disambiguation. Proceedings of CONLL -04, 2004.",
"links": null
},
"BIBREF23": {
"ref_id": "b23",
"title": "NewsInEssence: a system for domainindependent, real-time news clustering and multidocument summarization",
"authors": [
{
"first": "Dragomir",
"middle": [
"R"
],
"last": "Radev",
"suffix": ""
},
{
"first": "Sasha",
"middle": [],
"last": "Blair-Goldensohn",
"suffix": ""
},
{
"first": "Zhu",
"middle": [],
"last": "Zhang",
"suffix": ""
},
{
"first": "Revathi",
"middle": [],
"last": "Raghavan",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Sundara",
"suffix": ""
}
],
"year": 2001,
"venue": "Proceedings of the first international conference on Human language technology research",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Radev, Dragomir R. and Blair-Goldensohn, Sasha and Zhang, Zhu and Raghavan, Revathi Sundara. 2001. NewsInEssence: a system for domain- independent, real-time news clustering and multi- document summarization. Proceedings of the first international conference on Human language tech- nology research, 2001.",
"links": null
},
"BIBREF24": {
"ref_id": "b24",
"title": "Cheap and fastbut is it good?: evaluating non-expert annotations for natural language tasks",
"authors": [
{
"first": "Rion",
"middle": [],
"last": "Snow",
"suffix": ""
},
{
"first": "O'",
"middle": [],
"last": "Connor",
"suffix": ""
},
{
"first": "Brendan",
"middle": [],
"last": "Jurafsky",
"suffix": ""
},
{
"first": "Daniel",
"middle": [],
"last": "Ng",
"suffix": ""
},
{
"first": "Andrew",
"middle": [
"Y"
],
"last": "",
"suffix": ""
}
],
"year": 2008,
"venue": "Proceedings of the Conference on Empirical Methods in Natural Language Processing",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Snow, Rion and O'Connor, Brendan and Jurafsky, Daniel and Ng, Andrew Y.. 2008. Cheap and fast- but is it good?: evaluating non-expert annotations for natural language tasks. Proceedings of the Con- ference on Empirical Methods in Natural Language Processing, 2008.",
"links": null
},
"BIBREF25": {
"ref_id": "b25",
"title": "Towards Semi-Automated Annotation for Prepositional Phrase Attachment. LREC",
"authors": [
{
"first": "Sara",
"middle": [],
"last": "Rosenthal",
"suffix": ""
},
{
"first": "William",
"middle": [],
"last": "Lipovsky",
"suffix": ""
},
{
"first": "Kathleen",
"middle": [],
"last": "Mckeown",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Thadani",
"suffix": ""
},
{
"first": "Andreas",
"middle": [],
"last": "Kapil",
"suffix": ""
},
{
"first": "Jacob",
"middle": [],
"last": "",
"suffix": ""
}
],
"year": 2010,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Rosenthal, Sara and Lipovsky, William and McKe- own, Kathleen and Thadani, Kapil and Andreas, Ja- cob. 2010. Towards Semi-Automated Annotation for Prepositional Phrase Attachment. LREC, 2010.",
"links": null
},
"BIBREF26": {
"ref_id": "b26",
"title": "Unsupervised event clustering in multilingual news streams",
"authors": [
{
"first": "M",
"middle": [],
"last": "Spitters",
"suffix": ""
},
{
"first": "W",
"middle": [],
"last": "Kraaij",
"suffix": ""
}
],
"year": 2002,
"venue": "Proceedings of the LREC2002 Workshop on Event Modeling for Multilingual Document Linking",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Spitters, M. and Kraaij, W.. 2002. Unsupervised event clustering in multilingual news streams. Proceed- ings of the LREC2002 Workshop on Event Modeling for Multilingual Document Linking, pp. 4246.",
"links": null
},
"BIBREF27": {
"ref_id": "b27",
"title": "Co-training for cross-lingual sentiment classification",
"authors": [
{
"first": "Xiaojun",
"middle": [],
"last": "Wan",
"suffix": ""
}
],
"year": 2009,
"venue": "Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP",
"volume": "",
"issue": "",
"pages": "235--243",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Wan, Xiaojun. 2009. Co-training for cross-lingual sen- timent classification. Proceedings of the Joint Con- ference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP, pp. 235-243.",
"links": null
},
"BIBREF28": {
"ref_id": "b28",
"title": "Data mining: Practical machine learning tools and techniques with Java implementations",
"authors": [
{
"first": "I",
"middle": [
"H"
],
"last": "Witten",
"suffix": ""
},
{
"first": "E",
"middle": [],
"last": "Frank",
"suffix": ""
}
],
"year": 2000,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Witten, I.H. and Frank, E.. 2000. Data mining: Practi- cal machine learning tools and techniques with Java implementations. Morgan Kaufmann, 2000.",
"links": null
},
"BIBREF29": {
"ref_id": "b29",
"title": "Query expansion using local and global document analysis",
"authors": [
{
"first": "Jinxi",
"middle": [],
"last": "Xu",
"suffix": ""
},
{
"first": "W",
"middle": [],
"last": "Croft",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Bruce",
"suffix": ""
}
],
"year": 1996,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Xu, Jinxi and Croft, W. Bruce. 1996. Query expansion using local and global document analysis. SIGIR '96.",
"links": null
},
"BIBREF30": {
"ref_id": "b30",
"title": "Filling the Gap: Semi-Supervised Learning for Opinion Detection Across Domains",
"authors": [
{
"first": "Ning",
"middle": [],
"last": "Yu",
"suffix": ""
},
{
"first": "Sandra",
"middle": [],
"last": "K\u00fcbler",
"suffix": ""
}
],
"year": 2011,
"venue": "Proceedings of the Fifteenth Conference on Computational Natural Language Learning",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Yu, Ning and K\u00fcbler, Sandra. 2011. Filling the Gap: Semi-Supervised Learning for Opinion Detection Across Domains. Proceedings of the Fifteenth Con- ference on Computational Natural Language Learn- ing.",
"links": null
}
},
"ref_entries": {
"FIGREF0": {
"text": "Number of sentences where a proportion of AMT users agreed on the classification (eventrelated/unrelated). With a binary task, 1/5 implies 4/5 agreement and 2/5 implies 3/5 agreement.",
"uris": null,
"type_str": "figure",
"num": null
},
"FIGREF1": {
"text": "Number of sentences where a majority of AMT users agreed on the classification eventrelated.",
"uris": null,
"type_str": "figure",
"num": null
},
"FIGREF2": {
"text": "Performance varying leap size v with a fixed number of iterations k = 10",
"uris": null,
"type_str": "figure",
"num": null
},
"FIGREF3": {
"text": "Performance varying the number of iterations k with fixed leap size v = 500",
"uris": null,
"type_str": "figure",
"num": null
},
"FIGREF4": {
"text": "Average runtime costs when varying either k or v separately (and keeping the other fixed)Figure 7: Performance varying the size and temporal range of the unlabeled dataset",
"uris": null,
"type_str": "figure",
"num": null
},
"TABREF1": {
"content": "<table/>",
"type_str": "table",
"html": null,
"text": "",
"num": null
}
}
}
} |