Research map / Learning theory and algorithms / Optimal transport
Efficient and Effective Optimal Transport-Based Biclustering
Chakib Fettal, lazhar labiod, Mohamed Nadif
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| BCOT instead of k-Means | document clustering · ACM | clustering accuracy: 51.1±11.3 -> 76.6±1.5 | Improved |
| BCOT instead of COOT* | document clustering · ACM | clustering accuracy: 39.0±0.0 -> 76.6±1.5 | Improved |
| BCOT instead of k-Means | document clustering · Wiki | clustering accuracy: 26.0±6.1 -> 49.8±1.5 | Improved |
| BCOT instead of k-Means | document clustering · PubMed | clustering accuracy: 52.3±4.7 -> 53.6±4.5 | Improved |
| entropic regularization (BCOT-lambda) instead of exact BCOT (ablation) | BCOT · ACM | clustering accuracy: 76.6±1.5 -> 76.2±0.6 | No clear effect |
| entropic regularization (BCOT-lambda) instead of exact BCOT (ablation) | BCOT · PubMed | clustering accuracy: 53.6±4.5 -> 56.5±3.1 | Improved |
| entropic regularization (BCOT-lambda) instead of exact BCOT (ablation) | BCOT · DBLP | clustering accuracy: 61.5±6.2 -> 59.4±9.9 | Hurt |
| entropic regularization (BCOT-lambda) instead of exact BCOT (ablation) | BCOT · 20 Newsgroups | average run time: BCOT x4.5 slower | Improved |
| entropic regularization (BCOT-lambda) instead of exact BCOT (ablation) | BCOT · Ohscal | average run time: BCOT x4.1 slower | Improved |
| BCOT instead of CCOT | document clustering · 20 Newsgroups | run time: CCOT x464.9 | Improved |
| BCOT instead of COOT (exact) for term clustering | term clustering · Ng20 | PMI coherence: 0.43±0.02 -> 0.79±0.01 | Improved |
| BCOTλ instead of BCOT for term clustering (ablation) | BCOT · Ng20 | PMI coherence: 0.79±0.01 -> 0.27±0.01 | Hurt |
Closest papers by meaning
- Low-Rank Optimal Transport through Factor Relaxation with Latent Coupling (NeurIPS 2024 · similarity 0.85)
- Double-Bounded Optimal Transport for Advanced Clustering and Classification (AAAI 2024 · similarity 0.85)
- Online Sparsification of Bipartite-Like Clusters in Graphs (ICML 2025 · similarity 0.85)
- Hierarchical Refinement: Optimal Transport to Infinity and Beyond (ICML 2025 · similarity 0.85)
- An Optimal Transport View for Subspace Clustering and Spectral Clustering (AAAI 2024 · similarity 0.85)
- Hierarchical Overlapping Clustering on Graphs: Cost Function, Algorithm and Scalability (ICML 2025 · similarity 0.84)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
