This is the default mode of operation. At each successive step of constructing the hierarchy on top of the first level mcl clustering, mclcm uses a matrix derived from the input matrix and the last computed clustering to compute a contracted graph. The contracted graph is a graph where the nodes represent the clusters of the last clustering. The matrix derived from the input graph that is used to construct the contracted graph is called the base matrix. The base matrix can be either the start matrix or the expansion matrix. The start matrix is the input matrix after transformations have been applied to it (if any). The expansion matrix is the first expanded matrix of some mcl process applied to the input graph.

By default the base matrix is constructed from either the start matrix or the expansion matrix obtained from the first mcl process. It is possible to use a start matrix derived from special purpose mcl transformation parameters (such as -ph and -tf) or an expansion matrix derived from a special purpose mcl process. The -b1 and -b2 parameters provide the interfaces to this functionality.

You are advised to start with a high inflation value for the input graph and to use shadowing, e.g. include --shadow=vl in the -a argument. This generally leads to hierarchies that are better balanced. Shadowing is a transformation where nodes are added to the graph, preventing relatively distant nodes from unwanted chaining. For more information refer to the mcl manual. The invocations in SYNOPSIS are a good starting point.

In this mode each trailing argument is specified as a set of options to pass to an mcl process. For each trailing argument an mcl process is thus computed. The set of resulting clusterings is integrated into a hierarchy.

This mode is similar to dispatch mode. The difference is that with this option mclcm simply integrates a set of already existing clusterings. Each trailing argument must be the name of a file containing a clustering. The set of clusterings thus specified is integrated into a hierarchy.

In this mode each trailing argument specifies a set of options to pass to an mcl process. The second clustering process is applied to the graph of components induced by the first clustering, resulting in a further subdivision of the first clustering. This approach is repeated with each further trailing argument. With this approach, the first clustering will be the most coarse clustering. Hence, subsequent trailing arguments will typically specify increasingly higher inflation values, pre-inflation values, and optionally more stringent transformation parameters in order to achieve further subdivsions.

Use this to change and/or set the default mcl options for all iterations. Use quotes if necessary. Example of usage: -a "-I 5".

This will apply the mcl options opts to the input matrix. The resulting start matrix is used as the base matrix for constructing contracted graphs.

This will apply the mcl options opts to the input matrix and compute the first iterand of the corresponding mcl process. The first iterand, aka the expansion matrix, is used as the base matrix for constructing contracted graphs.

Transform the input matrix values according to the syntax described in mcxio.

The hierarchical clustering process will be kicked off by the clustering found in <fname>.

This puts an upper bound to the number of contractions that will be performed.

In case the graph consists of different connected components, the last clustering computed by the mclcm process will correspond with those connected components. This option simply adds an artificial clustering where all nodes have been joined into a single cluster.

File to write the nested cluster stack to. The nested cluster stack contains a sequence of clusterings, each written as an MCL matrix. The first (bottom) clustering is a clustering of the nodes in the input graph. Each subsequent clustering is a clustering where the nodes are the clusters of the previous clustering. mcxdump can dump this format if the file name is given as the -imx-stack option. The explanation for the cone/stack discrepancy is simple. To mcxdump the contents are simply a stack of matrices. It does not care whether the stack is cone shaped, cylindrical, or yet another shape.

File to write the expanded cluster stack to. The expanded cluster stack is similar to the nested cluster stack except that each cluster lists all the nodes in the input graph it contains. mcxdump can dump this format if the file name is given as the -imx-stack option.

File to write the sequence of coarsened graphs to. Each clustering induces a coarsened graph where the nodes represent the clusters and an edge between two nodes represents the connectivity between the corresponding two clusters. The computation of this connectivity takes into account all edges between the two clusters in in the original graph.

Use this option to explicitly specify all of the output types you want written in a comma-separated string. <tag> may contain any of the strings stack, cone, coarse, steps. The current default is to write all of these except coarse. The latter dumps the intermediate coarsened (aka contracted) graphs to a single file.

Write the base matrix to file. This can be useful for debugging expectations.

All output files share the same prefix. The default is mcl and can be changed with this option.

If turned on each clustering is written in a separate file. The first clustering is written to the file <stem>.3 where <stem> is determined by the -stem option. For each subsequent clustering the index is incremented by two, so clusterings are written to files for which the name ends with an odd index.

mclcm writes the command line with which it was invoked to the output file (either of the cone or stack files). Use this option to include any additional information. mclcm does nothing with this option except copying it as just described.

Set the quiet level. Read tingea.log for syntax and semantics.

Show the default mcl options. These are used for each mcl invocation as successively applied to the input graph and succeeding contracted graphs.