Co-clustering by block value decomposition
- 21 August 2005
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 635-640
- https://doi.org/10.1145/1081870.1081949
Abstract
Dyadic data matrices, such as co-occurrence matrix, rating matrix, and proximity matrix, arise frequently in various important applications. A fundamental problem in dyadic data analysis is to find the hidden block structure of the data matrix. In this paper, we present a new co-clustering framework, block value decomposition(BVD), for dyadic data, which factorizes the dyadic data matrix into three components, the row-coefficient matrix R, the block value matrix B, and the column-coefficient matrix C. Under this framework, we focus on a special yet very popular case -- non-negative dyadic data, and propose a specific novel co-clustering algorithm that iteratively computes the three decomposition matrices based on the multiplicative updating rules. Extensive experimental evaluations also demonstrate the effectiveness and potential of this framework as well as the specific algorithms for co-clustering, and in particular, for discovering the hidden block structure in the dyadic data.Keywords
This publication has 11 references indexed in Scilit:
- A generalized maximum entropy approach to bregman co-clustering and matrix approximationPublished by Association for Computing Machinery (ACM) ,2004
- Minimum Sum-Squared Residue Co-clustering of Gene Expression DataPublished by Society for Industrial & Applied Mathematics (SIAM) ,2004
- Information-theoretic co-clusteringPublished by Association for Computing Machinery (ACM) ,2003
- Document clustering using word clusters via the information bottleneck methodPublished by Association for Computing Machinery (ACM) ,2000
- Normalized cuts and image segmentationIeee Transactions On Pattern Analysis and Machine Intelligence, 2000
- Learning the parts of objects by non-negative matrix factorizationNature, 1999
- NewsWeeder: Learning to Filter NetnewsPublished by Elsevier BV ,1995
- Spectral K-way ratio-cut partitioning and clusteringPublished by Association for Computing Machinery (ACM) ,1993
- Indexing by latent semantic analysisJournal of the American Society for Information Science, 1990
- Direct Clustering of a Data MatrixJournal of the American Statistical Association, 1972