-
*Original issue: https://charm.cs.illinois.edu/redmine/issues/1677*
---
The current topology-aware recursive-bisection partitioner (described in Phillips et al., SC14) was based on an algorithm desig…
-
-
Hi
I found this git and tried to run the cuda code.
Is algorithm called cuda-dclust algorithm?
I am doing some tasks related to dbscan on gpu this year. Can I ask some questions on how to running t…
-
The way its constructed now if you want to specify a maxClusterSize rather than a specific number of clusters then you must use BigGMr. This has the somewhat tragic disadvantage that it does not run i…
-
The following list describes network measures that can be implemented. After discussion of these measures, I will open each one in a separate issue:
- [x] Clustering (double checking) - seems to retu…
-
I'm looking for a good tool to benchmark ELKI ( http://elki.dbs.ifi.lmu.de/ ) clustering performance across parameters.
The problem is, that the parameters aren't as nicely uniform as in your example…
kno10 updated
10 years ago
-
# Problem
We're computing the local clustering coefficient of many directed, weighted networks of approximate size of `N = 400` nodes. The networks are rather dense with ca. 50% of all possible nod…
-
Hi
I would love to be able to try out `Symphony` for label-transfer, but with a set of labels defined by an alternative method to `Harmony`. So for example, starting from an `sce` object where the …
-
Hi Professor @Anthony-Howell-PhD ,
Under the Identifying Communities section of the Final Project Outline Storyboard, there is this code. did you want us to create 9 clusters or should we stick to …
-
In this article the authors mention using human judges to ensure the quality of the clustering methods they propose. A sample of documents from within and across clusters are taken and then the judges…