Co-clustering Task
(Redirected from Co-clustering)
Jump to navigation
Jump to search
A Co-clustering Task is a Clustering Task that can produce/identify a biclique.
- AKA: Two-Sided Clustering, Biclustering.
- Context:
- It can be solved by a Co-clustering System (that implements a co-clustering algorithm).
- See: Hierarchical Clustering Task, Correlational Clustering, Mode (Statistics), Cluster Analysis.
References
2015
- (Wikipedia, 2015) ⇒ http://en.wikipedia.org/wiki/biclustering Retrieved:2015-11-8.
- 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 Mirkin, although the technique was originally introduced much earlier (i.e., by J.A. Hartigan ).
Given a set of [math]\displaystyle{ m }[/math] rows in [math]\displaystyle{ n }[/math] columns (i.e., an [math]\displaystyle{ m \times n }[/math] matrix), the biclustering algorithm generates biclusters – a subset of rows which exhibit similar behavior across a subset of columns, or vice versa.
- 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 Mirkin, although the technique was originally introduced much earlier (i.e., by J.A. Hartigan ).