We present a novel method, REMAXINT, that captures the gist of two-way interaction in row by column (i.e., two-mode) data, with one observation per cell. REMAXINTis a probabilistic two-mode clustering model that yields two-mode partitions with maximal interaction between row and column clusters. For estimation of the parameters of REMAXINT, we maximize a conditional classification likelihood in which the random row (or column) main effects are conditioned out. For testing the null hypothesis of no interaction between row and column clusters, we propose a max - F test statistic and discuss its properties. We develop a Monte Carlo approach to obtain its sampling distribution under the null hypothesis. We evaluate the performance of the method...
In 2009, Yu et al. proposed a multimodal probability model (MPM) for clustering. This paper makes ad...
International audienceThree-way data can be seen as a collection of two-way matrices, as we can meet...
We revisit recently proposed algorithms for probabilistic clustering with pair-wise constraints betw...
We present a novel method, REMAXINT, that captures the gist of two-way interaction in row by column ...
We present a novel method, REMAXINT, that captures the gist of two-way interaction in row by column ...
In this paper, we present E-ReMI, a new method for studying two-way interaction in row by column (i....
Most classical approaches for two-mode clustering of a data matrix are designed to attain homogeneou...
We consider the problem of simultaneously and optimally clustering the rows and columns of a real-va...
In this paper we present a structured overview of methods for two-mode clustering, that is, methods ...
Starting from an extension of standard K-means for simultaneously clustering observations and featur...
A new clustering approach based on mode identification is developed by applying new optimization tec...
peer reviewedIn this paper, a Monte Carlo study on the performance of two–mode cluster methods is p...
We deal with two-way contingency tables having ordered column categories.We use a row effects model ...
Thesis (Ph.D.)--University of Washington, 2020In this dissertation, we develop new methods for stati...
Cluster or co-cluster analyses are important tools in a variety of scientific areas. The introductio...
In 2009, Yu et al. proposed a multimodal probability model (MPM) for clustering. This paper makes ad...
International audienceThree-way data can be seen as a collection of two-way matrices, as we can meet...
We revisit recently proposed algorithms for probabilistic clustering with pair-wise constraints betw...
We present a novel method, REMAXINT, that captures the gist of two-way interaction in row by column ...
We present a novel method, REMAXINT, that captures the gist of two-way interaction in row by column ...
In this paper, we present E-ReMI, a new method for studying two-way interaction in row by column (i....
Most classical approaches for two-mode clustering of a data matrix are designed to attain homogeneou...
We consider the problem of simultaneously and optimally clustering the rows and columns of a real-va...
In this paper we present a structured overview of methods for two-mode clustering, that is, methods ...
Starting from an extension of standard K-means for simultaneously clustering observations and featur...
A new clustering approach based on mode identification is developed by applying new optimization tec...
peer reviewedIn this paper, a Monte Carlo study on the performance of two–mode cluster methods is p...
We deal with two-way contingency tables having ordered column categories.We use a row effects model ...
Thesis (Ph.D.)--University of Washington, 2020In this dissertation, we develop new methods for stati...
Cluster or co-cluster analyses are important tools in a variety of scientific areas. The introductio...
In 2009, Yu et al. proposed a multimodal probability model (MPM) for clustering. This paper makes ad...
International audienceThree-way data can be seen as a collection of two-way matrices, as we can meet...
We revisit recently proposed algorithms for probabilistic clustering with pair-wise constraints betw...