1CLUSTER(1)                  General Commands Manual                 CLUSTER(1)
2
3
4

NAME

6       cluster  -  find  clusters  in  a graph and augment the graph with this
7       information.
8

SYNOPSIS

10       cluster [-v?]  [ -Ck ] [ -ck ] [ -o outfile ] [ files ]
11

DESCRIPTION

13       cluster takes as input a graph in DOT format, finds node  clusters  and
14       augments  the  graph with this information.  The clusters are specified
15       by the "cluster" attribute attached to nodes; cluster values  are  non-
16       negative  integers.  cluster attempts to maximize the modularity of the
17       clustering.  If the edge attribute "weight" is defined,  this  will  be
18       used in computing the clustering.
19

OPTIONS

21       The following options are supported:
22
23       -Ck    specifies  a  targeted  number of clusters that should be gener‐
24              ated.  The specified number k is only a suggestion and  may  not
25              be  realisable.   If k == 0, the default, the number of clusters
26              that approximately optimizes the modularity is returned.
27
28       -ck    specifies clustering method.  If k == 0, the default, modularity
29              clustering  will  be used.  If k == 1 modularity quality will be
30              used.
31
32       -ooutfile
33              Specifies that output  should  go  into  the  file  outfile.  By
34              default, stdout is used.
35
36       -v     Verbose mode.
37
38       -?     Prints the usage and exits.
39

EXAMPLES

41       Applying cluster to the following graph,
42
43          graph {
44              1--2 [weight=10.]
45              2--3 [weight=1]
46              3--4 [weight=10.]
47              4--5 [weight=10]
48              5--6 [weight=10]
49              3--6 [weight=0.1]
50              4--6 [weight=10.]
51             }
52
53       gives
54
55          graph {
56                node [cluster="-1"];
57                1 [cluster=1];
58                2 [cluster=1];
59                3 [cluster=2];
60                4 [cluster=2];
61                5 [cluster=2];
62                6 [cluster=2];
63                1 -- 2 [weight="10."];
64                2 -- 3 [weight=1];
65                3 -- 4 [weight="10."];
66                4 -- 5 [weight=10];
67                5 -- 6 [weight=10];
68                3 -- 6 [weight="0.1"];
69                4 -- 6 [weight="10."];
70          }
71
72
73

AUTHOR

75       Yifan Hu <yifanhu@yahoo.com>
76

SEE ALSO

78       gvmap(1)
79
80       Blondel,  V.D.,  Guillaume,  J.L.,  Lambiotte,  R.,  Lefebvre, E.: Fast
81       unfolding of communities in  large  networks.  Journal  of  Statistical
82       Mechanics: Theory and Experiment (2008), P10008.
83
84
85
86                                 3 March 2011                       CLUSTER(1)
Impressum