-
So if K-means is apparently poor at clustering non-convex sets, are there any other algorithms that work well for non-convex problems or any modifications that can be made to K-means to improve its re…
-
Right now the K-means clustering method is used to find K distinct colors from the album artwork. This method has its flaws, more specifically:
- Need to know K (how many distinct colors the image ha…
-
Visualize trajectories over time for the existing datasets using PCA.
* for now the script works with \ + \
-
Hi @talgalili,
Is it possible to combine heatmaply with plotly animations (https://plot.ly/r/animations/)? I.e., could we supply a series of same-size matrices and transition between them using th…
-
Looking at Visumap, the majority of those algorithms are found in scikit-learn or scikit-bio, namely
**Ordination**
- [SMACOF](https://github.com/scikit-learn/scikit-learn/blob/master/sklearn/manifol…
-
We should add some benchmarks indicating the advantages of convex (bi)clustering over classical methods. Depending on the run-time, these can be a vignette or just included as a "run for yourself" fil…
-
#### Describe the workflow you want to enable
According to https://scikit-learn.org/stable/modules/clustering.html#silhouette-coefficient
> The Silhouette Coefficient is generally higher for conve…
-
`
library(cvxclustr)
library(scvxclustr)
library(gglasso)
###Generate a simple data matrix used for clustering, of which the rows are samples and the ###columns are variables. Here we produc…
-
This outlines a roadmap for basic statistical functionality that Julia needs to offer. It is heavily drawn from the table of contents for MASS.
- [ ] Data processing [DataFrames.jl](https://github.com…
-
In various projects where I used VisJS, I often had the need to implement a node clustering feature based on the groups. I'm not talking about the already implemented clustering feature where one node…