Stanford InfoLab Publication Server

Optimal Schemes for Robust Web Extraction

Parameswaran, Aditya and Dalvi, Nilesh and Garcia-Molina, Hector and Rastogi, Rajeev (2011) Optimal Schemes for Robust Web Extraction. Proceedings of the VLDB Conference, 4 (11).


PDF (Optimal Schemes for Robust Web Extraction)


In this paper, we consider the problem of constructing wrappers for web information extraction that are robust to changes in websites. We consider two models to study robustness formally: the adversarial model, where we look at the worst-case robustness of wrappers, and probabilistic model, where we look at the expected robustness of wrappers, as web-pages evolve. Under both models, we present optimal algorithms for constructing the most robust wrapper. By evaluating on real websites, we demonstrate that in practice, our algorithms are highly effective in coping up with changes in websites, and reduce the wrapper breakage by up to 500% over existing techniques.

Item Type:Article
Uncontrolled Keywords:wrappers, information extraction, robustness, annotation, theory, algorithms, experiments
ID Code:998
Deposited By:Aditya Parameswaran
Deposited On:02 Jun 2011 13:38
Last Modified:02 Jun 2011 13:40

Download statistics

Repository Staff Only: item control page