File size: 107,841 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 | {
"paper_id": "P10-1027",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T09:20:43.530991Z"
},
"title": "Recommendation in Internet Forums and Blogs",
"authors": [
{
"first": "Jia",
"middle": [],
"last": "Wang",
"suffix": "",
"affiliation": {},
"email": ""
},
{
"first": "Qing",
"middle": [],
"last": "Li",
"suffix": "",
"affiliation": {},
"email": ""
},
{
"first": "Yuanzhu",
"middle": [
"Peter"
],
"last": "Chen",
"suffix": "",
"affiliation": {},
"email": "yzchen@mun.ca"
},
{
"first": "Zhangxi",
"middle": [],
"last": "Lin",
"suffix": "",
"affiliation": {},
"email": "zhangxi.lin@ttu.edu"
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "The variety of engaging interactions among users in social medial distinguishes it from traditional Web media. Such a feature should be utilized while attempting to provide intelligent services to social media participants. In this article, we present a framework to recommend relevant information in Internet forums and blogs using user comments, one of the most representative of user behaviors in online discussion. When incorporating user comments, we consider structural, semantic, and authority information carried by them. One of the most important observation from this work is that semantic contents of user comments can play a fairly different role in a different form of social media. When designing a recommendation system for this purpose, such a difference must be considered with caution.",
"pdf_parse": {
"paper_id": "P10-1027",
"_pdf_hash": "",
"abstract": [
{
"text": "The variety of engaging interactions among users in social medial distinguishes it from traditional Web media. Such a feature should be utilized while attempting to provide intelligent services to social media participants. In this article, we present a framework to recommend relevant information in Internet forums and blogs using user comments, one of the most representative of user behaviors in online discussion. When incorporating user comments, we consider structural, semantic, and authority information carried by them. One of the most important observation from this work is that semantic contents of user comments can play a fairly different role in a different form of social media. When designing a recommendation system for this purpose, such a difference must be considered with caution.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "In the past twenty years, the Web has evolved from a framework of information dissemination to a social interaction facilitator for its users. From the initial dominance of static pages or sites, with addition of dynamic content generation and provision of client-side computation and event handling, Web applications have become a prevalent framework for distributed GUI applications. Such technological advancement has fertilized vibrant creation, sharing, and collaboration among the users (Ahn et al., 2007) . As a result, the role of Computer Science is not as much of designing or implementing certain data communication techniques, but more of enabling a variety of creative uses of the Web.",
"cite_spans": [
{
"start": 493,
"end": 511,
"text": "(Ahn et al., 2007)",
"ref_id": "BIBREF1"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "In a more general context, Web is one of the most important carriers for \"social media\", e.g. In-ternet forums, blogs, wikis, podcasts, instant messaging, and social networking. Various engaging interactions among users in social media differentiate it from traditional Web sites. Such characteristics should be utilized in attempt to provide intelligent services to social media users. One form of such interactions of particular interest here is user comments. In self-publication, or customer-generated media, a user can publish an article or post news to share with others. Other users can read and comment on the posting and these comments can, in turn, be read and commented on. Digg (www.digg.com), Yahoo!Buzz (buzz.yahoo.com) and various kinds of blogs are commercial examples of self-publication. Therefore, reader responses to earlier discussion provide a valuable source of information for effective recommendation.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Currently, self-publishing media are becoming increasingly popular. For instance, at this point of writing, Technorati is indexing over 133 million blogs, and about 900,000 new blogs are created worldwide daily 1 . With such a large scale, information in the blogosphere follows a Long Tail Distribution (Agarwal et al., 2010) . That is, in aggregate, the not-so-well-known blogs can have more valuable information than the popular ones. This gives us an incentive to develop a recommender to provide a set of relevant articles, which are expected to be of interest to the current reader. The user experience with the system can be immensely enhanced with the recommended articles. In this work, we focus on recommendation in Internet forums and blogs with discussion threads.",
"cite_spans": [
{
"start": 304,
"end": 326,
"text": "(Agarwal et al., 2010)",
"ref_id": "BIBREF0"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Here, a fundamental challenge is to account for topic divergence, i.e. the change of gist during the process of discussion. In a discussion thread, the original posting is typically followed by other readers' opinions, in the form of comments. Inten-tion and concerns of active users may change as the discussion goes on. Therefore, recommendation, if it were only based on the original posting, can not benefit the potentially evolving interests of the users. Apparently, there is a need to consider topic evolution in adaptive content-based recommendation and this requires novel techniques in order to capture topic evolution precisely and to prevent drastic topic shifting which returns completely irrelevant articles to users.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "In this work, we present a framework to recommend relevant information in Internet forums and blogs using user comments, one of the most representative recordings of user behaviors in these forms of social media.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "It has the following contributions.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "\u2022 The relevant information is recommended based on a balanced perspective of both the authors and readers.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "\u2022 We model the relationship among comments and that relative to the original posting using graphs in order to evaluate their combined impact. In addition, the weight of a comment is further enhanced with its content and with the authority of its poster.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "In a broader context, a related problem is contentbased information recommendation (or filtering). Most information recommender systems select articles based on the contents of the original postings. For instance, Chiang and Chen (Chiang and Chen, 2004 ) study a few classifiers for agent-based news recommendations. The relevant news selections of these work are determined by the textual similarity between the recommended news and the original news posting. A number of later proposals incorporate additional metadata, such as user behaviors and timestamps. For example, Claypool et al. (Claypool et al., 1999) combine the news content with numerical user ratings. Del Corso, Gull\u00ed, and Romani (Del Corso et al., 2005) use timestamps to favor more recent news. Cantador, Bellogin, and Castells (Cantador et al., 2008) utilize domain ontology. Lee and Park (Lee and Park, 2007) consider matching between news article attributes and user preferences. Anh et al. (Ahn et al., 2007) and Lai, Liang, and Ku (Lai et al., 2003) construct explicit user profiles, respectively. Lavrenko et al. (Lavrenko et al., 2000) propose the e-Analyst system which combines news stories with trends in financial time series. Some go even further by ignoring the news contents and only using browsing behaviors of the readers with similar interests (Das et al., 2007) .",
"cite_spans": [
{
"start": 230,
"end": 252,
"text": "(Chiang and Chen, 2004",
"ref_id": "BIBREF8"
},
{
"start": 590,
"end": 613,
"text": "(Claypool et al., 1999)",
"ref_id": "BIBREF9"
},
{
"start": 668,
"end": 721,
"text": "Del Corso, Gull\u00ed, and Romani (Del Corso et al., 2005)",
"ref_id": "BIBREF11"
},
{
"start": 764,
"end": 820,
"text": "Cantador, Bellogin, and Castells (Cantador et al., 2008)",
"ref_id": "BIBREF7"
},
{
"start": 846,
"end": 879,
"text": "Lee and Park (Lee and Park, 2007)",
"ref_id": "BIBREF20"
},
{
"start": 963,
"end": 981,
"text": "(Ahn et al., 2007)",
"ref_id": "BIBREF1"
},
{
"start": 986,
"end": 1023,
"text": "Lai, Liang, and Ku (Lai et al., 2003)",
"ref_id": "BIBREF17"
},
{
"start": 1088,
"end": 1111,
"text": "(Lavrenko et al., 2000)",
"ref_id": "BIBREF19"
},
{
"start": 1330,
"end": 1348,
"text": "(Das et al., 2007)",
"ref_id": "BIBREF10"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "2"
},
{
"text": "Another related problem is topic detection and tracking (TDT), i.e. automated categorization of news stories by their themes. TDT consists of breaking the stream of news into individual news stories, monitoring the stories for events that have not been seen before, and categorizing them (Lavrenko and Croft, 2001) . A topic is modeled with a language profile deduced by the news. Most existing TDT schemes calculate the similarity between a piece of news and a topic profile to determine its topic relevance (Lavrenko and Croft, 2001 ) (Yang et al., 1999) . Qiu (Qiu et al., 2009) apply TDT techniques to group news for collaborative news recommendation. Some work on TDT takes one step further in that they update the topic profiles as part of the learning process during its operation (Allan et al., 2002) (Leek et al., 2002) .",
"cite_spans": [
{
"start": 288,
"end": 314,
"text": "(Lavrenko and Croft, 2001)",
"ref_id": "BIBREF18"
},
{
"start": 509,
"end": 534,
"text": "(Lavrenko and Croft, 2001",
"ref_id": "BIBREF18"
},
{
"start": 537,
"end": 556,
"text": "(Yang et al., 1999)",
"ref_id": "BIBREF28"
},
{
"start": 563,
"end": 581,
"text": "(Qiu et al., 2009)",
"ref_id": "BIBREF24"
},
{
"start": 788,
"end": 808,
"text": "(Allan et al., 2002)",
"ref_id": "BIBREF2"
},
{
"start": 809,
"end": 828,
"text": "(Leek et al., 2002)",
"ref_id": "BIBREF21"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "2"
},
{
"text": "Most recent researches on information recommendation in social media focus on the blogosphere. Various types of user interactions in the blogosphere have been observed. A prominent feature of the blogosphere is the collective wisdom (Agarwal et al., 2010) . That is, the knowledge in the blogosphere is enriched by such engaging interactions among bloggers and readers as posting, commenting and tagging. Prior to this work, the linking structure and user tagging mechanisms in the blogosphere are the most widely adopted ones to model such collective wisdom. For example, Esmaili et al. (Esmaili et al., 2006) focus on the linking structure among blogs. Hayes, Avesani, and Bojars (Hayes et al., 2007) explore measures based on blog authorship and reader tagging to improve recommendation. Li and Chen further integrate trust, social relation and semantic analysis (Li and Chen, 2009) . These approaches attempt to capture accurate similarities between postings without using reader comments. Due to the interactions between bloggers and readers, blog recommendation should not limit its input to only blog postings themselves but also incorporate feedbacks from the readers.",
"cite_spans": [
{
"start": 233,
"end": 255,
"text": "(Agarwal et al., 2010)",
"ref_id": "BIBREF0"
},
{
"start": 588,
"end": 610,
"text": "(Esmaili et al., 2006)",
"ref_id": "BIBREF12"
},
{
"start": 655,
"end": 702,
"text": "Hayes, Avesani, and Bojars (Hayes et al., 2007)",
"ref_id": "BIBREF13"
},
{
"start": 866,
"end": 885,
"text": "(Li and Chen, 2009)",
"ref_id": "BIBREF22"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "2"
},
{
"text": "The rest of this article is organized as follows. We first describe the design of our recommendation framework in Section 3. We then evaluate the performance of such a recommender using two",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "2"
},
{
"text": "\u00a1 \u00a2 \u00a3 \u00a4 \u00a5 \u00a6 \u00a7 \u00a8 \u00a9 \u00a9 \u00a1 \u00a6 \u00a5 ! \" # $ \u00a2 \u00a6 ! \u00a3 % \u00a6 \u00a1 & \u00a3 \u00a4 ' \u00a1 ( \u00a3 \u00a5 \u00a6 ) \u00a2 0 ! \u00a6 1 \u00a6 \u00a2 \u00a1 \u00a3 \u00a6 2 \u00a6 \u00a1 1 \u00a6 \u00a5 \u00a6 2 $ \u00a2 \u00a1 \u00a2 \u00a3 \u00a4 \u00a5 \u00a6 ! \" \u00a6 3 $ \u00a2 \u00a3 \u00a4 4 $ ( 5 \" \u00a2 \u00a1 6 \u00a4 \u00a2 6 \u00a1 \u00a6 4 $ ( 5 6 \u00a2 \u00a1 \u00a3 \u00a2 # 4 $ ( 5 7 8 \u00a2 \u00a1 \u00a4 \u00a2 \u00a1",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "2"
},
{
"text": "Figure 1: Design scheme different social media corpora (Section 4). This paper is concluded with speculation on how the current prototype can be further improved in Section 5.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "2"
},
{
"text": "In this section, we present a mechanism for recommendation in Internet forums and blogs. The framework is sketched in Figure 1 . Essentially, it builds a topic profile for each original posting along with the comments from readers, and uses this profile to retrieve relevant articles. In particular, we first extract structural, semantic, and authority information carried by the comments. Then, with such collective wisdom, we use a graph to model the relationship among comments and that relative to the original posting in order to evaluate the impact of each comment. The graph is weighted with postings' contents and the authors' authority. This information along with the original posting and its comments are fed into a synthesizer. The synthesizer balances views from both authors and readers to construct a topic profile to retrieve relevant articles.",
"cite_spans": [],
"ref_spans": [
{
"start": 118,
"end": 126,
"text": "Figure 1",
"ref_id": null
}
],
"eq_spans": [],
"section": "System Design",
"sec_num": "3"
},
{
"text": "In a discussion thread, comments made at different levels reflect the variation of focus of readers. Therefore, recommended articles should reflect their concerns to complement the author's opinion. The degree of contribution from each comment, however, is different. In the extreme case, some of them are even advertisements which are completely irrelevant to the discussion topics.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Incorporating Comments",
"sec_num": "3.1"
},
{
"text": "In this work, we use a graph model to differentiate the importance of each comment. That is, we model the authority, semantic, structural relations of comments to determine their combined impact.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Incorporating Comments",
"sec_num": "3.1"
},
{
"text": "Intuitively, each comment may have a different degree of authority determined by the status of its author (Hu et al., 2007) . Assume we have users in a forum, denoted by = { 1 , 2 , . . . , }. We calculate the authority for user . To do that, we employ a variant of the PageRank algorithm (Brin and Page, 1998) . We consider the cases that a user replies to a previous posting and that a user quotes a previous posting separately. For user , we use ( , ) to denote the number of times that has replied to user . Similarly, we use ( , ) to denote the number of times that has quoted user . We combine them linearly:",
"cite_spans": [
{
"start": 106,
"end": 123,
"text": "(Hu et al., 2007)",
"ref_id": "BIBREF14"
},
{
"start": 289,
"end": 310,
"text": "(Brin and Page, 1998)",
"ref_id": "BIBREF5"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Authority Scoring Comments",
"sec_num": "3.1.1"
},
{
"text": "\u2032 ( , ) = 1 ( , ) + 2 ( , ).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Authority Scoring Comments",
"sec_num": "3.1.1"
},
{
"text": "Further, we normalize the above quantity to record how frequently a user refers to another:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Authority Scoring Comments",
"sec_num": "3.1.1"
},
{
"text": "( , ) = \u2032 ( , ) \u2211 =1 \u2032 ( , ) + .",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Authority Scoring Comments",
"sec_num": "3.1.1"
},
{
"text": "Inline with the PageRank algorithm, we define the authority of user as",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Authority Scoring Comments",
"sec_num": "3.1.1"
},
{
"text": "= + (1 \u2212 ) \u00d7 \u2211 =1 ( ( , ) \u00d7 ) .",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Authority Scoring Comments",
"sec_num": "3.1.1"
},
{
"text": "Semantic and Structural relations Next, we construct a similar model in terms of the comments themselves. In this model, we treat the original posting and the comments each as a text node. This model considers both the content similarity between text nodes and the logic relationship among them.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Differentiating comments with",
"sec_num": "3.1.2"
},
{
"text": "On the one hand, the semantic similarity between two nodes can be measured with any commonly adopted metric, such as cosine similarity and Jaccard coefficient (Baeza-Yates and Ribeiro-Neto, 1999 ). On the other hand, the structural relation between a pair of nodes takes two forms as we have discussed earlier. First, a comment can be made in response to the original posting or at most one earlier comment. In graph theoretic terms, the hierarchy can be represented as a tree = ( , ), where is the set of all text nodes and is the edge set. In particular, the original posting is the root and all the comments are ordinary nodes. There is an arc (directed edge) \u2208 from node to node , denoted ( , ), if the corresponding comment is made in response to comment (or original posting) . Second, a comment can quote from one or more earlier comments. From this perspective, the hierarchy can be modeled using a directed acyclic graph (DAG), There is an arc \u2208 from node to node , denoted ( , ), if the corresponding comment quotes comment (or original posting) . As shown in Figure 2 , for either graph or , we can use a | | \u00d7 | | adjacency matrix, denoted and , respectively, to record them. Similarly, we can also use a | | \u00d7 | | matrix defined on [0, 1] to record the content similarity between nodes and denote it by . Thus, we combine these three aspects linearly:",
"cite_spans": [
{
"start": 159,
"end": 194,
"text": "(Baeza-Yates and Ribeiro-Neto, 1999",
"ref_id": "BIBREF3"
}
],
"ref_spans": [
{
"start": 1070,
"end": 1078,
"text": "Figure 2",
"ref_id": "FIGREF0"
}
],
"eq_spans": [],
"section": "Differentiating comments with",
"sec_num": "3.1.2"
},
{
"text": "= 1 \u00d7 + 2 \u00d7 + 3 \u00d7 .",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Differentiating comments with",
"sec_num": "3.1.2"
},
{
"text": "The importance of a text node can be quantized by the times it has been referred to. Considering the semantic similarity between nodes, we use another variant of the PageRank algorithm to calculate the weight of comment :",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Differentiating comments with",
"sec_num": "3.1.2"
},
{
"text": "\u2032 = | | + (1 \u2212 ) \u00d7 | | \u2211 =1 , \u00d7 \u2032 ,",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Differentiating comments with",
"sec_num": "3.1.2"
},
{
"text": "where is a damping factor, and , is the normalized weight of comment referring to defined as",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Differentiating comments with",
"sec_num": "3.1.2"
},
{
"text": "( , ) = , \u2211 , + ,",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Differentiating comments with",
"sec_num": "3.1.2"
},
{
"text": "where , is an entry in the graph adjacency matrix M and is a constant to avoid division by zero.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Differentiating comments with",
"sec_num": "3.1.2"
},
{
"text": "In some social networking media, a user may have a subset of other users as \"friends\". This can be captured by a | | \u00d7 | | matrix of {0, 1}, whose entries are denoted by , . Thus, with this information and assuming poster has made a comment k for user 's posting, the final weight of this comment is defined as",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Differentiating comments with",
"sec_num": "3.1.2"
},
{
"text": "= \u2032 \u00d7 ( + , 2 ) .",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Differentiating comments with",
"sec_num": "3.1.2"
},
{
"text": "Once the weight of comments on one posting is quantified by our models, this information along with the entire discussion thread is fed into a synthesizer to construct a topic profile. As such, the perspectives of both authors and readers are balanced for recommendation. The profile is a weight vector of terms to model the language used in the discussion thread. Consider a posting 0 and its comment sequence",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Topic Profile Construction",
"sec_num": "3.2"
},
{
"text": "{ 1 , 2 , \u22c5 \u22c5 \u22c5 , }. For each term , a compound weight ( ) = (1 \u2212 ) \u00d7 1 ( ) + \u00d7 2 ( ) is calculated.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Topic Profile Construction",
"sec_num": "3.2"
},
{
"text": "It is a linear combination of the contribution by the posting itself, 1 ( ), and that by the comments, 2 ( ). We assume that each term is associated with an \"inverted document frequency\", denoted by ( ) = log ( ) , where is the corpus size and ( ) is the number of documents in corpus containing term . We use a function ( , ) to denote the number of occurrences of term in document , i.e. \"term frequency\". Thus, when the original posting and comments are each considered as a document, this term frequency can be calculated for any term in any document. We thus define the weight of term in document , be the posting itself or a comment, using the standard TF/IDF definition (Baeza-Yates and Ribeiro-Neto, 1999) :",
"cite_spans": [
{
"start": 677,
"end": 713,
"text": "(Baeza-Yates and Ribeiro-Neto, 1999)",
"ref_id": "BIBREF3"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Topic Profile Construction",
"sec_num": "3.2"
},
{
"text": "( , ) = ( 0.5 + 0.5 \u00d7 ( , ) max \u2032 ( \u2032 , ) ) \u00d7 ( ).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Topic Profile Construction",
"sec_num": "3.2"
},
{
"text": "The weight contributed by the posting itself, 0 , is thus:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Topic Profile Construction",
"sec_num": "3.2"
},
{
"text": "1 ( ) = ( , 0 ) max \u2032 ( \u2032 , 0 )",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Topic Profile Construction",
"sec_num": "3.2"
},
{
"text": ".",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Topic Profile Construction",
"sec_num": "3.2"
},
{
"text": "The weight contribution from the comments { 1 , 2 , \u22c5 \u22c5 \u22c5 , } incorporates not only the language features of these documents but also their importance in the discussion thread. That is, the contribution of comment score is incorporated into weight calculation of the words in a comment.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Topic Profile Construction",
"sec_num": "3.2"
},
{
"text": "2 ( ) = \u2211 =1 ( ( , ) max \u2032 ( \u2032 , ) ) \u00d7 ( ( ) max \u2032 ( \u2032 ) ) .",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Topic Profile Construction",
"sec_num": "3.2"
},
{
"text": "Such a treatment of compounded weight ( ) is essentially to recognize that readers' impact on selecting relevant articles and the difference of their influence. For each profile, we select the tophighest weighted words to represent the topic.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Topic Profile Construction",
"sec_num": "3.2"
},
{
"text": "With the topic profile thus constructed, the retriever returns an ordered list of articles with decreasing relevance to the topic. Note that our approach to differentiate the importance of each comment can be easily incorporated into any generic retrieval model. In this work, our retriever is adopted from (Lavrenko et al., 2000) .",
"cite_spans": [
{
"start": 307,
"end": 330,
"text": "(Lavrenko et al., 2000)",
"ref_id": "BIBREF19"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Topic Profile Construction",
"sec_num": "3.2"
},
{
"text": "Since interpreting recommended items enhances users' trusting beliefs (Wang and Benbasat, 2007) , we design a creative approach to generate hints to indicate the relationship (generalization, specialization and duplication) between the recommended articles and the original posting based on our previous work (Candan et al., 2009) .",
"cite_spans": [
{
"start": 70,
"end": 95,
"text": "(Wang and Benbasat, 2007)",
"ref_id": "BIBREF26"
},
{
"start": 309,
"end": 330,
"text": "(Candan et al., 2009)",
"ref_id": "BIBREF6"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Interpretation of Recommendation",
"sec_num": "3.3"
},
{
"text": "Article being more general than can be interpreted as being less constrained than by the keywords they contain. Let us consider two articles, and , where contains keywords, 1 and 2 , and only contains 1 .",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Interpretation of Recommendation",
"sec_num": "3.3"
},
{
"text": "\u2022 If is said to be more general than , then the additional keyword, 2 , of article must render less constrained than . Therefore, the content of can be interpreted as 1 \u222a 2 .",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Interpretation of Recommendation",
"sec_num": "3.3"
},
{
"text": "\u2022 If, on the other hand, is said to be more specific than , then the additional keyword, 2 , must render more constrained than . Therefore, the content of can be interpreted as 1 \u2229 2 .",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Interpretation of Recommendation",
"sec_num": "3.3"
},
{
"text": "Note that, in the two-keyword space \u27e8 1 , 2 \u27e9, can be denoted by a vector \u27e8 , \u27e9 and can be denoted by \u27e8 , 0\u27e9. The origin = \u27e80, 0\u27e9 corresponds to the case where an article does contain neither 1 nor 2 . That is, corresponds to an article which can be interpreted as",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Interpretation of Recommendation",
"sec_num": "3.3"
},
{
"text": "\u00ac 1 \u2229 \u00ac 2 \u2261 \u00ac ( 1 \u222a 2 ). Therefore, if",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Interpretation of Recommendation",
"sec_num": "3.3"
},
{
"text": "is said to be more general than , \u0394 = ( , ) should be greater than \u0394 = ( , ). This allows us to measure the degrees of generalization and specialization of two articles. Given two articles, and , of the same topic, they will have a common keyword base, while both articles will also have their own content, different from their common base. Let us denote the common part of by and common part of by . Note that \u0394 and \u0394 are usually unequal because the same words in the common part have different term weights in article and respectively. Given these and the generalization concept introduced above for two similar articles and , we can define the degree of generalization ( ) and specialization ( ) of with respect to as = \u0394 /\u0394 , = \u0394 /\u0394 .",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Interpretation of Recommendation",
"sec_num": "3.3"
},
{
"text": "To alleviate the effect of document length, we revise the definition as",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Interpretation of Recommendation",
"sec_num": "3.3"
},
{
"text": "= \u0394 / log(\u0394 ) \u0394 / log(\u0394 + \u0394 ) , = \u0394 / log(\u0394 ) \u0394 / log(\u0394 + \u0394 )",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Interpretation of Recommendation",
"sec_num": "3.3"
},
{
"text": ".",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Interpretation of Recommendation",
"sec_num": "3.3"
},
{
"text": "The relative specialization and generalization values can be used to reveal the relationships between recommended articles and the original posting. Given original posting and recommended article , if > \u0398 , for a given generalization threshold \u0398 , then B is marked as a generalization. When this is not the case, if > \u0398 , for a given specialization threshold, \u0398 , then is marked as a specialization. If neither of these cases is true, then is duplicate of .",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Interpretation of Recommendation",
"sec_num": "3.3"
},
{
"text": "Such an interpretation provides a control on delivering recommended articles. In particular, we can filter the duplicate articles to avoid recommending the same information.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Interpretation of Recommendation",
"sec_num": "3.3"
},
{
"text": "To evaluate the effectiveness of our proposed recommendation mechanism, we carry out a series of experiments on two synthetic data sets, collected from Internet forums and blogs, respectively. The first data set is called Forum. This data set is constructed by randomly selecting 20 news articles with corresponding reader comments from the Digg Web site and 16,718 news articles from the Reuters news Web site. This simulates the scenario of recommending relevant news from traditional media to social media users for their further reading. The second one is the Blog data set containing 15 blog articles with user comments and 15,110 articles obtained from the Myhome Web site 2 . Details of these two data sets are shown in Table 1 . For evaluation purposes, we adopt the traditional pooling strategy (Zobel, 1998 ) and apply to the TREC data set to mark the relevant articles for each topic. The recommendation engine may return a set of essentially the same articles re-posted at different sites. Therefore, we introduce a metric of novelty to measure the topic diversity of returned suggestions. In our experiments, we define precision and novelty metrics as",
"cite_spans": [
{
"start": 804,
"end": 816,
"text": "(Zobel, 1998",
"ref_id": "BIBREF29"
}
],
"ref_spans": [
{
"start": 727,
"end": 734,
"text": "Table 1",
"ref_id": "TABREF0"
}
],
"eq_spans": [],
"section": "Experimental Evaluation",
"sec_num": "4"
},
{
"text": "@ = | \u2229 | | | and @ = | \u2229 | | | ,",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Experimental Evaluation",
"sec_num": "4"
},
{
"text": "where is the subset of the top-articles returned by the recommender, is the set of manually tagged relevant articles, and is the set of manually tagged relevant articles excluding duplicate ones to the original posting. We select the top 10 articles for evaluation assuming most readers only browse up to 10 recommended articles (Karypis, 2001) . Meanwhile, we also utilize mean average precision (MAP) and mean average novelty (MAN) to evaluate the entire set of returned article.",
"cite_spans": [
{
"start": 329,
"end": 344,
"text": "(Karypis, 2001)",
"ref_id": "BIBREF16"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Experimental Evaluation",
"sec_num": "4"
},
{
"text": "We test our proposal in four aspects. First, we compare our work to two baseline works. We then present results for some preliminary tests to find out the optimal values for two critical parameters. Next, we study the effect of user authority and its integration to comment weighting. Fourth, we evaluate the performance gain obtained from interpreting recommendation. In addition, we provide a significance test to show that the observed differences in effectiveness for different approaches are not incidental. In particular, we use the -test here, which is commonly used for significance tests in information retrieval experiments (Hull, 1993) .",
"cite_spans": [
{
"start": 634,
"end": 646,
"text": "(Hull, 1993)",
"ref_id": "BIBREF15"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Experimental Evaluation",
"sec_num": "4"
},
{
"text": "As baseline proposals, we also implement two well-known content-based recommendation methods (Bogers and Bosch, 2007) . The first method, Okapi, is commonly applied as a representative of the classic probabilistic model for relevant information retrieval (Robertson and Walker, 1994) . The second one, LM, is based on statistical language models for relevant information retrieval (Ponte and Croft, 1998) . It builds a proba- bilistic language model for each article, and ranks them on query likelihood, i.e. the probability of the model generating the query. Following the strategy of Bogers and Bosch, relevant articles are selected based on the title and the first 10 sentences of the original postings. This is because articles are organized in the so-called inverted pyramid style, meaning that the most important information is usually placed at the beginning. Trimming the rest of an article would usually remove relatively less crucial information, which speeds up the recommendation process.",
"cite_spans": [
{
"start": 93,
"end": 117,
"text": "(Bogers and Bosch, 2007)",
"ref_id": "BIBREF4"
},
{
"start": 255,
"end": 283,
"text": "(Robertson and Walker, 1994)",
"ref_id": "BIBREF25"
},
{
"start": 381,
"end": 404,
"text": "(Ponte and Croft, 1998)",
"ref_id": "BIBREF23"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Overall Performance",
"sec_num": "4.1"
},
{
"text": "A paired -test shows that using @10 and @10 as performance measures, our approach performs significantly better than the baseline methods for both Forum and Blog data sets as shown in Table 2 . In addition, we conduct -tests using MAP and MAN as performance measures, respectively, and the -values of these tests are all less than 0.05, meaning that the results of experiments are statistically significant. We believe that such gains are introduced by the additional information from the collective wisdom, i.e. user authority and comments. Note that the retrieval precision for Blog of two baseline methods is not as good as that for Forum. Our explanation is that blog articles may not be organized in the inverted pyramid style as strictly as news forum articles.",
"cite_spans": [],
"ref_spans": [
{
"start": 184,
"end": 191,
"text": "Table 2",
"ref_id": "TABREF1"
}
],
"eq_spans": [],
"section": "Overall Performance",
"sec_num": "4.1"
},
{
"text": "There are two important parameters to be considered to construct topic profiles for recommendation. 1) the number of the most weighted words to represent the topic, and 2) combination coefficient to determine the contribution of original posting and comments in selecting relevant articles.We conduct a series of experiments and find out that the optimal performance is obtained when the number of words is between 50 and 70, and is between 0.65 and 0.75. When is set to 0, the recommended articles only reflect the author's opinion. When = 1, the suggested articles represent the concerns of readers exclusively. In the following experiments, we set topic word number to 60 and combination coefficient to 0.7.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Parameters of Topic Profile",
"sec_num": "4.2"
},
{
"text": "In this part, we explore the contribution of user authority and comments in social media recommender. In particular, we study the following scenarios with increasing system capabilities. Note that, lacking friend information (Section 3.1.2) in the Forum data set, , is set to zero.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Effect of Authority and Comments",
"sec_num": "4.3"
},
{
"text": "\u2022 RUN 1 (Posting): the topic profile is constructed only based on the original posting itself. This is analogous to traditional recommenders which only consider the focus of authors for suggesting further readings. Here, we set 1 = 2 = 3 = 1. Our -test shows that using @10 and @10 as performance measures, RUN4 performs best in both Forum and Blog data sets as shown in Table 3 . There is a stepwise performance improvement while integrating user authority, comments and both. With the assistance of user authority and comments, the recommendation precision is improved up to 9.8% and 21.6% for Forum and Blog, respectively. The opinion of readers is an effective complementarity to the authors' view in suggesting relevant information for further reading.",
"cite_spans": [],
"ref_spans": [
{
"start": 371,
"end": 378,
"text": "Table 3",
"ref_id": "TABREF2"
}
],
"eq_spans": [],
"section": "Effect of Authority and Comments",
"sec_num": "4.3"
},
{
"text": "Moreover, we investigate the effect of the semantic and structural relations among comments, i.e. semantic similarity, reply, and quotation. For this purpose, we carry out a series of experiments based on different combinations of these relations. \u2022 Quotation Relation (QR): only the quotation relation matrix is used in scoring the comments.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Effect of Authority and Comments",
"sec_num": "4.3"
},
{
"text": "\u2022 Reply Relation (RR): only the reply relation matrix is used in scoring the comments.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Effect of Authority and Comments",
"sec_num": "4.3"
},
{
"text": "\u2022 Content+Quotation Relation (CQR): both the content and quotation relation matrices is used in scoring the comments.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Effect of Authority and Comments",
"sec_num": "4.3"
},
{
"text": "\u2022 Content+Reply Relation(CRR): both the content and reply relation matrices are used in scoring the comments.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Effect of Authority and Comments",
"sec_num": "4.3"
},
{
"text": "\u2022 Quotation+Reply Relation (QRR): both the quotation and reply relation matrices are used in scoring the comments.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Effect of Authority and Comments",
"sec_num": "4.3"
},
{
"text": "\u2022 All: all three matrices are used.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Effect of Authority and Comments",
"sec_num": "4.3"
},
{
"text": "The MAP yielded by these combinations for both data sets is plotted in Figure 3 . For the case of Forum, we observe that incorporating content information adversely affects recommendation precision. This concurs with what we saw in our previous work (Wang et al., 2010) . On the other hand, when we test the Blog data set, the trend is the opposite, i.e. content similarity does contribute to retrieval performance positively. This is attributed by the text characteristics of these two forms of social media. Specifically, comments in news forums usually carry much richer structural information than blogs where comments are usually \"flat\" among themselves.",
"cite_spans": [
{
"start": 250,
"end": 269,
"text": "(Wang et al., 2010)",
"ref_id": "BIBREF27"
}
],
"ref_spans": [
{
"start": 71,
"end": 79,
"text": "Figure 3",
"ref_id": "FIGREF2"
}
],
"eq_spans": [],
"section": "Effect of Authority and Comments",
"sec_num": "4.3"
},
{
"text": "To evaluate the precision of interpreting the relationship between recommended articles and the original posting, the evaluation metric of success rate is defined as",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Recommendation Interpretation",
"sec_num": "4.4"
},
{
"text": "= \u2211 =1 (1 \u2212 )/ ,",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Recommendation Interpretation",
"sec_num": "4.4"
},
{
"text": "where is the number of recommended articles, is the error weight of recommended article . Here, the error weight is set to one if the result interpretation is mis-labelled.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Recommendation Interpretation",
"sec_num": "4.4"
},
{
"text": "From our studies, we observe that the success rate at top-10 is around 89.3% and 87.5% for the Forum and Blog data sets, respectively. Note that these rates include the errors introduced by the irrelevant articles returned by the retrieval module. To estimate optimal thresholds of generalization and specialization, we calculate the success rate at different threshold values and find that neither too small nor too large a value is appropriate for interpretation. In our experiments, we set generalization threshold \u0398 to 3.2 and specialization threshold \u0398 to 1.8 for the Forum data set, and \u0398 to 3.5 and \u0398 to 2.0 for Blog. Ideally, threshold values would need to be set through a machine learning process, which identifies proper values based on a given training sample.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Recommendation Interpretation",
"sec_num": "4.4"
},
{
"text": "The Web has become a platform for social networking, in addition to information dissemination at its earlier stage. Many of its applications are also being extended in this fashion. Traditional recommendation is essentially a push service to provide information according to the profile of individual or groups of users. Its niche at the Web 2.0 era lies in its ability to enable online discussion by serving up relevant references to the participants. In this work, we present a framework for information recommendation in such social media as Internet forums and blogs. This model incorporates information of user status and comment semantics and structures within the entire discussion thread. This framework models the logic connections among readers and the innovativeness of comments. By combining such information with traditional statistical language models, it is capable of suggesting relevant articles that meet the dynamic nature of a discussion in social media. One important discovery from this work is that, when integrating comment contents, the structural information among comments, and reader relationship, it is crucial to distinguish the characteristics of various forms of social media. The reason is that the role that the semantic content of a comment plays can differ from one form to another.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusion and Future Work",
"sec_num": "5"
},
{
"text": "This study can be extended in a few interesting ways. For example, we can also evaluate its effectiveness and costs during the operation of a discussion forum, where the discussion thread is continually updated by new comments and votes. Indeed, its power is yet to be further improved and investigated.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusion and Future Work",
"sec_num": "5"
},
{
"text": "http://technorati.com/",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "http://blogs.myhome.ie",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
}
],
"back_matter": [],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "Wiscoll: Collective wisdom based blog clustering",
"authors": [
{
"first": "Nitin",
"middle": [],
"last": "Agarwal",
"suffix": ""
},
{
"first": "Magdiel",
"middle": [],
"last": "Galan",
"suffix": ""
},
{
"first": "Huan",
"middle": [],
"last": "Liu",
"suffix": ""
},
{
"first": "Shankar",
"middle": [],
"last": "Subramanya",
"suffix": ""
}
],
"year": 2010,
"venue": "Information Sciences",
"volume": "180",
"issue": "1",
"pages": "39--61",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Nitin Agarwal, Magdiel Galan, Huan Liu, and Shankar Subramanya. 2010. Wiscoll: Collective wis- dom based blog clustering. Information Sciences, 180(1):39-61.",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "Open user profiles for adaptive news systems: help or harm?",
"authors": [
{
"first": "Jae-Wook",
"middle": [],
"last": "Ahn",
"suffix": ""
},
{
"first": "Peter",
"middle": [],
"last": "Brusilovsky",
"suffix": ""
},
{
"first": "Jonathan",
"middle": [],
"last": "Grady",
"suffix": ""
}
],
"year": 2007,
"venue": "Proceedings of the 16th International Conference on World Wide Web (WWW)",
"volume": "",
"issue": "",
"pages": "11--20",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Jae-wook Ahn, Peter Brusilovsky, Jonathan Grady, Daqing He, and Sue Yeon Syn. 2007. Open user profiles for adaptive news systems: help or harm? In Proceedings of the 16th International Conference on World Wide Web (WWW), pages 11-20.",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "Explorations within topic tracking and detection. Topic detection and tracking: event-based information organization Kluwer Academic Publishers",
"authors": [
{
"first": "James",
"middle": [],
"last": "Allan",
"suffix": ""
},
{
"first": "Victor",
"middle": [],
"last": "Lavrenko",
"suffix": ""
},
{
"first": "Russell",
"middle": [],
"last": "Swan",
"suffix": ""
}
],
"year": 2002,
"venue": "",
"volume": "",
"issue": "",
"pages": "197--224",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "James Allan, Victor Lavrenko, and Russell Swan. 2002. Explorations within topic tracking and detec- tion. Topic detection and tracking: event-based in- formation organization Kluwer Academic Publish- ers, pages 197-224.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "Modern information retrieval",
"authors": [
{
"first": "Ricardo",
"middle": [],
"last": "Baeza",
"suffix": ""
},
{
"first": "-",
"middle": [],
"last": "Yates",
"suffix": ""
},
{
"first": "Berthier",
"middle": [],
"last": "Ribeiro-Neto",
"suffix": ""
}
],
"year": 1999,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ricardo Baeza-Yates and Berthier Ribeiro-Neto. 1999. Modern information retrieval. Addison Wesley Longman Publisher.",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "Comparing and evaluating information retrieval algorithms for news recommendation",
"authors": [
{
"first": "Toine",
"middle": [],
"last": "Bogers",
"suffix": ""
},
{
"first": "Antal",
"middle": [],
"last": "Bosch",
"suffix": ""
}
],
"year": 2007,
"venue": "Proceedings of 2007 ACM conference on Recommender Systems",
"volume": "",
"issue": "",
"pages": "141--144",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Toine Bogers and Antal Bosch. 2007. Comparing and evaluating information retrieval algorithms for news recommendation. In Proceedings of 2007 ACM con- ference on Recommender Systems, pages 141-144.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "The anatomy of a large-scale hypertextual web search engine. Computer networks and ISDN systems",
"authors": [
{
"first": "Sergey",
"middle": [],
"last": "Brin",
"suffix": ""
},
{
"first": "Lawrence",
"middle": [],
"last": "Page",
"suffix": ""
}
],
"year": 1998,
"venue": "",
"volume": "30",
"issue": "",
"pages": "107--117",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Sergey Brin and Lawrence Page. 1998. The anatomy of a large-scale hypertextual web search engine. Computer networks and ISDN systems, 30(1-7):107-117.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "SEA: Segment-enrich-annotate paradigm for adapting dialog-based content for improved accessibility",
"authors": [
{
"first": "K",
"middle": [],
"last": "Sel\u00e7uk Candan",
"suffix": ""
},
{
"first": "Mehmet",
"middle": [
"E"
],
"last": "D\u00f6nderler",
"suffix": ""
},
{
"first": "Terri",
"middle": [],
"last": "Hedgpeth",
"suffix": ""
},
{
"first": "Jong",
"middle": [
"Wook"
],
"last": "Kim",
"suffix": ""
},
{
"first": "Qing",
"middle": [],
"last": "Li",
"suffix": ""
},
{
"first": "Maria",
"middle": [
"Luisa"
],
"last": "Sapino",
"suffix": ""
}
],
"year": 2009,
"venue": "ACM Transactions on Information Systems (TOIS)",
"volume": "27",
"issue": "3",
"pages": "1--45",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "K. Sel\u00e7uk Candan, Mehmet E. D\u00f6nderler, Terri Hedg- peth, Jong Wook Kim, Qing Li, and Maria Luisa Sapino. 2009. SEA: Segment-enrich-annotate paradigm for adapting dialog-based content for im- proved accessibility. ACM Transactions on Informa- tion Systems (TOIS), 27(3):1-45.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "Ontology-based personalized and contextaware recommendations of news items",
"authors": [
{
"first": "Ivan",
"middle": [],
"last": "Cantador",
"suffix": ""
},
{
"first": "Alejandro",
"middle": [],
"last": "Bellogin",
"suffix": ""
},
{
"first": "Pablo",
"middle": [],
"last": "Castells",
"suffix": ""
}
],
"year": 2008,
"venue": "Proceedings of IEEE/WIC/ACM international Conference on Web Intelligence and Intelligent Agent Technology (WI)",
"volume": "",
"issue": "",
"pages": "562--565",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ivan Cantador, Alejandro Bellogin, and Pablo Castells. 2008. Ontology-based personalized and context- aware recommendations of news items. In Pro- ceedings of IEEE/WIC/ACM international Confer- ence on Web Intelligence and Intelligent Agent Tech- nology (WI), pages 562-565.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "An intelligent news recommender agent for filtering and categorizing large volumes of text corpus",
"authors": [
{
"first": "Jung-Hsien",
"middle": [],
"last": "Chiang",
"suffix": ""
},
{
"first": "Yan-Cheng",
"middle": [],
"last": "Chen",
"suffix": ""
}
],
"year": 2004,
"venue": "International Journal of Intelligent Systems",
"volume": "19",
"issue": "3",
"pages": "201--216",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Jung-Hsien Chiang and Yan-Cheng Chen. 2004. An intelligent news recommender agent for filtering and categorizing large volumes of text corpus. Inter- national Journal of Intelligent Systems, 19(3):201- 216.",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "Combining content-based and collaborative filters in an online newspaper",
"authors": [
{
"first": "Mark",
"middle": [],
"last": "Claypool",
"suffix": ""
},
{
"first": "Anuja",
"middle": [],
"last": "Gokhale",
"suffix": ""
},
{
"first": "Tim",
"middle": [],
"last": "Miranda",
"suffix": ""
},
{
"first": "Pavel",
"middle": [],
"last": "Murnikov",
"suffix": ""
},
{
"first": "Dmitry",
"middle": [],
"last": "Netes",
"suffix": ""
},
{
"first": "Matthew",
"middle": [],
"last": "Sartin",
"suffix": ""
}
],
"year": 1999,
"venue": "Proceedings of the ACM SIGIR Workshop on Recommender Systems",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Mark Claypool, Anuja Gokhale, Tim Miranda, Pavel Murnikov, Dmitry Netes, and Matthew Sartin. 1999. Combining content-based and collaborative filters in an online newspaper. In Proceedings of the ACM SIGIR Workshop on Recommender Systems.",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "Google news personalization: scalable online collaborative filtering",
"authors": [
{
"first": "S",
"middle": [],
"last": "Abhinandan",
"suffix": ""
},
{
"first": "Mayur",
"middle": [],
"last": "Das",
"suffix": ""
},
{
"first": "Ashutosh",
"middle": [],
"last": "Datar",
"suffix": ""
},
{
"first": "Shyam",
"middle": [],
"last": "Garg",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Rajaram",
"suffix": ""
}
],
"year": 2007,
"venue": "Proceedings of the 16th International Conference on World Wide Web (WWW)",
"volume": "",
"issue": "",
"pages": "271--280",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Abhinandan S. Das, Mayur Datar, Ashutosh Garg, and Shyam Rajaram. 2007. Google news personaliza- tion: scalable online collaborative filtering. In Pro- ceedings of the 16th International Conference on World Wide Web (WWW), pages 271-280.",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"title": "Ranking a stream of news",
"authors": [
{
"first": "Gianna",
"middle": [
"M Del"
],
"last": "Corso",
"suffix": ""
},
{
"first": "Antonio",
"middle": [],
"last": "Gull\u00ed",
"suffix": ""
},
{
"first": "Francesco",
"middle": [],
"last": "Romani",
"suffix": ""
}
],
"year": 2005,
"venue": "Proceedings of the 14th International Conference on World Wide Web(WWW)",
"volume": "",
"issue": "",
"pages": "97--106",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Gianna M. Del Corso, Antonio Gull\u00ed, and Francesco Romani. 2005. Ranking a stream of news. In Proceedings of the 14th International Conference on World Wide Web(WWW), pages 97-106.",
"links": null
},
"BIBREF12": {
"ref_id": "b12",
"title": "Comparing performance of recommendation techniques in the blogsphere",
"authors": [
{
"first": "Mahmood",
"middle": [],
"last": "Kyumars Sheykh Esmaili",
"suffix": ""
},
{
"first": "Mohsen",
"middle": [],
"last": "Neshati",
"suffix": ""
},
{
"first": "Hassan",
"middle": [],
"last": "Jamali",
"suffix": ""
},
{
"first": "Jafar",
"middle": [],
"last": "Abolhassani",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Habibi",
"suffix": ""
}
],
"year": 2006,
"venue": "ECAI 2006 Workshop on Recommender Systems",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Kyumars Sheykh Esmaili, Mahmood Neshati, Mohsen Jamali, Hassan Abolhassani, and Jafar Habibi. 2006. Comparing performance of recommendation techniques in the blogsphere. In ECAI 2006 Work- shop on Recommender Systems.",
"links": null
},
"BIBREF13": {
"ref_id": "b13",
"title": "An analysis of bloggers, topics and tags for a blog recommender system",
"authors": [
{
"first": "Conor",
"middle": [],
"last": "Hayes",
"suffix": ""
},
{
"first": "Paolo",
"middle": [],
"last": "Avesani",
"suffix": ""
},
{
"first": "Uldis",
"middle": [],
"last": "Bojars",
"suffix": ""
}
],
"year": 2007,
"venue": "Workshop on Web Mining (WebMine)",
"volume": "",
"issue": "",
"pages": "1--20",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Conor Hayes, Paolo Avesani, and Uldis Bojars. 2007. An analysis of bloggers, topics and tags for a blog recommender system. In Workshop on Web Mining (WebMine), pages 1-20.",
"links": null
},
"BIBREF14": {
"ref_id": "b14",
"title": "Comments-oriented blog summarization by sentence extraction",
"authors": [
{
"first": "Meishan",
"middle": [],
"last": "Hu",
"suffix": ""
},
{
"first": "Aixin",
"middle": [],
"last": "Sun",
"suffix": ""
},
{
"first": "Ee-Peng",
"middle": [],
"last": "Lim",
"suffix": ""
}
],
"year": 2007,
"venue": "Proceedings of the sixteenth ACM Conference on Conference on Information and Knowledge Management(CIKM)",
"volume": "",
"issue": "",
"pages": "901--904",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Meishan Hu, Aixin Sun, and Ee-Peng Lim. 2007. Comments-oriented blog summarization by sen- tence extraction. In Proceedings of the sixteenth ACM Conference on Conference on Information and Knowledge Management(CIKM), pages 901-904.",
"links": null
},
"BIBREF15": {
"ref_id": "b15",
"title": "Using statistical testing in the evaluation of retrieval experiments",
"authors": [
{
"first": "David",
"middle": [],
"last": "Hull",
"suffix": ""
}
],
"year": 1993,
"venue": "Proceedings of the 16th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval",
"volume": "",
"issue": "",
"pages": "329--338",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "David Hull. 1993. Using statistical testing in the eval- uation of retrieval experiments. In Proceedings of the 16th Annual International ACM SIGIR Confer- ence on Research and Development in Information Retrieval, pages 329-338.",
"links": null
},
"BIBREF16": {
"ref_id": "b16",
"title": "Evaluation of item-based Top-N recommendation algorithms",
"authors": [
{
"first": "George",
"middle": [],
"last": "Karypis",
"suffix": ""
}
],
"year": 2001,
"venue": "Proceedings of the 10th International Conference on Information and Knowledge Management (CIKM)",
"volume": "",
"issue": "",
"pages": "247--254",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "George Karypis. 2001. Evaluation of item-based Top- N recommendation algorithms. In Proceedings of the 10th International Conference on Information and Knowledge Management (CIKM), pages 247- 254.",
"links": null
},
"BIBREF17": {
"ref_id": "b17",
"title": "Customized internet news services based on customer profiles",
"authors": [
{
"first": "Hung-Jen",
"middle": [],
"last": "Lai",
"suffix": ""
},
{
"first": "Ting-Peng",
"middle": [],
"last": "Liang",
"suffix": ""
},
{
"first": "Yi Cheng",
"middle": [],
"last": "Ku",
"suffix": ""
}
],
"year": 2003,
"venue": "Proceedings of the 5th International Conference on Electronic commerce (ICEC)",
"volume": "",
"issue": "",
"pages": "225--229",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Hung-Jen Lai, Ting-Peng Liang, and Yi Cheng Ku. 2003. Customized internet news services based on customer profiles. In Proceedings of the 5th Interna- tional Conference on Electronic commerce (ICEC), pages 225-229.",
"links": null
},
"BIBREF18": {
"ref_id": "b18",
"title": "Relevance based language models",
"authors": [
{
"first": "Victor",
"middle": [],
"last": "Lavrenko",
"suffix": ""
},
{
"first": "W. Bruce",
"middle": [],
"last": "Croft",
"suffix": ""
}
],
"year": 2001,
"venue": "Proceedings of the 24th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval",
"volume": "",
"issue": "",
"pages": "120--127",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Victor Lavrenko and W. Bruce Croft. 2001. Rele- vance based language models. In Proceedings of the 24th Annual International ACM SIGIR Confer- ence on Research and Development in Information Retrieval, pages 120-127.",
"links": null
},
"BIBREF19": {
"ref_id": "b19",
"title": "Language models for financial news recommendation",
"authors": [
{
"first": "Victor",
"middle": [],
"last": "Lavrenko",
"suffix": ""
},
{
"first": "Matt",
"middle": [],
"last": "Schmill",
"suffix": ""
},
{
"first": "Dawn",
"middle": [],
"last": "Lawrie",
"suffix": ""
},
{
"first": "Paul",
"middle": [],
"last": "Ogilvie",
"suffix": ""
},
{
"first": "David",
"middle": [],
"last": "Jensen",
"suffix": ""
},
{
"first": "James",
"middle": [],
"last": "Allan",
"suffix": ""
}
],
"year": 2000,
"venue": "Proceedings of the 9th International Conference on Information and Knowledge Management (CIKM)",
"volume": "",
"issue": "",
"pages": "389--396",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Victor Lavrenko, Matt Schmill, Dawn Lawrie, Paul Ogilvie, David Jensen, and James Allan. 2000. Language models for financial news recommenda- tion. In Proceedings of the 9th International Confer- ence on Information and Knowledge Management (CIKM), pages 389-396.",
"links": null
},
"BIBREF20": {
"ref_id": "b20",
"title": "MONERS: A news recommender for the mobile web",
"authors": [
{
"first": "Hong Joo",
"middle": [],
"last": "Lee",
"suffix": ""
},
{
"first": "Sung Joo",
"middle": [],
"last": "Park",
"suffix": ""
}
],
"year": 2007,
"venue": "Expert Systems with Applications",
"volume": "32",
"issue": "1",
"pages": "143--150",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Hong Joo Lee and Sung Joo Park. 2007. MONERS: A news recommender for the mobile web. Expert Systems with Applications, 32(1):143-150.",
"links": null
},
"BIBREF21": {
"ref_id": "b21",
"title": "Probabilistic approaches to topic detection and tracking. Topic detection and tracking: eventbased information organization",
"authors": [
{
"first": "Tim",
"middle": [],
"last": "Leek",
"suffix": ""
},
{
"first": "Richard",
"middle": [],
"last": "Schwartz",
"suffix": ""
},
{
"first": "Srinivasa",
"middle": [],
"last": "Sista",
"suffix": ""
}
],
"year": 2002,
"venue": "",
"volume": "",
"issue": "",
"pages": "67--83",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Tim Leek, Richard Schwartz, and Srinivasa Sista. 2002. Probabilistic approaches to topic detection and tracking. Topic detection and tracking: event- based information organization, pages 67-83.",
"links": null
},
"BIBREF22": {
"ref_id": "b22",
"title": "A synthetical approach for blog recommendation: Combining trust, social relation, and semantic analysis",
"authors": [
{
"first": "Yung-Ming",
"middle": [],
"last": "Li",
"suffix": ""
},
{
"first": "Ching-Wen",
"middle": [],
"last": "Chen",
"suffix": ""
}
],
"year": 2009,
"venue": "Expert Systems with Applications",
"volume": "36",
"issue": "3",
"pages": "6536--6547",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Yung-Ming Li and Ching-Wen Chen. 2009. A synthet- ical approach for blog recommendation: Combining trust, social relation, and semantic analysis. Expert Systems with Applications, 36(3):6536 -6547.",
"links": null
},
"BIBREF23": {
"ref_id": "b23",
"title": "A language modeling approach to information retrieval",
"authors": [
{
"first": "Jay",
"middle": [],
"last": "Michael Ponte",
"suffix": ""
},
{
"first": "William",
"middle": [
"Bruce"
],
"last": "Croft",
"suffix": ""
}
],
"year": 1998,
"venue": "Proceedings of the 21st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval",
"volume": "",
"issue": "",
"pages": "275--281",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Jay Michael Ponte and William Bruce Croft. 1998. A language modeling approach to information re- trieval. In Proceedings of the 21st Annual Interna- tional ACM SIGIR Conference on Research and De- velopment in Information Retrieval, pages 275-281.",
"links": null
},
"BIBREF24": {
"ref_id": "b24",
"title": "News recommender system based on topic detection and tracking",
"authors": [
{
"first": "Jing",
"middle": [],
"last": "Qiu",
"suffix": ""
},
{
"first": "Lejian",
"middle": [],
"last": "Liao",
"suffix": ""
},
{
"first": "Peng",
"middle": [],
"last": "Li",
"suffix": ""
}
],
"year": 2009,
"venue": "Proceedings of the 4th Rough Sets and Knowledge Technology",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Jing Qiu, Lejian Liao, and Peng Li. 2009. News recommender system based on topic detection and tracking. In Proceedings of the 4th Rough Sets and Knowledge Technology.",
"links": null
},
"BIBREF25": {
"ref_id": "b25",
"title": "Some simple effective approximations to the 2-poisson model for probabilistic weighted retrieval",
"authors": [
{
"first": "E",
"middle": [],
"last": "Stephen",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Robertson",
"suffix": ""
},
{
"first": "G",
"middle": [],
"last": "Stephen",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Walker",
"suffix": ""
}
],
"year": 1994,
"venue": "Proceedings of the 17th ACM SIGIR conference on Research and Development in Information Retrieval",
"volume": "",
"issue": "",
"pages": "232--241",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Stephen E. Robertson and Stephen G Walker. 1994. Some simple effective approximations to the 2- poisson model for probabilistic weighted retrieval. In Proceedings of the 17th ACM SIGIR conference on Research and Development in Information Re- trieval, pages 232-241.",
"links": null
},
"BIBREF26": {
"ref_id": "b26",
"title": "Recommendation agents for electronic commerce: Effects of explanation facilities on trusting beliefs",
"authors": [
{
"first": "Weiquan",
"middle": [],
"last": "Wang",
"suffix": ""
},
{
"first": "Izak",
"middle": [],
"last": "Benbasat",
"suffix": ""
}
],
"year": 2007,
"venue": "Journal of Management Information Systems",
"volume": "23",
"issue": "4",
"pages": "217--246",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Weiquan Wang and Izak Benbasat. 2007. Recommen- dation agents for electronic commerce: Effects of explanation facilities on trusting beliefs. Journal of Management Information Systems, 23(4):217-246.",
"links": null
},
"BIBREF27": {
"ref_id": "b27",
"title": "User comments for news recommendation in social media",
"authors": [
{
"first": "Jia",
"middle": [],
"last": "Wang",
"suffix": ""
},
{
"first": "Qing",
"middle": [],
"last": "Li",
"suffix": ""
},
{
"first": "Yuanzhu Peter",
"middle": [],
"last": "Chen",
"suffix": ""
}
],
"year": 2010,
"venue": "Proceedings of the 33rd ACM SIGIR Conference on Research and Development in Information Retrieval",
"volume": "",
"issue": "",
"pages": "295--296",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Jia Wang, Qing Li, and Yuanzhu Peter Chen. 2010. User comments for news recommendation in social media. In Proceedings of the 33rd ACM SIGIR Con- ference on Research and Development in Informa- tion Retrieval, pages 295-296.",
"links": null
},
"BIBREF28": {
"ref_id": "b28",
"title": "Learning approaches for detecting and tracking news events",
"authors": [
{
"first": "Yiming",
"middle": [],
"last": "Yang",
"suffix": ""
},
{
"first": "Jaime",
"middle": [
"Guillermo"
],
"last": "Carbonell",
"suffix": ""
},
{
"first": "Ralf",
"middle": [
"D"
],
"last": "Brown",
"suffix": ""
},
{
"first": "Thomas",
"middle": [],
"last": "Pierce",
"suffix": ""
},
{
"first": "Brian",
"middle": [
"T"
],
"last": "Archibald",
"suffix": ""
},
{
"first": "Xin",
"middle": [],
"last": "Liu",
"suffix": ""
}
],
"year": 1999,
"venue": "IEEE Intelligent Systems",
"volume": "14",
"issue": "4",
"pages": "32--43",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Yiming Yang, Jaime Guillermo Carbonell, Ralf D. Brown, Thomas Pierce, Brian T. Archibald, and Xin Liu. 1999. Learning approaches for detecting and tracking news events. IEEE Intelligent Systems, 14(4):32-43.",
"links": null
},
"BIBREF29": {
"ref_id": "b29",
"title": "How reliable are the results of large-scale information retrieval experiments?",
"authors": [
{
"first": "Justin",
"middle": [],
"last": "Zobel",
"suffix": ""
}
],
"year": 1998,
"venue": "Proceedings of the 21st International ACM SIGIR Conference on Research and Development in Information Retrieval",
"volume": "",
"issue": "",
"pages": "307--314",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Justin Zobel. 1998. How reliable are the results of large-scale information retrieval experiments? In Proceedings of the 21st International ACM SIGIR Conference on Research and Development in Infor- mation Retrieval, pages 307-314.",
"links": null
}
},
"ref_entries": {
"FIGREF0": {
"type_str": "figure",
"num": null,
"uris": null,
"text": "Multi-relation graph of comments based on the structural and semantic information denoted = ( , )."
},
"FIGREF1": {
"type_str": "figure",
"num": null,
"uris": null,
"text": "RUN 2 (Posting+Authority): the topic profile is constructed based on the original posting and participant authority. \u2022 RUN 3 (Posting+Comment): the topic profile is constructed based on the original posting and its comments. \u2022 RUN 4 (All): the topic profile is constructed based on the original posting, user authority, and its comments."
},
"FIGREF2": {
"type_str": "figure",
"num": null,
"uris": null,
"text": "Effect of content, quotation and reply relation\u2022 Content Relation (CR): only the content relation matrix is used in scoring the comments."
},
"TABREF0": {
"type_str": "table",
"num": null,
"html": null,
"content": "<table><tr><td/><td>Synthetic Data Set</td><td colspan=\"2\">Forum Blog</td></tr><tr><td/><td>No. of postings</td><td>20</td><td>15</td></tr><tr><td>Topics</td><td colspan=\"2\">Ave. length of postings No. of comments per posting 81.4 676</td><td>236 46</td></tr><tr><td/><td>Ave. length of comments</td><td>45</td><td>150</td></tr><tr><td>Target</td><td>No. of articles Ave. length of articles</td><td colspan=\"2\">16718 15110 583 317</td></tr></table>",
"text": "Evaluation data set"
},
"TABREF1": {
"type_str": "table",
"num": null,
"html": null,
"content": "<table><tr><td/><td/><td colspan=\"2\">Precision</td><td colspan=\"2\">Novelty</td></tr><tr><td>Data</td><td>Method</td><td>@10</td><td/><td>@10</td><td/></tr><tr><td/><td>Okapi</td><td>0.827</td><td>0.833</td><td>0.807</td><td>0.751</td></tr><tr><td>Forum</td><td>LM</td><td>0.804</td><td>0.833</td><td>0.807</td><td>0.731</td></tr><tr><td/><td>Our</td><td>0.967</td><td>0.967</td><td>0.9</td><td>0.85</td></tr><tr><td/><td>Okapi</td><td>0.733</td><td>0.651</td><td>0.667</td><td>0.466</td></tr><tr><td>Blog</td><td>LM</td><td>0.767</td><td>0.718</td><td>0.70</td><td>0.524</td></tr><tr><td/><td>Our</td><td>0.933</td><td>0.894</td><td>0.867</td><td>0.756</td></tr></table>",
"text": "Overall performance"
},
"TABREF2": {
"type_str": "table",
"num": null,
"html": null,
"content": "<table><tr><td/><td/><td colspan=\"2\">Precision</td><td colspan=\"2\">Novelty</td></tr><tr><td/><td>Method</td><td>@10</td><td/><td>@10</td><td/></tr><tr><td/><td>RUN1</td><td>0.88</td><td>0.869</td><td>0.853</td><td>0.794</td></tr><tr><td>Forum</td><td>RUN2</td><td>0.933</td><td>0.911</td><td>0.9</td><td>0.814</td></tr><tr><td/><td>RUN3</td><td>0.94</td><td>0.932</td><td>0.9</td><td>0.848</td></tr><tr><td/><td>RUN4</td><td>0.967</td><td>0.967</td><td>0.9</td><td>0.85</td></tr><tr><td/><td>RUN1</td><td>0.767</td><td>0.758</td><td>0.7</td><td>0.574</td></tr><tr><td>Blog</td><td>RUN2</td><td>0.867</td><td>0.828</td><td>0.833</td><td>0.739</td></tr><tr><td/><td>RUN3</td><td>0.9</td><td>0.858</td><td>0.833</td><td>0.728</td></tr><tr><td/><td>RUN4</td><td>0.933</td><td>0.894</td><td>0.867</td><td>0.756</td></tr></table>",
"text": "Performance of four runs"
}
}
}
} |