./wip/mcl, Fast and scalable unsupervised cluster algorithm for graphs

[ CVSweb ] [ Homepage ] [ RSS ] [ Required by ] [ Add to tracker ]

Branch: CURRENT, Version: 14, Package name: mcl-14, Maintainer: bacon

The MCL algorithm is short for the Markov Cluster Algorithm, a fast and
scalable unsupervised cluster algorithm for graphs (also known as networks)
based on simulation of (stochastic) flow in graphs.

Required to run:

Required to build:

Master sites:

RMD160: 063e6415a0d23dcdb2fa8663fe62a95ec4f67f5d
Filesize: 2964.347 KB

Version history: (Expand)

CVS history: (Expand)

   2013-09-01 22:46:00 by Kamel Derouiche | Files touched by this commit (4)
Log message:
Import mcl-12-135 as wip/mcl.

The MCL package is an implementation of the MCL algorithm, and offers
utilities for manipulating sparse matrices (the essential data structure in the
MCL algorithm) and conducting cluster experiments.

MCL is currently being used in sciences like biology (protein family detection,
genomics), computer science (node clustering in Peer-to-Peer networks),
and linguistics (text analysis)