Recent Advances in Biological Psychiatry 1966
DOI: 10.1007/978-1-4899-7313-9_36
|View full text |Cite
|
Sign up to set email alerts
|

Computer Simulation of Sleep EEG Patterns with a Markov Chain Model

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
20
0
1

Year Published

1977
1977
2018
2018

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 18 publications
(22 citation statements)
references
References 6 publications
0
20
0
1
Order By: Relevance
“…This would be an interesting topic for future research. With regard to model structure, the choice of HMMs was motivated by the fact that sleep dynamics are reasonably well-represented by Markov chain models (Zung et al 1966), and the HMM’s key parameters, the transition probabilities, convey information about the dynamics and stability of the underlying states. It is possible that other more powerful machine learning techniques may provide interesting insights into piezo signal dynamics in relation to overt and subtle behaviors.…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…This would be an interesting topic for future research. With regard to model structure, the choice of HMMs was motivated by the fact that sleep dynamics are reasonably well-represented by Markov chain models (Zung et al 1966), and the HMM’s key parameters, the transition probabilities, convey information about the dynamics and stability of the underlying states. It is possible that other more powerful machine learning techniques may provide interesting insights into piezo signal dynamics in relation to overt and subtle behaviors.…”
Section: Discussionmentioning
confidence: 99%
“…In keeping with the polyphasic nature of their activity cycles, mice spent variable amounts of time in each of the three states described above, and made rapid transitions between them at irregular intervals. The seemingly random nature of these transitions between discrete states suggested that their dynamics could be modeled as a Markov chain (Zung et al 1966), in which a system occupies one of many discrete states at any instant but makes random transitions to other states in a manner determined only by the current state (the Markov property). A Markov chain in which the true state is concealed but characterized by observations whose probability distribution is conditioned on the state is known as a hidden Markov model or HMM.…”
Section: Methodsmentioning
confidence: 99%
“…The HMM is one such modeling technique that maps continuous observations onto discrete hidden states [15]. Early statistical models of sleep dynamics used Markov chain models to represent probabilistic transitions between stages of sleep extracted from expert-scored hypnograms [28]. These models have become more refined and are being used to characterize disordered sleep and the effect of medication [29, 30].…”
Section: Discussionmentioning
confidence: 99%
“…[26][27][28][29] Approaches ranged from simply calculating average transition probabilities over constant periods of the night 29 to complex mixed effects models. 26 Yassouridis and others 30 (Figure 2A), transition probabilities to wake, S2, and REM are higher and transition probabilities to S1, S3, and S4 are lower.…”
Section: Discussionmentioning
confidence: 99%
“…All data were integrated into a single model, as opposed to approaches where several models were built for this purpose (e.g., Karlsson and others 26 ). In addition, it was not necessary to divide the sleep period time into segments with constant transition probabilities (e.g., Zung and others 29 and Kemp and Kamphuisen 27 ). In autoregressive models, realizations of past and present states are explicitly used to predict future states.…”
Section: Discussionmentioning
confidence: 99%