Co-clustering Task: Difference between revisions
Jump to navigation
Jump to search
m (Text replacement - "<ref name=[\w\s\.\"\,\[\]]{1,10}>[\w\s\.\"\,\[\]]{1,20}<\/ref>" to " ") |
m (Text replacement - "<ref name=[\w\d\:\s\"]{1,26}\/>" to " ") |
||
| Line 12: | Line 12: | ||
=== 2015 === | === 2015 === | ||
* (Wikipedia, 2015) ⇒ http://en.wikipedia.org/wiki/biclustering Retrieved:2015-11-8. | * (Wikipedia, 2015) ⇒ http://en.wikipedia.org/wiki/biclustering Retrieved:2015-11-8. | ||
** '''Biclustering</B>, '''block clustering</B>, <B>co-clustering</B>, or '''two-[[mode (statistics)|mode]] clustering</B> is a [[data mining technique]] which allows simultaneous [[cluster analysis|clustering]] of the rows and columns of a [[matrix (mathematics)|matrix]]. The term was first introduced by Mirkin, although the technique was originally introduced much earlier | ** '''Biclustering</B>, '''block clustering</B>, <B>co-clustering</B>, or '''two-[[mode (statistics)|mode]] clustering</B> is a [[data mining technique]] which allows simultaneous [[cluster analysis|clustering]] of the rows and columns of a [[matrix (mathematics)|matrix]]. The term was first introduced by Mirkin, although the technique was originally introduced much earlier (i.e., by J.A. Hartigan ). <P> Given a set of <math> m </math> rows in <math> n </math> columns (i.e., an <math> 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. | ||
<references/> | <references/> | ||
Latest revision as of 22:37, 13 January 2022
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 ).