2018
DOI: 10.1007/978-3-319-95420-2_12
|View full text |Cite
|
Sign up to set email alerts
|

Markovian-Based Clustering of Internet Addiction Trajectories

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
6
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
3
2

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(6 citation statements)
references
References 27 publications
0
6
0
Order By: Relevance
“…Five papers address alternatives to the classical 'compute dissimilarities-partition the set of sequences' approach. These alternatives include feature-based and fuzzy clustering (Studer 2018) and non-dissimilarity-based methods such as those based on network representations of sequences (Cornwell 2018;Hamberger 2018), and Markov-based models (Helske et al 2018;Taushanov and Berchtold 2018). Alongside the two general papers (Courgeau 2018;Eerola 2018) in Part I, five papers demonstrate the benefit of combining SA with other methods to grasp the dynamics that drive the trajectories.…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…Five papers address alternatives to the classical 'compute dissimilarities-partition the set of sequences' approach. These alternatives include feature-based and fuzzy clustering (Studer 2018) and non-dissimilarity-based methods such as those based on network representations of sequences (Cornwell 2018;Hamberger 2018), and Markov-based models (Helske et al 2018;Taushanov and Berchtold 2018). Alongside the two general papers (Courgeau 2018;Eerola 2018) in Part I, five papers demonstrate the benefit of combining SA with other methods to grasp the dynamics that drive the trajectories.…”
Section: Resultsmentioning
confidence: 99%
“…Part V includes three chapters that present advances in the original task of SA, namely the clustering of sequences. The chapter by Taushanov and Berchtold (2018) proposes clustering sequences of continuous data by means of a Markov-based mixture model-the hidden mixture transition distribution (HMTD) model-and applying their method to Swiss data obtained from the internet addiction test (IAT). The clustering is achieved by setting the transition matrix of the hidden states as the identity matrix, which makes their model a mixture of Gaussian distributions.…”
Section: Directions For the Future: The Chapters Of This Bookmentioning
confidence: 99%
“…In a longitudinal study conducted by Taushanov and Berchtold (2018), Swiss youth (N = 185) were clustered along their level of emotional well-being, body mass index, gender, and education track. The Markovian-based hidden mixture transition distribution (HMTD) model yielded four groups: 'group 1′ with average volatility and PIU level, 'group 2′ with relatively low scores and variability, 'group 3′ with very low variability and a constantly diminishing PIU score, and 'group 4′ with more complex trajectories and variability.…”
Section: Youth Clusters By Problematic Usementioning
confidence: 99%
“…The Growth Mixture Model (GMM) model has become a reference in the continuous longitudinal data modeling, with various applications in criminology [13], health and medicine [14,15], psychology and social sciences [16][17][18], among others (see [19]). The GMM [14,20] is a model designed to discover and describe the unknown groups of sequences that share a similar pattern.…”
Section: Growth Models and The Growth Mixture Model (Gmm)mentioning
confidence: 99%