Starting from an extension of standard K-means for simultaneously clustering observations and features, namely Double K-Means (DKM) (Vichi, 2001), the model is developed in a probabilistic framework with a robustification necessary to take into account a certain amount of outlying observations assumed included in the data, that generally lead to unsatisfactory clustering results. An efficient algorithm is proposed and the advantages of using this approach are discussed. Key Words: Two-mode clustering, double k-means, disjoint principal component analysis, robustness. 1
A unified theory is presented to assess the robustness of general clustering methods (GCM), i.e., me...
In this paper we present a new algorithm for parameter-free clustering by mode seeking. Mode seeking...
Two-mode partitioning is a relatively new form of clustering that clusters both rows and columns of ...
Two-mode clustering consists in simultaneously clustering modes (e.g., objects, variables) of an obs...
k-means algorithm is a popular data clustering algorithm. k-means clustering aims to partition n obs...
Recently, Chaturvedi, Green and Carroll (2001) presented a nonparametric approach to deriving cluste...
Cluster or co-cluster analyses are important tools in a variety of scientific areas. The introductio...
We propose two algorithms for robust two-mode partitioning of a data matrix in the presence of outli...
textabstractTwo-mode clustering is a relatively new form of clustering that clusters both rows and ...
In this paper we present a structured overview of methods for two-mode clustering, that is, methods ...
peer reviewedIn this paper methods to cluster analyze two-mode data are discussed which assume that...
A general method for two-mode simultaneous reduction of observation units and variables of a data ma...
Most classical approaches for two-mode clustering of a data matrix are designed to attain homogeneou...
A new clustering approach based on mode identification is developed by applying new optimization tec...
We introduce a robust k-means-based clustering method for high-dimensional data where not only outli...
A unified theory is presented to assess the robustness of general clustering methods (GCM), i.e., me...
In this paper we present a new algorithm for parameter-free clustering by mode seeking. Mode seeking...
Two-mode partitioning is a relatively new form of clustering that clusters both rows and columns of ...
Two-mode clustering consists in simultaneously clustering modes (e.g., objects, variables) of an obs...
k-means algorithm is a popular data clustering algorithm. k-means clustering aims to partition n obs...
Recently, Chaturvedi, Green and Carroll (2001) presented a nonparametric approach to deriving cluste...
Cluster or co-cluster analyses are important tools in a variety of scientific areas. The introductio...
We propose two algorithms for robust two-mode partitioning of a data matrix in the presence of outli...
textabstractTwo-mode clustering is a relatively new form of clustering that clusters both rows and ...
In this paper we present a structured overview of methods for two-mode clustering, that is, methods ...
peer reviewedIn this paper methods to cluster analyze two-mode data are discussed which assume that...
A general method for two-mode simultaneous reduction of observation units and variables of a data ma...
Most classical approaches for two-mode clustering of a data matrix are designed to attain homogeneou...
A new clustering approach based on mode identification is developed by applying new optimization tec...
We introduce a robust k-means-based clustering method for high-dimensional data where not only outli...
A unified theory is presented to assess the robustness of general clustering methods (GCM), i.e., me...
In this paper we present a new algorithm for parameter-free clustering by mode seeking. Mode seeking...
Two-mode partitioning is a relatively new form of clustering that clusters both rows and columns of ...