1 / 10

Web Mining for Extracting Relations

Web Mining for Extracting Relations. Negin Nejati. Relation Extraction. (James Gleick, Chaos: Making a New Science) (Charles Dickens, Great Expectations) (William Shakespeare, The Comedy of Errors) (Isaac Asimov, The Robots of Dawn) (David Brin, Startide Rising) (author, title).

arawn
Download Presentation

Web Mining for Extracting Relations

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Web Mining for Extracting Relations Negin Nejati

  2. Relation Extraction (James Gleick, Chaos: Making a New Science) (Charles Dickens, Great Expectations) (William Shakespeare, The Comedy of Errors) (Isaac Asimov, The Robots of Dawn) (David Brin, Startide Rising) (author, title)

  3. DIPRE Algorithm S = SampleTuples While size(S) < T O = FindOccurrences(S) P = GenPatterns(O) S = MatchingTuples(P)

  4. Pattern Generation • Existing methods assume components of tuple appear close together (e.g.” Foundation, by Isaac Asimov”) • This is a very strong assumption. (e.g. misses all the titles in the author’s webpage). • Non-popular relations with limited source of data suffer more. (for some relations this is not the typical appearance, e.g. (service, price))

  5. Using Heuristics • We are looking for (author, title) pairs. • It is very likely that the works of an author are presented as lists or tables. • Such tables usually have helpful titles such as: bibliography,selected work, novels, stories, etc.

  6. New Algorithm Great Expectations Charles Dickens occurrences

  7. New Algorithm Group occurrences using edit distance and generate patterns: <LI><I><A HREF="/WIKI/CHAOS:_MAKING_A_NEW_SCIENCE" TITLE="title">title</A></I> (VIKING PENGUIN, 1987)</LI> & <LI><I><A HREF="/WIKI/GREAT_EXPECTATIONS“ TITLE="title">title</A></I> (1860Â1861)</LI> [<LI><I><A HREF="/WIKI/, “TITLE="title">title</A></I> (, )</LI>]

  8. Pattern Generation (An Alternative) • [Charles Dickens • James Gleick • William Shakespeare • ….] • “List of authors” New titles Run patterns on result pages New authors

  9. Results • DIPRE 5 seeds  3 patterns  4047 pairs • The proposed algorithm 5 seeds  2 patterns  2596 pairs

  10. Further Investigations • Study the effects of including the titles of the lists and tables in the patterns. • Study the qualitative differences of these two methods.

More Related