The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
The power of amnesia: Learning probabilistic automata with variable memory length
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
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
Bellman, R. E. (2010) · doi:10.1515/9781400835386 · Cited by 14,588
Baum, L. E., Petrie, T., Soules, G., & Weiss, N. (1970) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177697196 · Cited by 4,297
Compression of individual sequences via variable-rate coding
Ziv, J., & Lempel, A. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055934 · Cited by 3,432
Prediction and Entropy of Printed English
Shannon, C. E. (1951) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1951.tb01366.x · Cited by 2,686
Baum, L. E. (1972) · Medical Entomology and Zoology · Cited by 1,405
The context-tree weighting method: basic properties
Willems, F. M. J., Shtarkov, Y. M., & Tjalkens, T. J. (1995) · IEEE Transactions on Information Theory · doi:10.1109/18.382012 · Cited by 919
A universal data compression system
Rissanen, J. (1983) · IEEE Transactions on Information Theory · doi:10.1109/tit.1983.1056741 · Cited by 631
Fast Sequential Decoding Algorithm Using a Stack
Jelinek, F. (1969) · IBM Journal of Research and Development · doi:10.1147/rd.136.0675 · Cited by 541
SELF-ORGANIZED LANGUAGE MODELING FOR SPEECH RECOGNITION
Jelinek, F. (1990) · Readings in Speech Recognition · doi:10.1016/b978-0-08-051584-7.50045-0 · Cited by 427
Learning Decision Trees Using the Fourier Spectrum
Kushilevitz, E., & Mansour, Y. (1993) · SIAM Journal on Computing · doi:10.1137/0222080 · Cited by 328
Fill, J. A. (1991) · The Annals of Applied Probability · doi:10.1214/aoap/1177005981 · Cited by 320
A hidden Markov model that finds genes inE.coliDNA
Krogh, A., Mian, I. S., & Haussler, D. (1994) · Nucleic Acids Research · doi:10.1093/nar/22.22.4768 · Cited by 315
On the learnability of discrete distributions
Kearns, M., Mansour, Y., Ron, D., Rubinfeld, R., Schapire, R. E., & Sellie, L. (1994) · Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 · doi:10.1145/195058.195155 · Cited by 273
Self-citationComplexity of strings in the class of Markov sources
Rissanen, J. (1986) · IEEE Transactions on Information Theory · doi:10.1109/tit.1986.1057210 · Cited by 192
Conductance and convergence of Markov chains-a combinatorial treatment of expanders
Mihail, M. (1989) · 30th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1989.63529 · Cited by 175
ON THE COMPUTATIONAL COMPLEXITY OFAPPROXIMATING DISTRIBUTIONS BY PROBABILISTIC AUTOMATA
Abe, N., & Warmuth, M. K. (1990) · doi:10.5555/92571.92587 · Cited by 147
On the learnability and usage of acyclic probabilistic finite automata
Ron, D., Singer, Y., & Tishby, N. (1995) · Conference on Learning Theory · doi:10.1145/225298.225302 · Cited by 124
Self-citationDiscrete Sequence Prediction and Its Applications
Laird, P. D., & Saul, R. (1994) · Machine Learning · doi:10.1007/bf01000408 · Cited by 82
Optimal prefetching via data compression
Vitter, J. S., & Krishnan, P. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1991.185360 · Cited by 64
Learning and robust learning of product distributions
Höffgen, K.-U. (1993) · Annual Conference on Computational Learning Theory (COLT) · doi:10.1145/168304.168314 · Cited by 57
Part-of-speech tagging using a Variable Memory Markov model
Schütze, H., & Singer, Y. (1994) · Proceedings of the conference - Association for Computational Linguistics. Meeting · doi:10.3115/981732.981757 · Cited by 53
Self-citationEfficient learning of typical finite automata from random walks
Freund, Y., Kearns, M. J., Ron, D., Rubinfeld, R., Schapire, R. E., & Sellie, L. M. (1993) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/167088.167191 · Cited by 44
Self-citationInference and minimization of hidden Markov chains
Gillman, D. W., & Sipser, M. (1994) · Conference on Learning Theory · doi:10.1145/180139.181091 · Cited by 19
Optimal prediction for prefetching in the worst case
Krishnan, P., & Vitter, J. S. (1994) · doi:10.5555/314464.314575 · Cited by 11
Cited by
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
Self-citationJordan, M. I. (2004) · Statistical Science · doi:10.1214/088342304000000026 · Cited by 420
Automated annotation of birdsong with a neural network that segments spectrograms
Cohen, Y., Nicholson, D. A., Sanchioni, A., Mallaber, E. K., Skidanova, V., & Gardner, T. J. (2022) · eLife · doi:10.7554/elife.63853 · Cited by 80
Metadata
- Authors
- Ron, D., Singer, Y., & Tishby, N.
- Venue
- Machine Learning
- Published
- 1997
- Volume
- 25
- Issue
- 2-3
- Pages
- 117-149
- ISSN
- 0885-6125 (ISSN-L)
- 1573-0565
- OpenAlex
- W1994920552
- Cited by
- 447
- References
- 27
- FWCI
- 15.19
- Type
- journal article
- Language
- en
- Open access
- bronze
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.
