2011 OptimalSchemesforRobustWebExt

From GM-RKB
Jump to navigation Jump to search

Subject Headings:

Notes

Cited By

Quotes

Abstract

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.

References


,

 AuthorvolumeDate ValuetitletypejournaltitleUrldoinoteyear
2011 OptimalSchemesforRobustWebExtHector Garcia-Molina
Rajeev Rastogi
Aditya Parameswaran
Optimal Schemes for Robust Web Extractionhttp://ilpubs.stanford.edu:8090/998/1/robust-wrapper.pdf