arXiv (All)
open access
Fast unsupervised ground metric learning with tree-Wasserstein distance
The performance of unsupervised methods such as clustering depends on the choice of distance metric between features, or ground metric. Commonly, ground metrics are decided with heuristics or learned via supervised algorithms. However, since many interesting datasets are unlabelled, unsupervised gro
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Gromov-Wasserstein Quantization and Clustering: Structure, Rates, and Algorithms#444632
- Federated Deep Clustering Networks for High-Dimensional and Heterogeneous Data#1036218
- Federated Deep Clustering Networks for High-Dimensional and Heterogeneous Data#1006860
- FlatLands: Generative Floormap Completion From a Single Egocentric View#924059
- FlatLands: Generative Floormap Completion From a Single Egocentric View#919830
Record · ID 1156166
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive