Hierarchical clustering

August 5, 2018

Using clustering with relational constraints on large networks we get very large hierarhies. Current support in Pajek for their inspection is scarce. Here are two new commands that could be useful:

  1. (partition, min, max, clu) → partition : preserves only clusters with size in [min,max]. Other clusters are set to cluster clu
  2. (hierarchy, vertex, size) → (hierarchy, partition) : extracts from the given hierarchy a sub-hierarchy of size at most size containing the given vertex. It determines also a 0/1 partition - cluster 1 contains vertices from the sub-hierarchy.

August 10, 2018

Subject Re: Clustering with RC
From Mrvar, Andrej

(partition, min, max, clu) → partition : preserves only clusters with size in [min,max]. Other clusters are set to cluster clu

Partition / Canonical Partition / with Decreasing Frequencies - > First Partition
Partition / Info [Minimum Frequency to Display = Min]    -> Clumin, CluMax
Partition / Binarize Partition [CluMin-CluMax]
Partition / Binarize Partition [0]  - v razbitju zamenjamo nicle in enice - > Second Partition
Partitions / Cover With [?]
pajek/note/cl.txt · Last modified: 2018/08/10 10:52 by vlado
 
Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Noncommercial-Share Alike 3.0 Unported
Recent changes RSS feed Donate Powered by PHP Valid XHTML 1.0 Valid CSS Driven by DokuWiki