Abstract

To discover psychiatric subtypes, researchers are adopting a method called community detection. This method was not subjected to the same scrutiny in the psychiatric literature as traditional clustering methods. Furthermore, many community detection algorithms have been developed without psychiatric sample sizes and variable numbers in mind. We aim to provide clarity to researchers on the utility of this method. We provide an introduction to community detection algorithms, specifically describing the crucial differences between correlation-based and distance-based community detection. We compare community detection results to results of traditional methods in a simulation study representing typical psychiatry settings, using three conceptualizations of how subtypes might differ. We discovered that the number of recovered subgroups was often incorrect with several community detection algorithms. Correlation-based community detection fared better than distance-based community detection, and performed relatively well with smaller sample sizes. Latent profile analysis was more consistent in recovering subtypes. Whether methods were successful depended on how differences were introduced. Traditional methods like latent profile analysis remain reasonable choices. Furthermore, results depend on assumptions and theoretical choices underlying subtyping analyses, which researchers need to consider before drawing conclusions on subtypes. Employing multiple subtyping methods to establish method dependency is recommended.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call