%0 Conference Paper %1 citeulike:383532 %A Ghani, Rayid %A Slattery, Se&\#225;n %A Yang, Yiming %B ICML '01: Proceedings of the Eighteenth International Conference on Machine Learning %C San Francisco, CA, USA %D 2001 %I Morgan Kaufmann Publishers Inc. %K topicinference socialnets community %P 178--185 %T Hypertext Categorization using Hyperlink Patterns and Meta Data %U http://portal.acm.org/citation.cfm?id=658307 %@ 1558607781

@inproceedings{citeulike:383532, added-at = {2006-06-16T10:34:37.000+0200}, address = {San Francisco, CA, USA}, author = {Ghani, Rayid and Slattery, Se\&\#225;n and Yang, Yiming}, biburl = {https://www.bibsonomy.org/bibtex/2dddc51368be16ba8a0a8a092881c22e1/ldietz}, booktitle = {ICML '01: Proceedings of the Eighteenth International Conference on Machine Learning}, citeulike-article-id = {383532}, comment = {Probably contains sentences like "papers of similar topics will contain references to each other more probably" --- Slides: http://www.cs.cmu.edu/Groups/reinforcement/OldFiles/mosaic/talks-2001/01-06-26.rayid.html " Hypertext poses new text classification research challenges as hyperlinks, content of linked documents, and meta data about related web sites all provide richer sources of information for hypertext classification that are not available in traditional text classification. We investigate the use of such information for representing web sites, and the effectiveness of different classifiers (Naive Bayes, Nearest Neighbor, and Foil) in exploiting those representations. We find that using words in web pages alone often yields suboptimal performance of classifiers, compared to exploiting additional sources of information beyond document content. On the other hand, we also observe that linked pages can be more harmful than helpful when the linked neighborhoods are highly "noisy" and that links have to be used in a careful manner. More importantly, our investigation suggests that meta data which is often available, or can be acquired using information extraction techniques, can be extremely useful for improving classification accuracy. Finally, the relative performance of the different classifiers being tested gives us insights into the strengths and limitations of our algorithms for hypertext classification. "}, interhash = {c81a0e73aac858493c370f0d930d5176}, intrahash = {dddc51368be16ba8a0a8a092881c22e1}, isbn = {1558607781}, keywords = {topicinference socialnets community}, pages = {178--185}, priority = {3}, publisher = {Morgan Kaufmann Publishers Inc.}, timestamp = {2006-06-16T10:34:37.000+0200}, title = {Hypertext Categorization using Hyperlink Patterns and Meta Data}, url = {http://portal.acm.org/citation.cfm?id=658307}, year = 2001 }