Skip to main content
Log in

An analysis of some conditions for representingN state Markov processes as general all or none models

  • Published:
Psychometrika Aims and scope Submit manuscript

Abstract

Recently Markov learning models with two unidentifiable presolution success states, an error state, and an absorbing learned state, have been suggested to handle certain aspects of data better than the three state Markov models of the General All or None model type. In attempting to interpret psychologically, and evaluate statistically the adequacy of various classes of Markov models, a knowledge of the relationship between the classes of models would be helpful. This paper considers some aspects of the relationship between the class of General All or None models and the class of Stationary Absorbing Markov models withN error states, andM presolution success states.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Atkinson, R. C., & Crothers, E. J. A comparison of paired-associate learning models having different acquisition and retention axioms.Journal of Mathematical Psychology, 1964,1, 285–315.

    Google Scholar 

  • Bernbach, H. A. A forgetting model for paired-associate learning.Journal of Mathematical Psychology, 1965,2, 128–144.

    Google Scholar 

  • Burke, C. J., & Rosenblatt, M. A Markovian function of a Markov chain.Annals of Mathematical Statistics, 1958,29, 1112–1122.

    Google Scholar 

  • Goldberg, S.Introduction to difference equations. New York: Wiley & Sons, Inc., 1961.

    Google Scholar 

  • Greeno, J. G. Paired-associate learning with short term retention: mathematical analysis and data regarding identification of parameters.Journal of Mathematical Psychology, 1967,4, 430–472.

    Google Scholar 

  • Greeno, J. G. Identifiability and statistical properties of two-stage learning with no successes in the initial stage.Psychometrika, 1968,33, 173–215.

    Google Scholar 

  • Greeno, J. G., & Steiner, T. E. Markovian processes with identifiable states: General considerations and application to all or none learning.Psychometrika, 1964,29, 309–333.

    Google Scholar 

  • Greeno, J. G., & Steiner, T. E. Comments on “Markovian processes with identifiable states: General considerations and application to all or none learning.”Psychometrika, 1968,33, 169–172.

    Google Scholar 

  • Jolley, L. B. W.Summation of series (2nd ed.). New York: Dover, 1961.

    Google Scholar 

  • Kemeny, J. G., & J. L. Snell,Finite Markov Chains. Princeton: D. Van Nostrand Co., 1960.

    Google Scholar 

  • Murdoch, D. C.Linear algebra for undergraduates. New York: John Wiley & Sons, 1957.

    Google Scholar 

  • Polson, P. G., & Greeno, J. G. Nonstationary performance before all or none learning. Paper read at Midwestern Psychological Association, 1965.

  • Suppes, P., & Ginsberg, Rose. A fundamental property of all or none models.Psychological Review, 1963,70, 139–161.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Steiner, T.E., Greeno, J.G. An analysis of some conditions for representingN state Markov processes as general all or none models. Psychometrika 34, 461–487 (1969). https://doi.org/10.1007/BF02290602

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02290602

Keywords

Navigation