An Efficient Algorithm for Convex Biclustering
We consider biclustering that clusters both samples and features and propose efficient convex biclustering procedures. The convex biclustering algorithm (COBRA) procedure solves twice the standard convex clustering problem that contains a non-differentiable function optimization. We instead convert...
| Published in: | Mathematics |
|---|---|
| Main Authors: | , |
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2021-11-01
|
| Subjects: | |
| Online Access: | https://www.mdpi.com/2227-7390/9/23/3021 |