The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Inducing features of random fields
Abstract
We present a technique for constructing random fields from a set of training samples. The learning paradigm builds increasingly complex fields by allowing potential functions, or features, that are supported by increasingly large subgraphs. Each feature has a weight that is trained by minimizing the Kullback-Leibler divergence between the model and the empirical distribution of the training data. A greedy algorithm determines how features are incrementally added to the field and an iterative scaling algorithm is used to estimate the optimal values of the weights. 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. Relations to other learning approaches, including decision trees, are given. As a demonstration of the method, we describe its application to the problem of automatic word classification in natural language processing.
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
Maximum Likelihood from Incomplete Data Via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1977.tb01600.x · Cited by 50,444
Classification and Regression Trees.
Gordon, A. D., Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (1984) · Biometrics · doi:10.2307/2530946 · Cited by 23,522
Classification and Regression Trees.
Ryzin, J. V., Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (1986) · Journal of the American Statistical Association · doi:10.2307/2288003 · Cited by 20,825
Stochastic relaxation, gibbs distributions, and the bayesian restoration of images.
Geman, S., & Geman, D. (1984) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1984.4767596 · Cited by 17,949
Classification and regression trees
Praagman, J. (1985) · European Journal of Operational Research · doi:10.1016/0377-2217(85)90321-2 · Cited by 10,053
Maximum Likelihood from Incomplete Data via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1976) · Cited by 4,517
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
(1992) · doi:10.5555/176313.176316 · Cited by 2,892
Self-citationA statistical approach to machine translation
Brown, P. F., Cocke, J., Pietra, S. A. D., Pietra, V. J. D., Jelinek, F., Lafferty, J., Mercer, R. L., & Roossin, P. S. (1990) · doi:10.5555/92858.92860 · Cited by 1,655
Self-citation$I$-Divergence Geometry of Probability Distributions and Minimization Problems
Csiszar, I. (1975) · The Annals of Probability · doi:10.1214/aop/1176996454 · Cited by 1,645
Cited by
Maximum entropy modeling of species geographic distributions
Phillips, S. J., Anderson, R. P., & Schapire, R. E. (2006) · Ecological Modelling · doi:10.1016/j.ecolmodel.2005.03.026 · Cited by 15,396
Thumbs up?: sentiment classification using machine learning techniques
Pang, B., Lee, L., & Vaithyanathan, S. (2002) · Proceedings of the ACL-02 conference on Empirical methods in natural language processing - EMNLP '02 · doi:10.3115/1118693.1118704 · Cited by 7,024
A statistical explanation of MaxEnt for ecologists
Elith, J., Phillips, S. J., Hastie, T., Dudík, M., Chee, Y. E., & Yates, C. J. (2011) · Diversity and Distributions · doi:10.1111/j.1472-4642.2010.00725.x · Cited by 6,699
A Comprehensive Survey on Transfer Learning
Zhuang, F., Qi, Z., Duan, K., Xi, D., Zhu, Y., Zhu, H., Xiong, H., & He, Q. (2021) · Proceedings of the IEEE · doi:10.1109/jproc.2020.3004555 · Cited by 6,678
“Therefore, in the final step, the crossdomain dense correspondences are established between the test image and the retrieved best matching image at first, and then the annotations of the best matching image are transferred to the test image via the Markov random field model [180], [181].”
MethodIncorporating non-local information into information extraction systems by Gibbs sampling
Finkel, J. R., Grenager, T., & Manning, C. (2005) · Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics - ACL '05 · doi:10.3115/1219840.1219885 · Cited by 3,008
Richardson, M., & Domingos, P. (2006) · Machine Learning · doi:10.1007/s10994-006-5833-1 · Cited by 2,676
A maximum entropy approach to species distribution modeling
Phillips, S. J., Dudík, M., & Schapire, R. E. (2004) · Twenty-first international conference on Machine learning - ICML '04 · doi:10.1145/1015330.1015412 · Cited by 2,252
The Boosting Approach to Machine Learning: An Overview
Schapire, R. E. (2003) · Lecture Notes in Statistics · doi:10.1007/978-0-387-21579-2_9 · Cited by 2,003
Automatic Labeling of Semantic Roles
Gildea, D., & Jurafsky, D. (2002) · Computational Linguistics · doi:10.1162/089120102760275983 · Cited by 1,626
Shallow 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
McCallum, A., & Li, W. (2003) · Proceedings of the seventh conference on Natural language learning at HLT-NAACL 2003 - · doi:10.3115/1119176.1119206 · Cited by 1,160
Yuille, A. L., & Rangarajan, A. (2003) · Neural Computation · doi:10.1162/08997660360581958 · Cited by 1,151
Hand, D. J. (2007) · Drug Safety · doi:10.2165/00002018-200730070-00010 · Cited by 1,044
Topic Detection and Tracking Pilot Study Final Report
Allan, J., Carbonell, J., Doddington, G. R., Yamron, J., & Yang, Y. (2018) · doi:10.1184/r1/6626252.v1 · Cited by 939
Learning Conditional Random Fields for Stereo
Scharstein, D., & Pal, C. (2007) · 2007 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2007.383191 · Cited by 851
Roth, S., & Black, M. J. (2009) · International Journal of Computer Vision · doi:10.1007/s11263-008-0197-6 · Cited by 847
Domain Adaptation for Statistical Classifiers
Daume III, H., & Marcu, D. (2006) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1872 · Cited by 816
Two decades of statistical language modeling: where do we go from here?
Rosenfeld, R. (2000) · Proceedings of the IEEE · doi:10.1109/5.880083 · Cited by 735
Discriminative Reranking for Natural Language Parsing
Collins, M., & Koo, T. (2005) · Computational Linguistics · doi:10.1162/0891201053630273 · Cited by 710
Geng, X. (2016) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2016.2545658 · Cited by 691
Logistic Regression, AdaBoost and Bregman Distances
Collins, M., Schapire, R. E., & Singer, Y. (2002) · Machine Learning · doi:10.1023/a:1013912006537 · Cited by 687
Statistical Models for Text Segmentation
Beeferman, D., Berger, A., & Lafferty, J. (1999) · Machine Learning · doi:10.1023/a:1007506220214 · Cited by 680
Self-citationA 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
From Plant Traits to Plant Communities: A Statistical Mechanistic Approach to Biodiversity
Shipley, B., Vile, D., & Garnier, E. (2006) · Science · doi:10.1126/science.1131344 · Cited by 631
Facial Age Estimation by Learning from Label Distributions
Geng, X., Yin, C., & Zhou, Z.-H. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2013.51 · Cited by 618
Speakers optimize information density through syntactic reduction
Levy, R., & Jaeger, T. F. (2007) · Advances in Neural Information Processing Systems 19 · doi:10.7551/mitpress/7503.003.0111 · Cited by 503
Equivalence of MAXENT and Poisson Point Process Models for Species Distribution Modeling in Ecology
Renner, I. W., & Warton, D. I. (2013) · Biometrics · doi:10.1111/j.1541-0420.2012.01824.x · Cited by 463
Application of Deep Belief Networks for Natural Language Understanding
Sarikaya, R., Hinton, G. E., & Deoras, A. (2014) · IEEE/ACM Transactions on Audio, Speech, and Language Processing · doi:10.1109/taslp.2014.2303296 · Cited by 460
Chinese segmentation and new word detection using conditional random fields
Peng, F., Feng, F., & McCallum, A. (2004) · Proceedings of the 20th international conference on Computational Linguistics - COLING '04 · doi:10.3115/1220355.1220436 · Cited by 460
An Introduction to Boosting and Leveraging
Meir, R., & Rätsch, G. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36434-x_4 · Cited by 447
Wide-Coverage Efficient Statistical Parsing with CCG and Log-Linear Models
Clark, S., & Curran, J. R. (2007) · Computational Linguistics · doi:10.1162/coli.2007.33.4.493 · Cited by 410
Data Mined Ionic Substitutions for the Discovery of New Compounds
Hautier, G., Fischer, C., Ehrlacher, V., Jain, A., & Ceder, G. (2011) · Inorganic Chemistry · doi:10.1021/ic102031h · Cited by 394
Dual coordinate descent methods for logistic regression and maximum entropy models
Yu, H.-F., Huang, F.-L., & Lin, C.-J. (2011) · Machine Learning · doi:10.1007/s10994-010-5221-8 · Cited by 387
Incremental parsing with the perceptron algorithm
Collins, M., & Roark, B. (2004) · Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics - ACL '04 · doi:10.3115/1218955.1218970 · Cited by 373
Linear feature-based models for information retrieval
Metzler, D., & Bruce Croft, W. (2007) · Information Retrieval · doi:10.1007/s10791-006-9019-z · Cited by 372
Efficiently Inducing Features of Conditional Random Fields
McCallum, A. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1212.2504 · Cited by 363
Entity Resolution with Markov Logic
Singla, P., & Domingos, P. (2006) · Sixth International Conference on Data Mining (ICDM'06) · doi:10.1109/icdm.2006.65 · Cited by 359
Lee, C., & Lee, G. G. (2006) · Information Processing & Management · doi:10.1016/j.ipm.2004.08.006 · Cited by 356
Conditional random fields for activity recognition
Vail, D. L., Veloso, M. M., & Lafferty, J. D. (2007) · Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems · doi:10.1145/1329125.1329409 · Cited by 357
Self-citationLearning how to inpaint from global image statistics
Levin, Zomet, & Weiss (2003) · Proceedings Ninth IEEE International Conference on Computer Vision · doi:10.1109/iccv.2003.1238360 · Cited by 324
An evaluation of statistical spam filtering techniques
Zhang, L., Zhu, J., & Yao, T. (2004) · ACM Transactions on Asian Language Information Processing · doi:10.1145/1039621.1039625 · Cited by 315
Markov Logic: An Interface Layer for Artificial Intelligence
Domingos, P., & Lowd, D. (2009) · Synthesis lectures on artificial intelligence and machine learning · doi:10.2200/s00206ed1v01y200907aim007 · Cited by 314
Named entity recognition: a maximum entropy approach using global information
Chieu, H. L., & Ng, H. T. (2002) · Proceedings of the 19th international conference on Computational linguistics - · doi:10.3115/1072228.1072253 · Cited by 309
Detecting anomalies in network traffic using maximum entropy estimation
Gu, Y., McCallum, A., & Towsley, D. (2005) · Internet Measurement Conference · doi:10.5555/1251086.1251118 · Cited by 305
Learning the structure of Markov logic networks
Kok, S., & Domingos, P. (2005) · Proceedings of the 22nd international conference on Machine learning - ICML '05 · doi:10.1145/1102351.1102407 · Cited by 298
Statistical language model adaptation: review and perspectives
Bellegarda, J. R. (2004) · Speech Communication · doi:10.1016/j.specom.2003.08.002 · Cited by 297
Trust region Newton methods for large-scale logistic regression
Lin, C.-J., Weng, R. C., & Keerthi, S. S. (2007) · Proceedings of the 24th international conference on Machine learning · doi:10.1145/1273496.1273567 · Cited by 284
Kornejady, A., Ownegh, M., & Bahremand, A. (2017) · CATENA · doi:10.1016/j.catena.2017.01.010 · Cited by 271
Recent Advances of Large-Scale Linear Classification
Yuan, G.-X., Ho, C.-H., & Lin, C.-J. (2012) · Proceedings of the IEEE · doi:10.1109/jproc.2012.2188013 · Cited by 266
Bootstrapping pay-as-you-go data integration systems
Das Sarma, A., Dong, X., & Halevy, A. (2008) · Proceedings of the 2008 ACM SIGMOD international conference on Management of data · doi:10.1145/1376616.1376702 · Cited by 254
Detecting anomalies in network traffic using maximum entropy estimation
Gu, Y., McCallum, A., & Towsley, D. (2005) · Proceedings of the 5th ACM SIGCOMM conference on Internet measurement - IMC '05 · doi:10.1145/1330107.1330148 · Cited by 253
StatSnowball: a statistical approach to extracting entity relationships
Zhu, J., Nie, Z., Liu, X., Zhang, B., & Wen, J.-R. (2009) · Proceedings of the 18th international conference on World wide web · doi:10.1145/1526709.1526724 · Cited by 252
BILMES, J. A. (2006) · IEICE Transactions on Information and Systems · doi:10.1093/ietisy/e89-d.3.869 · Cited by 172
“Inference is essential both to make predictions and to learn the network parameters with, say, the EM algorithm [32] or other iterative schemes [33].”
BackgroundWasserstein Introspective Neural Networks
Lee, K., Xu, W., Fan, F., & Tu, Z. (2018) · 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2018.00390 · Cited by 56
Introspective Neural Networks for Generative Modeling
Lazarow, J., Jin, L., & Tu, Z. (2017) · 2017 IEEE International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2017.302 · Cited by 49
Metadata
- Authors
- Della Pietra, S., Della Pietra, V., & Lafferty, J.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 1997-04
- Volume
- 19
- Issue
- 4
- Pages
- 380-393
- ISSN
- 0162-8828 (ISSN-L)
- OpenAlex
- W2160842254
- Cited by
- 1,036
- References
- 22
- FWCI
- 22.35
- Type
- journal article
- Language
- en
- Open access
- closed
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.