Text extraction from the Web via text-to-tag ratio

TIR 2008 - 5th International Workshop on Text-Based Information Retrieval, in Conjunction with DEXA 2008

Volumn , Issue , 2008, Pages

  Weninger, Tim ^a   Hsu, William H ^a  

^a Kansas State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

HTML DOCUMENTS; LARGE SPACES; TEXT EXTRACTION;

HTML; WEBSITES;

INFORMATION RETRIEVAL;

EID: 84883430488     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. W. Lu, L. Chien, and H. Lee, "Anchor text mining for translation of Web queries: A transitive translation approach," ACM Transactions on Information Systems (TOIS), Vol. 22, no. 2, pp. 242-269, April 2004.
2. S. Soderland, "Learning to Extract Text-based Information from the World Wide Web," in Proc. Of KDD 1997, Newport Beach, California, USA, 1997.
3. R. J. Mooney, and R. Bunescu, "Mining Knowledge from Text Using Information Extraction," in Proc. of SIGKDD 2005, Chicago, Illinois, USA. Aug. 2005.
4. M. Y. Ivory, R. Megraw, "Evolution of web site design patterns." ACM Transactions on Information Systems (TOIS), Vol. 23, no. 4, pp. 463-497, Oct. 2005.
5. D. C. Rajapaske, and Jarzabek, "A Need-Oriented Assessment of Technological Trends In Web Engineering," in Proc. of ICWE 2005, Sydney, Australia, July, 2005.
6. S. H. Lin and J. M. Ho. "Discovering informative content blocks from Web documents," in Proc. of SIGKDD 2002, Edmonton, Canada, 2002.
7. Xiaoli Li, Bing Liu. "Learning to classify text using positive and unlabeled data." in Proc. of IJCAI 2003, Acapulco, Mexico, 2003.
8. B. Krüpl, M. Herzog, and W. Gatterbauer, "Using visual cues for extraction of tabular data from arbitrary HTML documents," in Proc. of WWW 2005, Chiba, Japan, 2005.
9. th Berkeley Symposium on Mathematical Statistics and Probability, Berkeley, CA, 1967.
10. A. Dempster, N. Laird, and D. Rubin. "Maximum likelihood from incomplete data via the EM algorithm". Journal of the Royal Statistical Society, Series B, Vol. 39, No. 1, pp. 1-38, 1977.
11. S.D. Hochbaum, B.D. Shmoys, "A Best Possible Heuristic for the KCenter Problem," Mathematics of Operational Research, Vol. 10, no. 2, May, pp. 180-184, 1985.
12. D. S. Hirschberg, "Algorithms for the Longest Common Subsequence Problem," Journal of ACM, Vol. 24, no. 4, pp. 664-675. 1977.
13. V. Levenshtein, "Binary Codes Capable of Correcting Deletions, Insertions, and Reversals," Soviet Physics-Doklady 10, Vol. 10, pp. 707-710, 1966.