The DOI matches its Crossref record; 53 of the 53 references it cites were found in a registry or an index.
Dynamic conditional random fields: factorized probabilistic models for labeling and segmenting sequence data
Open accessAbstract
693-723
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A tutorial on hidden Markov models and selected applications in speech recognition
Rabiner, L. R. (1989) · Proceedings of the IEEE · doi:10.1109/5.18626 · Cited by 22,743
(2021) · A First Course in Statistical Programming with R · doi:10.1017/9781108993456.011 · Cited by 13,724
Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data
Lafferty, J., McCallum, A., & Pereira, F. C. N. (2001) · ScholarlyCommons (University of Pennsylvania) · Cited by 12,935
Self-citationWolpert, D. H. (1992) · Neural Networks · doi:10.1016/s0893-6080(05)80023-1 · Cited by 7,951
Building a Large Annotated Corpus of English: The Penn Treebank
Marcus, M. (1993) · doi:10.21236/ada273556 · Cited by 7,405
Training Products of Experts by Minimizing Contrastive Divergence
Hinton, G. E. (2002) · Neural Computation · doi:10.1162/089976602760128018 · Cited by 4,879
A maximum entropy approach to natural language processing
Berger, A. L., Pietra, V. J. D., & Pietra, S. A. D. (1996) · doi:10.5555/234285.234289 · Cited by 3,065
Dynamic bayesian networks: representation, inference and learning
Murphy, K. P., & Russell, S. (2002) · Cited by 2,616
Collins, M. (2002) · Proceedings of the ACL-02 conference on Empirical methods in natural language processing - EMNLP '02 · doi:10.3115/1118693.1118694 · Cited by 1,862
Constructing Free-Energy Approximations and Generalized Belief Propagation Algorithms
Yedidia, J. S., Freeman, W. T., & Weiss, Y. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.850085 · Cited by 1,617
Text Chunking Using Transformation-Based Learning
Ramshaw, L. A., & Marcus, M. P. (1999) · Text, Speech and Language Technology · doi:10.1007/978-94-017-2390-9_10 · Cited by 1,460
Loopy Belief Propagation for Approximate Inference: An Empirical Study
Murphy, K. P., Weiss, Y., & Jordan, M. I. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1301.6725 · Cited by 1,397
A Maximum Entropy Model for Part-Of-Speech Tagging
Ratnaparkhi, A. (1996) · Cited by 1,317
Maximum Entropy Markov Models for Information Extraction and Segmentation
McCallum, A., Freitag, D., & Pereira, F. C. N. (2000) · Cited by 1,315
Self-citationShallow parsing with conditional random fields
Sha, F., & Pereira, F. (2003) · Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology - NAACL '03 · doi:10.3115/1073445.1073473 · Cited by 1,246
Taskar, B., Guestrin, C., & Koller, D. (2003) · Cited by 1,206
Factorial Hidden Markov Models
Ghahramani, Z., & Jordan, M. I. (1997) · Machine Learning · doi:10.1023/a:1007425814087 · Cited by 1,157
A model for reasoning about persistence and causation
Dean, T., & Kanazawa, K. (1989) · Computational Intelligence · doi:10.1111/j.1467-8640.1989.tb00324.x · Cited by 999
Learning Information Extraction Rules for Semi-Structured and Free Text
Soderland, S. (1999) · Machine Learning · doi:10.1023/a:1007562322031 · Cited by 934
The hierarchical hidden Markov model: Analysis and applications
Fine, S., Singer, Y., & Tishby, N. (1998) · Machine Learning · doi:10.1023/a:1007469218079 · Cited by 906 · cited 2×
“…probabilities depend on how long the chain has been in its current state, and hierarchical CRFs, which are moralized versions of the hierarchical HMMs of Fine et al. (1998).1 As in DBNs, this factorized structure can use many fewer parameters than the cross-product state space: even the…”
BackgroundWeighted finite-state transducers in speech recognition
Mohri, M., Pereira, F., & Riley, M. (2002) · Computer Speech & Language · doi:10.1006/csla.2001.0184 · Cited by 885
A family of algorithms for approximate bayesian inference
Minka, T. P., & Picard, R. W. (2001) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 882
An Introduction to Conditional Random Fields for Relational Learning
Sutton, C., & McCallum, A. (2007) · Introduction to Statistical Relational Learning · doi:10.7551/mitpress/7432.003.0006 · Cited by 841
Self-citationMultiscale conditional random fields for image labeling
He, X., Zemel, R. S., & Carreira-Perpinan, M. A. (2004) · Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR 2004. · doi:10.1109/cvpr.2004.1315232 · Cited by 828
Online large-margin training of dependency parsers
McDonald, R., Crammer, K., & Pereira, F. (2005) · Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics - ACL '05 · doi:10.3115/1219840.1219852 · Cited by 791
Introduction to the CoNLL-2000 shared task: chunking
Tjong Kim Sang, E. F., & Buchholz, S. (2000) · Proceedings of the 2nd workshop on Learning language in logic and the 4th conference on Computational natural language learning - · doi:10.3115/1117601.1117631 · Cited by 705
A comparison of algorithms for maximum entropy parameter estimation
Malouf, R. (2002) · proceeding of the 6th conference on Natural language learning - COLING-02 · doi:10.3115/1118853.1118871 · Cited by 655
Discriminative probabilistic models for relational data
Taskar, B., Abbeel, P., & Koller, D. (2002) · Cited by 625
Chunking with support vector machines
Kudo, T., & Matsumoto, Y. (2001) · Second meeting of the North American Chapter of the Association for Computational Linguistics on Language technologies 2001 - NAACL '01 · doi:10.3115/1073336.1073361 · Cited by 520
Relational Learning of Pattern-Match Rules for Information Extraction.
Califf, M. E., & Mooney, R. J. (1997) · Cited by 507
Divergence measures and message passing
Minka, T. P. (2005) · Cited by 477
Hidden Markov support vector machines
Altün, Y., Tsochantaridis, I., & Hofmann, T. (2003) · Cited by 458
Table extraction using conditional random fields
Pinto, D., McCallum, A., Wei, X., & Croft, W. B. (2003) · Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval · doi:10.1145/860435.860479 · Cited by 355
Self-citationMachine Learning for Information Extraction in Informal Domains
Freitag, D. (2000) · Machine Learning · doi:10.1023/a:1007601113994 · Cited by 350
Conditional random fields for object recognition
Quattoni, A., Collins, M., & Darrell, T. (2004) · Cited by 342
Accelerated training of conditional random fields with stochastic gradient methods
Vishwanathan, S. V. N., Schraudolph, N. N., Schmidt, M. W., & Murphy, K. P. (2006) · Proceedings of the 23rd international conference on Machine learning - ICML '06 · doi:10.1145/1143844.1143966 · Cited by 278
Policy Recognition in the Abstract Hidden Markov Model
Bui, H., Venkatesh, S., & WEST, G. A. W. (2002) · Cited by 243
Information Extraction with HMMs and Shrinkage
Freitag, D., & McCallum, A. K. (1999) · Cited by 237
Self-citationTaskar, B., Klein, D., Collins, M., Koller, D., & Manning, C. D. (2004) · Conference on Empirical Methods in Natural Language Processing (EMNLP) · Cited by 229
Residual Belief Propagation: Informed Scheduling for Asynchronous Message Passing
Elidan, G., McGraw, I., & Koller, D. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1206.6837 · Cited by 225
A coupled HMM for audio-visual speech recognition
Nefian, A. V., Liang, L., Pi, X., Xiaoxiang, L., Mao, C., & Murphy, K. (2002) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2002.5745027 · Cited by 217
Linear-time inference in Hierarchical HMMs
Murphy, K. P., & Paskin, M. A. (2001) · neural information processing systems · Cited by 206
Discriminative Fields for Modeling Spatial Dependencies in Natural Images
Kumar, S., & Hebert, M. (2018) · Figshare · doi:10.1184/r1/6554576 · Cited by 196
Hierarchical hidden Markov models for information extraction
Skounakis, M., Craven, M. W., & Ray, S. (2003) · Cited by 142
Efficient Training of Conditional Random Fields
Wallach, H. (2002) · Cited by 127
A Conditional Random Field for Discriminatively-Trained Finite-State String Edit Distance
McCallum, A., Bellare, K., & Pereira, F. M. B. (2005) · Defense Technical Information Center (DTIC) · doi:10.21236/ada440386 · Cited by 126
Self-citationPolicy Recognition in the Abstract Hidden Markov Model
Bui, H. H., Venkatesh, S., & West, G. (2002) · Journal of Artificial Intelligence Research · doi:10.1613/jair.839 · Cited by 123
Graphical models and automatic speech recognition
Bilmes, J. (2002) · The Journal of the Acoustical Society of America · doi:10.1121/1.4779134 · Cited by 90
Relational learning via propositional algorithms: an information extraction case study
Roth, D., & Yih, W.-T. (2001) · Cited by 83
Viola, P. A., & Narasimhan, M. (2005) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/1076034.1076091 · Cited by 75
McCallum, A., & Jensen, D. D. (2003) · ScholarWorks@UMassAmherst (University of Massachusetts Amherst) · Cited by 56
Self-citationComposition of conditional random fields for transfer learning
Sutton, C. A., & McCallum, A. (2005) · doi:10.3115/1220575.1220669 · Cited by 53
Self-citationFactorial Markov Random Fields
Kim, J., & Zabih, R. (2002) · Lecture notes in computer science · doi:10.1007/3-540-47977-5_21 · Cited by 31
Cited by
Modeling of species distributions with Maxent: new extensions and a comprehensive evaluation
Phillips, S. J., & Dudík, M. (2008) · Ecography · doi:10.1111/j.0906-7590.2008.5203.x · Cited by 5,890
A unified architecture for natural language processing: deep neural networks with multitask learning
Collobert, R., & Weston, J. (2008) · Proceedings of the 25th international conference on Machine learning - ICML '08 · doi:10.1145/1390156.1390177 · Cited by 5,058
Natural Language Processing (almost) from Scratch
Collobert, R., Weston, J., Bottou, L., Karlen, M., Kavukcuoglu, K., & Kuksa, P. P. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1103.0398 · Cited by 4,962
Time-series clustering – A decade review
Aghabozorgi, S., Seyed Shirkhorshidi, A., & Ying Wah, T. (2015) · Information Systems · doi:10.1016/j.is.2015.04.007 · Cited by 1,826
Boosting for transfer learning
Dai, W., Yang, Q., Xue, G.-R., & Yu, Y. (2007) · Proceedings of the 24th international conference on Machine learning · doi:10.1145/1273496.1273521 · Cited by 1,724
Metadata
- Authors
- Sutton, C., Rohanimanesh, K., & McCallum, A.
- Venue
- Twenty-first international conference on Machine learning - ICML '04
- Publisher
- ACM Press
- Published
- 2004
- Volume
- 8
- Issue
- 25
- Pages
- 99
- OpenAlex
- W2152463966
- Cited by
- 284
- References
- 53
- FWCI
- 28.37
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.