1CLUSTER(1) General Commands Manual CLUSTER(1)
2
3
4
6 cluster - find clusters in a graph and augment the graph with this
7 information.
8
10 cluster [-v?] [ -Ck ] [ -ck ] [ -o outfile ] [ files ]
11
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
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
39 Applying cluster to the following graph,
40
41 graph {
42 1--2 [weight=10.]
43 2--3 [weight=1]
44 3--4 [weight=10.]
45 4--5 [weight=10]
46 5--6 [weight=10]
47 3--6 [weight=0.1]
48 4--6 [weight=10.]
49 }
50
51 gives
52
53 graph {
54 node [cluster="-1"];
55 1 [cluster=1];
56 2 [cluster=1];
57 3 [cluster=2];
58 4 [cluster=2];
59 5 [cluster=2];
60 6 [cluster=2];
61 1 -- 2 [weight="10."];
62 2 -- 3 [weight=1];
63 3 -- 4 [weight="10."];
64 4 -- 5 [weight=10];
65 5 -- 6 [weight=10];
66 3 -- 6 [weight="0.1"];
67 4 -- 6 [weight="10."];
68 }
69
70
71
73 Yifan Hu <yifanhu@yahoo.com>
74
76 gvmap(1)
77
78 Blondel, V.D., Guillaume, J.L., Lambiotte, R., Lefebvre, E.: Fast
79 unfolding of communities in large networks. Journal of Statistical
80 Mechanics: Theory and Experiment (2008), P10008.
81
82
83
84 3 March 2011 CLUSTER(1)