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
Generalized Iterative Scaling for Log-Linear Models
Darroch, J. N., & Ratcliff, D. (1972) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177692379 · Cited by 1,206
(1990) · Acta Applicandae Mathematicae · doi:10.1007/bf00046910 · Cited by 882
Constrained Monte Carlo Maximum Likelihood for Dependent Data
Geyer, C. J., & Thompson, E. A. (1992) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1992.tb01443.x · Cited by 874
Conjugate Priors for Exponential Families
Diaconis, P., & Ylvisaker, D. (1979) · The Annals of Statistics · doi:10.1214/aos/1176344611 · Cited by 700
Information geometry and alternating minimization procedures
Csiszár, I. (1984) · Statistics & Risk Modeling · Cited by 579
An iterative Gibbsian technique for reconstruction of m-ary images
Chalmond, B. (1989) · Pattern Recognition · doi:10.1016/0031-3203(89)90011-3 · Cited by 145
Estimation and annealing for Gibbsian fields
Laurent Younes, B. (1988) · French digital mathematics library (Numdam) · Cited by 134
A note on approximations to discrete probability distributions
Brown, D. T. (1959) · Information and Control · doi:10.1016/s0019-9958(59)80016-4 · Cited by 97
Frigessi, A., Hwang, C.-R., & Younès, L. (1992) · The Annals of Applied Probability · doi:10.1214/aoap/1177005652 · Cited by 83
A Geometric Interpretation of Darroch and Ratcliff's Generalized Iterative Scaling
Csiszár, I. (1989) · The Annals of Statistics · doi:10.1214/aos/1176347279 · Cited by 81
A Variational Method for Estimating the Parameters of MRF from Complete or Incomplete Data
Almeida, M. P., & Gidas, B. (1993) · The Annals of Applied Probability · doi:10.1214/aoap/1177005510 · Cited by 28
Convergence of Some Partially Parallel Gibbs Samplers with Annealing
Ferrari, P. A., Frigessi, A., & Schonmann, R. H. (1993) · The Annals of Applied Probability · doi:10.1214/aoap/1177005511 · Cited by 18
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
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.