Efficiently Inducing Features of Conditional Random Fields

Efficiently Inducing Features of Conditional Random Fields (2003)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Andrew McCallum

Citations:

142 - 9 self

BibTeX

@MISC{McCallum03efficientlyinducing,
    author = {Andrew McCallum},
    title = {Efficiently Inducing Features of Conditional Random Fields},
    year = {2003}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

Conditional Random Fields (CRFs) are undirected graphical models, a special case of which correspond to conditionally-trained finite state machines. A key advantage of CRFs is their great flexibility to include a wide variety of arbitrary, non-independent features of the input. Faced with

Citations

3116	A tutorial on hidden Markov models and selected applications in speech recognition - Rabiner - 1989
1714	Schapire R: A decision-theoretic generalization of online learning and an application to boosting - Freund - 1997
1548	BConditional random fields: Probabilistic models for segmenting and labeling sequence data - Lafferty, McCallum, et al.
464	Inducing Features of Random Fields - Pietra, Pietra, et al. - 1997
355	Maximum entropy Markov models for information extraction and segmentation - McCallum, Freitag, et al. - 2000
348	A maximum entropy model for part-of-speech tagging - Ratnaparkhi - 1996
340	BDiscriminative training methods for hidden Markov models - Collins
336	F: Shallow parsing with conditional random fields - Sha, Pereira
276	D: Discriminative probabilistic models for relational data - Taskar, Abbeel, et al. - 2002
207	Using maximum entropy for text classification - Nigam - 1999
181	R: A Gaussian prior for smoothing maximum entropy models - SF, Rosenfeld - 1999
179	Statistical models for text segmentation - Beeferman, Berger, et al. - 1999
171	A comparison of algorithms for maximum entropy parameter estimation - Malouf - 2002
151	Y: Chunking with Support Vector Machines - Kudo, Matsumoto
89	Exploiting Diverse Knowledge Sources via Maximum Entropy in Named Entity Recognition - Borthwick, Sterling, et al. - 1998
84	Markov fields on finite graphs and lattices,” Unpublished manuscript - Hammersley, Clifford - 1971
79	Representations of quasiNewton matrices and their use in limited memory methods - RH, Nocedal, et al. - 1994
73	Markov fields and log-linear interaction models for contingency tables - Darroch, Lauritzen, et al. - 1980
26	An alternate objective function for Markovian fields - Kakade, Teh, et al. - 2002
25	2002. Discriminative learning for label sequences via boosting - Altun, Hofmann, et al.
3	The use of classifiers in sequential inference. NIPS 13. Forthcoming - Punyakanok, Roth - 2001
1	Combining classifiers in text categorization. Submitted to SIGIR ’03 - Pinto, McCallum, et al. - 2003