Open AccessProceedings Article
Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data
John Lafferty,Andrew McCallum,Fernando Pereira +2 more
- pp 282-289
Reads0
Chats0
TLDR
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.Abstract:
We present conditional random fields , a framework for building probabilistic models to segment and label sequence data. Conditional random fields offer several advantages over hidden Markov models and stochastic grammars for such tasks, including the ability to relax strong independence assumptions made in those models. Conditional random fields also avoid a fundamental limitation of maximum entropy Markov models (MEMMs) and other discriminative Markov models based on directed graphical models, which can be biased towards states with few successor states. We present iterative parameter estimation algorithms for conditional random fields and compare the performance of the resulting models to HMMs and MEMMs on synthetic and natural-language data.read more
Citations
More filters
Journal ArticleDOI
A Study of Parts-Based Object Class Detection Using Complete Graphs
TL;DR: This work presents a practicable and expandable probabilistic framework for parts-based object class representation, enabling the detection of rigid and articulated object classes in arbitrary views and investigates learning of this representation from labelled training images and infer globally optimal solutions to the contextual MAP-detection problem.
Journal ArticleDOI
A survey on real-time event detection from the Twitter data stream:
TL;DR: A survey of a wide variety of event detection methods applied to streaming Twitter data, classifying them according to shared common traits, and then discusses different aspects of the subtasks and challenges involved in event detection.
Proceedings ArticleDOI
Collective Information Extraction with Relational Markov Networks
Razvan Bunescu,Raymond J. Mooney +1 more
TL;DR: A new IE method is presented that employs Relational Markov Networks (a generalization of CRFs), which can represent arbitrary dependencies between extractions, which allows for "collective information extraction" that exploits the mutual influence between possible extractions.
Journal ArticleDOI
Integrating Concept Ontology and Multitask Learning to Achieve More Effective Classifier Training for Multilevel Image Annotation
TL;DR: A novel hyperbolic framework for large-scale image visualization and interactive hypotheses assessment and a novel hierarchical boosting algorithm is developed to learn their ensemble classifiers hierarchically is developed.
Book
Linguistic Structure Prediction
TL;DR: This work considers statistical, computational approaches to modeling linguistic structure and approaches to decoding and supervised and unsupervised learning of models that predict discrete structures as outputs are the focus.
References
More filters
Journal ArticleDOI
A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting
Yoav Freund,Robert E. Schapire +1 more
TL;DR: The model studied can be interpreted as a broad, abstract extension of the well-studied on-line prediction model to a general decision-theoretic setting, and it is shown that the multiplicative weight-update Littlestone?Warmuth rule can be adapted to this model, yielding bounds that are slightly weaker in some cases, but applicable to a considerably more general class of learning problems.
Gradient-based learning applied to document recognition
Yann LeCun,Léon Bottou,Léon Bottou,Yoshua Bengio,Yoshua Bengio,Yoshua Bengio,Patrick Haffner,Patrick Haffner +7 more
TL;DR: This paper reviews various methods applied to handwritten character recognition and compares them on a standard handwritten digit recognition task, and Convolutional neural networks are shown to outperform all other techniques.
Book
Foundations of Statistical Natural Language Processing
TL;DR: This foundational text is the first comprehensive introduction to statistical natural language processing (NLP) to appear and provides broad but rigorous coverage of mathematical and linguistic foundations, as well as detailed discussion of statistical methods, allowing students and researchers to construct their own implementations.
Book
Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids
TL;DR: This book gives a unified, up-to-date and self-contained account, with a Bayesian slant, of such methods, and more generally to probabilistic methods of sequence analysis.
Journal ArticleDOI
A maximum entropy approach to natural language processing
TL;DR: A maximum-likelihood approach for automatically constructing maximum entropy models is presented and how to implement this approach efficiently is described, using as examples several problems in natural language processing.