Accurately and Reliably Extracting Data from the Web:

474 views

Published on

0 Comments
0 Likes
Statistics
Notes
  • Be the first to comment

  • Be the first to like this

No Downloads
Views
Total views
474
On SlideShare
0
From Embeds
0
Number of Embeds
3
Actions
Shares
0
Downloads
12
Comments
0
Likes
0
Embeds 0
No embeds

No notes for slide

Accurately and Reliably Extracting Data from the Web:

  1. 1. Accurately and Reliably Extracting Data from the Web: A Machine Learning Approach by: Craig A. Knoblock, Kristina Lerman Steven Minton, Ion Muslea Presented By: Divin Proothi
  2. 2. Introduction <ul><li>Problem Definition There is a tremendous amount of information available on the Web but much of this information is not in a form that can be easily used by other applications. </li></ul>
  3. 3. Introduction (Cont…) <ul><li>Existing Solution </li></ul><ul><ul><li>Use XML </li></ul></ul><ul><ul><li>Use of Wrappers </li></ul></ul><ul><li>Problems with XML </li></ul><ul><ul><li>XML is not widespread in use </li></ul></ul><ul><ul><li>Only address the problem within application domains where the interested parties can agree on the XML schema definitions. </li></ul></ul>
  4. 4. Introduction (Cont…) <ul><li>Use of Wrappers </li></ul><ul><ul><li>A wrapper is a piece of software that enables a semi-structured Web source to be queried as if it were a database. </li></ul></ul><ul><li>Issues with Wrappers </li></ul><ul><ul><li>Accuracy is not ensured </li></ul></ul><ul><ul><li>Not capable of detecting failures and repairing themselves when underlying sources change </li></ul></ul>
  5. 5. Critical Problem in Building Wrapper <ul><li>Defining a set of extraction rules that precisely define how to locate the information on the page. </li></ul>
  6. 6. STALKER - A Hierarchical Wrapper Induction Algorithm <ul><li>Learns extraction rules based on examples labeled by the user. </li></ul><ul><li>It has a GUI which allows a user to mark up several pages on a site. </li></ul><ul><li>System then generates a set of extraction rules that accurately extract the required information. </li></ul><ul><li>Uses a greedy-covering inductive learning algorithm. </li></ul>
  7. 7. Efficiency of Stalker <ul><li>Generates extraction rules from a small number of examples </li></ul><ul><ul><li>Rarely requires more than 10 examples </li></ul></ul><ul><ul><li>In many cases two examples are sufficient </li></ul></ul>
  8. 8. Reason for Efficiency <ul><li>First, in most of the cases, the pages in a source are generated based on a fixed template that may have only a few variations. </li></ul><ul><li>Second, STALKER exploits the hierarchical structure of the source to constrain the learning problem. </li></ul>
  9. 9. Definition of Stalker <ul><li>STALKER is a sequential covering algorithm that, given the training examples E, tries to learn a minimal number of perfect disjuncts that cover all examples in E </li></ul><ul><ul><li>A perfect disjunct is a rule that covers at least one training example and on any example the rule matches it produces the correct result. </li></ul></ul>
  10. 10. Algorithm <ul><li>Creates an initial set of candidate-rules C </li></ul><ul><li>Repeats until a perfect disjunct (P): </li></ul><ul><ul><li>select most promising candidate from C </li></ul></ul><ul><ul><li>refine that candidate </li></ul></ul><ul><ul><li>add the resulting refinements to C </li></ul></ul><ul><li>Removes from E all examples on which P is correct </li></ul><ul><li>Repeats the process until there are no more training examples in E. </li></ul>
  11. 11. Illustrative Example – Extracting Addresses of Restaurants <ul><li>Four Sample Restaurant documents </li></ul><ul><li>First, it selects an example, say E4, to guide the search. </li></ul><ul><li>Second, it generates a set of initial candidates , which are rules that consist of a single 1-token landmark. </li></ul>
  12. 12. Example (Cont…) <ul><li>In this case we have two initial candidates: </li></ul><ul><ul><li>R5 = SkipTo( <b> ) </li></ul></ul><ul><ul><li>R6 = SkipTo( _ HtmlTag _ ) </li></ul></ul><ul><li>R5 does not match within the other three examples. R6 matches in all four examples </li></ul><ul><li>Because R6 has a better generalization potential, STALKER selects R6 for further refinements. </li></ul>
  13. 13. Cont… <ul><li>While refining R6 , STALKER creates, among others, the new candidates R7 , R8 , R9 , and R10 </li></ul><ul><ul><li>R7 = SkipTo( : _ HtmlTag _ ) </li></ul></ul><ul><ul><li>R8 = SkipTo( _ Punctuation _ _ HtmlTag _ ) </li></ul></ul><ul><ul><li>R9 = SkipTo(:) SkipTo(_ HtmlTag _) </li></ul></ul><ul><ul><li>R10 = SkipTo(Address) SkipTo( _ HtmlTag _ ) </li></ul></ul><ul><li>As R10 works correctly on all four examples, STALKER stops the learning process and returns R10 . </li></ul>
  14. 14. Identifying Highly Informative Examples <ul><li>Stalker uses an active learning approach that analyzes the set of unlabeled examples to automatically select examples for the user to label called Co-testing . </li></ul><ul><li>Co-testing , exploits the fact that there are often multiple ways of extracting the same information. Here the system uses two types of rules: </li></ul><ul><ul><li>Forward </li></ul></ul><ul><ul><li>Backward </li></ul></ul>
  15. 15. Cont… <ul><li>In address identification example the address could also be identified by the following Backward Rules </li></ul><ul><ul><li>R11 = BackTo(Phone) BackTo(_ Number _) </li></ul></ul><ul><ul><li>R12 = BackTo(Phone : <i> ) BackTo(_ Number _) </li></ul></ul>
  16. 16. How it works <ul><li>The system first learns both a forward and a backward rules. </li></ul><ul><li>Then it runs both rules on a given set of unlabeled pages. </li></ul><ul><li>Whenever the rules disagree on an example, the system considers that as an example for the user to label next </li></ul>
  17. 17. Verifying the Extracted Data <ul><li>Data on web sites changes and changes often . </li></ul><ul><li>Machine learning techniques to learn a set of patterns that describe the information that is being extracted from each of the relevant fields. </li></ul>
  18. 18. Cont… <ul><li>The system learns the statistical distribution of the patterns for each field. </li></ul><ul><ul><li>For example, a set of street addresses — 12 Pico St. , 512 Oak Blvd. , 416 Main St. and 97 Adams Blvd. </li></ul></ul><ul><ul><li>all start with a pattern ( _ Number _ _ Capitalized _ ) and end with (Blvd.) or (St.) . </li></ul></ul>
  19. 19. Cont… <ul><li>Wrappers are verified by comparing the patterns of data returned to the learned statistical distribution. </li></ul><ul><li>Incase of significant difference an operator is notified or an automatic wrapper repair process is launched. </li></ul>
  20. 20. Automatically Repairing Wrappers <ul><li>Once the required information has been located </li></ul><ul><ul><li>The pages are automatically re-labeled and the labeled examples are re-run through the inductive learning process to produce the correct rules for this site. </li></ul></ul>
  21. 21. The Complete Process
  22. 22. Discussion <ul><li>Building wrappers by example. </li></ul><ul><li>Ensuring that the wrappers accurately extract data across an entire collection of pages. </li></ul><ul><li>Verifying a wrapper to avoid failures when a site changes. </li></ul><ul><li>Automatically repair wrappers in response to changes in layout or format. </li></ul>
  23. 23. Thank You Open for Questions and Discussions

×