Matrix analysis of identifiability of some finite Markov models
From MaRDI portal
Publication:2549554
DOI10.1007/BF02291365zbMATH Open0227.62064MaRDI QIDQ2549554FDOQ2549554
Authors: Coleman T. Merryman, James G. Greeno, Richard Millward
Publication date: 1971
Published in: Psychometrika (Search for Journal in Brave)
Cites Work
- A Markovian Function of a Markov Chain
- Markovian processes with identifiable states: General considerations and application to all-or-none learning
- Paired-associate learning with short-term retention: Mathematical analysis and data regarding identification of parameters
- Derivations of learning statistics from absorbing Markov chains
- Derivation of learning process statistics for a general Markov model
- An analysis of some conditions for representing \(N\) state Markov processes as general all or none models
Cited In (7)
- Markovian interpretations of dual retrieval processes
- Population states and eigenstructures: A simplifying view of Markov learning models
- Equivalence classes of functions of finite Markov chains
- Statistical methods for absorbing Markov-chain models for learning: Estimation and identification
- How many parameters can a model have and still be testable?
- An identifiable model of two-stage learning
- Second responses in paired-associate learning
This page was built for publication: Matrix analysis of identifiability of some finite Markov models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2549554)