Skip to content
EntityQ2976575· pop 5· linked from 15 articles

Biclustering

Sign in to save

Also known as co-clustering

Biclustering, block clustering,

Wikidata facts

Subclass of
cluster analysis
Sources (3)

via Wikidata · CC0

~15 min read

Encyclopedic overview

8 sections
Contents
  • Development
  • Complexity
  • Types of Biclusters
  • Algorithms
  • See also
  • References
  • Others
  • External links

Biclustering, block clustering, co-clustering or two-mode clustering is a data mining technique which allows simultaneous clustering of the rows and columns of a matrix. The term was first introduced by Boris Mirkin to name a technique introduced many years earlier, in 1972, by John A. Hartigan.

Given a set of m samples represented by an n-dimensional feature vector, the entire dataset can be represented as m rows in n columns (i.e., an m \times n matrix). The Biclustering algorithm generates Biclusters. A Bicluster is a subset of rows which exhibit similar behavior across a subset of columns, or vice versa.

Excerpted from Wikipedia’s “Biclustering” article, available under the CC BY-SA 4.0 licence.

Available in 5 languages

via Wikidata sitelinks · CC0