Name
Abstract | ||
|---|---|---|
We present a robust method for gathering relational facts from the Web, based on matching generalized patterns which are automatically learned from seed facts for relations of interest. Our approach combines these generalized patterns for high recall information extraction with a rule-based, declarative reasoning approach to also ensure high precision. Newly extracted candidate facts are assigned statistical weights which reflect the strengths of the patterns used to extract them. For checking the plausibility of candidate facts with respect to existing knowledge and competing hypotheses, we use an efficient algorithm for weighted Max-Sat over propositional-logic clauses. In contrast to prior work on reasoning-based information extraction, we employ richer statistics and smart pruning to bound the number of grounded rules passed on to the Max-Sat solver. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1145/1859127.1859136 | WebDB |
Keywords | Field | DocType |
existing knowledge,robust knowledge gathering,candidate fact,generalized pattern,weighted max-sat,high precision,declarative reasoning approach,efficient algorithm,reasoning-based information extraction,high recall information extraction,max-sat solver,sat solver,propositional logic,information extraction,rule based | Data mining,Rdf databases,World Wide Web,Computer science,Information extraction,Artificial intelligence,Solver,Recall,Database,Machine learning | Conference |
Citations | PageRank | References |
7 | 0.60 | 25 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ndapandula Nakashole | 1 | 394 | 19.48 |
| Martin Theobald | 2 | 1474 | 72.06 |
| Gerhard Weikum | 3 | 12710 | 2146.01 |