Markovian processes with identifiable states: General considerations and application to all-or-none learning
From MaRDI portal
Publication:2521308
DOI10.1007/BF02289599zbMath0136.41805MaRDI QIDQ2521308
T. E. Steiner, James G. Greeno
Publication date: 1964
Published in: Psychometrika (Search for Journal in Brave)
Related Items (22)
Random search with unequal search rates: Serial and parallel generalizations of McGill's model ⋮ Thou shalt identify! The identifiability of two high-threshold models in confidence-rating recognition (and super-recognition) paradigms ⋮ An all-or-none model for noncorrection routines with elimination of incorrect responses ⋮ A comparison of paired-associate learning models having different acquisition and retention axioms ⋮ Markovian interpretations of dual retrieval processes ⋮ Population states and eigenstructures: A simplifying view of Markov learning models ⋮ Mathematical psychology: Prospects for the 21st century: A guest editorial ⋮ Linear phase-correction in synchronization: predictions, parameter estimation, and simulations ⋮ Equivalence classes of functions of finite Markov chains ⋮ Statistical methods for absorbing Markov-chain models for learning: Estimation and identification ⋮ A variation on the minimum chi-square test ⋮ Paired-associate learning with short-term retention: Mathematical analysis and data regarding identification of parameters ⋮ Probability learning with noncontingent success ⋮ Statistical methods for a general theory of all-or-none learning ⋮ Reinforcement-test intervals in paired-associate learning ⋮ A theoretical and empirical comparison of the all-or-none multilevel theory and the mixed model ⋮ An analysis of some conditions for representing \(N\) state Markov processes as general all or none models ⋮ Stochastic processes and the Guttman simplex ⋮ Matrix analysis of identifiability of some finite Markov models ⋮ A quantitative theory of the concept identification processes in the Hull paradigm ⋮ Identifiability of a class of theories with states not directly observed over trials ⋮ An identifiable model of two-stage learning
Cites Work
This page was built for publication: Markovian processes with identifiable states: General considerations and application to all-or-none learning
