File size: 93,434 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 |
{
"paper_id": "O09-1005",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T08:10:57.616641Z"
},
"title": "Web Mining for Unsupervised Classification",
"authors": [
{
"first": "Wei-Yen",
"middle": [],
"last": "\u6234\u744b\u5f65",
"suffix": "",
"affiliation": {},
"email": ""
},
{
"first": "",
"middle": [],
"last": "Day",
"suffix": "",
"affiliation": {},
"email": ""
},
{
"first": "Chun-Yi",
"middle": [],
"last": "\u7d00\u5747\u6613",
"suffix": "",
"affiliation": {},
"email": ""
},
{
"first": "",
"middle": [],
"last": "Chi",
"suffix": "",
"affiliation": {},
"email": ""
},
{
"first": "Ruey-Cheng",
"middle": [],
"last": "\u9673\u745e\u5448",
"suffix": "",
"affiliation": {},
"email": ""
},
{
"first": "",
"middle": [],
"last": "Chen",
"suffix": "",
"affiliation": {},
"email": ""
},
{
"first": "\u912d\u535c\u58ec",
"middle": [],
"last": "Pu",
"suffix": "",
"affiliation": {},
"email": ""
},
{
"first": "Jen",
"middle": [],
"last": "Cheng",
"suffix": "",
"affiliation": {},
"email": "pjcheng@csie.ntu.edu.tw"
},
{
"first": "Pei-Sen",
"middle": [],
"last": "\u5289\u57f9\u68ee",
"suffix": "",
"affiliation": {},
"email": ""
},
{
"first": "",
"middle": [],
"last": "Liu",
"suffix": "",
"affiliation": {},
"email": ""
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "Data acquisition is a major concern in text classification. The excessive human efforts required by conventional methods to build up quality training collection might not always be available to research workers. In this paper, we look into possibilities to automatically collect training data by sampling the Web with a set of given class names. The basic idea is to populate appropriate keywords and submit them as queries to search engines for acquiring training data. Two methods are presented in this study: One method is based on sampling the common concepts among the classes, and the other based on sampling the discriminative concepts for each class. A series of experiments were carried out independently on two different datasets, and the result shows that the proposed methods significantly improve classifier performance even without using manually labeled training data. Our strategy for 53 retrieving Web samples, we find that, is substantially helpful in conventional document classification in terms of accuracy and efficiency.",
"pdf_parse": {
"paper_id": "O09-1005",
"_pdf_hash": "",
"abstract": [
{
"text": "Data acquisition is a major concern in text classification. The excessive human efforts required by conventional methods to build up quality training collection might not always be available to research workers. In this paper, we look into possibilities to automatically collect training data by sampling the Web with a set of given class names. The basic idea is to populate appropriate keywords and submit them as queries to search engines for acquiring training data. Two methods are presented in this study: One method is based on sampling the common concepts among the classes, and the other based on sampling the discriminative concepts for each class. A series of experiments were carried out independently on two different datasets, and the result shows that the proposed methods significantly improve classifier performance even without using manually labeled training data. Our strategy for 53 retrieving Web samples, we find that, is substantially helpful in conventional document classification in terms of accuracy and efficiency.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "Document classification has been extensively studied in the fields of data mining and machine learning. Conventionally, document classification is a supervised learning task [1, 2] in which adequately labeled documents should be given so that various classification models, i.e., classifiers, can be learned accordingly. However, such requirement for supervised text classification has its limitations in practice. First, the cost to manually label sufficient amount of training documents can be high. Secondly, the quality of labor works is suspicious, especially when one is unfamiliar with the topics of given classes. Thirdly, in certain applications, such as email spam filtering, prototypes for documents considered as spam might change over time, and the need to access the dynamic training corpora specifically-tailored for this kind of application emerges. Automatic methods for data acquisition, therefore, can be very important in real-world classification work and require further exploration.",
"cite_spans": [
{
"start": 174,
"end": 177,
"text": "[1,",
"ref_id": "BIBREF0"
},
{
"start": 178,
"end": 180,
"text": "2]",
"ref_id": "BIBREF1"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1."
},
{
"text": "Previous works on automatic acquisition of training sets can be divided in two types. One of which focused on augmenting a small number of labeled training documents with a large pool of unlabeled documents. The key idea from these works is to train an initial classifier to label the unlabeled documents and uses the newly-labeled data to retrain the classifier iteratively. Although classifying unlabeled data is efficient, human effort is still involved in the beginning of the training process.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1."
},
{
"text": "The other type of work focused on collecting training data from the Web. As more data is being put on the Web every day, there is a great potential to exploit the Web and devise algorithms that automatically fetch effective training data for diverse topics. A major challenge for Web-based methods is the way to locate quality training data by sending effective queries, e.g., class names, to search engines. This type of works can be found in [3, 4, 5, 6] , which present an approach that assumes the search results initially returned from a class name are relevant to the class. Then the search results are treated as auto-labeled and additional associated terms with the class names are extracted from the labeled data. By sending the class names together with the associated terms, appropriate training documents can be retrieved automatically. Although generating queries is more convenient than manually collecting training data, the quality of the initial search results may not always be good especially when the given classes have multiple concepts. For example, the concepts of class \"Apple\" include company and fruit. Such a problem can be observed widely in various applications.",
"cite_spans": [
{
"start": 444,
"end": 447,
"text": "[3,",
"ref_id": "BIBREF2"
},
{
"start": 448,
"end": 450,
"text": "4,",
"ref_id": "BIBREF3"
},
{
"start": 451,
"end": 453,
"text": "5,",
"ref_id": "BIBREF4"
},
{
"start": 454,
"end": 456,
"text": "6]",
"ref_id": "BIBREF5"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1."
},
{
"text": "The goal of this paper is, given a set of concept classes, to automatically acquire training corpus based merely on the names of the given classes. Similar to our previous attempts, we employ a technique to produce keywords by expanding the concepts encompassed in the class names, query the search engines, and use the returned snippets as training instances in the subsequent classification tasks. Two issues may arise with this technique. First, the given class names are usually very short and ambiguous, making search results less relevant to the classes. Secondly, the expanded keywords generated from different classes may be very close to each other so that the corresponding search-result snippets have little discrimination power to distinguish one class from the others.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1."
},
{
"text": "We present two concept expansion methods to deal with these problems, respectively. The first method, expansion by common concepts, aims at alleviating the problem of ambiguous class names. The method utilizes the relations among the classes to discover their common concepts. For example, \"company\" could be one of the common concepts of classes \"Apple\" and \"Microsoft\". Combined with the common concepts, relevant training documents to the given classes can be retrieved. The second method, expansion by discriminative concepts, aims at finding discriminative concepts among the given classes. For example, \"iPod\" could be one of the unique concepts of class \"Apple\". Combined with the discriminative concepts, effective training documents that distinguish one class from another can be retrieved.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1."
},
{
"text": "Our methods are tested under two different experimental setups, the CS papers and Web pages classification tasks. The proposed methods are effective in retrieving quality training data by querying search engines. Moreover, the result shows that the obtained Web training data and manually labeled training data are complementary. Our methods can significantly improve classification accuracy when only a few manually labeled training data is available. Contribution of our work can be addressed as follows. We propose an automatic way to sample the Web and collect the training data with good quality. Apart from the previous work, our methods are fully automatic, reliable, and robust, and achieve an 81% accuracy in text classification tasks. With a little help from a small number of labeled data added into the scene, the classification accuracy can be as high up to 90%. Several experiment results are also revealed to help investigation and realization of automatic Web sampling methods, in which the difficulties encountered are presented in detail.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1."
},
{
"text": "The sections are organized as follows. In Sections 2 and 3, we present our basic idea and the two methodologies, respectively. The experiments are introduced in Section 4. In Section 5, we discuss the related work of this paper. Finally, in Section 6, we give out discussions and conclusions.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1."
},
{
"text": "Suppose that we are given a set of classes C=(c 1 , c 2 , \u2026, c n ), where c i is the name of the i-th class. We plan to generate keywords based on classes C, form a few queries and send them off to search engines so as to collect training instances. Our methods presented in this paper are independent of classification models; that is, any model can be incorporated with our methods.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The Basic Idea",
"sec_num": "2."
},
{
"text": "To carefully examine the possibility of querying search engines for acquiring training data, we did an evaluation with different search engines, search-result types (snippet or document), and the number of search results. 5 CS-related classes were taken into account, including \"Architecture\", \"IR\", \"Network\", \"Programming\", and \"Theory\". Each class name c i was sent to 3 search engines, including Google 1 , Yahoo! 2 , and Live Search 3 . Top 100 snippets were extracted as training data. We also gathered the research papers from the corresponding conferences to the 5 classes as the testing documents. Table 1 shows the performance of different search engines. Querying by the class names can achieve classification accuracy at a range from 0.35 to 0.56. More specifically, the three search engines perform well in \"Programming\" and \"Theory\" but poorly in the others on average. This arises from the fact that irrelevant documents may be located for those classes with ambiguous names. The way to query by the class names is not reliable due to the ambiguity of the class names (the first challenge). For example, the word \"architecture\" is widely used in CS, art and construction. From the results, we select Google as our backend search engine in this paper.",
"cite_spans": [
{
"start": 438,
"end": 439,
"text": "3",
"ref_id": "BIBREF2"
}
],
"ref_spans": [
{
"start": 607,
"end": 614,
"text": "Table 1",
"ref_id": "TABREF0"
}
],
"eq_spans": [],
"section": "The Basic Idea",
"sec_num": "2."
},
{
"text": "We further explore if the classification performance can be improved by downloading Web pages for training. The result is shown in Table 2 . It reveals that Web pages might introduce more noises than snippets do, while the snippets summarize Web pages and capture the concepts of classes C by their context. Moreover, to download Web pages is time-consuming. Our methods, therefore, only retrieve snippets as the training source. Intuitively, collecting more snippets or documents might enhance the performance. Table 3 shows the results of changing training data sizes from 100 to 900. It could be found that classification accuracy does not increase obviously when the numbers of snippets and documents reach 200 and 300, respectively. This is because much relevant information can be retrieved in top ranked search results returned by the search engine. Noises are unavoidably included from longer lists. Hence, simply fetching a large amount of snippets or documents from a single search result cannot achieve satisfactory performance. Even if we expand the queries, i.e., the class names, using pseudo-relevance feedback (PRF) [7, 8, 9] , the improvement is still minor since the generated expanded keywords cannot effectively discriminate different classes (our second challenge). The performance comparison between our methods and PRF will be given in Section 4.2.",
"cite_spans": [
{
"start": 1132,
"end": 1135,
"text": "[7,",
"ref_id": "BIBREF6"
},
{
"start": 1136,
"end": 1138,
"text": "8,",
"ref_id": "BIBREF7"
},
{
"start": 1139,
"end": 1141,
"text": "9]",
"ref_id": "BIBREF8"
}
],
"ref_spans": [
{
"start": 131,
"end": 138,
"text": "Table 2",
"ref_id": "TABREF1"
},
{
"start": 512,
"end": 519,
"text": "Table 3",
"ref_id": null
}
],
"eq_spans": [],
"section": "The Basic Idea",
"sec_num": "2."
},
{
"text": "To collect good training corpora and help classifiers learn more quickly (querying search engines is costly), two methods are proposed in this paper. The first method, expansion by common concepts, aims at alleviating the ambiguity problem. Generally, a short class name easily conveys multiple meanings. For example, class \"Apple\" may be a fruit or company name. We find that class c i is context-aware if its context C -{c i } provides relevant information to c i . For example, if \"Apple\" and \"Microsoft\" are put together, \"Apple\" would be a company. If we are given \"apple\" and \"banana\", \"apple\" could refer to a fruit. Our first method, which will be described in Section 3.1, is trying to discover such common concepts among classes C, i.e., \"company\" and \"fruit\", from the Web, and use them as constraints to expand our original queries C. Common concepts can help us collect more relevant documents to each class but cannot discriminate one class from the others. The latter becomes important because classification is inherently to distinguish different classes. Our second method is focused on the finding of discriminative concepts among classes C. Consider previous example. \"PowerPoint\" and \"iPod\" are possible discriminative concepts because \"PowerPoint\" is only relevant to \"Microsoft\" while \"iPod\" is only about \"Apple\". Different from PRF, our second method, expansion by discriminative concepts, which will be described in Section 3.2, aims at acquiring Web training data not only relevant to each class but also effectively distinguishing one class from another.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The Basic Idea",
"sec_num": "2."
},
{
"text": "In this section, we will describe the two training data acquiring methods, sampling the Web by common concepts expansion and discriminative concepts expansion, respectively.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The Proposed Methods",
"sec_num": "3."
},
{
"text": "The goal of our first method is to collect training data via sampling the Web by discovering the common concepts between given classes C. Expanding class names C by their common concepts is helpful in obtaining more suitable training data from search engines. An intuitive way to discover the concepts is to find common concepts from well-known topic hierarchies on the Web such as Open Directory Project 4 (DMOZ), which is one of the largest and comprehensive human-edited directories. To obtain common concepts, we first search DMOZ by each class name c i and get a set of the nodes relevant to c i in the DMOZ directory. Suppose the set of the nodes is N(c i ). The least common ancestors (LCA) of all of the nodes N(c i ) (i=1\u2026n) are viewed as the common concepts of C. The LCAs are the shared ancestors of N(c i ) (i=1\u2026n) located farthest from the roots of the DMOZ directory. For example, by searching class \"Architecture\", we get the path \"Arts: Architecture\" and \"Computers: Emulators: Intel x86 Architecture\". When search the class \"Programming\", we find it has the same common concept of \"Computers\" (from \"Computers: Programming\") with \"Architecture\". Thus the concept \"Computers\" would be the common concepts between the two classes \"Architecture\" and \"Programming\".",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Expansion by Common Concepts",
"sec_num": "3.1"
},
{
"text": "Although Open Directory Project covers diverse topics and is very precise, sometimes we might get few or even no common concepts among C. The problem is serious for those classes not so popular such as names of person or organizations. For example, if we query the class \"Cornell\", we only get 5 paths for the class, which contains few candidates of concepts to select and expand. To deal with this problem, we extract terms co-occurring with each class c i in Web pages, cluster the terms, and treat the representative term for each class as one of the common concepts. More specifically, all of the classes {c 1 , c 2 , \u2026 , c n }\uf0ce C are combined into one query \"c 1 + c 2 + \u2026 + c n \", and then submitted to a search engine. After stemming and removing stopwords, we extract 20 high-frequency terms as candidates for common concepts from top 100 snippets returned from the search engine. To group these candidates, we send them separately to the search engine and generate corresponding feature vectors based on their top 100 snippets. Uni-and bi-grams are adopted as feature terms and TF-IDF is used to calculate feature weights. Next, a graph G = (V, E) is constructed, where v \uf0ceV represents one candidate term, and e\uf0ce E is the cosine similarity between two feature vectors. Finally, we perform the star clustering algorithm [10] to choose the star centers, which are the common concepts among C.",
"cite_spans": [
{
"start": 1328,
"end": 1332,
"text": "[10]",
"ref_id": "BIBREF9"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Expansion by Common Concepts",
"sec_num": "3.1"
},
{
"text": "In this paper, we adopt both of LCAs from DMOZ and co-occurring terms from Web pages as our common concepts among C. After common concepts generated, we can either use it to sample the Web and acquire good training data, or utilize them while discriminative concepts are generating.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Expansion by Common Concepts",
"sec_num": "3.1"
},
{
"text": "A discriminative concept is a concept that can help distinguish one certain concept class of interest (say, c) from all the classes (c'\u2260c). Such a concept contributes more relevance to one specific class than to the others. Unlike common concepts, which are shared by all the concept classes in C, any discriminative concept has a specific concept class to contribute relevance to, called the host. Let f c be the feature vector of concept class c. Let the similarity between any two concepts x and y be denoted as\u03c3 x,y = cos(f x , f y ). An ideal discriminative concept k for concept c must satisfy all the following constraints:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Expansion by Discriminative Concepts",
"sec_num": "3.2"
},
{
"text": "1. Concept k should exhibit high similarity to its host c.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Expansion by Discriminative Concepts",
"sec_num": "3.2"
},
{
"text": "The similarity between k and c should be significantly greater than that between k and any one of the other concept classes.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "2.",
"sec_num": null
},
{
"text": "These constraints loosely define the criteria that we can use to discover discriminative concepts, and they also rule out the possibility that a concept k has two or more hosts. Based on the second constraint, a plausible decision criteria for discriminative concept is given below. Let \u03ba c denote the set of all discriminative concepts hosted by concept class c. We have:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "2.",
"sec_num": null
},
{
"text": "k \u2208 \u03ba \u27fa \u03c3 c,k \u03c3 c \u2032 ,k > \u2032 \u2260",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "2.",
"sec_num": null
},
{
"text": "In the criteria, the right-hand side equation needs to be satisfied for all other concept classes c'; in other words, we have a multiple-constraint-satisfaction problem. For every concept-class pair (c, c'), the ratio \u03c3 c,k /\u03c3 c',k describes the degree of deviation in similarities exhibited by k toward both classes. When the value is greater than 1, we say that c is more likely to be the host; when it lies between 0 and 1, we say that c' is more likely. The parameter\u03b8 determines the tightness of the decision boundary. Since we expect higher similarity between k and c than that between k and other c's, it would normally be defined as a value greater than 1.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "2.",
"sec_num": null
},
{
"text": "Generally, fixed boundary value is easier to train and suitable for general cases, while we also find that this type of setup can cause problems in extreme cases. Suppose we have two classes c 1 and c 2 which are relevant topics or extraordinarily similar to each other (in terms of the similarity between their feature vectors). The number of discriminative concepts for either c 1 or c 2 may drastically decrease because, for most k's, deviation in similarities toward both classes becomes even more subtle and harder to detect by using a simple constant\u03b8 . An obvious solution to this problem, we find, is to adopt a function in place of the constant\u03b8 , that assigns high threshold value for general cases and low threshold value for the aforementioned extreme cases. In real practice, we use a very simple form of decision criteria to identify discriminative concepts:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "2.",
"sec_num": null
},
{
"text": "k \u2208 \u03ba \u27fa \u03c3 c,k \u03c3 c \u2032 ,k > (1 \u2212 \u03c3 c,c \u2032 ) for all c\u2032 \u2260 c",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "2.",
"sec_num": null
},
{
"text": "where\u03b4 is the discrimination coefficient. With the new criteria, a number of 5 to 40 discriminative concepts (for each class) can still be discovered even when any two concept classes exhibit high class-to-class similarity to each other.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "2.",
"sec_num": null
},
{
"text": "The next step is to apply this technique to each concept class in C so as to populate new training instances from the Web. Let SR c be the set of search-result snippets obtained by sending concept c as a query to the search engine. Assume that the training set for concept class c before and after the expansion is denoted as D c and D' c , respectively. Given \u03ba c , we can form a set of new queries by concatenating c with each k\uf0ce \u03ba c ,, send them off to the search engine, and obtain a new set of training instances, i.e., { SR c \u222a k \uf0ce \u03ba c | k\uf0ce \u03ba c }. In formalism, we have:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "2.",
"sec_num": null
},
{
"text": "D \u2032 c = D c \u222a k\u2208\u03ba c SR c\u222ak",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "2.",
"sec_num": null
},
{
"text": "This procedure can be repeated several times for each class so that the total number of discovered training instances can reach our expectation. However, certain changes on definitions and notations required by the adaptation needs to be clarified in advance. First, we can no longer expect that the feature vector for a concept class c remains the same throughout multiple iterations. In each iteration, when new training instances added to the collection, feature vectors for c actually changes. Next, the set of discriminative concepts discovered in each iteration would vary, as similarity measure suffers from the change as well. Certain modification in definitions should be taken care of so as to seamlessly fit the aforementioned criteria into the framework, while treating notations for a concept and for a concept class differently might clutter up the framework. For simplicity, no explicit treatment will be done to the equations in the following text. Readers should take caution that, when class-to-concept or class-to-class similarity computation is considered in discussions, the feature vector referred to a concept class is in fact derived from its current training set (rather than SR c ). On the other hand, we will use (i) in place of plain in the rest of the work.",
"cite_spans": [
{
"start": 1240,
"end": 1243,
"text": "(i)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "2.",
"sec_num": null
},
{
"text": "Assume that the algorithm repeats t times. The initial training data for concept class c is denoted as D c (0) , and in each iteration i\uf0ce [1,t] , a new training set for c is produced and represented by D c (i) . Consider a simple framework as follows. For all c\uf0ce C, we have:",
"cite_spans": [
{
"start": 107,
"end": 110,
"text": "(0)",
"ref_id": null
},
{
"start": 138,
"end": 143,
"text": "[1,t]",
"ref_id": null
},
{
"start": 206,
"end": 209,
"text": "(i)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "2.",
"sec_num": null
},
{
"text": "D c 0 = SR c D c (i) = D c (i) \u222a k\u2208\u03ba c (i) SR c\u222ak , i > 0 where D c (i) and (i)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "2.",
"sec_num": null
},
{
"text": "is the set of training instances and the set of discovered discriminative concepts, respectively, for concept class c at iteration i. Eventually, the algorithm stops after the t-th iteration. The content of D c (t) will serve as the final training data for all concept class c.",
"cite_spans": [
{
"start": 211,
"end": 214,
"text": "(t)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "2.",
"sec_num": null
},
{
"text": "Since practically it is infeasible to populate the entire set of \u03ba c , several heuristics are involved in creation of the set: 1) We look for terms with high discrimination power (specifically, unigram and bigrams) in the context of D (i-1) using commonly-used information-theoretic measures, such as information gain and inverse document-frequency. These candidates are then examined with the decision criteria and disqualified ones are discarded immediately; 2) candidates that survived the test are ranked accordingly by the score function, which is a simple rewrite of the criteria that indicates the average degree of deviation for the candidate k:",
"cite_spans": [
{
"start": 235,
"end": 240,
"text": "(i-1)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "2.",
"sec_num": null
},
{
"text": "1 c \u2212 1 \u03c3 c,k \u03c3 c\u2032,k \u2212 \u03b4(1 \u2212 \u03c3 c,c \u2032 ) c\u2032\u2260c",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "2.",
"sec_num": null
},
{
"text": "The summands will not cancel out since the score is calculated for the candidates satisfying the criteria. Generally, testing all the candidate terms may result in an extremely inefficient procedure. In practice, we set up a strict threshold on the information gain and idf in light of reducing the number of candidates. We test only the top m concepts selected by the filter in the end. The value m is set to be 15 throughout the work.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "2.",
"sec_num": null
},
{
"text": "We evaluate our performance in CS papers and Web pages classification.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Experiments",
"sec_num": "4."
},
{
"text": "We conduct experiments on two datasets. First is a set of papers from several CS-related conferences, and there are five classes used for training, including \"Architecture\", \"IR\", \"Network\", \"Programming\", and \"Theory\", as shown in Table 4 . For the paper dataset, there are about 500 papers in each class. Another dataset is the Web pages collected from four universities, and can be downloaded from the WebKB project 5 . The classes for these universities include \"Cornell\", \"Texas\", \"Washington\", and \"Wisconsin\". As the original dataset for Web pages is imbalanced, we randomly choose 827 Web pages (i.e. the minimum size of original data among the 4 classes) for classification. Please note that the two datasets are our testing data since the training data are fully collected from the Web. Moreover, the two datasets are quite different in document length and quality. The papers are often longer, well written, and with much useful information about the CS-related classes, while the Web pages might cover more noises and shorter contents.",
"cite_spans": [
{
"start": 419,
"end": 420,
"text": "5",
"ref_id": "BIBREF4"
}
],
"ref_spans": [
{
"start": 232,
"end": 239,
"text": "Table 4",
"ref_id": "TABREF2"
}
],
"eq_spans": [],
"section": "Experimental Setup",
"sec_num": "4.1"
},
{
"text": "Our first method of expansion by common concepts is denoted as CM; the second method of expansion by discriminative concepts is denoted as DM; CM+DM is the combination of both methods, where CM is applied first so that search results could be more relevant, and then DM is used to extract discriminative concepts from the relevant search results. With the common concepts extracted from CM, we can use these concepts plus the class name as a whole query and perform DM to iteratively collect the discriminative concepts. To compare our performance with the state-of-the-art Web-based method, LiveClassifier [3] , denoted as LC, has been implemented, where the concepts hierarchy are referred from DMOZ. For the CS-related classes, these concepts are \"computers\", \"reference\", \"business\", \"software\", and \"science\"; and for the classes of four universities, the concepts are \"society\", \"people\", \"university\", \"school\", \"education\", \"sports\", \"United States\". The thresholds \u03b4 and t used in DM are set to 0.85 and 7 in both dataset, respectively. We use the Rainbow tool 6 and the VSM (Vector Space Model) classification model for all the experiments. Table 5 compares the classification accuracy between different methods. For each class, the baseline method is to use only the class name as query, submit to the search engine, and collect snippets as training data. The method from query expansion (QE) is to use pseudo-relevance feedback (PRF) for each class, where the terms with high TF-IDF values in the snippets are selected as expansion terms which used for acquiring training data. LC is the method implemented based on LiveClassifier [3] . With the concept hierarchy of each class, all the concepts are used to combine with the class name as a query, then submit to the search engine and collect the snippets as training data.",
"cite_spans": [
{
"start": 607,
"end": 610,
"text": "[3]",
"ref_id": "BIBREF2"
},
{
"start": 1070,
"end": 1071,
"text": "6",
"ref_id": "BIBREF5"
},
{
"start": 1643,
"end": 1646,
"text": "[3]",
"ref_id": "BIBREF2"
}
],
"ref_spans": [
{
"start": 1151,
"end": 1158,
"text": "Table 5",
"ref_id": "TABREF3"
}
],
"eq_spans": [],
"section": "Experimental Setup",
"sec_num": "4.1"
},
{
"text": "From Table 5 , we find that merely sending class names as queries cannot retrieve quality training data. It only achieves the accuracy at 0.57 on average. Even if we expand the class names with PRF (the method of QE), the accuracy cannot be improved by QE in this case. This is because PRF is a general solution to the keyword mismatching problem and thus would not be well applied to our classification problem. LC manually labels some concepts of the class names, e.g., the concept of \"Architecture\" is about computer architecture, so that more relevant training data to original classes can be fetched. LC gets higher accuracy at about 0.71. But such concepts labeled by people are often few. Our CM method can discover more useful common concepts, as shown in Table 6 , where keywords \"computers\", \"conference\", and \"proceeding\" are all helpful in searching relevant data for each class when combined with original class name. CM, on the other hand, might introduce noisy keywords often co-occurring with the class names such as keyword \"web\". Due to the assistance of more common concepts, we collect more quality training data by CM. The accuracy for CM comes to 0.76, which is much better than LC and QE.",
"cite_spans": [],
"ref_spans": [
{
"start": 5,
"end": 12,
"text": "Table 5",
"ref_id": "TABREF3"
},
{
"start": 764,
"end": 771,
"text": "Table 6",
"ref_id": null
}
],
"eq_spans": [],
"section": "Text Classification",
"sec_num": "4.2"
},
{
"text": "In addition, we observe that the performance for class \"Network\" is originally high in baseline method. To realize what makes the result, we check the process for getting training data in advance. Except for the accurate semantic for the term \"Network\", we discover that the snippets from search engine are suitable and with good quality for the class \"Network\". This is related to the characteristic of the Web. To our experience, the documents ranked from search engines might be mostly relevant to the fields about computer or network.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Text Classification",
"sec_num": "4.2"
},
{
"text": "The results of Web pages classifications, as shown in Table 7 , are similar to previous experimental results except the average accuracy obtained here is lower in general due to the noisy Web pages that are unreliable for testing. Moreover, sometimes the concepts derived from the Web are not effective in classification (even they are correct). For example, from the Web, DM learns two discriminative concepts of \"ut\" and \"milwaukee\" for classes \"Texas\" and \"Wisconsin\", respectively. But their impacts on classifying our testing data are futile. Although there are some noises in the Web page dataset and the concepts found are correct but less useful, CM+DM does an improvement while training by the snippets from these concepts, and surpasses the performance of LiveClassifier (LC). By our methods, the quality training data are fetched and the classifier learns better, thus become more robust for text classification. ",
"cite_spans": [],
"ref_spans": [
{
"start": 54,
"end": 61,
"text": "Table 7",
"ref_id": null
}
],
"eq_spans": [],
"section": "Text Classification",
"sec_num": "4.2"
},
{
"text": "In this experiment, we want to realize how our methods help conventional supervised text classification. We further conduct an experiment to compare the performance between labeled data plus training data from the Web and the labeled data only.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Combination of Web Training Data for Text Classification",
"sec_num": "4.3"
},
{
"text": "Both datasets are divided into training and testing data. We combine the training data collected from the Web and sample \u03b1 % of the training data as a new training corpus. For comparison, we also train a classifier with just those \u03b1 % of the labeled data only. The \u03b1 value varies from 1 to 100. \u03b1 =100 means to use all the labeled data from original divided training set, thus become a supervised learning. 5-fold cross validation is used to evaluate the classification accuracy. Figure 1 and 2 show the two experimental results, respectively. We find that the Web corpus improves the classifier's accuracy more than 6% when \u03b1 is small for both datasets. In other words, when the labeled data is insufficient or even with no quality, sampling training data from the Web could substantially complements the manually-labeled data. The performance of both classifiers increases when more labeled data are included. However, when more and more manually-labeled data is given, the improvement by the Web becomes less obvious or even slightly worse. This is because once we add more data from the Web, we also introduce the noises such that the accuracy glows slowly when the quality documents are enough. In CS papers classification, the performance reaches as higher as all training data used when 50% labeled data is added. For Web pages classification, we have the same performance as supervised learning when only use 20% labeled data. The performance even exceeds the result from supervised learning when 40% labeled data is joined. It explains more quality data from the Web is helpful in classification. This result also shows that using all the labeled data is not always as good as expected because some of the labeled data are not in good quality. This experiment shows us that the training data from the Web does help to improve the text classification. Moreover, we could use a very few number of labeled data, plus the Web corpus our methods collect, to train a desirable classifier. The Web helps the classifiers to learn the unseen concepts which do not exist due to the insufficiency or the unreliable quality of labeled data. It also tells us that the suitable training data might change by time, thus the original labeled data performs worse in new classification tasks. From the result, we believe that our methods can benefit the task of text classification, and other advanced applications. 1% 3% 5% 7% 9% 20% 40% 60% 80% 100% web+labeled pure labeled \u03b1=100",
"cite_spans": [],
"ref_spans": [
{
"start": 480,
"end": 488,
"text": "Figure 1",
"ref_id": "FIGREF0"
}
],
"eq_spans": [],
"section": "Combination of Web Training Data for Text Classification",
"sec_num": "4.3"
},
{
"text": "Text classification has been extensively studied for a long time in many research fields. Conventionally, supervised learning is usually applied in text classification [1, 2] . Our work focuses on the problem of how to adequately acquire and label documents automatically for classification models.",
"cite_spans": [
{
"start": 168,
"end": 171,
"text": "[1,",
"ref_id": "BIBREF0"
},
{
"start": 172,
"end": 174,
"text": "2]",
"ref_id": "BIBREF1"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "5."
},
{
"text": "For the problem of automatic acquiring training data, previous studies discuss in two directions. One is focused on augmenting a small number of labeled training documents with a large pool of unlabeled documents [11, 12, 13, 14, 15, 16, 17, 18] . Such work trains an initial classifier to label the unlabeled documents and uses the newly-labeled data to retrain the classifier iteratively. [11] proposed by Nigam et al. use the EM clustering algorithm and the naive Bayes classifier to learn from labeled and unlabeled documents simultaneously. [12, 13] proposed by Yu et al. efficiently computes an accurate classification boundary of a class from positive and unlabeled data. In [15] , Li et al. use positive and unlabeled data to train a classifier and solve the lack of labeled negative documents problem. Fung et al. in [17] study the problem of building a text classifier using positive examples and unlabeled example while the unlabeled examples are mixed with both positive and negative examples. [14] proposed by Nigam et al. starts from a small number of labeled data and employs a bootstrapping method to label the rest data, and then retrain the classifier. In [18] , Shen et al. propose a method to use the n-multigram model to help the automatic text classification task. This model could automatically discover the latent semantic sequences contained in the document set of each category. Yu et al. in [16] present a framework, called positive example based learning (PEBL), for Web page classification which eliminates the need for manually collecting negative training examples in preprocessing. Although classifying unlabeled data is efficient, human effort is still involved in the beginning of the training process. In this paper, we propose an acquiring process of training data from the Web, which is fully automatic. The method trains a classifier well for document classification without labeled data, which is the mainly different part from the previous work. Moreover, our experiments show that the Web can help the conventional text classification. The training data acquired from the Web expand the coverage of classifier, which substantially enhance the performance while there is a lack of labeled data, or the quality of labeled data is not well enough.",
"cite_spans": [
{
"start": 213,
"end": 217,
"text": "[11,",
"ref_id": "BIBREF10"
},
{
"start": 218,
"end": 221,
"text": "12,",
"ref_id": "BIBREF11"
},
{
"start": 222,
"end": 225,
"text": "13,",
"ref_id": "BIBREF12"
},
{
"start": 226,
"end": 229,
"text": "14,",
"ref_id": "BIBREF13"
},
{
"start": 230,
"end": 233,
"text": "15,",
"ref_id": "BIBREF14"
},
{
"start": 234,
"end": 237,
"text": "16,",
"ref_id": "BIBREF15"
},
{
"start": 238,
"end": 241,
"text": "17,",
"ref_id": "BIBREF16"
},
{
"start": 242,
"end": 245,
"text": "18]",
"ref_id": "BIBREF17"
},
{
"start": 391,
"end": 395,
"text": "[11]",
"ref_id": "BIBREF10"
},
{
"start": 546,
"end": 550,
"text": "[12,",
"ref_id": "BIBREF11"
},
{
"start": 551,
"end": 554,
"text": "13]",
"ref_id": "BIBREF12"
},
{
"start": 682,
"end": 686,
"text": "[15]",
"ref_id": "BIBREF14"
},
{
"start": 826,
"end": 830,
"text": "[17]",
"ref_id": "BIBREF16"
},
{
"start": 1006,
"end": 1010,
"text": "[14]",
"ref_id": "BIBREF13"
},
{
"start": 1174,
"end": 1178,
"text": "[18]",
"ref_id": "BIBREF17"
},
{
"start": 1418,
"end": 1422,
"text": "[16]",
"ref_id": "BIBREF15"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "5."
},
{
"text": "Another direction is focused on gathering training data by the Web [3, 4, 5, 6] . In [3] , Huang et al. propose a system, called \"LiveClassifier\", which combines relevant class names as queries based on a user-defined topic hierarchy so that more relevant documents to the classes could be found from the Web. [4, 5, 6] proposed by Hung et al. presents an approach that assumes the search results initially returned from a class name are relevant to the class. These search results are treated as auto-labeled and additional associated terms with the class names are extracted from the labeled data. Although the previous works are similar to our methods, all of them are human-intervened. In this paper, we propose a method which automatically finds the associated concepts for the related classes and train a desirable classifier. The main contribution is that our method utilizes the relationship of classes and samples the Web in an automatic way for key concepts of each class, thus further find the quality training data from the Web. Without labeled data and associated terms given by human, our methods perform well and classify documents accurately for the text classification problem.",
"cite_spans": [
{
"start": 67,
"end": 70,
"text": "[3,",
"ref_id": "BIBREF2"
},
{
"start": 71,
"end": 73,
"text": "4,",
"ref_id": "BIBREF3"
},
{
"start": 74,
"end": 76,
"text": "5,",
"ref_id": "BIBREF4"
},
{
"start": 77,
"end": 79,
"text": "6]",
"ref_id": "BIBREF5"
},
{
"start": 85,
"end": 88,
"text": "[3]",
"ref_id": "BIBREF2"
},
{
"start": 310,
"end": 313,
"text": "[4,",
"ref_id": "BIBREF3"
},
{
"start": 314,
"end": 316,
"text": "5,",
"ref_id": "BIBREF4"
},
{
"start": 317,
"end": 319,
"text": "6]",
"ref_id": "BIBREF5"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "5."
},
{
"text": "In this paper, we propose two methods to automatically sample the Web and find quality training data for text classification. We first examine the effects of different search engines, retrieved data types, and sizes of retrieved data. Moreover, from the subset of documents and the method by associated terms, we know that sampling the Web for concepts of classes and fetching training data can substantially improve the performance of classification. It might be hard to distinguish the classes with the ambiguity and close relationship without labeled data. By the discovering of common concepts and discriminative concepts, the ambiguity of class names is eliminated and more relevant concepts are utilized for sampling suitable and quality training data from the Web. Several experiments conducted in this work show that our methods are useful and robust for classifying documents and Web pages. Furthermore, our experiments show that the training data sampled from the Web helps the conventional supervised classification, which need quality and labeled data. The result demonstrates that the quality of labeled data might not always desirable due to the lack of useful key concepts, and we can provide proper training data from the Web to further improve the results of text classification. In additions, two dataset with different characteristics are used for our experiments and the analysis from different dataset is carefully conducted in this paper. Compared to previous works, the advantage of our methods is the fully automatic processes during the concepts expansion and the training data collecting. Our methods are independent of classification models, thus existing models can be incorporated with the proposed methods.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Discussions and Conclusions",
"sec_num": "6."
},
{
"text": "However, our work has some limitations. The classes we choose are related to each other. In other words, the performance would be better while the classes are in the same level in the hierarchy of topic classes. With the relationships between the classes, our methods can perform the context-aware technique among the classes to acquire more relevant documents, making the classifiers robust. To go a step further, there are more challenges to choose the quality documents in the training corpus sampled from the Web. We can also sample good training documents while a pool of unlabeled data is provided. We believe that these challenges are worth studied and would be the research directions in our future work.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Discussions and Conclusions",
"sec_num": "6."
},
{
"text": "The Google search engine: http://www.google.com/search2 The Yahoo! search engine: http://search.yahoo.com/search3 The MSN Live search engine: http://search.live.com/",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "DMOZ Open Directory Project: http://www.dmoz.org/",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "The WebKB project: http://www.cs.cmu.edu/~WebKB/6 The Rainbow tool: http://www.cs.cmu.edu/~mccallum/bow/rainbow/",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
}
],
"back_matter": [],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "A re-examination of text categorization methods",
"authors": [
{
"first": "Y",
"middle": [],
"last": "Yang",
"suffix": ""
},
{
"first": "X",
"middle": [],
"last": "Liu",
"suffix": ""
}
],
"year": 1999,
"venue": "Proceedings of the 22nd Annual International ACM SIGIR conference",
"volume": "",
"issue": "",
"pages": "42--49",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Y. Yang and X. Liu, \"A re-examination of text categorization methods,\" in Proceedings of the 22nd Annual International ACM SIGIR conference, 1999, pp. 42-49.",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "An evaluation of statistical approaches to text categorization",
"authors": [
{
"first": "Y",
"middle": [],
"last": "Yang",
"suffix": ""
}
],
"year": 1999,
"venue": "Information Retrieval",
"volume": "1",
"issue": "",
"pages": "69--90",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Y. Yang, \"An evaluation of statistical approaches to text categorization,\" Information Retrieval, vol. 1, pp. 69-90, 1999.",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "Liveclassifier: Creating hierarchical text classifier through web corpora",
"authors": [
{
"first": "C.-C",
"middle": [],
"last": "Huang",
"suffix": ""
},
{
"first": "S.-L",
"middle": [],
"last": "Chuang",
"suffix": ""
},
{
"first": "L.-F",
"middle": [],
"last": "Chien",
"suffix": ""
}
],
"year": 2004,
"venue": "World Wide Web Conference",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "C.-C. Huang, S.-L. Chuang, and L.-F. Chien, \"Liveclassifier: Creating hierarchical text classifier through web corpora,\" in World Wide Web Conference, 2004.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "Automatic training corpora acquisition through web mining",
"authors": [
{
"first": "C.-C",
"middle": [],
"last": "Huang",
"suffix": ""
},
{
"first": "K.-M",
"middle": [],
"last": "Lin",
"suffix": ""
},
{
"first": "L.-F",
"middle": [],
"last": "Chien",
"suffix": ""
}
],
"year": 2005,
"venue": "IEEE/WIC/ACM Conference on Web Intelligence",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "C.-C. Huang, K.-M. Lin, and L.-F. Chien, \"Automatic training corpora acquisition through web mining,\" in IEEE/WIC/ACM Conference on Web Intelligence, 2005.",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "Text classification using web corpora and em algorithms",
"authors": [
{
"first": "C.-M",
"middle": [],
"last": "Hung",
"suffix": ""
},
{
"first": "L.-F",
"middle": [],
"last": "Chien",
"suffix": ""
}
],
"year": 2004,
"venue": "The Asia Information Retrieval Symposium",
"volume": "",
"issue": "",
"pages": "12--23",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "C.-M. Hung and L.-F. Chien, \"Text classification using web corpora and em algorithms,\" in The Asia Information Retrieval Symposium, 2004, pp. 12-23.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "Web-based text classication in the absence of manually labeled training documents",
"authors": [
{
"first": "C",
"middle": [
"M"
],
"last": "Hung",
"suffix": ""
},
{
"first": "L",
"middle": [
"F"
],
"last": "Chien",
"suffix": ""
}
],
"year": 2007,
"venue": "Journal of the American Society for Information Science and Technology",
"volume": "",
"issue": "",
"pages": "88--96",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "C. M. Hung and L. F. Chien, \"Web-based text classication in the absence of manually labeled training documents,\" Journal of the American Society for Information Science and Technology, pp. 88-96, 2007.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "An information theoretic approach to automatic query expansion",
"authors": [
{
"first": "C",
"middle": [],
"last": "Carpineto",
"suffix": ""
},
{
"first": "R",
"middle": [
"D"
],
"last": "Mori",
"suffix": ""
},
{
"first": "G",
"middle": [],
"last": "Romano",
"suffix": ""
},
{
"first": "B",
"middle": [],
"last": "Bigi",
"suffix": ""
}
],
"year": 2001,
"venue": "ACM Transactions on Information Systems",
"volume": "19",
"issue": "1",
"pages": "1--27",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "C. Carpineto, R. D. Mori, G. Romano, and B. Bigi, \"An information theoretic approach to automatic query expansion,\" ACM Transactions on Information Systems, vol. 19(1), pp. 1-27, 2001.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "Concept based query expansion",
"authors": [
{
"first": "Y",
"middle": [],
"last": "Qui",
"suffix": ""
},
{
"first": "H",
"middle": [],
"last": "Frei",
"suffix": ""
}
],
"year": 1993,
"venue": "Proceedings of the 16th Annual International ACM SIGIR Conference",
"volume": "",
"issue": "",
"pages": "160--169",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Y. Qui and H. Frei, \"Concept based query expansion,\" in Proceedings of the 16th Annual International ACM SIGIR Conference, 1993, pp. 160-169.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "Query expansion using local and global document analysis",
"authors": [
{
"first": "J",
"middle": [],
"last": "Xu",
"suffix": ""
},
{
"first": "W",
"middle": [
"B"
],
"last": "Croft",
"suffix": ""
}
],
"year": 1996,
"venue": "Proceedings of the 19th Annual International ACM SIGIR Conference",
"volume": "",
"issue": "",
"pages": "412--420",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "J. Xu and W. B. Croft, \"Query expansion using local and global document analysis,\" in Proceedings of the 19th Annual International ACM SIGIR Conference, 1996, pp. 412-420.",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "A practical clustering algorithm for static and dynamic information organization",
"authors": [
{
"first": "J",
"middle": [],
"last": "Aslam",
"suffix": ""
},
{
"first": "K",
"middle": [],
"last": "Pelekhov",
"suffix": ""
},
{
"first": "D",
"middle": [],
"last": "Rus",
"suffix": ""
}
],
"year": 1999,
"venue": "in In: ACM-SIAM Symposium on Discrete Algorithms",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "J. Aslam, K. Pelekhov, and D. Rus, \"A practical clustering algorithm for static and dynamic information organization,\" in In: ACM-SIAM Symposium on Discrete Algorithms. In: ACM-SIAM Symposium on Discrete Algorithms (1999), 1999.",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "Text classification from labeled and unlabeled documents using em",
"authors": [
{
"first": "K",
"middle": [],
"last": "Nigam",
"suffix": ""
},
{
"first": "A",
"middle": [
"K"
],
"last": "Mccallum",
"suffix": ""
},
{
"first": "S",
"middle": [],
"last": "Thrun",
"suffix": ""
},
{
"first": "T",
"middle": [
"M"
],
"last": "Mitchell",
"suffix": ""
}
],
"year": 2000,
"venue": "Machine Learning",
"volume": "39",
"issue": "2/3",
"pages": "103--134",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "K. Nigam, A. K. McCallum, S. Thrun, and T. M. Mitchell, \"Text classification from labeled and unlabeled documents using em,\" Machine Learning, vol. 39(2/3), pp. 103-134, 2000.",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"title": "Svmc: Single-class classification with support vector machines",
"authors": [
{
"first": "H",
"middle": [],
"last": "Yu",
"suffix": ""
}
],
"year": 2003,
"venue": "Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "H. Yu, \"Svmc: Single-class classification with support vector machines,\" in Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, 2003.",
"links": null
},
"BIBREF12": {
"ref_id": "b12",
"title": "Text classification from positive and unlabeled documents",
"authors": [
{
"first": "H",
"middle": [],
"last": "Yu",
"suffix": ""
},
{
"first": "C",
"middle": [],
"last": "Zhai",
"suffix": ""
}
],
"year": 2003,
"venue": "Proceedings of the 12th Annual International ACM Conference on Information and Knowledge Management",
"volume": "",
"issue": "",
"pages": "232--239",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "H. Yu and C. Zhai, \"Text classification from positive and unlabeled documents,\" in Proceedings of the 12th Annual International ACM Conference on Information and Knowledge Management, 2003, pp. 232-239.",
"links": null
},
"BIBREF13": {
"ref_id": "b13",
"title": "Text classification by bootstrapping with keywords",
"authors": [
{
"first": "A",
"middle": [],
"last": "Mccallum",
"suffix": ""
},
{
"first": "K",
"middle": [],
"last": "Nigam",
"suffix": ""
}
],
"year": 1999,
"venue": "ACL Workshop for Unsupervised Learning in Natural Language Processing",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "A. McCallum and K. Nigam, \"Text classification by bootstrapping with keywords,\" in ACL Workshop for Unsupervised Learning in Natural Language Processing, 1999.",
"links": null
},
"BIBREF14": {
"ref_id": "b14",
"title": "Learning to classify texts using positive and unlabeled data",
"authors": [
{
"first": "X",
"middle": [],
"last": "Li",
"suffix": ""
},
{
"first": "B",
"middle": [],
"last": "Liu",
"suffix": ""
}
],
"year": 2003,
"venue": "Proceedings of International Joint Conferences on Artificial Intelligence",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "X. Li and B. Liu, \"Learning to classify texts using positive and unlabeled data,\" in Proceedings of International Joint Conferences on Artificial Intelligence, 2003.",
"links": null
},
"BIBREF15": {
"ref_id": "b15",
"title": "Pebl: Web page classification without negative examples",
"authors": [
{
"first": "H",
"middle": [],
"last": "Yu",
"suffix": ""
},
{
"first": "J",
"middle": [],
"last": "Han",
"suffix": ""
},
{
"first": "K.-C",
"middle": [],
"last": "Chang",
"suffix": ""
}
],
"year": 2004,
"venue": "IEEE Transactions on Knowledge and Data Engineering",
"volume": "16",
"issue": "",
"pages": "70--81",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "H. Yu, J. Han, and K.-C. Chang, \"Pebl: Web page classification without negative examples,\" IEEE Transactions on Knowledge and Data Engineering, vol. 16, pp. 70-81, 2004.",
"links": null
},
"BIBREF16": {
"ref_id": "b16",
"title": "Text classification without labeled negative documents",
"authors": [
{
"first": "G",
"middle": [],
"last": "Fung",
"suffix": ""
},
{
"first": "J",
"middle": [],
"last": "Yu",
"suffix": ""
},
{
"first": "H",
"middle": [],
"last": "Lu",
"suffix": ""
},
{
"first": "P",
"middle": [],
"last": "Yu",
"suffix": ""
}
],
"year": 2005,
"venue": "Proceedings of 21st International Conference on Data Engineering",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "G. Fung, J. Yu, H. Lu, and P. Yu, \"Text classification without labeled negative documents,\" in Proceedings of 21st International Conference on Data Engineering, 2005.",
"links": null
},
"BIBREF17": {
"ref_id": "b17",
"title": "Text classification improved through automatically extracted sequences",
"authors": [
{
"first": "D",
"middle": [],
"last": "Shen",
"suffix": ""
},
{
"first": "J.-T",
"middle": [],
"last": "Sun",
"suffix": ""
},
{
"first": "Q",
"middle": [],
"last": "Yang",
"suffix": ""
},
{
"first": "H",
"middle": [],
"last": "Zhao",
"suffix": ""
},
{
"first": "Z",
"middle": [],
"last": "Chen",
"suffix": ""
}
],
"year": 2006,
"venue": "Proceedings of the 22nd International Conference on Data Engineering",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "D. Shen, J.-T. Sun, Q. Yang, H. Zhao, and Z. Chen, \"Text classification improved through automatically extracted sequences,\" in Proceedings of the 22nd International Conference on Data Engineering, 2006.",
"links": null
}
},
"ref_entries": {
"FIGREF0": {
"text": "Accuracy of training data from the Web plus % labeled data for CS papers classification.",
"uris": null,
"num": null,
"type_str": "figure"
},
"FIGREF1": {
"text": "Accuracy of training data from the Web plus % labeled data for Web pages classification.",
"uris": null,
"num": null,
"type_str": "figure"
},
"TABREF0": {
"html": null,
"num": null,
"content": "<table><tr><td>Engine</td><td colspan=\"2\">Architecture IR</td><td colspan=\"3\">Network Programming Theory</td><td>Avg.</td></tr><tr><td>Google</td><td>0.075</td><td>0.382</td><td>0.899</td><td>0.723</td><td>0.762</td><td>0.568</td></tr><tr><td>Yahoo!</td><td>0.112</td><td>0.022</td><td>0.094</td><td>0.863</td><td>0.665</td><td>0.351</td></tr><tr><td colspan=\"2\">Live Search 0.269</td><td>0.006</td><td>0.083</td><td>0.784</td><td>0.815</td><td>0.391</td></tr></table>",
"text": "Accuracy of different search engines for classification of CS papers.",
"type_str": "table"
},
"TABREF1": {
"html": null,
"num": null,
"content": "<table><tr><td>Source</td><td colspan=\"3\">Architecture IR</td><td colspan=\"4\">Network Programming Theory</td><td/><td>Avg.</td></tr><tr><td>Snippet</td><td>0.075</td><td/><td>0.382</td><td>0.899</td><td>0.723</td><td/><td>0.762</td><td/><td>0.568</td></tr><tr><td colspan=\"2\">Documents 0.272</td><td/><td>0.049</td><td>0.689</td><td>0.505</td><td/><td>0.783</td><td/><td>0.459</td></tr><tr><td colspan=\"10\">Table 3. Average accuracy of different training sizes in CS papers classification.</td></tr><tr><td colspan=\"2\"># of docs 100</td><td>200</td><td>300</td><td>400</td><td>500</td><td>600</td><td>700</td><td>800</td><td>900</td></tr></table>",
"text": "Accuracy of different training types in CS papers classification. Snippets 0.568 0.601 0.603 0.601 0.608 0.603 0.604 0.604 0.604 Documents 0.460 0.463 0.507 0.500 0.503 0.504 0.507 0.507 0.508",
"type_str": "table"
},
"TABREF2": {
"html": null,
"num": null,
"content": "<table><tr><td>Class</td><td colspan=\"2\"># papers From Conferences</td></tr><tr><td colspan=\"2\">Architecture 490</td><td>SIGARCH(04-08), DAC(00-07)</td></tr><tr><td>IR</td><td>484</td><td>SIGIR(02-07), CIKM(02-07)</td></tr><tr><td>Network</td><td>446</td><td>SIGCOMM(02-08), IPSN(04-07), MOBICOM(03-07),</td></tr><tr><td/><td/><td>MOBIHOC(00-07), IMC(01-07)</td></tr><tr><td colspan=\"2\">Programming 505</td><td>POPL(02-08), PLDI(00-07), ICFP(02-07), OOPSLA(00-07)</td></tr><tr><td>Theory</td><td>471</td><td>SODA(01-08), STOC(00-07)</td></tr></table>",
"text": "The information about the dataset of CS papers for classification.",
"type_str": "table"
},
"TABREF3": {
"html": null,
"num": null,
"content": "<table><tr><td>Method</td><td colspan=\"2\">Architecture IR</td><td colspan=\"2\">Network</td><td colspan=\"2\">Programming Theory</td><td>Avg.</td></tr><tr><td>Baseline</td><td>0.76</td><td>0.38</td><td>0.90</td><td/><td>0.72</td><td>0.76</td><td>0.57</td></tr><tr><td>QE</td><td>0.03</td><td>0.01</td><td>0.98</td><td/><td>0.71</td><td>0.66</td><td>0.48</td></tr><tr><td>LC</td><td>0.88</td><td>0.42</td><td>0.82</td><td/><td>0.54</td><td>0.89</td><td>0.71</td></tr><tr><td>CM</td><td>0.80</td><td>0.77</td><td>0.89</td><td/><td>0.56</td><td>0.76</td><td>0.76</td></tr><tr><td>DM</td><td>0.04</td><td>0.00</td><td>0.83</td><td/><td>0.66</td><td>0.98</td><td>0.50</td></tr><tr><td colspan=\"2\">CM+DM 0.76</td><td>0.86</td><td>0.91</td><td/><td>0.71</td><td>0.82</td><td>0.81</td></tr><tr><td colspan=\"8\">Table 6. Extracted common concepts and discriminative concepts of CS classes.</td></tr><tr><td>Method</td><td>Architecture</td><td>IR</td><td/><td colspan=\"2\">Network</td><td colspan=\"2\">Programming Theory</td></tr><tr><td>CM</td><td colspan=\"7\">By DMOZ: computers By Star Algorithm: conference, proceeding, web</td></tr><tr><td>DM</td><td>architecture,</td><td>infrared,</td><td/><td colspan=\"2\">usa, health,</td><td>tutorial, java,</td><td>graph,</td></tr><tr><td/><td>architectural,</td><td>satellite,</td><td/><td>action,</td><td/><td>example,</td><td>mathematical,</td></tr><tr><td/><td>architects, arts,</td><td colspan=\"2\">visible, image,</td><td colspan=\"2\">sports, food,</td><td>using,</td><td>problems,</td></tr><tr><td/><td>history,</td><td>weather,</td><td/><td colspan=\"2\">monitor,</td><td>oriented,</td><td>literary studies,</td></tr><tr><td/><td>contemporary,</td><td>thermal,</td><td/><td>global</td><td/><td>download,</td><td>political,</td></tr><tr><td/><td>design</td><td>cameras</td><td/><td/><td/><td>linux</td><td>number,</td></tr><tr><td colspan=\"2\">CM+DM isca, energy,</td><td>investor,</td><td/><td colspan=\"2\">development</td><td>ferment,</td><td>Number,</td></tr><tr><td/><td>oriented,</td><td>infrafed,</td><td/><td colspan=\"2\">, wireless,</td><td>oriented,</td><td>university,</td></tr><tr><td/><td>adaptive,</td><td colspan=\"2\">retrieval, ecir,</td><td colspan=\"2\">shows,</td><td>programmers,</td><td>critical, math,</td></tr><tr><td/><td>aidede, ecaade,</td><td colspan=\"2\">trec, sigir, ie</td><td colspan=\"2\">server, first,</td><td>final, siggraph,</td><td>computational,</td></tr><tr><td/><td>architectural</td><td/><td/><td colspan=\"2\">email ,mail</td><td>graphics,</td><td>theoretical,</td></tr><tr><td/><td/><td/><td/><td/><td/><td>animation</td><td>complexity</td></tr><tr><td/><td colspan=\"6\">Table 7. Accuracy of classification in Web pages.</td></tr><tr><td/><td colspan=\"7\">Baseline: Class Names, QE: Query Expansion, LC:LiveClassifier,</td></tr><tr><td/><td colspan=\"7\">CM: Common concept method, and DM: Discriminative concept method.</td></tr><tr><td>Method</td><td>Cornell</td><td>Texas</td><td/><td colspan=\"3\">Washington Wisconsin</td><td>Avg.</td></tr><tr><td>Baseline</td><td>0.85</td><td>0.47</td><td/><td>0.68</td><td/><td>0.20</td><td>0.55</td></tr><tr><td>QE</td><td>0.87</td><td>0.40</td><td/><td>0.71</td><td/><td>0.41</td><td>0.60</td></tr><tr><td>LC</td><td>0.99</td><td>0.14</td><td/><td>0.58</td><td/><td>0.14</td><td>0.46</td></tr><tr><td>CM</td><td>0.99</td><td>0.30</td><td/><td>0.72</td><td/><td>0.33</td><td>0.59</td></tr><tr><td>DM</td><td>0.47</td><td>0.75</td><td/><td>0.53</td><td/><td>0.66</td><td>0.60</td></tr><tr><td>CM+DM</td><td>0.98</td><td>0.43</td><td/><td>0.77</td><td/><td>0.37</td><td>0.64</td></tr></table>",
"text": "Accuracy of classification in CS papers. Baseline: Class Names, QE: Query Expansion, LC:LiveClassifier, CM: Common concept method, and DM: Discriminative concept method.",
"type_str": "table"
}
}
}
} |