Difference between revisions of "MCL"
Moskalenko (talk | contribs) m (Text replace - "<!--Compiler and MPI settings - OPTIONAL --> |{" to "|{") |
Moskalenko (talk | contribs) |
||
| Line 19: | Line 19: | ||
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. | 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. | ||
| − | |||
<!--Modules--> | <!--Modules--> | ||
==Required Modules== | ==Required Modules== | ||
| Line 25: | Line 24: | ||
===Serial=== | ===Serial=== | ||
*{{#var:app}} | *{{#var:app}} | ||
| + | ==System Variables== | ||
| + | * HPC_{{#uppercase:{{#var:app}}}}_DIR - installation directory | ||
* 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 19:07, 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
System Variables
- HPC_{{#uppercase:mcl}}_DIR - installation directory
- HPC_MCL_* HPC_MCL_BIN - executable directory
- HPC_MCL_DOC - documentation directory
- HPC_MCL_MAN - manpage directory