论文信息 - Approximate Bicluster and Tricluster Boxes in the Analysis of Binary Data

Approximate Bicluster and Tricluster Boxes in the Analysis of Binary Data

A disjunctive model of box bicluster and tricluster analysis is considered. A least-squares locally-optimal one cluster method is proposed, oriented towards the analysis of binary data. The method involves a parameter, the scale shift, and is proven to lead to "contrast" box biand tri-clusters. An experimental study of the method is reported.

Boris G. Mirkin | Andrey V. Kramarenko | B. Mirkin | A. Kramarenko

[1] Arlindo L. Oliveira,et al. Biclustering algorithms for biological data analysis: a survey , 2004, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[2] John A. Hartigan,et al. Clustering Algorithms , 1975 .

[3] Robert M. Haralick,et al. Towards a Formal Concept Analysis Approach to Exploring Communities on the World Wide Web , 2005, ICFCA.

[4] Boris Mirkin,et al. Mathematical Classification and Clustering , 1996 .

[5] J. Hartigan. Direct Clustering of a Data Matrix , 1972 .

[6] L. Hubert,et al. Additive two-mode clustering: The error-variance approach revisited , 1995 .

[7] Ruggero G. Pensa,et al. Towards Fault-Tolerant Formal Concept Analysis , 2005, AI*IA.

[8] Lothar Thiele,et al. A systematic comparison and evaluation of biclustering methods for gene expression data , 2006, Bioinform..

[9] Bernhard Ganter,et al. Formal Concept Analysis: Mathematical Foundations , 1998 .