Approximate bicluster and tricluster boxes in the analysis of binary data

Mirkin, Boris and Kramarenko, A.V. (2011) Approximate bicluster and tricluster boxes in the analysis of binary data. In: Kuznetsov, S.O. and Ślęzak, D. and Hepting, D.H. and Mirkin, Boris (eds.) Rough Sets, Fuzzy Sets, Data Mining and Granular Computing. Berlin, Germany: Springer Verlag, pp. 248-256. ISBN 9783642218811.

Full text not available from this repository.

Official URL: http://dx.doi.org/10.1007/978-3-642-21881-1_40

Abstract

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 bi- and tri-clusters. An experimental study of the method is reported.

Metadata

Item Type:	Book Section
Keyword(s) / Subject(s):	box, bicluster, tricluster
School:	School of Business, Economics & Informatics > Computer Science and Information Systems
Research Centres and Institutes:	Structural Molecular Biology, Institute of (ISMB)
Depositing User:	Sarah Hall
Date Deposited:	26 Jul 2013 08:30
Last Modified:	06 Dec 2016 10:33
URI:	https://eprints.bbk.ac.uk/id/eprint/7826

Statistics

Archive Staff Only (login required)

Edit/View Item