Journal ArticleDOI
Cluster Differences Unfolding for Two-Way Two-Mode Preference Rating Data
Reads0
Chats0
TLDR
An alternating least squares procedure is proposed, in which the individuals and the objects are partitioned into clusters, while at the same time the cluster centers are represented by unfolding.Abstract:
Classification and spatial methods can be used in conjunction to represent the individual information of similar preferences by means of groups. In the context of latent class models and using Simulated Annealing, the cluster-unfolding model for two-way two-mode preference rating data has been shown to be superior to a two-step approach of first deriving the clusters and then unfolding the classes. However, the high computational cost makes the procedure only suitable for small or medium-sized data sets, and the hypothesis of independent and normally distributed preference data may also be too restrictive in many practical situations. Therefore, an alternating least squares procedure is proposed, in which the individuals and the objects are partitioned into clusters, while at the same time the cluster centers are represented by unfolding. An enhanced Simulated Annealing algorithm in the least squares framework is also proposed in order to address the local optimum problem. Real and artificial data sets are analyzed to illustrate the performance of the model.read more
Citations
More filters
Journal ArticleDOI
Variance-Based Cluster Selection Criteria in a K-Means Framework for One-Mode Dissimilarity Data
J. Fernando Vera,Rodrigo Macías +1 more
TL;DR: This paper addresses the formulation of criteria to determine the number of clusters, in the general situation in which the available information for clustering is a one-mode $$N\times N$$N×N dissimilarity matrix describing the objects.
Journal ArticleDOI
A distribution-free soft-clustering method for preference rankings
TL;DR: This work uses the flexible class of methods proposed by Ben-Israel and Iyigun, which consists in a probabilistic distance clustering approach, and defines the disparity between a ranking and the center of a cluster as the Kemeny distance.
Journal ArticleDOI
A latent class distance association model for cross-classified data with a categorical response variable.
TL;DR: A latent class distance association model for clustering in the predictor space of large contingency tables with a categorical response variable is proposed and an empirical example highlighting the advantages of the new approach and comparing it with traditional approaches is presented.
Journal ArticleDOI
On the Behaviour of K -Means Clustering of a Dissimilarity Matrix by Means of Full Multidimensional Scaling
J. Fernando Vera,Rodrigo Macías +1 more
TL;DR: In this paper, the authors analyzed the usefulness of multidimensional scaling in relation to performing K-means clustering on a dissimilarity matrix, when the dimensionality of the objects is unknown.
Journal ArticleDOI
A Latent Block Distance-Association Model for Profile by Profile Cross-Classified Categorical Data.
J. Fernando Vera,Mark de Rooij +1 more
TL;DR: A latent block distance-association model is proposed to apply block clustering to the outcomes of two categorical variables while the cluster centers are represented in a low dimensional space in terms of a distance-Association model.
References
More filters
Journal ArticleDOI
Equation of state calculations by fast computing machines
TL;DR: In this article, a modified Monte Carlo integration over configuration space is used to investigate the properties of a two-dimensional rigid-sphere system with a set of interacting individual molecules, and the results are compared to free volume equations of state and a four-term virial coefficient expansion.
Book
Cluster Analysis
TL;DR: This fourth edition of the highly successful Cluster Analysis represents a thorough revision of the third edition and covers new and developing areas such as classification likelihood and neural networks for clustering.
Journal ArticleDOI
A dendrite method for cluster analysis
Tadeusz Caliński,Harabasz J +1 more
TL;DR: A method for identifying clusters of points in a multidimensional Euclidean space is described and its application to taxonomy considered and an informal indicator of the "best number" of clusters is suggested.
Journal ArticleDOI
An examination of procedures for determining the number of clusters in a data set
TL;DR: A Monte Carlo evaluation of 30 procedures for determining the number of clusters was conducted on artificial data sets which contained either 2, 3, 4, or 5 distinct nonoverlapping clusters to provide a variety of clustering solutions.
Journal ArticleDOI
Modern Multidimensional Scaling: Theory and Applications
TL;DR: The four Purposes of Multidimensional Scaling, Special Solutions, Degeneracies, and Local Minima, and Avoiding Trivial Solutions in Unfolding are explained.
Related Papers (5)
How Many Clusters? Which Clustering Method? Answers Via Model-Based Cluster Analysis
Chris Fraley,Adrian E. Raftery +1 more