Difference between revisions of "MCL"
Moskalenko (talk | contribs) m (Text replace - "Usage policy" to "Usage Policy") |
Moskalenko (talk | contribs) m (Text replace - "{{#if: {{#var: mod}}|==Execution Environment and Modules== {{App_Module|app={{#var:app}}|intel={{#var:intel}}|mpi={{#var:mpi}}}}|}}" to "==Required Modules== modules documentation ===Serial=== *{{#var:app}}") |
||
| Line 36: | Line 36: | ||
<!--Modules--> | <!--Modules--> | ||
| − | + | ==Required Modules== | |
| − | + | [[Modules|modules documentation]] | |
| + | ===Serial=== | ||
| + | *{{#var:app}} | ||
* HPC_MCL_* HPC_MCL_BIN - executable directory | * HPC_MCL_* HPC_MCL_BIN - executable directory | ||
* HPC_MCL_DOC - documentation directory | * HPC_MCL_DOC - documentation directory | ||
Revision as of 16:55, 10 August 2012
Description
The MCL algorithm is short for the Markov Cluster Algorithm, a fast and scalable unsupervised cluster algorithm for networks (also known as graphs) based on simulation of (stochastic) flow in graphs. The algorithm was invented/discovered by Stijn van Dongen (that is, me) at the Centre for Mathematics and Computer Science (also known as CWI) in the Netherlands. The PhD thesis Graph clustering by flow simulation is centered around this algorithm, the main topics being the mathematical theory behind it, its position in cluster analysis and graph clustering, issues concerning scalability, implementation, and benchmarking, and performance criteria for graph clustering in general. The work for this thesis was carried out under supervision of Jan van Eijck and Michiel Hazewinkel.
Required Modules
Serial
- mcl
- HPC_MCL_* HPC_MCL_BIN - executable directory
- HPC_MCL_DOC - documentation directory
- HPC_MCL_MAN - manpage directory