On precision and recall of multi-attribute data extraction from semistructured sources

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2003, Pages 395-402

  Yang, Guizhen ^a   Mukherjee, Saikat ^b   Ramakrishnan, I V ^b  

^a the State University of New York   (United States)

^b Stony Brook University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (21)

1. B. Adelberg. NoDoSe: A tool for semi-automatically extracting structured and semi-structured data from text documents. In ACM International Conference on Management of Data (SIGMOD), 1998.
2. D. Angluin. On the complexity of minimum inference of regular sets. Information and Control, 39(3):337-350, 1978.
3. A. Arasu and H. Garcia-Molina. Extracting structured data fromWeb pages. In ACMInternational Conference on Management of Data (SIGMOD), 2003.
4. N. Ashish and C. Knoblock. Wrapper generation for semistructured Internet sources. SIGMOD Record, 26(4):8-15, 1997.
5. W. Cohen, M. Hurst, and L. Jensen. A flexible learning system for wrapping tables and lists in HTML documents. In International World Wide Web Conference (WWW), 2002.
6. V. Crescenzi, G. Mecca, and P. Merialdo. RoadRunner: Towards automatic data extraction from largeWeb sites. In International Conference on Very Large Data Bases (VLDB), 2001.
7. D. W. Embley, D. M. Campbell, R. D. Smith, and S. W. Liddle. Ontology-based extraction and structuring of information from data-rich unstructured documents. In ACM Internation Conference on Information and Knowledge Management (CIKM), 1998.
8. D. W. Embley, Y. Jiang, and Y.-K. Ng. Record-boundary discovery inWeb documents. In ACM International Conference on Management of Data (SIGMOD), 1999.
9. E. M. Gold. Complexity of automaton identification from given data. Information and Control, 37(3):302-320, 1978.
10. J. Hammer, H. Garcia-Molina, S. Nestorov, R. Yerneni, M. M. Breunig, and V. Vassalos. Template-based wrappers in the TSIMMIS system. In ACM International Conference on Management of Data (SIGMOD), 1997.
11. C.-N. Hsu and M.-T. Dung. Generating finite-state transducers for semi-structured data extraction from the Web. Information Systems, 23(8):521-538, 1998.
12. T. Jiang and M. Li. On the complexity of learning strings and sequences. Theoretical Computer Science, 119(2):363-371, 1993.
13. N. Kushmerick, D. S. Weld, and R. B. Doorenbos. Wrapper induction for information extraction. In International Joint Conference on Artificial Intelligence (IJCAI), 1997.
14. D. Maier. The complexity of some problems on subsequences and supersequences. Journal of ACM, 25(2):322-336, 1978.
15. M. Middendrof. On finding various minimal, maximal, and consistent sequences over a binary alphabet. Theoretical Computer Science, 145(1-2):317-327, 1995.
16. I. Muslea, S. Minton, and C. Knoblock. A hierarchical approach to wrapper induction. In Third International Conference on Autonomous Agents (Agents'99), 1999.
17. M. Perkowitz, R. B. Doorenbos, O. Etzioni, and D. S. Weld. Learning to understand information on the Internet: An example-based approach. Journal of Intelligent Information Systems, 8(2):133-153, 1997.
18. K.-J. Räihä and E. Ukkonen. The shortest common supersequence problem over binary alphabet is NP-complete. Theoretical Computer Science, 16:187-198, 1981.
19. A. Sahuguet and F. Azavant. Web Ecology: Recycling HTML pages as XML documents using W4F. In ACM SIGMOD Workshop on the Web and Databases (WebDB), 1999.
20. S. Soderland. Learning information extraction rules for semi-structured and free text. Machine Learning, 34(1-3), 1999.
21. G. Yang, I. V. Ramakrishnan, and M. Kifer. On the complexity of schema inference fromWeb pages in the presence of nullalbe data attributes. In ACM Internation Conference on Information and Knowledge Management (CIKM), 2003.