Načítá se...
Dynamic Visualization and Fast Computation for Convex Clustering via Algorithmic Regularization
Convex clustering is a promising new approach to the classical problem of clustering, combining strong performance in empirical studies with rigorous theoretical foundations. Despite these advantages, convex clustering has not been widely adopted, due to its computationally intensive nature and its...
Uloženo v:
| Vydáno v: | J Comput Graph Stat |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Artigo |
| Jazyk: | Inglês |
| Vydáno: |
2019
|
| Témata: | |
| On-line přístup: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7518335/ https://ncbi.nlm.nih.gov/pubmed/32982130 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1080/10618600.2019.1629943 |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo otaguje tento záznam!
|