Open AccessProceedings Article
Collective Cross-Document Relation Extraction Without Labelled Data
Limin Yao,Sebastian Riedel,Andrew McCallum +2 more
- 09 Oct 2010
- pp 1013-1023
TL;DR: A novel approach to relation extraction is presented that integrates information across documents, performs global inference and requires no labelled text, and tackles relation extraction and entity identification jointly.
read more
Abstract: We present a novel approach to relation extraction that integrates information across documents, performs global inference and requires no labelled text. In particular, we tackle relation extraction and entity identification jointly. We use distant supervision to train a factor graph model for relation extraction based on an existing knowledge base (Freebase, derived in parts from Wikipedia). For inference we run an efficient Gibbs sampler that leads to linear time joint inference. We evaluate our approach both for an indomain (Wikipedia) and a more realistic out-of-domain (New York Times Corpus) setting. For the in-domain setting, our joint model leads to 4% higher precision than an isolated local approach, but has no advantage over a pipeline. For the out-of-domain data, we benefit strongly from joint modelling, and observe improvements in precision of 13% over the pipeline, and 15% over the isolated baseline.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Proceedings Article
Knowledge-Based Weak Supervision for Information Extraction of Overlapping Relations
Raphael Hoffmann,Congle Zhang,Xiao Ling,Luke Zettlemoyer,Daniel S. Weld +4 more
- 19 Jun 2011
TL;DR: A novel approach for multi-instance learning with overlapping relations that combines a sentence-level extraction model with a simple, corpus-level component for aggregating the individual facts is presented.
Knowledge Graph Identification
Jay Pujara,Hui Miao,Lise Getoor,William W. Cohen +3 more
- 21 Oct 2013
TL;DR: This paper shows how uncertain extractions about entities and their relations can be transformed into a knowledge graph and shows that compared to existing methods, the proposed approach is able to achieve improved AUC and F1 with significantly lower running time.
It's who you know: graph mining using recursive structural features
Keith Henderson,Brian Gallagher,Lei Li,Leman Akoglu,Tina Eliassi-Rad,Hanghang Tong,Christos Faloutsos +6 more
- 21 Aug 2011
TL;DR: ReFeX (Recursive Feature eXtraction), a novel algorithm, that recursively combines local features with neighborhood features; and outputs regional features -- capturing "behavioral" information in large graphs, is proposed.
•Proceedings Article
Reducing Wrong Labels in Distant Supervision for Relation Extraction
Shingo Takamatsu,Issei Sato,Hiroshi Nakagawa +2 more
- 08 Jul 2012
TL;DR: A novel generative model is presented that directly models the heuristic labeling process of distant supervision and predicts whether assigned labels are correct or wrong via its hidden variables.
250
•Proceedings Article
Event Discovery in Social Media Feeds
Edward Benson,Aria Haghighi,Regina Barzilay +2 more
- 19 Jun 2011
TL;DR: A graphical model is developed that addresses record extraction from social streams such as Twitter by learning a latent set of records and a record-message alignment simultaneously, resulting in a set of canonical records that are consistent with aligned messages.
References
Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
Stuart Geman,Donald Geman +1 more
TL;DR: The analogy between images and statistical mechanics systems is made and the analogous operation under the posterior distribution yields the maximum a posteriori (MAP) estimate of the image given the degraded observations, creating a highly parallel ``relaxation'' algorithm for MAP estimation.
•Proceedings Article
Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data
John Lafferty,Andrew McCallum,Fernando Pereira +2 more
- 28 Jun 2001
TL;DR: This work presents iterative parameter estimation algorithms for conditional random fields and compares the performance of the resulting models to HMMs and MEMMs on synthetic and natural-language data.
Freebase: a collaboratively created graph database for structuring human knowledge
Kurt Bollacker,Colin Evans,Praveen Paritosh,Tim Sturge,Jamie Taylor +4 more
- 09 Jun 2008
TL;DR: MQL provides an easy-to-use object-oriented interface to the tuple data in Freebase and is designed to facilitate the creation of collaborative, Web-based data-oriented applications.
6.1K
Incorporating Non-local Information into Information Extraction Systems by Gibbs Sampling
Jenny Rose Finkel,Trond Grenager,Christopher D. Manning +2 more
- 25 Jun 2005
TL;DR: By using simulated annealing in place of Viterbi decoding in sequence models such as HMMs, CMMs, and CRFs, it is possible to incorporate non-local structure while preserving tractable inference.