Markovian-Based Clustering of Internet Addiction Trajectories

4Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The main aim of this paper is to describe the use of the Markovian-based Hidden Mixture Transition Distribution (HMTD) model for the clustering of longitudinal sequences of continuous data. We especially discuss the use of covariates to improve the clustering process. The HMTD is compared to the well-known Growth Mixture Model (GMM) that is considered here as a gold standard. Both models are applied to a sample of n = 185 adolescents, who are repeatedly evaluated for Internet overuse using the Internet Addiction Test (IAT). The best solution provided by the HMTD model has four groups and it uses five covariates. This solution is related to the subjects’ level of emotional well-being, body mass index, gender, and education track, but shows no relation with age. Compared to a GMM clustering, the HMTD solution provides highly interpretable results with quite equilibrate cluster size, while GMM tends to identify very small clusters allowing for less generalization.

Cite

CITATION STYLE

APA

Taushanov, Z., & Berchtold, A. (2018). Markovian-Based Clustering of Internet Addiction Trajectories. In Life Course Research and Social Policies (Vol. 10, pp. 203–222). Springer Science and Business Media B.V. https://doi.org/10.1007/978-3-319-95420-2_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free