-
Using the Louvain hierarchical clustering algorithm to generate communities of nodes for the graph resulting in annotating the abstracts of source level nodes.
-
**Sprint 1**
Goal:
- write functions for group level feature extraction from graphs
- use my algorithms to construct feature matrices (to be used by clustering team)
**DoD**:
- [x] two good me…
-
Hi,
Thank you for developing this incredibly useful pipeline. It has been instrumental in my scRNA-seq analysis work. I have encountered an interesting issue while using the script provided: when u…
-
**From:** Maxime Moog
**Email:** maxime.moog@tuni.fi
**Server IP:** 10.142.0.14
**Msg:** Hello, I have been trying to use your platform to analyze some data and no matter my characteristics or the …
-
**Hello igraph community!**
I would like to see an extension of the configuration model implemented, that allows one to specify the joint degree/triangle sequence of a graph. See reference below...…
-
The current scaling bottleneck is usually the connected components step in clustering. The current algorithm loads the entire edgelist into memory.
We need to move this to disk.
Things worth e…
-
Hello,
Thanks a lot for this wonderful mapper. I have been impressed by it so far.
Is there a way to automatically identify clusters of closely connected nodes within the TDA graph?
I have s…
-
-
This is the way we are building the graph under the hood: `The Manhattan distance function computes the distance that would be traveled to get from one data point to the other if a grid-like path is f…
-
Perhaps we touched on this briefly in class, but it's still not quite clear to me: wouldn't there be a limitation in clustering only on the adjacency matrix and ignoring vertex or graph attributes? If…