modMax: Community Structure Detection via Modularity Maximization
Version 1.1

The algorithms implemented here are used to detect the community structure of a network. These algorithms follow different approaches, but are all based on the concept of modularity maximization.

Browse man pages Browse package API and functions Browse package files

AuthorMaria Schelling, Cang Hui
Date of publication2015-07-24 18:21:32
MaintainerMaria Schelling <schelling.rmaintainer@vodafone.de>
LicenseGPL-2
Version1.1
Package repositoryView on CRAN
InstallationInstall the latest version of this package by entering the following in R:
install.packages("modMax")

Man pages

extremalOptimization: Extremal optimization (EO) algorithms
geneticAlgorithm: Genetic algorithm
greedy: Greedy algorithms
localModularity: Algorithms using local modularity
modMax-package: Calculate network modularity via maximization algorithms
simulatedAnnealing: Simulated annealing algorithms
spectralOptimization: Spectral optimization algorithms

Functions

calculateA Source code
calculateDeltaQ Source code
calculateFitness Source code
calculateLambda Source code
calculateLambdaPCSEOSS Source code
calculateModMatrix Source code
calculateQ Source code
calculateQEO Source code
calculateQMerge Source code
calculateQMove Source code
calculateQPCSEOSS Source code
calculateRandomGraph Source code
callCD Source code
callEOPCSEOSS Source code
callExtremalOptimization Source code
callGeneticAlgorithm Source code
callGreedy Source code
callLocalModularity Source code
callLocalModularityWang Source code
callLouvain Source code
callMome Source code
callMsgvm Source code
callMultiWay Source code
callRgplus Source code
callSaIndividualCollectiveMoves Source code
callSimulatedAnnealing Source code
callSpectral1 Source code
callSpectral2 Source code
callSpectralOptimization Source code
callVertexSim Source code
cd Man page Source code
completeGreedyRefinement Source code
computeCoarsening Source code
computeDist Source code
computeUk Source code
eoPCSEOSS Source code
extremalOptimization Man page Source code
fastGreedyRefinement Source code
generateLocalOutput Source code
generateOutput Source code
geneticAlgorithm Man page Source code
getCEO Source code
getDegree Source code
getLevelSet Source code
greedy Man page Source code
individualNodeMovement Source code
initialGreedy Source code
initialPriorKnowledge Source code
initialRandom Source code
initialRandomWalkers Source code
initialSingletons Source code
initialSubgraphSim Source code
initialWholeGraph Source code
kernighanLinRefinement Source code
localCommunityDetection Source code
localModularity Man page Source code
localModularityWang Man page Source code
localSearchOperator Source code
louvain Man page Source code
mergeCommunities Source code
modMax Man page
modMax-package Man page
mome Man page Source code
msgvm Man page Source code
multiWay Man page Source code
pcseoss Man page Source code
randomLocalSearchAgent Source code
rgplus Man page Source code
saIndividualCollectiveMoves Man page Source code
simulatedAnnealing Man page Source code
spectral1 Man page Source code
spectral2 Man page Source code
spectralOptimization Man page Source code
splitCommunities Source code
updateC Source code
updateDeltaQ Source code
updateLevelSet Source code
vertexSim Man page Source code
weighting Source code

Files

NAMESPACE
R
R/spectralOptimization.R
R/generalFunctions.R
R/localModularity.R
R/saMovements.R
R/simulatedAnnealing.R
R/greedy.R
R/extremalOptimization.R
R/geneticAlgorithm.R
MD5
DESCRIPTION
man
man/greedy.Rd
man/extremalOptimization.Rd
man/spectralOptimization.Rd
man/geneticAlgorithm.Rd
man/modMax-package.Rd
man/simulatedAnnealing.Rd
man/localModularity.Rd
modMax documentation built on May 20, 2017, 1:05 a.m.