Doug Steinley

Prof. Dr. Doug Steinley

Department of Psychological Sciences, University of Missouri, Columbia, 210 McAlester Hall, Columbia, MO 65211, USA

Research Focus & Metrics

Academic Career Length

22Years (2005-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 May 2006 in British Journal of Mathematical and Statistical Psychology
Verified
Journal Article
Closed access
PDF file
DSDoug Steinley
Doug Steinley

1 March 2011 in Psychological Methods
Verified
Journal Article
Closed access
DSDoug Steinley
Doug Steinley
MBMichael J. Brusco
Michael J. Brusco
This article provides a large-scale investigation into several of the properties of mixture-model clustering techniques (also referred to as latent class cluster analysis, latent profile analysis, model-based clustering, probabilistic clustering, Bayesian classification, unsupervised learning, and finite mixture models; see Vermunt & Magdison, 2002). Focus is given to the multivariate normal distribution, and 9 separate decompositions (i.e., class structures) of the covariance matrix are investigated. To provide a link to the current literature, comparisons are made with K-means clustering in 3 detailed Monte Carlo studies. The findings have implications for applied researchers in that mixture-model clustering techniques performed best when the covariance structure and number of clusters were known. However, as the information about the shape and number of clusters became unknown, degraded performance was observed for both K-means clustering and mixture-model clustering.

1 March 2008 in Psychometrika
Verified
Journal Article
Closed access
PDF file
DSDoug Steinley
Doug Steinley
MBMichael J. Brusco
Michael J. Brusco
Eight different variable selection techniques for model-based and non-model-based clustering are evaluated across a wide range of cluster structures. It is shown that several methods have difficulties when non-informative variables (i.e., random noise) are included in the model. Furthermore, the distribution of the random noise greatly impacts the performance of nearly all of the variable selection procedures. Overall, a variable selection technique based on a variance-to-range weighting procedure coupled with the largest decreases in within-cluster sums of squares error performed the best. On the other hand, variable selection methods used in conjunction with finite mixture models performed the worst.

1 January 2011 in Psychological Methods
Verified
Journal Article
Closed access
DSDoug Steinley
Doug Steinley
MBMichael J. Brusco
Michael J. Brusco
Steinley (2007) provided a lower bound for the sum-of-squares error criterion function used in K-means clustering. In this article, on the basis of the lower bound, the authors propose a method to distinguish between 1 cluster (i.e., a single distribution) versus more than 1 cluster. Additionally, conditional on indicating there are multiple clusters, the procedure is extended to determine the number of clusters. Through a series of simulations, the proposed methodology is shown to outperform several other commonly used procedures for determining both the presence of clusters and their number.

1 July 2015 in Social Networks
Verified
Journal Article
Closed access
MHMichaela Hoffman
Michaela Hoffman
DSDoug Steinley
Doug Steinley
MBMichael J. Brusco
Michael J. Brusco

1 January 2006 in Psychological Methods
Verified
Journal Article
Closed access
DSDoug Steinley
Doug Steinley
Using the cluster generation procedure proposed by D. Steinley and R. Henson (2005), the author investigated the performance of K-means clustering under the following scenarios: (a) different probabilities of cluster overlap; (b) different types of cluster overlap; (c) varying samples sizes, clusters, and dimensions; (d) different multivariate distributions of clusters; and (e) various multidimensional data structures. The results are evaluated in terms of the Hubert-Arabie adjusted Rand index, and several observations concerning the performance of K-means clustering are made. Finally, the article concludes with the proposal of a diagnostic technique indicating when the partitioning given by a K-means cluster analysis can be trusted. By combining the information from several observable characteristics of the data (number of clusters, number of variables, sample size, etc.) with the prevalence of unique local optima in several thousand implementations of the K-means algorithm, the author provides a method capable of guiding key data-analysis decisions.