StatSnowball
Published 20 April 2009
Jun Zhu, Zaiqing Nie, Xiaojiang Liu, Bo Zhang, Ji-Rong Wen
Citations259
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
A statistical extraction framework called Statistical Snowball (StatSnowball), which is a bootstrapping system and can perform both traditional relation extraction and Open IE, is proposed and a working entity relation search engine called Renlifang is developed based on it.
Abstract
Traditional relation extraction methods require pre-specified relations and relation-specific human-tagged examples. Bootstrapping systems significantly reduce the number of training examples, but they usually apply heuristic-based methods to combine a set of strict hard rules, which limit the ability to generalize and thus generate a low recall. Furthermore, existing bootstrapping methods do not perform open information extraction (Open IE), which can identify various types of relations without requiring pre-specifications. In this paper, we propose a statistical extraction framework called Statistical Snowball (StatSnowball), which is a bootstrapping system and can perform both traditional relation extraction and Open IE.
Keywords
Computer ScienceDecision Sciences
Journal of the Royal Statistical Society Series B (Statistical Methodology)Regression Shrinkage and Selection Via the Lasso
51,790 Citations1996Robert Tibshirani
A new method for estimation in linear models called the lasso, which minimizes the residual sum of squares subject to the sum of the absolute value of the coefficients being less than a constant, is proposed.
Machine LearningSupport-Vector Networks
33,035 Citations1995Corinna Cortes, Vladimir Vapnik
High generalization ability of support-vector networks utilizing polynomial input transformations is demonstrated and the performance of the support- vector network is compared to various classical learning algorithms that all took part in a benchmark study of Optical Character Recognition.
ScholarlyCommons (University of Pennsylvania)Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data
12,978 Citations2001John Lafferty, Andrew McCallum +1 more
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.
Machine LearningMarkov logic networks
2,678 Citations2006Matthew Richardson, Pedro Domingos
Experiments with a real-world database and knowledge base in a university domain illustrate the promise of this approach to combining first-order logic and probabilistic graphical models in a single representation.
Open information extraction from the web
1,323 Citations2007Michele Banko, Michael Cafarella +3 more
<i>Snowball</i>
1,169 Citations2000Eugene Agichtein, Luis Gravano
This paper develops a scalable evaluation methodology and metrics for the task, and presents a thorough experimental evaluation of Snowball and comparable techniques over a collection of more than 300,000 newspaper documents.
Artificial IntelligenceUnsupervised named-entity extraction from the Web: An experimental study
1,128 Citations2005Oren Etzioni, Michael Cafarella +6 more
An overview of KnowItAll's novel architecture and design principles is presented, emphasizing its distinctive ability to extract information without any hand-labeled training examples, and three distinct ways to address this challenge are presented and evaluated.
IEEE Transactions on Pattern Analysis and Machine IntelligenceInducing features of random fields
1,044 Citations1997S. Della Pietra, V. Della Pietra +1 more
The random field models and techniques introduced in this paper differ from those common to much of the computer vision literature in that the underlying random fields are non-Markovian and have a large number of parameters that must be estimated.
Lecture notes in computer scienceExtracting Patterns and Relations from the World Wide Web
1,007 Citations1999Sergey Brin
This paper presents a technique which exploits the duality between sets of patterns and relations to grow the target relation starting from a small sample and uses it to extract a relation of (author,title) pairs from the World Wide Web.
Kernel methods for relation extraction
579 Citations2002Dmitry Zelenko, Chinatsu Aone +1 more
This work introduces kernels defined over shallow parse representations of text, and design efficient algorithms for computing the kernels, and uses the devised kernels in conjunction with Support Vector Machine and Voted Perceptron learning algorithms for the task of extracting person-affiliation and organization-location relations from text.
Scalable training of<i>L</i><sup>1</sup>-regularized log-linear models
541 Citations2007Galen Andrew, Jianfeng Gao
This work presents an algorithm Orthant-Wise Limited-memory Quasi-Newton (OWL-QN), based on L-BFGS, that can efficiently optimize the L1-regularized log-likelihood of log-linear models with millions of parameters.
arXiv (Cornell University)Efficiently Inducing Features of Conditional Random Fields
366 Citations2012Andrew McCallum
The Tradeoffs Between Open and Traditional Relation Extraction
321 Citations2008Michele Banko, Oren Etzioni
A new model for Open IE called O-CRF is presented and it is shown that it achieves increased precision and nearly double the recall than the model employed by TEXTRUNNER, the previous stateof-the-art Open IE system.
Learning the structure of Markov logic networks
304 Citations2005Stanley Kok, Pedro Domingos
An algorithm for learning the structure of MLNs from relational databases is developed, combining ideas from inductive logic programming (ILP) and feature induction in Markov networks.
Exploiting Shallow Linguistic Information for Relation Extraction from Biomedical Literature
288 Citations2006Claudio Giuliano, Alberto Lavelli +1 more
An approach for extracting relations between entities from biomedical literature based solely on shallow linguistic information is proposed, which outperforms most of the previous methods based on syntactic and semantic information.
Statistical predicate invention
261 Citations2007Stanley Kok, Pedro Domingos
This work proposes an initial model for SPI based on second-order Markov logic, in which predicates as well as arguments can be variables, and the domain of discourse is not fully known in advance.
Discriminative training of Markov logic networks
248 Citations2005Parag Singla, Pedro Domingos
This paper extends Collins’s (2002) voted perceptron algorithm for HMMs to MLNs by replacing the Viterbi algorithm with a weighted satisfiability solver, and proposes a discriminative approach to training MLNs.
Joint inference in information extraction
244 Citations2007Hoifung Poon, Pedro Domingos
This paper proposes a joint approach to information extraction, where segmentation of all records and entity resolution are performed together in a single integrated inference process, and is believed to be the first fully joint approach.
Preemptive information extraction using unrestricted relation discovery
240 Citations2006Yusuke Shinyama, Satoshi Sekine
A technique called Unrestricted Relation Discovery is proposed that discovers all possible relations from texts and presents them as tables in order to extend the boundary of Information Extraction systems.
Tree Kernel-Based Relation Extraction with Context-Sensitive Structured Parse Tree Information
195 Citations2007Guodong Zhou, Min Zhang +2 more
Evaluation on the ACE RDC corpora shows that the dynamic context-sensitive tree span is much more suitable for relation extraction than SPT and the tree kernel outperforms the state-of-the-art Collins and Duffy’s convolution tree kernel.
A scalable modular convex solver for regularized risk minimization
178 Citations2007Choon Hui Teo, Alex Smola +2 more
The theory and implementation of a highly scalable and modular convex solver which solves all these estimation problems, can be parallelized on a cluster of workstations, allows for data-locality, and can deal with regularizers such as l1 and l2 penalties.
Simultaneous record detection and attribute labeling in web data extraction
170 Citations2006Jun Zhu, Zaiqing Nie +3 more
It is shown that separately extracting data records and attributes is highly ineffective and a probabilistic model to perform these two tasks simultaneously is proposed and it can also incorporate hierarchical interactions which are very important for Web data extraction.
Discriminative structure and parameter learning for Markov logic networks
108 Citations2008Tuyen N. Huynh, Raymond J. Mooney
It is found that existing MLN methods perform very poorly on several such ILP benchmark problems, and improved discriminative methods for learning MLN clauses and weights are presented that outperform existingMLN and traditional ILP methods.
Conference on Innovative Data Systems ResearchObject-level vertical search
107 Citations2007Zaiqing Nie, Ji-Rong Wen +1 more
A new paradigm to enable web search at the object level is explored in this paper, extracting and integrating web information for objects relevant to a specific application domain and ranking these objects in terms of their relevance and popularity in answering user queries.
Lecture notes in computer scienceExtracting Semantic Networks from Text Via Relational Clustering
97 Citations2008Stanley Kok, Pedro Domingos
This paper uses the TextRunner system to extract tuples from text, and then induce general concepts and relations from them by jointly clustering the objects and relational strings in the tuples using Markov logic.
ScholarWorks@UMassAmherst (University of Massachusetts Amherst)A Note on the Unification of Information Extraction and Data Mining using Conditional-Probability, Relational Models
56 Citations2003Andrew McCallum, David Jensen
This position paper proposes the use of unified, relational, undirected graphical models for information extraction and data mining, in which extraction decisions and data-mining decisions are made in the same probabilistic “currency” with a common inference procedure— each component thus being able to make up for the weaknesses of the other and therefore improving the performance of both.
International Joint Conference on Artificial IntelligenceShallow semantics for relation extraction
56 Citations2005Sanda M. Harabagiu, Cosmin A. Bejan +1 more
A new method for extracting meaningful relations from unstructured natural language sources based on information made available by shallow semantic parsers that surpassed the results of kernel-based models employing only semantic class information.
Pattern Recognition LettersOn Bayesian classification with Laplace priors
48 Citations2007Ata Kabán
A new classification approach, using a variational Bayesian estimation of probit regression with Laplace priors, which is able to retain correlated features favouring generalisation and produces a weight-based ranking of the features, suited for interpretation.