On the complexity of schema inference from web pages in the presence of nullable data attributes

International Conference on Information and Knowledge Management, Proceedings

Volumn , Issue , 2003, Pages 224-230

  Yang, Guizhen ^a   Ramakrishnan, I V ^b   Kifer, Michael ^a  

^a State University of New York   (United States)

^b Stony Brook University   (United States)

Author keywords

Data Extraction; Data Mining; Machine Learning; Schema Inference; Web Mining; World Wide Web; Wrapper Induction

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA MINING; DATA STORAGE EQUIPMENT; DATABASE SYSTEMS; ENCODING (SYMBOLS); INFORMATION RETRIEVAL; LEARNING SYSTEMS; PROBLEM SOLVING; WEBSITES;

DATA EXTRACTION; SCHEMA INFERENCE; WEB MINING; WRAPPER INDUCTION;

WORLD WIDE WEB;

EID: 10944246083     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/956904.956907     Document Type: Conference Paper

References (23)

1. D. Angluin. On the complexity of minimum inference of regular seta. Information and Control, 39(3):337-350, 1978.
2. D. Angluin. Learning regular sets from queries and counterexamples. Information and Computation, 75(2):87-106, 1987.
3. A. Arasu and H. Garcia-Molina. Extracting structured data from web pages. In ACM International Conference on Management of Data (SIGMOD), 2003.
4. N. Ashish and C. Knoblock. Wrapper generation for semi-structured internet sources. SIGMOD Record, 26(4):8-15, 1997.
5. P. Atzeni, G. Mecca, and P. Merialdo. To weave the web. In International Conference on Very Large Data Bases (VLDB), 1997.
6. B. Chidlovskii. Wrapping web information providers by transducer induction. In European Conference on Machine Learning, 2001.
7. 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.
8. V. Crescenzi, G. Mecca, and P. Merialdo. RoadRunner: Towards automatic data extraction from large web sites. In International Conference on Very Large Data Bases (VLDB), 2001.
9. H. Davulcu, G. Yang, M. Kifer, and I. V. Ramakrishnan. Computational aspects of resilient data extraction from semistructured sources. In ACM International Symposium on Principles of Database Systems (PODS), 2000.
10. M. N. Garofalakis, A. Gionis, R. Rastogi, S. Seshadri, and K. Shim. XTRACT: A system for extracting document type descriptors from XML documents. In ACM International Conference on Management of Data (SIGMOD), 2000.
11. E. M. Gold. Language identification in the limit. Information and Control, 10(5):447-474, 1967.
12. E. M. Gold. Complexity of automaton identification from given data. Information and Control, 37(3):302-320, 1978.
13. S. Grumbach and G. Mecca. In search of the lost schema. In International Conference on Database Theory (ICDT), 1999.
14. 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.
15. T. Jiang and M. Li. On the complexity of learning strings and sequences. Theoretical Computer Science, 119(2):363-371, 1993.
16. N. Kushmerick, D. S. Weld, and R. B. Doorenbos. Wrapper induction for information extraction. In International Joint Conference on Artificial Intelligence (IJCAI), 1997.
17. D. Maier. The complexity of some problems on subsequences and supersequences. Journal of ACM, 25(2):322-336, 1978.
18. M. Middendrof. On finding various minimal, maximal, and consistent sequences over a binary alphabet. Theoretical Computer Science, 145(1-2):317-327, 1995.
19. T. M. Mitchell. Machine Learning. McGraw Hill, 1997.
20. I. Muslea, S. Minton, and C. Knoblock. A hierarchical approach to wrapper induction. In Third International Conference on Autonomous Agents (Agents '99), 1999.
21. 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.
22. 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.
23. G. Yang, S. Mukherjee, and I. V. Ramakrishnan. On precision and recall of multi-attribute data extraction from semistructured sources. In IEEE International Conerence on Data Mining (ICDM), 2003.