My Project
|
BestMatch | Match clusters with best partners |
bidirected_t | Directed Network With Cycles of Size 2 |
CliqueCluster< R > | Clique Percolation Implementation |
ClusterAlg< R > | Base class for all community detection algorithms |
Compare | Set of cluster comparisons |
complex_density< graph_t > | Weights simple_density measure with edge probability |
CONGA< R > | Cluster Overlapping Newman Girvan Algorithm |
COPRA< R > | Community Overlapping Propagation Algorithm |
density< graph_t > | Interface for densities |
directed_t | Directed Networks |
dist | Compare two single clusters |
entropy | Entropy measure for cluster similarity |
FScore | Binary Classification measures |
Interaction | Probabilistic measure |
IterativeDensity< R > | Connected Iterative Scan |
KCenter | Sampled Best Match |
KL | Kullback-Leibler distance |
L2 | L2 distance measure |
LCOMM< R > | Link Communities |
moves | 'Best Moves' similarity |
Nation | Collection of communities |
negative_density< graph_t > | For use in networks with negative edge weights |
NMI | Normalized Mutual Information |
normalized | Normalized version of best move |
OSLOM< R > | Order Statistics Local Optimization Method |
RRW< R > | Repeated Random Walks Implementation |
seed | Potential Cluster |
simple_density< graph_t > | Ratio of internal weights to internal+external weights |
SLPA< R > | Speaker-Listener Label Propagation Algorithm |
SSDE< R > | Sampled Spectral Distance Embedding |
undirected_t | Undirected Networks |