Integrating data from the web by machine-learning tree-pattern queries

Effienct and reliable integration of web data requires building programs called wrappers Hand writting wrappers is tedious and error prone Constant changes in the web, also implies that wrappers need to be constantly refactored Machine learning has proven to be useful, but current techniques are either limited in expressivity, require non-intuitive user interaction or do not allow for n-ary extraction We study using tree-patterns as an n-ary extraction language and propose an algorithm learning such queries It calculates the most information-conservative tree-pattern which is a generalization of two input trees A notable aspect is that the approach allows to learn queries containing both child and descendant relationships between nodes More importantly, the proposed approach does not require any labeling other than the data which the user effectively wants to extract The experiments reported show the effectiveness of the approach.