Search

Deterministic blockmodelling is a well‐established clustering method for both exploratory and confirmatory social network analysis seeking partitions of a set of actors so that actors within each cluster are similar with respect to their patterns of ties to other actors (or, in some cases, other objects when considering two‐mode networks). Even though some of the historical foundations for certain types of blockmodelling stem from the psychological literature, applications of deterministic blockmodelling in psychological research are relatively rare. This scarcity is potentially attributable to three factors: a general unfamiliarity with relevant blockmodelling methods and applications; a lack of awareness of the value of partitioning network data for understanding group structures and processes; and the unavailability of such methods on software platforms familiar to most psychological researchers. To tackle the first two items, we provide a tutorial presenting a general framework for blockmodelling and describe two of the most important types of deterministic blockmodelling applications relevant to psychological research: structural balance partitioning and two‐mode partitioning based on structural equivalence. To address the third problem, we developed a suite of software programs that are available as both Fortran executable files and compiled Fortran dynamic‐link libraries that can be implemented in the R software system. We demonstrate these software programs using networks from the literature. [ABSTRACT FROM AUTHOR]

Using complete enumeration (e.g., generating all possible subsets of item combinations) to evaluate clustering problems has the benefit of locating globally optimal solutions automatically without the concern of sampling variability. The proposed method is meant to combine clustering variables in such a way as to create groups that are maximally different on a theoretically sound derivation variable(s). After the population of all unique sets is permuted, optimization on some predefined, user-specific function can occur. We apply this technique to optimizing the diagnosis of Alcohol Use Disorder. This is a unique application, from a clustering point of view, in that the decision rule for clustering observations into the "diagnosis" group relies on both the set of items being considered and a predefined threshold on the number of items required to be endorsed for the "diagnosis" to occur. In optimizing diagnostic rules, criteria set sizes can be reduced without a loss of significant information when compared to current and proposed, alternative, diagnostic schemes. [ABSTRACT FROM AUTHOR]

Most partitioning methods used in psychological research seek to produce homogeneous groups (i.e., groups with low intra‐group dissimilarity). However, there are also applications where the goal is to provide heterogeneous groups (i.e., groups with high intra‐group dissimilarity). Examples of these anticlustering contexts include construction of stimulus sets, formation of student groups, assignment of employees to project work teams, and assembly of test forms from a bank of items. Unfortunately, most commercial software packages are not equipped to accommodate the objective criteria and constraints that commonly arise for anticlustering problems. Two important objective criteria for anticlustering based on information in a dissimilarity matrix are: a diversity measure based on within‐cluster sums of dissimilarities; and a dispersion measure based on the within‐cluster minimum dissimilarities. In many instances, it is possible to find a partition that provides a large improvement in one of these two criteria with little (or no) sacrifice in the other criterion. For this reason, it is of significant value to explore the trade‐offs that arise between these two criteria. Accordingly, the key contribution of this paper is the formulation of a bicriterion optimization problem for anticlustering based on the diversity and dispersion criteria, along with heuristics to approximate the Pareto efficient set of partitions. A motivating example and computational study are provided within the framework of test assembly. [ABSTRACT FROM AUTHOR]

Alcohol consumption is an important predictor of a variety of negative outcomes. There is an extensive literature that examines the differences in the estimated level of alcohol consumption between types of assessments (e.g., quantity–frequency [QF] questionnaires, daily diaries). However, it is typically assumed that all QF-based measures are nearly identical in their assessment of the volume of alcohol consumption in a population. Using timeline follow-back data and constructing common QF consumption measures, we examined differences among survey instruments to assess alcohol consumption and heavy drinking. Using three data sets, including clinical to community samples, we demonstrate how scale-specific item characteristics (i.e., number of response options and ranges of consumption assessed by each option) can substantially affect the estimated mean level of consumption and estimated prevalence of binge drinking. Our analyses suggest that problems can be mitigated by employing more resolved measures of quantity and frequency in consumption questionnaires. [ABSTRACT FROM AUTHOR]

K-means inverse regression was developed as an easy-to-use dimension reduction procedure for multivariate regression. This approach is similar to the original sliced inverse regression method, with the exception that the slices are explicitly produced by a K-means clustering of the response vectors. In this article, we propose K-medoids clustering as an alternative clustering approach for slicing and compare its performance to K-means in a simulation study. Although the two methods often produce comparable results, K-medoids tends to yield better performance in the presence of outliers. In addition to isolation of outliers, K-medoids clustering also has the advantage of accommodating a broader range of dissimilarity measures, which could prove useful in other graphical regression applications where slicing is required. [ABSTRACT FROM AUTHOR]

We present a procedure (RAUS) for residual analysis of a dissimilarity matrix whereby unidimensional scaling is successively applied to the absolute value of residuals. A key advantage of RAUS is that the efficient Defays formulation of unidimensional scaling can be used for the fitting of each scale. An example using U.S. Supreme Court voting data is provided to illustrate the interpretation of successive scales. A simulation study was performed to evaluate RAUS. [ABSTRACT FROM AUTHOR]

We propose a hybrid two-group classification method that integrates linear discriminant analysis, a polynomial expansion of the basis (or variable space), and a genetic algorithm with multiple crossover operations to select variables from the expanded basis. Using new product launch data from the biochemical industry, we found that the proposed algorithm offers mean percentage decreases in the misclassification error rate of 50%, 56%, 59%, 77%, and 78% in comparison to a support vector machine, artificial neural network, quadratic discriminant analysis, linear discriminant analysis, and logistic regression, respectively. These improvements correspond to annual cost savings of $4.40–$25.73 million. [ABSTRACT FROM AUTHOR]

Affinity propagation is a message‐passing‐based clustering procedure that has received widespread attention in domains such as biological science, physics, and computer science. However, its implementation in psychology and related areas of social science is comparatively scant. In this paper, we describe the basic principles of affinity propagation, its relationship to other clustering problems, and the types of data for which it can be used for cluster analysis. More importantly, we identify the strengths and weaknesses of affinity propagation as a clustering tool in general and highlight potential opportunities for its use in psychological research. Numerical examples are provided to illustrate the method. [ABSTRACT FROM AUTHOR]

Two expectations of the adjusted Rand index (ARI) are compared. It is shown that the expectation derived by Morey and Agresti (1984, Educational and Psychological Measurement, 44, 33) under the multinomial distribution to approximate the exact expectation from the hypergeometric distribution (Hubert & Arabie, 1985, Journal of Classification, 2, 193) provides a poor approximation, and, in some cases, the difference between the two expectations can increase with the sample size. Proofs concerning the minimum and maximum difference between the two expectations are provided, and it is shown through simulation that the ARI can differ significantly depending on which expectation is used. Furthermore, when compared in a hypothesis testing framework, multinomial approximation overly favours the null hypothesis. [ABSTRACT FROM AUTHOR]

An introduction is presented in which the editor discusses various articles in the issue on topics including Bayesian techniques, support vector machine (SVM), and hierarchical clustering.

Abstract: We present a statistical methodology for clustering decision makers according to similar choice behavior. We apply a p‐median clustering algorithm that identifies an “exemplar” for each cluster, a decision maker who best represents that cluster. We demonstrate that information about group behavior can be inferred by examining the behavior of each cluster's exemplar. The method is exploratory, providing information about the prevalence of decision strategies without researchers needing to specify candidate strategies a priori. The method is also very general and can be applied to a wide range of decision‐making data structures. We illustrate our method by re‐analyzing two existing choice data sets. Copyright © 2016 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]