ABSTRACT
This work explores the usage of Linked Data for Web scale Information Extraction and shows encouraging results on the task of Wrapper Induction. We propose a simple knowledge based method which is (i) highly flexible with respect to different domains and (ii) does not require any training material, but exploits Linked Data as background knowledge source to build essential learning resources. The major contribution of this work is a study of how Linked Data - an imprecise, redundant and large-scale knowledge resource - can be used to support Web scale Information Extraction in an effective and efficient way and identify the challenges involved. We show that, for domains that are covered, Linked Data serve as a powerful knowledge resource for Information Extraction. Experiments on a publicly available dataset demonstrate that, under certain conditions, this simple unsupervised approach can achieve competitive results against some complex state of the art that always depends on training data.
- A. Arasu and H. Garcia-Molina. Extracting structured data from web pages. In Proceedings of the 2003 ACM SIGMOD international conference on Management of data, pages 337--348. ACM, 2003. Google ScholarDigital Library
- R. Blanco, H. Halpin, D. Herzig, and P. Mika. Entity search evaluation over structured web data. In SIGIR 2011, 2011.Google Scholar
- A. Carlson and C. Schafer. Bootstrapping information extraction from semi-structured web pages. e European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, 2008. Google ScholarDigital Library
- V. Crescenzi and G. Mecca. Automatic information extraction from large websites. Journal of the ACM,51(5):731--779, Sept. 2004. Google ScholarDigital Library
- N. Dalvi, P. Bohannon, and F. Sha. Robust web extraction: an approach based on a probabilistic tree-edit model. Proceedings of the 35th SIGMOD international conference on Management of data, 2009. Google ScholarDigital Library
- N. Dalvi, R. Kumar, and M. Soliman. Automatic wrappers for large scale web extraction. Proceedings of the VLDB Endowment, 4(4):219--230, 2011. Google ScholarDigital Library
- P. Gulhane, A. Madaan, R. Mehta, J. Ramamirtham, R. Rastogi, S. Satpal, S. H. Sengamedu, A. Tengli, and C. Tiwari. Web-scale information extraction with vertex. 2011 IEEE 27th International Conference on Data Engineering, pages 1209--1220, Apr. 2011. Google ScholarDigital Library
- Q. Hao, R. Cai, Y. Pang, and L. Zhang. From One Tree to a Forest : a Unified Solution for Structured Web Data Extraction. In SIGIR 2011, pages 775--784, 2011. Google ScholarDigital Library
- T. Heath and C. Bizer. Linked data: Evolving the web into a global data space. Synthesis Lectures on the Semantic Web: Theory and Technology, 1(1):1--136, 2011. Google ScholarCross Ref
- G. Kobilarov, C. Bizer, S. Auer, and J. Lehmann. DBpedia-A Linked Data Hub and Data Source for Web and Enterprise Applications. In WWW2009, pages 1--3, 2009.Google Scholar
- S. Krause, H. Li, H. Uszkoreit, and F. Xu. Large-scale learning of relation-extraction rules with distant supervision from the web. In Proceedings of the 11th international conference on The Semantic Web - Volume Part I, ISWC'12, pages 263--278, Berlin, Heidelberg, 2012. Springer-Verlag. Google ScholarDigital Library
- N. Kushmerick. Wrapper Induction for information Extraction. In IJCAI97, pages 729--735, 1997.Google Scholar
- V. Lopez, M. Fernändez, E. Motta, and N. Stieler.Poweraqua: Supporting users in querying and exploring the semantic web. Semantic Web, 3(3):249--265, 2012.Google ScholarCross Ref
- V. Mulwad, T. Finin, Z. Syed, and A. Joshi. Using linked data to interpret tables. In O. Hartig, A. Harth, and J. Sequeda, editors, COLD, volume 665 of CEUR Workshop Proceedings. CEUR-WS.org, 2010.Google Scholar
- I. Muslea, S. Minton, and C. Knoblock. Hierarchical wrapper induction for semistructured information sources. Autonomous Agents and Multi-Agent Systems, pages 1--28, 2001. Google ScholarDigital Library
- I. Muslea, S. Minton, and C. Knoblock. Active Learning with Strong and Weak Views : A Case Study on Wrapper Induction. IJCAI'03 8th international joint conference on Artificial intelligence, pages 415--420, 2003. Google ScholarDigital Library
- A. Nikolov, V. Uren, E. Motta, and A. Roeck. Overcoming schema heterogeneity between linked semantic repositories to improve coreference resolution. In Proceedings of the 4th Asian Conference on The Semantic Web, ASWC '09, pages 332--346, Berlin, Heidelberg, 2009. Springer-Verlag. Google ScholarDigital Library
- A. Parameswaran, N. Dalvi, H. Garcia-Molina, and R. Rastogi. Optimal Schemes for Robust Web Extraction. In 37th International Conference on Very Large Data Bases, 2011.Google Scholar
- S. Soderland. Learning information extraction rules for semi-structured and free text. Mach. Learn., 34(1--3):23--272, Feb. 1999. Google ScholarDigital Library
- D. Song, Y. Wu, L. Liao, L. Li, and F. Sun. A dynamic learning framework to thoroughly extract structured data from web pages without human efforts. Proceedings of the ACM SIGKDD Workshop on Mining Data Semantics - MDS '12, l:1--8, 2012. Google ScholarDigital Library
- C. Welty, J. Fan, D. Gondek, and A. Schlaikjer. Large scale relation detection. In Proceedings of the NAACL HLT 2010 First International Workshop on Formalisms and Methodology for Learning by Reading, FAM-LbR '10, pages 24--33, Stroudsburg, PA, USA, 2010. Association for Computational Linguistics. Google ScholarDigital Library
- T. Wong and W. Lam. Learning to adapt web information extraction knowledge and discovering new attributes via a Bayesian approach. Knowledge and Data Engineering, IEEE, 22(4):523--536, 2010. Google ScholarDigital Library
Index Terms
- Unsupervised wrapper induction using linked data
Recommendations
Using the relation ontology Metarel for modelling Linked Data as multi-digraphs
Linked Data for Health Care and the Life SciencesThe Semantic Web standards OWL and RDF are often used to represent biomedical information as Linked Data; however, the OWL/RDF syntax, which combines both, was never optimised for querying. By combining two formal paradigms for modelling Linked Data, ...
Unsupervised information extraction from unstructured, ungrammatical data sources on the World Wide Web
Information extraction from unstructured, ungrammatical data such as classified listings is difficult because traditional structural and grammatical extraction methods do not apply. Previous work has exploited reference sets to aid such extraction, but ...
Swift Linked Data Miner
In this study, we present Swift Linked Data Miner, an interruptible algorithm that can directly mine an online Linked Data source (e.g., a SPARQL endpoint) for OWL 2 EL class expressions to extend an ontology with new SubClassOf: axioms. The algorithm ...
Comments