most citedEfficiently Inducing Features of Conditional Random Fields

366 citations · 996 across the 9 of their papers we have counts for

collaborators

9 papers

cs.LG2012366 cited

Efficiently Inducing Features of Conditional Random Fields

Andrew McCallum

Conditional Random Fields (CRFs) are undirected graphical models, a special case of which correspond to conditionally-trained finite state machines. A key advantage of these models…

cs.LG20125 cited

An Integrated, Conditional Model of Information Extraction and Coreference with Applications to Citation Matching

Ben Wellner, Andrew McCallum, Fuchun Peng +1

Although information extraction and coreference resolution appear together in many applications, most current systems perform them as ndependent steps. This paper describes an appr…

cs.LG2012146 cited

Piecewise Training for Undirected Models

Charles Sutton, Andrew McCallum

For many large undirected models that arise in real-world applications, exact maximumlikelihood training is intractable, because it requires computing marginal distributions of the…

cs.LG20126 cited

A Conditional Random Field for Discriminatively-trained Finite-state String Edit Distance

Andrew McCallum, Kedar Bellare, Fernando Pereira

The need to measure sequence similarity arises in information extraction, object identity, data mining, biological sequence analysis, and other domains. This paper presents discrim…

cs.LG201243 cited

Improved Dynamic Schedules for Belief Propagation

Charles Sutton, Andrew McCallum

Belief propagation and its variants are popular methods for approximate inference, but their running time and even their convergence depend greatly on the schedule used to send the…

cs.IR201274 cited

Nonparametric Bayes Pachinko Allocation

Wei Li, David Blei, Andrew McCallum

Recent advances in topic models have explored complicated structured distributions to represent topic correlation. For example, the pachinko allocation model (PAM) captures arbitra…