<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://visone.ethz.ch/wiki/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=Nick</id>
	<title>visone manual - User contributions [en]</title>
	<link rel="self" type="application/atom+xml" href="https://visone.ethz.ch/wiki/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=Nick"/>
	<link rel="alternate" type="text/html" href="https://visone.ethz.ch/wiki/index.php/Special:Contributions/Nick"/>
	<updated>2026-09-14T18:05:23Z</updated>
	<subtitle>User contributions</subtitle>
	<generator>MediaWiki 1.43.3</generator>
	<entry>
		<id>https://visone.ethz.ch/wiki/index.php?title=Simmelian_backbone_extraction&amp;diff=1360</id>
		<title>Simmelian backbone extraction</title>
		<link rel="alternate" type="text/html" href="https://visone.ethz.ch/wiki/index.php?title=Simmelian_backbone_extraction&amp;diff=1360"/>
		<updated>2013-09-25T17:01:38Z</updated>

		<summary type="html">&lt;p&gt;Nick: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;This transformation algorithm is meant to make network data more easy to visualize and analyze, in particular with regard to detecting underlying community structures.&lt;br /&gt;
The method is based on local ranking and overlap calculations to extract a &#039;&#039;Simmelian backbone&#039;&#039; of strong and redundant ties.&lt;br /&gt;
More detailed background information is provided in&lt;br /&gt;
&lt;br /&gt;
*  Bobo Nick, Conrad Lee, Pádraig Cunningham, Ulrik Brandes: [http://www.inf.uni-konstanz.de/algo/publications/nlcb-sb-13.pdf Simmelian Backbones: Amplifying Hidden Homophily in Facebook Networks], to appear in Proc. ASONAM 2013.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;For questions and comments, or if you want to apply the concept to big data, please contact [[User:Nick|Bobo Nick]].&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
== Where to find ==&lt;br /&gt;
&lt;br /&gt;
Access is given via the [[transformation tab]] in the left-hand side of the visone window:&lt;br /&gt;
set &#039;&#039;level&#039;&#039; to &#039;&#039;&#039;network&#039;&#039;&#039; and &#039;&#039;operation&#039;&#039; to &#039;&#039;&#039;Simmelian backbone&#039;&#039;&#039;.&lt;br /&gt;
&lt;br /&gt;
[[File:simmelian-backbone-find.png]]&lt;br /&gt;
&lt;br /&gt;
== Configuration ==&lt;br /&gt;
&lt;br /&gt;
=== Ranking calculation ===&lt;br /&gt;
&lt;br /&gt;
The Simmelian backbone is extracted from a ranked neighborhood graph.&lt;br /&gt;
For this purpose, each undirected edge is split into two contrary directed edges,&lt;br /&gt;
and the algorithm will rank each node&#039;s (outgoing) neighbors according to an associated (ordinal) &#039;&#039;&#039;link strength&#039;&#039;&#039; attribute:&lt;br /&gt;
&lt;br /&gt;
* If &#039;&#039;uniform&#039;&#039; is selected (default), the algorithm will calculate a link strength attribute on its own (the &#039;&#039;Simmelian strength&#039;&#039;; saved as &#039;&#039;triadType300&#039;&#039;).&lt;br /&gt;
* &#039;&#039;Otherwise&#039;&#039;, the algorithm will use the attribute that was provided. &lt;br /&gt;
Neighbors with equal link strength are equally ranked with the best available rank.&lt;br /&gt;
The resulting neighborhood rankings are saved in a link attribute termed &#039;&#039;ranking&#039;&#039;. &lt;br /&gt;
(For technical reasons, if the selected link strength attribute is termed &#039;&#039;ranking&#039;&#039; or &#039;&#039;redundancy&#039;&#039; it will be renamed into &#039;&#039;backbone-weight (ranking)&#039;&#039; or &#039;&#039;backbone-weight (redundancy)&#039;&#039;, respectively.)&lt;br /&gt;
&lt;br /&gt;
[[File:simmelian-backbone-config.png]]&lt;br /&gt;
&lt;br /&gt;
=== Redundancy assessment ===&lt;br /&gt;
&lt;br /&gt;
Next, for designated pairs of nodes, the algorithm will calculate the redundancy of top-ranked neighbors.&lt;br /&gt;
Always, each redundancy assessment is associated with a directed link (from ego to alter) in the ranked neighborhood graph.&lt;br /&gt;
The resulting redundancy values are saved in a link attribute termed &#039;&#039;redundancy&#039;&#039;.&lt;br /&gt;
&lt;br /&gt;
==== Parametric variant ====&lt;br /&gt;
&lt;br /&gt;
If &#039;&#039;&#039;parametric&#039;&#039;&#039; is selected (default), the required redundancy for a link to be included in the Simmelian backbone&lt;br /&gt;
is specified in terms of a necessary number of top-ranked common neighbors (regarding ego and alter associated with this link):&lt;br /&gt;
&lt;br /&gt;
* You can use the &#039;&#039;&#039;min overlap&#039;&#039;&#039; parameter to specify a minimal required overlap of top-ranked common neighbors (default 5).&lt;br /&gt;
* You can use the &#039;&#039;&#039;max ranking&#039;&#039;&#039; parameter to specify the maximal rank which is still regarded as a top-rank (default 10). That is, those outgoing neighbors that have been attached a rank greater than &#039;&#039;max ranking&#039;&#039; will not contribute in the redundancy calculation.&lt;br /&gt;
* You can use the &#039;&#039;&#039;conditioned&#039;&#039;&#039; parameter to specify for which pairs of actors the overlap is calculated:&lt;br /&gt;
** if selected (default), the overlap calculation is only performed for those links which have been top-ranked themselves&lt;br /&gt;
** if deselected, the overlap calculation is performed for each directed link in the ranked neighborhood graph.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Special cases&#039;&#039;:&lt;br /&gt;
If &#039;&#039;conditioned&#039;&#039; is true, non-top-ranked links will have undefined overlap values.&lt;br /&gt;
Setting &#039;&#039;min overlap&#039;&#039; to zero will imply that only links with undefined overlap value are removed from the network.&lt;br /&gt;
&lt;br /&gt;
==== Non-parametric variant ====&lt;br /&gt;
&lt;br /&gt;
In the non-parametric variant of the transformation algorithm, a redundancy calculation is triggered for each link in the ranked neighborhood graph.&lt;br /&gt;
The redundancy is defined as the maximum (ranked) Jaccard coefficient that is found when iteratively comparing top ranked neighbors (including more and more ranks).&lt;br /&gt;
For a link to be included in the Simmelian backbone, the best found Jaccard coefficient has to be at least one half.&lt;br /&gt;
&lt;br /&gt;
==== Reciprocity handling ====&lt;br /&gt;
&lt;br /&gt;
For any of the two variants (parametric, or non-parametric redundancy assessment), you can decide whether ego is &#039;&#039;&#039;identified&#039;&#039;&#039; with alter in the redundancy calculations,&lt;br /&gt;
i.e. reciprocity within top ranks is counted as overlap (default), or whether ego&#039;s rank in alter&#039;s neighborhood and alter&#039;s rank in ego&#039;s neighborhood are not taken into account&lt;br /&gt;
in the redundancy assessment.&lt;br /&gt;
&lt;br /&gt;
== Result ==&lt;br /&gt;
&lt;br /&gt;
For convenience, if &#039;&#039;&#039;layout&#039;&#039;&#039; is selected, visone&#039;s &#039;&#039;quick layout&#039;&#039; functionality is used to visualize the modified network structure at the end of the algorithm;&lt;br /&gt;
otherwise, all node positions remain as before.&lt;br /&gt;
&lt;br /&gt;
[[File:simmelian-backbone-result.png]]&lt;br /&gt;
&lt;br /&gt;
Use &#039;&#039;&#039;apply to&#039;&#039;&#039; to select the network(s) for which the calculations shall be performed.&lt;br /&gt;
Since the network structure is altered by the algorithm, &#039;&#039;&#039;result in&#039;&#039;&#039; a &#039;&#039;new network&#039;&#039; rather than &#039;&#039;this network&#039;&#039; is proposed as default.&lt;br /&gt;
The calculation is triggered by clicking the &#039;&#039;&#039;transform&#039;&#039;&#039; button at the bottom.&lt;/div&gt;</summary>
		<author><name>Nick</name></author>
	</entry>
	<entry>
		<id>https://visone.ethz.ch/wiki/index.php?title=User:Nick&amp;diff=1359</id>
		<title>User:Nick</title>
		<link rel="alternate" type="text/html" href="https://visone.ethz.ch/wiki/index.php?title=User:Nick&amp;diff=1359"/>
		<updated>2013-09-02T18:13:56Z</updated>

		<summary type="html">&lt;p&gt;Nick: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&#039;&#039;&#039;Bobo Nick&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
Information about me can be found on my homepage: [http://bobo-nick.de http://bobo-nick.de]&lt;/div&gt;</summary>
		<author><name>Nick</name></author>
	</entry>
	<entry>
		<id>https://visone.ethz.ch/wiki/index.php?title=Simmelian_backbone_extraction&amp;diff=1333</id>
		<title>Simmelian backbone extraction</title>
		<link rel="alternate" type="text/html" href="https://visone.ethz.ch/wiki/index.php?title=Simmelian_backbone_extraction&amp;diff=1333"/>
		<updated>2013-06-04T08:43:56Z</updated>

		<summary type="html">&lt;p&gt;Nick: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;This transformation algorithm is meant to make a network more easy to visualize and analyze, in particular with regard to detecting an underlying community structure.&lt;br /&gt;
It is based on local ranking and overlap calculations to extract a &#039;&#039;Simmelian backbone&#039;&#039; of strong and redundant ties.&lt;br /&gt;
Detailed information is provided in&lt;br /&gt;
&lt;br /&gt;
*  Bobo Nick, Conrad Lee, Pádraig Cunningham, Ulrik Brandes: &amp;quot;Simmelian Backbones: Amplifying Hidden Homophily in Facebook Networks&amp;quot;, ASONAM 2013; to appear.&lt;br /&gt;
&lt;br /&gt;
Background information was also presented in a talk at XXXIII Sunbelt Social Networks Conference of the International Network for Social Network Analysis (INSNA),&lt;br /&gt;
Hamburg, Germany, May 21-26, 2013; Bobo Nick, Conrad Lee, Pádraig Cunningham, Ulrik Brandes: &amp;quot;Triadic Cohesion in Social Networks&amp;quot;.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Please address questions and comments to [[User:Nick|Bobo Nick]].&lt;br /&gt;
&lt;br /&gt;
== Where to find ==&lt;br /&gt;
&lt;br /&gt;
Access is given via the [[transformation tab]] in the left-hand side of the visone window:&lt;br /&gt;
set &#039;&#039;level&#039;&#039; to &#039;&#039;&#039;network&#039;&#039;&#039; and &#039;&#039;operation&#039;&#039; to &#039;&#039;&#039;Simmelian backbone&#039;&#039;&#039;.&lt;br /&gt;
&lt;br /&gt;
[[File:simmelian-backbone-find.png]]&lt;br /&gt;
&lt;br /&gt;
== Configuration ==&lt;br /&gt;
&lt;br /&gt;
=== Ranking calculation ===&lt;br /&gt;
&lt;br /&gt;
The Simmelian backbone is extracted from a ranked neighborhood graph.&lt;br /&gt;
For this purpose, each undirected edge is split into two contrary directed edges,&lt;br /&gt;
and the algorithm will rank each node&#039;s (outgoing) neighbors according to an associated (ordinal) &#039;&#039;&#039;link strength&#039;&#039;&#039; attribute:&lt;br /&gt;
&lt;br /&gt;
* If &#039;&#039;uniform&#039;&#039; is selected (default), the algorithm will calculate a link strength attribute on its own (the &#039;&#039;Simmelian strength&#039;&#039;; saved as &#039;&#039;triadType300&#039;&#039;).&lt;br /&gt;
* &#039;&#039;Otherwise&#039;&#039;, the algorithm will use the attribute that was provided. &lt;br /&gt;
Neighbors with equal link strength are equally ranked with the best available rank.&lt;br /&gt;
The resulting neighborhood rankings are saved in a link attribute termed &#039;&#039;ranking&#039;&#039;. &lt;br /&gt;
(For technical reasons, if the selected link strength attribute is termed &#039;&#039;ranking&#039;&#039; or &#039;&#039;redundancy&#039;&#039; it will be renamed into &#039;&#039;backbone-weight (ranking)&#039;&#039; or &#039;&#039;backbone-weight (redundancy)&#039;&#039;, respectively.)&lt;br /&gt;
&lt;br /&gt;
[[File:simmelian-backbone-config.png]]&lt;br /&gt;
&lt;br /&gt;
=== Redundancy assessment ===&lt;br /&gt;
&lt;br /&gt;
Next, for designated pairs of nodes, the algorithm will calculate the redundancy of top-ranked neighbors.&lt;br /&gt;
Always, each redundancy assessment is associated with a directed link (from ego to alter) in the ranked neighborhood graph.&lt;br /&gt;
The resulting redundancy values are saved in a link attribute termed &#039;&#039;redundancy&#039;&#039;.&lt;br /&gt;
&lt;br /&gt;
==== Parametric variant ====&lt;br /&gt;
&lt;br /&gt;
If &#039;&#039;&#039;parametric&#039;&#039;&#039; is selected (default), the required redundancy for a link to be included in the Simmelian backbone&lt;br /&gt;
is specified in terms of a necessary number of top-ranked common neighbors (regarding ego and alter associated with this link):&lt;br /&gt;
&lt;br /&gt;
* You can use the &#039;&#039;&#039;min overlap&#039;&#039;&#039; parameter to specify a minimal required overlap of top-ranked common neighbors (default 5).&lt;br /&gt;
* You can use the &#039;&#039;&#039;max ranking&#039;&#039;&#039; parameter to specify the maximal rank which is still regarded as a top-rank (default 10). That is, those outgoing neighbors that have been attached a rank greater than &#039;&#039;max ranking&#039;&#039; will not contribute in the redundancy calculation.&lt;br /&gt;
* You can use the &#039;&#039;&#039;conditioned&#039;&#039;&#039; parameter to specify for which pairs of actors the overlap is calculated:&lt;br /&gt;
** if selected (default), the overlap calculation is only performed for those links which have been top-ranked themselves&lt;br /&gt;
** if deselected, the overlap calculation is performed for each directed link in the ranked neighborhood graph.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Special cases&#039;&#039;:&lt;br /&gt;
If &#039;&#039;conditioned&#039;&#039; is true, non-top-ranked links will have undefined overlap values.&lt;br /&gt;
Setting &#039;&#039;min overlap&#039;&#039; to zero will imply that only links with undefined overlap value are removed from the network.&lt;br /&gt;
&lt;br /&gt;
==== Non-parametric variant ====&lt;br /&gt;
&lt;br /&gt;
In the non-parametric variant of the transformation algorithm, a redundancy calculation is triggered for each link in the ranked neighborhood graph.&lt;br /&gt;
The redundancy is defined as the maximum (ranked) Jaccard coefficient that is found when iteratively comparing top ranked neighbors (including more and more ranks).&lt;br /&gt;
For a link to be included in the Simmelian backbone, the best found Jaccard coefficient has to be at least one half.&lt;br /&gt;
&lt;br /&gt;
==== Reciprocity handling ====&lt;br /&gt;
&lt;br /&gt;
For any of the two variants (parametric, or non-parametric redundancy assessment), you can decide whether ego is &#039;&#039;&#039;identified&#039;&#039;&#039; with alter in the redundancy calculations,&lt;br /&gt;
i.e. reciprocity within top ranks is counted as overlap (default), or whether ego&#039;s rank in alter&#039;s neighborhood and alter&#039;s rank in ego&#039;s neighborhood are not taken into account&lt;br /&gt;
in the redundancy assessment.&lt;br /&gt;
&lt;br /&gt;
== Result ==&lt;br /&gt;
&lt;br /&gt;
For convenience, if &#039;&#039;&#039;layout&#039;&#039;&#039; is selected, visone&#039;s &#039;&#039;quick layout&#039;&#039; functionality is used to visualize the modified network structure at the end of the algorithm;&lt;br /&gt;
otherwise, all node positions remain as before.&lt;br /&gt;
&lt;br /&gt;
[[File:simmelian-backbone-result.png]]&lt;br /&gt;
&lt;br /&gt;
Use &#039;&#039;&#039;apply to&#039;&#039;&#039; to select the network(s) for which the calculations shall be performed.&lt;br /&gt;
Since the network structure is altered by the algorithm, &#039;&#039;&#039;result in&#039;&#039;&#039; a &#039;&#039;new network&#039;&#039; rather than &#039;&#039;this network&#039;&#039; is proposed as default.&lt;br /&gt;
The calculation is triggered by clicking the &#039;&#039;&#039;transform&#039;&#039;&#039; button at the bottom.&lt;/div&gt;</summary>
		<author><name>Nick</name></author>
	</entry>
	<entry>
		<id>https://visone.ethz.ch/wiki/index.php?title=Transformation_tab&amp;diff=1319</id>
		<title>Transformation tab</title>
		<link rel="alternate" type="text/html" href="https://visone.ethz.ch/wiki/index.php?title=Transformation_tab&amp;diff=1319"/>
		<updated>2013-04-19T10:28:37Z</updated>

		<summary type="html">&lt;p&gt;Nick: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;The transformation tab allows to modify the network structure according to some specified rule such as computing a co-authoring network from an author-article network, or replacing reciprocated directed links by undirected links.&lt;br /&gt;
&lt;br /&gt;
visone distinguishes between three different &#039;&#039;&#039;transformation levels&#039;&#039;&#039;&lt;br /&gt;
* &#039;&#039;link level&#039;&#039;, e.g., to merge parallel links or reverse link directions;&lt;br /&gt;
* &#039;&#039;node level&#039;&#039; to turn the network of individual nodes into a network among groups;&lt;br /&gt;
* &#039;&#039;network level&#039;&#039;, e.g., to collapse a two-mode network into one-mode networks, or [[Simmelian backbone extraction]].&lt;/div&gt;</summary>
		<author><name>Nick</name></author>
	</entry>
	<entry>
		<id>https://visone.ethz.ch/wiki/index.php?title=Simmelian_backbone_extraction&amp;diff=1318</id>
		<title>Simmelian backbone extraction</title>
		<link rel="alternate" type="text/html" href="https://visone.ethz.ch/wiki/index.php?title=Simmelian_backbone_extraction&amp;diff=1318"/>
		<updated>2013-04-19T10:23:29Z</updated>

		<summary type="html">&lt;p&gt;Nick: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&#039;&#039;&#039;Note: this page documents a visone functionality that will be available in the next release of visone (version 2.7, scheduled for May 2013) .&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
This transformation algorithm is meant to make a network more easy to visualize and analyze, e.g., with regard to detecting an underlying community structure.&lt;br /&gt;
It is based on local ranking and overlap calculations to extract a &#039;&#039;Simmelian backbone&#039;&#039; of strong and redundant ties.&lt;br /&gt;
Detailed information is provided in&lt;br /&gt;
&lt;br /&gt;
*  Bobo Nick, Conrad Lee, Ulrik Brandes: &amp;quot;Simmelian Backbones: Amplifying Hidden Homophily in Facebook Networks&amp;quot;, 2013; submitted.&lt;br /&gt;
&lt;br /&gt;
Background information will also be presented in a talk at XXXIII Sunbelt Social Networks Conference of the International Network for Social Network Analysis (INSNA),&lt;br /&gt;
Hamburg, Germany, May 21-26, 2013; Bobo Nick, Conrad Lee, Pádraig Cunningham, Ulrik Brandes: &amp;quot;Triadic Cohesion in Social Networks&amp;quot;.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Please address questions and comments to [[User:Nick|Bobo Nick]].&lt;br /&gt;
&lt;br /&gt;
== Where to find ==&lt;br /&gt;
&lt;br /&gt;
Access is given via the [[transformation tab]] in the left-hand side of the visone window:&lt;br /&gt;
set &#039;&#039;level&#039;&#039; to &#039;&#039;&#039;network&#039;&#039;&#039; and &#039;&#039;operation&#039;&#039; to &#039;&#039;&#039;Simmelian backbone&#039;&#039;&#039;.&lt;br /&gt;
&lt;br /&gt;
[[File:simmelian-backbone-find.png]]&lt;br /&gt;
&lt;br /&gt;
== Configuration ==&lt;br /&gt;
&lt;br /&gt;
=== Ranking calculation ===&lt;br /&gt;
&lt;br /&gt;
The Simmelian backbone is extracted from a ranked neighborhood graph.&lt;br /&gt;
For this purpose, each undirected edge is split into two contrary directed edges,&lt;br /&gt;
and the algorithm will rank each node&#039;s (outgoing) neighbors according to an associated (ordinal) &#039;&#039;&#039;link strength&#039;&#039;&#039; attribute:&lt;br /&gt;
&lt;br /&gt;
* If &#039;&#039;uniform&#039;&#039; is selected (default), the algorithm will calculate a link strength attribute on its own (the &#039;&#039;Simmelian strength&#039;&#039;; saved as &#039;&#039;triadType300&#039;&#039;).&lt;br /&gt;
* &#039;&#039;Otherwise&#039;&#039;, the algorithm will use the attribute that was provided. &lt;br /&gt;
Neighbors with equal link strength are equally ranked with the best available rank.&lt;br /&gt;
The resulting neighborhood rankings are saved in a link attribute termed &#039;&#039;ranking&#039;&#039;. &lt;br /&gt;
(For technical reasons, if the selected link strength attribute is termed &#039;&#039;ranking&#039;&#039; or &#039;&#039;redundancy&#039;&#039; it will be renamed into &#039;&#039;backbone-weight (ranking)&#039;&#039; or &#039;&#039;backbone-weight (redundancy)&#039;&#039;, respectively.)&lt;br /&gt;
&lt;br /&gt;
[[File:simmelian-backbone-config.png]]&lt;br /&gt;
&lt;br /&gt;
=== Redundancy assessment ===&lt;br /&gt;
&lt;br /&gt;
Next, for designated pairs of nodes, the algorithm will calculate the redundancy of top-ranked neighbors.&lt;br /&gt;
Always, each redundancy assessment is associated with a directed link (from ego to alter) in the ranked neighborhood graph.&lt;br /&gt;
The resulting redundancy values are saved in a link attribute termed &#039;&#039;redundancy&#039;&#039;.&lt;br /&gt;
&lt;br /&gt;
==== Parametric variant ====&lt;br /&gt;
&lt;br /&gt;
If &#039;&#039;&#039;parametric&#039;&#039;&#039; is selected (default), the required redundancy for a link to be included in the Simmelian backbone&lt;br /&gt;
is specified in terms of a necessary number of top-ranked common neighbors (regarding ego and alter associated with this link):&lt;br /&gt;
&lt;br /&gt;
* You can use the &#039;&#039;&#039;min overlap&#039;&#039;&#039; parameter to specify a minimal required overlap of top-ranked common neighbors (default 5).&lt;br /&gt;
* You can use the &#039;&#039;&#039;max ranking&#039;&#039;&#039; parameter to specify the maximal rank which is still regarded as a top-rank (default 10). That is, those outgoing neighbors that have been attached a rank greater than &#039;&#039;max ranking&#039;&#039; will not contribute in the redundancy calculation.&lt;br /&gt;
* You can use the &#039;&#039;&#039;conditioned&#039;&#039;&#039; parameter to specify for which pairs of actors the overlap is calculated:&lt;br /&gt;
** if selected (default), the overlap calculation is only performed for those links which have been top-ranked themselves&lt;br /&gt;
** if deselected, the overlap calculation is performed for each directed link in the ranked neighborhood graph.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Special cases&#039;&#039;:&lt;br /&gt;
If &#039;&#039;conditioned&#039;&#039; is true, non-top-ranked links will have undefined overlap values.&lt;br /&gt;
Setting &#039;&#039;min overlap&#039;&#039; to zero will imply that only links with undefined overlap value are removed from the network.&lt;br /&gt;
&lt;br /&gt;
==== Non-parametric variant ====&lt;br /&gt;
&lt;br /&gt;
In the non-parametric variant of the transformation algorithm, a redundancy calculation is triggered for each link in the ranked neighborhood graph.&lt;br /&gt;
The redundancy is defined as the maximum (ranked) Jaccard coefficient that is found when iteratively comparing top ranked neighbors (including more and more ranks).&lt;br /&gt;
For a link to be included in the Simmelian backbone, the best found Jaccard coefficient has to be at least one half.&lt;br /&gt;
&lt;br /&gt;
==== Reciprocity handling ====&lt;br /&gt;
&lt;br /&gt;
For any of the two variants (parametric, or non-parametric redundancy assessment), you can decide whether ego is &#039;&#039;&#039;identified&#039;&#039;&#039; with alter in the redundancy calculations,&lt;br /&gt;
i.e. reciprocity within top ranks is counted as overlap (default), or whether ego&#039;s rank in alter&#039;s neighborhood and alter&#039;s rank in ego&#039;s neighborhood are not taken into account&lt;br /&gt;
in the redundancy assessment.&lt;br /&gt;
&lt;br /&gt;
== Result ==&lt;br /&gt;
&lt;br /&gt;
For convenience, if &#039;&#039;&#039;layout&#039;&#039;&#039; is selected, visone&#039;s &#039;&#039;quick layout&#039;&#039; functionality is used to visualize the modified network structure at the end of the algorithm;&lt;br /&gt;
otherwise, all node positions remain as before.&lt;br /&gt;
&lt;br /&gt;
[[File:simmelian-backbone-result.png]]&lt;br /&gt;
&lt;br /&gt;
Use &#039;&#039;&#039;apply to&#039;&#039;&#039; to select the network(s) for which the calculations shall be performed.&lt;br /&gt;
Since the network structure is altered by the algorithm, &#039;&#039;&#039;result in&#039;&#039;&#039; a &#039;&#039;new network&#039;&#039; rather than &#039;&#039;this network&#039;&#039; is proposed as default.&lt;br /&gt;
The calculation is triggered by clicking the &#039;&#039;&#039;transform&#039;&#039;&#039; button at the bottom.&lt;/div&gt;</summary>
		<author><name>Nick</name></author>
	</entry>
	<entry>
		<id>https://visone.ethz.ch/wiki/index.php?title=Triadic_cohesion_clustering&amp;diff=1317</id>
		<title>Triadic cohesion clustering</title>
		<link rel="alternate" type="text/html" href="https://visone.ethz.ch/wiki/index.php?title=Triadic_cohesion_clustering&amp;diff=1317"/>
		<updated>2013-04-18T23:08:43Z</updated>

		<summary type="html">&lt;p&gt;Nick: Redirected page to Simmelian backbone extraction&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;#REDIRECT [[Simmelian backbone extraction]]&lt;/div&gt;</summary>
		<author><name>Nick</name></author>
	</entry>
	<entry>
		<id>https://visone.ethz.ch/wiki/index.php?title=Simmelian_backbone_extraction&amp;diff=1316</id>
		<title>Simmelian backbone extraction</title>
		<link rel="alternate" type="text/html" href="https://visone.ethz.ch/wiki/index.php?title=Simmelian_backbone_extraction&amp;diff=1316"/>
		<updated>2013-04-18T23:03:22Z</updated>

		<summary type="html">&lt;p&gt;Nick: Created page with &amp;quot;&amp;#039;&amp;#039;&amp;#039;Note: this page documents a visone functionality that will be available in the next release of visone (version 2.7, scheduled for May 2013) .&amp;#039;&amp;#039;&amp;#039;  This network transformation i...&amp;quot;&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&#039;&#039;&#039;Note: this page documents a visone functionality that will be available in the next release of visone (version 2.7, scheduled for May 2013) .&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
This network transformation is meant to simplify subsequent network visualizations and clustering calculations.&lt;br /&gt;
It is based on local ranking and overlap calculations to extract a Simmelian backbone of strong and redundant ties.&lt;br /&gt;
Detailed information is provided in&lt;br /&gt;
&lt;br /&gt;
*  Bobo Nick, Conrad Lee, Ulrik Brandes: &amp;quot;Simmelian Backbones: Amplifying Hidden Homophily in Facebook Networks&amp;quot;, 2013; submitted.&lt;br /&gt;
&lt;br /&gt;
Background information will also be presented in a talk at XXXIII Sunbelt Social Networks Conference of the International Network for Social Network Analysis (INSNA),&lt;br /&gt;
Hamburg, Germany, May 21-26, 2013: Bobo Nick, Conrad Lee, Pádraig Cunningham, Ulrik Brandes: &amp;quot;Triadic Cohesion in Social Networks&amp;quot;.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Please address questions and comments to [[User:Nick|Bobo Nick]].&lt;br /&gt;
&lt;br /&gt;
== Where to find ==&lt;br /&gt;
&lt;br /&gt;
Access is given via the [[transformation tab]] in the left-hand side of the visone window:&lt;br /&gt;
set &#039;&#039;level&#039;&#039; to &#039;&#039;&#039;network&#039;&#039;&#039; and &#039;&#039;operation&#039;&#039; to &#039;&#039;&#039;Simmelian backbone&#039;&#039;&#039;.&lt;br /&gt;
&lt;br /&gt;
[[File:simmelian-backbone-find.png]]&lt;br /&gt;
&lt;br /&gt;
== Configuration ==&lt;br /&gt;
&lt;br /&gt;
=== Ranking calculation ===&lt;br /&gt;
&lt;br /&gt;
The Simmelian backbone is extracted from a ranked neighborhood graph.&lt;br /&gt;
For this purpose, each undirected edge is split into two contrary directed edges,&lt;br /&gt;
and the algorithm will rank each node&#039;s (outgoing) neighbors according to an associated (ordinal) &#039;&#039;&#039;link strength&#039;&#039;&#039; attribute.&lt;br /&gt;
&lt;br /&gt;
* If &#039;&#039;uniform&#039;&#039; is selected (default), the algorithm will calculate a link strength attribute on its own (the &#039;&#039;Simmelian strength&#039;&#039;; saved as &#039;&#039;triadType300&#039;&#039;).&lt;br /&gt;
* &#039;&#039;Otherwise&#039;&#039;, the algorithm will use the attribute that was provided.&lt;br /&gt;
&lt;br /&gt;
The resulting neighborhood rankings are saved in a link attribute termed &#039;&#039;ranking&#039;&#039;. Neighbors with equal link strength are equally ranked with the best available rank.&lt;br /&gt;
(For technical reasons, if the selected link strength attribute is termed &#039;&#039;ranking&#039;&#039; or &#039;&#039;redundancy&#039;&#039; it will be renamed into &#039;&#039;backbone-weight (ranking)&#039;&#039; or &#039;&#039;backbone-weight (redundancy)&#039;&#039;, respectively.)&lt;br /&gt;
&lt;br /&gt;
[[File:simmelian-backbone-config.png]]&lt;br /&gt;
&lt;br /&gt;
=== Redundancy assessment ===&lt;br /&gt;
&lt;br /&gt;
Next, for designated pairs of nodes, the algorithm will calculate the redundancy of top-ranked neighbors.&lt;br /&gt;
Always, only the ranked neighborhoods of connected pairs of actors will be compared. &lt;br /&gt;
That is, each overlap comparison is associated with a directed link.&lt;br /&gt;
The resulting redundancy values are saved in a link attribute termed &#039;&#039;redundancy&#039;&#039;.&lt;br /&gt;
&lt;br /&gt;
==== Parametric variant ====&lt;br /&gt;
&lt;br /&gt;
If &#039;&#039;parametric&#039;&#039; is selected, the required redundancy for a link to be included in the Simmelian backbone&lt;br /&gt;
is specified in terms of a necessary number of top-ranked common neighbors (regarding ego and alter associated with this link):&lt;br /&gt;
&lt;br /&gt;
* You can use the &#039;&#039;&#039;max ranking&#039;&#039;&#039; parameter to specify the maximal rank which is still regarded as a top-rank. That is, those outgoing neighbors that have been attached a rank greater than &#039;&#039;max ranking&#039;&#039; will not contribute in the redundancy calculation.&lt;br /&gt;
* You can use the &#039;&#039;&#039;min overlap&#039;&#039;&#039; parameter to specify a minimal required overlap of top-ranked common neighbors.&lt;br /&gt;
* You can use the &#039;&#039;&#039;conditioned&#039;&#039;&#039; parameter to specify for which pairs of actors the overlap is calculated:&lt;br /&gt;
** if selected (default), the overlap calculation is only performed for those links which have been top-ranked themselves&lt;br /&gt;
** if deselected, the overlap calculation is performed for each directed link in the ranked neighborhood graph.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Special cases&#039;&#039; (allowing other functionality):&lt;br /&gt;
Setting &#039;&#039;max ranking&#039;&#039; to zero will imply zero/undefined overlap values; thus, only the ranking functionality is used.&lt;br /&gt;
If &#039;&#039;restricted&#039;&#039; is true, non-top-ranked links have undefined overlap values and will be removed accordingly; set &#039;&#039;restricted&#039;&#039; to false to avoid undefined overlap values.&lt;br /&gt;
Setting &#039;&#039;min overlap&#039;&#039; to zero will imply that only links with undefined overlap value are removed from the network; thus, the filtering does only take into account the ranking.&lt;br /&gt;
&lt;br /&gt;
==== Non-parametric variant ====&lt;br /&gt;
&lt;br /&gt;
In the non-parametric variant of the transformation algorithm, a redundancy calculation is triggered for each link in the ranked neighborhood graph.&lt;br /&gt;
The redundancy is defined as the maximum Jaccard coefficient that is reach when iteratively comparing top ranked neighbors (including more and more ranks).&lt;br /&gt;
For a link to be included in the Simmelian backbone, the best found Jaccard coefficient has to be at least one half.&lt;br /&gt;
&lt;br /&gt;
==== Assessment of reciprocity ====&lt;br /&gt;
&lt;br /&gt;
For any of the two variants (parametric, or non-parametric redundancy assessment), you can decide whether ego is identified with alter in the redundancy calculations,&lt;br /&gt;
i.e. reciprocity within top ranks is counted as overlap, or whether those entries in the ranked neighborhoods are not taken into account.&lt;br /&gt;
&lt;br /&gt;
== Result ==&lt;br /&gt;
&lt;br /&gt;
For convenience, if &#039;&#039;&#039;layout&#039;&#039;&#039; is selected, visone&#039;s &#039;&#039;quick layout&#039;&#039; functionality is used to visualize the modified network structure at the end of the algorithm;&lt;br /&gt;
otherwise, all node positions remain as before.&lt;br /&gt;
&lt;br /&gt;
[[File:simmelian-backbone-result.png]]&lt;br /&gt;
&lt;br /&gt;
Use &#039;&#039;&#039;apply to&#039;&#039;&#039; to select the network(s) for which the calculations shall be performed.&lt;br /&gt;
Since the network structure is altered by the algorithm, &#039;&#039;&#039;result in&#039;&#039;&#039; a &#039;&#039;new network&#039;&#039; rather than &#039;&#039;this network&#039;&#039; is proposed as default.&lt;br /&gt;
The calculation is triggered by clicking the &#039;&#039;&#039;transform&#039;&#039;&#039; button at the bottom.&lt;/div&gt;</summary>
		<author><name>Nick</name></author>
	</entry>
	<entry>
		<id>https://visone.ethz.ch/wiki/index.php?title=File:Simmelian-backbone-result.png&amp;diff=1315</id>
		<title>File:Simmelian-backbone-result.png</title>
		<link rel="alternate" type="text/html" href="https://visone.ethz.ch/wiki/index.php?title=File:Simmelian-backbone-result.png&amp;diff=1315"/>
		<updated>2013-04-18T22:26:54Z</updated>

		<summary type="html">&lt;p&gt;Nick: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&lt;/div&gt;</summary>
		<author><name>Nick</name></author>
	</entry>
	<entry>
		<id>https://visone.ethz.ch/wiki/index.php?title=File:Simmelian-backbone-config.png&amp;diff=1314</id>
		<title>File:Simmelian-backbone-config.png</title>
		<link rel="alternate" type="text/html" href="https://visone.ethz.ch/wiki/index.php?title=File:Simmelian-backbone-config.png&amp;diff=1314"/>
		<updated>2013-04-18T22:26:39Z</updated>

		<summary type="html">&lt;p&gt;Nick: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&lt;/div&gt;</summary>
		<author><name>Nick</name></author>
	</entry>
	<entry>
		<id>https://visone.ethz.ch/wiki/index.php?title=File:Simmelian-backbone-find.png&amp;diff=1313</id>
		<title>File:Simmelian-backbone-find.png</title>
		<link rel="alternate" type="text/html" href="https://visone.ethz.ch/wiki/index.php?title=File:Simmelian-backbone-find.png&amp;diff=1313"/>
		<updated>2013-04-18T21:39:07Z</updated>

		<summary type="html">&lt;p&gt;Nick: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&lt;/div&gt;</summary>
		<author><name>Nick</name></author>
	</entry>
	<entry>
		<id>https://visone.ethz.ch/wiki/index.php?title=Triadic_cohesion_clustering&amp;diff=1311</id>
		<title>Triadic cohesion clustering</title>
		<link rel="alternate" type="text/html" href="https://visone.ethz.ch/wiki/index.php?title=Triadic_cohesion_clustering&amp;diff=1311"/>
		<updated>2013-02-10T13:31:27Z</updated>

		<summary type="html">&lt;p&gt;Nick: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&#039;&#039;&#039;Note: this page documents a visone functionality that will be in the next release.&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
More background information is presented at XXXIII Sunbelt Social Networks Conference of the International Network for Social Network Analysis (INSNA),&lt;br /&gt;
Hamburg, Germany, May 21-26, 2013:&lt;br /&gt;
&lt;br /&gt;
*  Bobo Nick, Conrad Lee, Pádraig Cunningham, Ulrik Brandes: &amp;quot;Triadic Cohesion in Social Networks&amp;quot;&lt;br /&gt;
&lt;br /&gt;
Please address questions and comments to [[User:Nick|Bobo Nick]].&lt;br /&gt;
&lt;br /&gt;
== Where to find ==&lt;br /&gt;
&lt;br /&gt;
Access is given via the [[analysis tab]] in the left-hand side of the visone window:&lt;br /&gt;
set &#039;&#039;level&#039;&#039; to &#039;&#039;&#039;grouping&#039;&#039;&#039;, set &#039;&#039;class&#039;&#039; to &#039;&#039;&#039;clustering&#039;&#039;&#039;, and set &#039;&#039;measure&#039;&#039; to &#039;&#039;&#039;triadic cohesion clustering (TCC)&#039;&#039;&#039;.&lt;br /&gt;
&lt;br /&gt;
[[File:Tcc-wheretofind.png]]&lt;br /&gt;
&lt;br /&gt;
== How to use ==&lt;br /&gt;
&lt;br /&gt;
=== Ranking calculation ===&lt;br /&gt;
&lt;br /&gt;
For each node, the algorithm will rank its outgoing neighbors according to an associated &#039;&#039;&#039;link strength&#039;&#039;&#039; attribute.&lt;br /&gt;
For this purpose, undirected links will be initially split into reciprocal pairs of directed links.&lt;br /&gt;
&lt;br /&gt;
* If &#039;&#039;uniform&#039;&#039; is selected (default), links are first weighted according to their Simmelian strength and afterwards ranked according to this newly created link attribute (termed &#039;&#039;triadType300&#039;&#039;).&lt;br /&gt;
* &#039;&#039;Otherwise&#039;&#039;, the rankings will be calculated according to the link strength attribute that was provided. (For technical reasons, if the selected link strength attribute is termed &#039;&#039;rank&#039;&#039; or &#039;&#039;overlap&#039;&#039; it will be renamed into &#039;&#039;tcc-weight (rank)&#039;&#039; or &#039;&#039;tcc-weight (overlap)&#039;&#039;, respectively.)&lt;br /&gt;
&lt;br /&gt;
The resulting neighborhood rankings are saved in a link attribute termed &#039;&#039;rank&#039;&#039;. (Neighbors with equal link strength will be equally ranked with the best available rank.)&lt;br /&gt;
&lt;br /&gt;
[[File:Tcc-configure.png]]&lt;br /&gt;
&lt;br /&gt;
=== Overlap calculation ===&lt;br /&gt;
&lt;br /&gt;
Next, for designated pairs of nodes, the algorithm will calculate the overlap of top-ranked other nodes in their neighborhoods.&lt;br /&gt;
Always, only the neighborhoods of connected pairs of actors will be compared. That is, each overlap comparison is associated with a directed link.&lt;br /&gt;
&lt;br /&gt;
You can use the &#039;&#039;&#039;restricted&#039;&#039;&#039; parameter to further restrict for which pairs of actors the overlap is calculated:&lt;br /&gt;
* if selected (default), the overlap calculation is only performed for those links which have been top-ranked themselves&lt;br /&gt;
* if deselected, the overlap calculation is performed for each directed link&lt;br /&gt;
&lt;br /&gt;
You can use the &#039;&#039;&#039;max ranking&#039;&#039;&#039; parameter to specify the maximal rank which is still regarded as a top-rank.&lt;br /&gt;
That is, those outgoing neighbors that have been attached a rank greater than &#039;&#039;max ranking&#039;&#039; will not contribute in an overlap calculation.&lt;br /&gt;
(Setting &#039;&#039;max ranking&#039;&#039; to zero will imply zero/undefined overlap values; thus, only the ranking functionality is used.)&lt;br /&gt;
&lt;br /&gt;
The resulting overlap values are saved in a link attribute termed &#039;&#039;overlap&#039;&#039;.&lt;br /&gt;
&lt;br /&gt;
=== Filtering and clustering ===&lt;br /&gt;
&lt;br /&gt;
You can use the &#039;&#039;&#039;min overlap&#039;&#039;&#039; parameter to specify a minimal required overlap for a corresponding link not to be removed from the network, after the overlap calculations are finished.&lt;br /&gt;
If &#039;&#039;restricted&#039;&#039; was true, non-top-ranked links have undefined overlap values and will be removed accordingly; set &#039;&#039;restricted&#039;&#039; to false to avoid undefined overlap values.&lt;br /&gt;
(Setting &#039;&#039;min overlap&#039;&#039; to zero will imply that only links with undefined overlap value are removed from the network; thus, the filtering does only take into account the ranking.)&lt;br /&gt;
&lt;br /&gt;
The network transformation implied by the specified ranking and overlap filtering shall simplify any subsequent clustering calculations.&lt;br /&gt;
In the text field right of &#039;&#039;&#039;to attribute&#039;&#039;&#039; you can specify the name of the node attribute &lt;br /&gt;
(default: &#039;&#039;&#039;triadic cohesion clustering (TCC)&#039;&#039;&#039;) in which preliminary cluster memberships are stored: visone&#039;s &#039;&#039;conductance cutting&#039;&#039; clustering algorithm with granularity parameter set to 0.2 is used to assign cluster memberships in the first place. Moreover, visone&#039;s &#039;&#039;quick layout&#039;&#039; functionality is used to visualize the modified network structure immediately.&lt;br /&gt;
&lt;br /&gt;
[[File:Tcc-apply.png]]&lt;br /&gt;
&lt;br /&gt;
Use &#039;&#039;&#039;apply to&#039;&#039;&#039; to select the network(s) for which the calculations shall be performed.&lt;br /&gt;
Since the network structure is altered by the algorithm, you might want to show the &#039;&#039;&#039;result in&#039;&#039;&#039; a &#039;&#039;new network&#039;&#039; rather than &#039;&#039;this network&#039;&#039;.&lt;br /&gt;
Having set all these options click on the &#039;&#039;&#039;analyze&#039;&#039;&#039; button at the bottom.&lt;/div&gt;</summary>
		<author><name>Nick</name></author>
	</entry>
	<entry>
		<id>https://visone.ethz.ch/wiki/index.php?title=Triadic_cohesion_clustering&amp;diff=1310</id>
		<title>Triadic cohesion clustering</title>
		<link rel="alternate" type="text/html" href="https://visone.ethz.ch/wiki/index.php?title=Triadic_cohesion_clustering&amp;diff=1310"/>
		<updated>2013-02-10T12:24:31Z</updated>

		<summary type="html">&lt;p&gt;Nick: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&#039;&#039;&#039;Note: this page documents a visone functionality that will be in the next release.&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
More background information is presented at XXXIII Sunbelt Social Networks Conference of the International Network for Social Network Analysis (INSNA),&lt;br /&gt;
Hamburg, Germany, May 21-26, 2013:&lt;br /&gt;
&lt;br /&gt;
*  Bobo Nick, Conrad Lee, Pádraig Cunningham, Ulrik Brandes: &amp;quot;Triadic Cohesion in Social Networks&amp;quot;&lt;br /&gt;
&lt;br /&gt;
Please address questions and comments to [[User:Nick|Bobo Nick]].&lt;br /&gt;
&lt;br /&gt;
== Where to find ==&lt;br /&gt;
&lt;br /&gt;
Access is given via the [[analysis tab]] in the left-hand side of the visone window:&lt;br /&gt;
set &#039;&#039;level&#039;&#039; to &#039;&#039;&#039;grouping&#039;&#039;&#039;, set &#039;&#039;class&#039;&#039; to &#039;&#039;&#039;clustering&#039;&#039;&#039;, and set &#039;&#039;measure&#039;&#039; to &#039;&#039;&#039;triadic cohesion clustering (TCC)&#039;&#039;&#039;.&lt;br /&gt;
&lt;br /&gt;
[[File:Tcc-wheretofind.png]]&lt;br /&gt;
&lt;br /&gt;
== How to use ==&lt;br /&gt;
&lt;br /&gt;
=== Ranking calculation ===&lt;br /&gt;
&lt;br /&gt;
For each node, the algorithm will rank its outgoing neighbors according to an associated &#039;&#039;&#039;link strength&#039;&#039;&#039; attribute.&lt;br /&gt;
For this purpose, undirected links will be initially split into reciprocal pairs of directed links.&lt;br /&gt;
&lt;br /&gt;
* If &#039;&#039;uniform&#039;&#039; is selected (default), links are first weighted according to their Simmelian strength and afterwards ranked according to this newly created link attribute (termed &#039;&#039;triadType300&#039;&#039;).&lt;br /&gt;
* &#039;&#039;Otherwise&#039;&#039;, the rankings will be calculated according to the link strength attribute that was provided.&lt;br /&gt;
&lt;br /&gt;
The resulting neighborhood rankings are saved in a link attribute termed &#039;&#039;rank&#039;&#039;.&lt;br /&gt;
&lt;br /&gt;
[[File:Tcc-configure.png]]&lt;br /&gt;
&lt;br /&gt;
=== Overlap calculation ===&lt;br /&gt;
&lt;br /&gt;
Next, for designated pairs of nodes, the algorithm will calculate the overlap of top-ranked other nodes in their neighborhoods.&lt;br /&gt;
Always, only the neighborhoods of connected pairs of actors will be compared. That is, each overlap comparison is associated with a directed link.&lt;br /&gt;
&lt;br /&gt;
You can use the &#039;&#039;&#039;restricted&#039;&#039;&#039; parameter to further restrict for which pairs of actors the overlap is calculated:&lt;br /&gt;
* if selected (default), the overlap calculation is only performed for those links which have been top-ranked themselves&lt;br /&gt;
* if deselected, the overlap calculation is performed for each directed link&lt;br /&gt;
&lt;br /&gt;
You can use the &#039;&#039;&#039;max ranking&#039;&#039;&#039; parameter to specify the maximal rank which is still regarded as a top-rank.&lt;br /&gt;
That is, those outgoing neighbors that have been attached a rank greater than &#039;&#039;max ranking&#039;&#039; will not contribute in an overlap calculation.&lt;br /&gt;
(Setting &#039;&#039;max ranking&#039;&#039; to zero will imply zero/undefined overlap values; only the ranking functionality is used.)&lt;br /&gt;
&lt;br /&gt;
You can use the &#039;&#039;&#039;min overlap&#039;&#039;&#039; parameter to specify a minimal required overlap for a corresponding link not to be removed from the network when the overlap calculating are finished.&lt;br /&gt;
(Setting &#039;&#039;min overlap&#039;&#039; to zero will imply that only links with undefined overlap value are removed from the network; set &#039;&#039;restricted&#039;&#039; to false to avoid this.)&lt;br /&gt;
&lt;br /&gt;
The resulting overlap values are saved in a link attribute termed &#039;&#039;overlap&#039;&#039;.&lt;br /&gt;
&lt;br /&gt;
=== Clustering calculation ===&lt;br /&gt;
&lt;br /&gt;
The network transformation implied by the specified ranking and overlap filtering shall facilitate any subsequent clustering calculations.&lt;br /&gt;
In the text field right of &#039;&#039;&#039;to attribute&#039;&#039;&#039; you can specify the name of the node attribute &lt;br /&gt;
(default: &#039;&#039;&#039;triadic cohesion clustering (TCC)&#039;&#039;&#039;) in which preliminary cluster memberships are stored: visone&#039;s &#039;&#039;conductance cutting&#039;&#039; clustering algorithm with granularity parameter set to 0.2 is used to assign cluster memberships in the first place. Moreover, visone&#039;s &#039;&#039;quick layout&#039;&#039; functionality is used to visualize the modified network structure immediately.&lt;br /&gt;
&lt;br /&gt;
[[File:Tcc-apply.png]]&lt;br /&gt;
&lt;br /&gt;
Use &#039;&#039;&#039;apply to&#039;&#039;&#039; to select the network(s) for which the calculations shall be performed.&lt;br /&gt;
Since the network structure is altered by the algorithm, you might want to show the &#039;&#039;&#039;result in&#039;&#039;&#039; a &#039;&#039;new network&#039;&#039; rather than &#039;&#039;this network&#039;&#039;.&lt;br /&gt;
Having set all these options click on the &#039;&#039;&#039;analyze&#039;&#039;&#039; button at the bottom.&lt;/div&gt;</summary>
		<author><name>Nick</name></author>
	</entry>
	<entry>
		<id>https://visone.ethz.ch/wiki/index.php?title=Triadic_cohesion_clustering&amp;diff=1309</id>
		<title>Triadic cohesion clustering</title>
		<link rel="alternate" type="text/html" href="https://visone.ethz.ch/wiki/index.php?title=Triadic_cohesion_clustering&amp;diff=1309"/>
		<updated>2013-02-10T12:10:59Z</updated>

		<summary type="html">&lt;p&gt;Nick: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&#039;&#039;&#039;Note: this page documents a visone functionality that will be in the next release.&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
More background information is presented at XXXIII Sunbelt Social Networks Conference of the International Network for Social Network Analysis (INSNA),&lt;br /&gt;
Hamburg, Germany, May 21-26, 2013:&lt;br /&gt;
&lt;br /&gt;
*  Bobo Nick, Conrad Lee, Pádraig Cunningham, Ulrik Brandes: &amp;quot;Triadic Cohesion in Social Networks&amp;quot;&lt;br /&gt;
&lt;br /&gt;
Please address questions and comments to [[User:Nick|Bobo Nick]].&lt;br /&gt;
&lt;br /&gt;
== Where to find ==&lt;br /&gt;
&lt;br /&gt;
Access is given via the [[analysis tab]] in the left-hand side of the visone window:&lt;br /&gt;
set &#039;&#039;level&#039;&#039; to &#039;&#039;&#039;grouping&#039;&#039;&#039;, set &#039;&#039;class&#039;&#039; to &#039;&#039;&#039;clustering&#039;&#039;&#039;, and set &#039;&#039;measure&#039;&#039; to &#039;&#039;&#039;triadic cohesion clustering (TCC)&#039;&#039;&#039;.&lt;br /&gt;
&lt;br /&gt;
[[File:Tcc-wheretofind.png]]&lt;br /&gt;
&lt;br /&gt;
== How to use ==&lt;br /&gt;
&lt;br /&gt;
=== Ranking calculation ===&lt;br /&gt;
&lt;br /&gt;
For each node, the algorithm will rank its outgoing neighbors according to an associated &#039;&#039;&#039;link strength&#039;&#039;&#039; attribute.&lt;br /&gt;
For this purpose, undirected links will be initially split into reciprocal pairs of directed links.&lt;br /&gt;
&lt;br /&gt;
* If &#039;&#039;uniform&#039;&#039; is selected (default), links are first weighted according to their Simmelian strength and afterwards ranked according to this newly created link attribute (termed &#039;&#039;triadType300&#039;&#039;).&lt;br /&gt;
* &#039;&#039;Otherwise&#039;&#039;, the rankings will be calculated according to the link strength attribute that was provided.&lt;br /&gt;
&lt;br /&gt;
The resulting neighborhood rankings are saved in a link attribute termed &#039;&#039;rank&#039;&#039;.&lt;br /&gt;
&lt;br /&gt;
[[File:Tcc-configure.png]]&lt;br /&gt;
&lt;br /&gt;
=== Overlap calculation ===&lt;br /&gt;
&lt;br /&gt;
Next, for designated pairs of nodes, the algorithm will calculate the overlap of top-ranked other nodes in their neighborhoods.&lt;br /&gt;
Always, only the neighborhoods of connected pairs of actors will be compared. That is, each overlap comparison is associated with a directed link.&lt;br /&gt;
&lt;br /&gt;
You can use the &#039;&#039;&#039;restricted&#039;&#039;&#039; parameter to further restrict for which pairs of actors the overlap is calculated:&lt;br /&gt;
* if selected (default), the overlap calculation is only performed for those links which have been top-ranked themselves&lt;br /&gt;
* if deselected, the overlap calculation is performed for each directed link&lt;br /&gt;
&lt;br /&gt;
You can use the &#039;&#039;&#039;max ranking&#039;&#039;&#039; parameter to specify the maximal rank which is still regarded as a top-rank.&lt;br /&gt;
That is, those links that have been attached a rank greater than &#039;&#039;max ranking&#039;&#039; will not trigger an overlap calculation.&lt;br /&gt;
(Setting &#039;&#039;max ranking&#039;&#039; to zero will imply zero/undefined overlap values.)&lt;br /&gt;
&lt;br /&gt;
You can use the &#039;&#039;&#039;min overlap&#039;&#039;&#039; parameter to specify a minimal required overlap for a corresponding link not to be removed from the network when the overlap calculating are finished.&lt;br /&gt;
(Setting &#039;&#039;min overlap&#039;&#039; to zero will imply that only links with undefined overlap value are removed from the network.)&lt;br /&gt;
&lt;br /&gt;
The resulting overlap values are saved in a link attribute termed &#039;&#039;overlap&#039;&#039;.&lt;br /&gt;
&lt;br /&gt;
=== Clustering calculation ===&lt;br /&gt;
&lt;br /&gt;
The network transformation implied by the specified edge filtering shall facilitate subsequent clustering calculations.&lt;br /&gt;
In the text field right of &#039;&#039;&#039;to attribute&#039;&#039;&#039; you can specify the name of the node attribute &lt;br /&gt;
(default: &#039;&#039;&#039;triadic cohesion clustering (TCC)&#039;&#039;&#039;) in which preliminary cluster memberships are stored: visone&#039;s &#039;&#039;conductance cutting&#039;&#039; clustering algorithm with granularity parameter set to 0.2 is used to assign cluster memberships in the first place. Moreover, visone&#039;s &#039;&#039;quick layout&#039;&#039; functionality is used to visualize the modified network structure.&lt;br /&gt;
&lt;br /&gt;
[[File:Tcc-apply.png]]&lt;br /&gt;
&lt;br /&gt;
Use &#039;&#039;&#039;apply to&#039;&#039;&#039; to select the network(s) for which the calculations shall be performed.&lt;br /&gt;
Since the network structure is altered by the algorithm, you might want to show the &#039;&#039;&#039;result in&#039;&#039;&#039; a &#039;&#039;new network&#039;&#039; rather than &#039;&#039;this network&#039;&#039;.&lt;br /&gt;
Having set all these options click on the &#039;&#039;&#039;analyze&#039;&#039;&#039; button at the bottom.&lt;/div&gt;</summary>
		<author><name>Nick</name></author>
	</entry>
	<entry>
		<id>https://visone.ethz.ch/wiki/index.php?title=Triadic_cohesion_clustering&amp;diff=1308</id>
		<title>Triadic cohesion clustering</title>
		<link rel="alternate" type="text/html" href="https://visone.ethz.ch/wiki/index.php?title=Triadic_cohesion_clustering&amp;diff=1308"/>
		<updated>2013-02-09T22:36:29Z</updated>

		<summary type="html">&lt;p&gt;Nick: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&#039;&#039;&#039;Note: this page documents a visone functionality that will be in the next release.&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
More background information is presented at XXXIII Sunbelt Social Networks Conference of the International Network for Social Network Analysis (INSNA),&lt;br /&gt;
Hamburg, Germany, May 21-26, 2013:&lt;br /&gt;
&lt;br /&gt;
*  Bobo Nick, Conrad Lee, Pádraig Cunningham, Ulrik Brandes: &amp;quot;Triadic Cohesion in Social Networks&amp;quot;&lt;br /&gt;
&lt;br /&gt;
Please address questions and comments to [[User:Nick|Bobo Nick]].&lt;br /&gt;
&lt;br /&gt;
== Where to find ==&lt;br /&gt;
&lt;br /&gt;
Access is given via the [[analysis tab]] in the left-hand side of the visone window:&lt;br /&gt;
set &#039;&#039;level&#039;&#039; to &#039;&#039;&#039;grouping&#039;&#039;&#039;, set &#039;&#039;class&#039;&#039; to &#039;&#039;&#039;clustering&#039;&#039;&#039;, and set &#039;&#039;measure&#039;&#039; to &#039;&#039;&#039;triadic cohesion clustering (TCC)&#039;&#039;&#039;.&lt;br /&gt;
&lt;br /&gt;
[[File:Tcc-wheretofind.png]]&lt;br /&gt;
&lt;br /&gt;
== How to use ==&lt;br /&gt;
&lt;br /&gt;
=== Configuration ===&lt;br /&gt;
&lt;br /&gt;
==== link strength ====&lt;br /&gt;
&lt;br /&gt;
For each node, the algorithm will rank its neighborhood (outgoing links) according to the provided link strength attribute.&lt;br /&gt;
* If &#039;&#039;&#039;uniform&#039;&#039;&#039; is selected (default), links are first weighted according to their Simmelian strength and afterwards ranked according to this newly created link attribute (termed &#039;&#039;triadType300&#039;&#039;).&lt;br /&gt;
* &#039;&#039;&#039;Otherwise&#039;&#039;&#039;, the rankings will be calculated according to the link strength attribute that was provided.&lt;br /&gt;
&lt;br /&gt;
[[File:Tcc-configure.png]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
For designated pairs of nodes, the algorithm will calculate the overlap of top-ranked other nodes in their neighborhoods.&lt;br /&gt;
Only connected pairs of actors will be compared.&lt;br /&gt;
&lt;br /&gt;
==== restricted ====&lt;br /&gt;
&lt;br /&gt;
Use this parameter to further restrict for which pairs of actors the overlap of top-ranked neighborhoods is calculated:&lt;br /&gt;
&lt;br /&gt;
* if selected (default), the overlap calculation is restricted to those links which have been top-ranked themselves&lt;br /&gt;
* if de-selected, the overlap calculation is performed for each pair of connected actors&lt;br /&gt;
&lt;br /&gt;
==== max ranking ====&lt;br /&gt;
&lt;br /&gt;
You can use the &#039;&#039;max ranking&#039;&#039; parameter to specify the maximal rank which is still reagrded as top-rank.&lt;br /&gt;
That is, those neighbors that have been attached a rank greater than &#039;&#039;max ranking&#039;&#039; will be disregarded when calculating the overlap.&lt;br /&gt;
(Setting &#039;&#039;max ranking&#039;&#039; to zero will imply zero/undefined overlap values.)&lt;br /&gt;
&lt;br /&gt;
==== min overlap ====&lt;br /&gt;
&lt;br /&gt;
You can use the &#039;&#039;min overlap&#039;&#039; parameter to specify a minimal required overlap for the corresponding link not to be removed from the network.&lt;br /&gt;
Setting &#039;&#039;min overlap&#039;&#039; to zero will imply that only links with undefined overlap value are removed from the network.&lt;br /&gt;
&lt;br /&gt;
=== Execution and result ===&lt;br /&gt;
&lt;br /&gt;
The resulting neighborhood rankings are saved in a link attribute termed &#039;&#039;rank&#039;&#039;, the resulting overlap values are saved in a link attribute termed &#039;&#039;overlap&#039;&#039;.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[File:Tcc-apply.png]]&lt;/div&gt;</summary>
		<author><name>Nick</name></author>
	</entry>
	<entry>
		<id>https://visone.ethz.ch/wiki/index.php?title=Triadic_cohesion_clustering&amp;diff=1307</id>
		<title>Triadic cohesion clustering</title>
		<link rel="alternate" type="text/html" href="https://visone.ethz.ch/wiki/index.php?title=Triadic_cohesion_clustering&amp;diff=1307"/>
		<updated>2013-02-09T21:49:29Z</updated>

		<summary type="html">&lt;p&gt;Nick: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&#039;&#039;&#039;Note: this page documents a visone functionality that will be in the next release.&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
More background information is presented at XXXIII Sunbelt Social Networks Conference of the International Network for Social Network Analysis (INSNA),&lt;br /&gt;
Hamburg, Germany, May 21-26, 2013:&lt;br /&gt;
&lt;br /&gt;
*  Bobo Nick, Conrad Lee, Pádraig Cunningham, Ulrik Brandes: &amp;quot;Triadic Cohesion in Social Networks&amp;quot;&lt;br /&gt;
&lt;br /&gt;
Please address questions and comments to [[User:Nick|Bobo Nick]].&lt;br /&gt;
&lt;br /&gt;
== Where to find ==&lt;br /&gt;
&lt;br /&gt;
Access is given via the [[analysis tab]] in the left-hand side of the visone window:&lt;br /&gt;
set &#039;&#039;level&#039;&#039; to &#039;&#039;&#039;grouping&#039;&#039;&#039;, set &#039;&#039;class&#039;&#039; to &#039;&#039;&#039;clustering&#039;&#039;&#039;, and set &#039;&#039;measure&#039;&#039; to &#039;&#039;&#039;triadic cohesion clustering (TCC)&#039;&#039;&#039;.&lt;br /&gt;
&lt;br /&gt;
[[File:Tcc-wheretofind.png]]&lt;br /&gt;
&lt;br /&gt;
== How to use ==&lt;br /&gt;
&lt;br /&gt;
=== Configuration ===&lt;br /&gt;
&lt;br /&gt;
[[File:Tcc-configure.png]]&lt;br /&gt;
&lt;br /&gt;
==== link strength ====&lt;br /&gt;
&lt;br /&gt;
For each node, the algorithm will rank its neighborhood (outgoing links) according to the provided link strength attribute.&lt;br /&gt;
* If &#039;&#039;&#039;uniform&#039;&#039;&#039; is selected (default), links are first weighted according to their Simmelian strength and afterwards ranked according to this newly created link attribute (termed &#039;&#039;triadType300&#039;&#039;).&lt;br /&gt;
* &#039;&#039;&#039;Otherwise&#039;&#039;&#039;, the rankings will be calculated according to the link strength attribute that was provided.&lt;br /&gt;
&lt;br /&gt;
==== min overlap ====&lt;br /&gt;
&lt;br /&gt;
This parameter allows to specify a threshold for the minimal required overlap for a link not to be removed from the network; see next paragraphs for more information on the calculation of the overlap. Setting &#039;&#039;min overlap&#039;&#039; to zero will imply that the overlap value has no effect with regard to removing links from the network.&lt;br /&gt;
&lt;br /&gt;
==== max ranking ====&lt;br /&gt;
&lt;br /&gt;
Given a pair of nodes, the algorithm will calculate the overlap of top-ranked other nodes in their neighborhoods.&lt;br /&gt;
You can use the &#039;&#039;max ranking&#039;&#039; parameter to specify the maximum rank which is still reagrded as top-rank.&lt;br /&gt;
That is, those neighbors that have been attached a rank greater than &#039;&#039;max ranking&#039;&#039; will be disregarded when calculating the overlap.&lt;br /&gt;
(Setting &#039;&#039;max ranking&#039;&#039; to zero will imply zero/undefined overlap values.)&lt;br /&gt;
&lt;br /&gt;
==== restricted ====&lt;br /&gt;
&lt;br /&gt;
Use this parameter to define for which pairs of actors the overlap of top-ranked neighborhoods is calculated:&lt;br /&gt;
&lt;br /&gt;
* if selected (default), the overlap calculation is restricted to those links which have been top-ranked themselves&lt;br /&gt;
* if de-selected, the overlap calculation is performed for each pair of connected actors&lt;br /&gt;
&lt;br /&gt;
=== Execution and result ===&lt;br /&gt;
&lt;br /&gt;
The resulting neighborhood rankings are saved in a link attribute termed &#039;&#039;rank&#039;&#039;, the resulting overlap values are saved in a link attribute termed &#039;&#039;overlap&#039;&#039;.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[File:Tcc-apply.png]]&lt;/div&gt;</summary>
		<author><name>Nick</name></author>
	</entry>
	<entry>
		<id>https://visone.ethz.ch/wiki/index.php?title=Triadic_cohesion_clustering&amp;diff=1306</id>
		<title>Triadic cohesion clustering</title>
		<link rel="alternate" type="text/html" href="https://visone.ethz.ch/wiki/index.php?title=Triadic_cohesion_clustering&amp;diff=1306"/>
		<updated>2013-02-09T21:11:18Z</updated>

		<summary type="html">&lt;p&gt;Nick: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&#039;&#039;&#039;Note: this page documents a visone functionality that will be in the next release.&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
More background information is presented at XXXIII Sunbelt Social Networks Conference of the International Network for Social Network Analysis (INSNA),&lt;br /&gt;
Hamburg, Germany, May 21-26, 2013:&lt;br /&gt;
&lt;br /&gt;
*  Bobo Nick, Conrad Lee, Pádraig Cunningham, Ulrik Brandes: &amp;quot;Triadic Cohesion in Social Networks&amp;quot;&lt;br /&gt;
&lt;br /&gt;
Please address questions and comments to [[User:Nick|Bobo Nick]].&lt;br /&gt;
&lt;br /&gt;
== Where to find ==&lt;br /&gt;
&lt;br /&gt;
Access is given via the [[analysis tab]] in the left-hand side of the visone window:&lt;br /&gt;
set &#039;&#039;level&#039;&#039; to &#039;&#039;&#039;grouping&#039;&#039;&#039;, set &#039;&#039;class&#039;&#039; to &#039;&#039;&#039;clustering&#039;&#039;&#039;, and set &#039;&#039;measure&#039;&#039; to &#039;&#039;&#039;triadic cohesion clustering (TCC)&#039;&#039;&#039;.&lt;br /&gt;
&lt;br /&gt;
[[File:Tcc-wheretofind.png]]&lt;br /&gt;
&lt;br /&gt;
== How to use ==&lt;br /&gt;
&lt;br /&gt;
=== Configuration ===&lt;br /&gt;
&lt;br /&gt;
[[File:Tcc-configure.png]]&lt;br /&gt;
&lt;br /&gt;
==== link strength ====&lt;br /&gt;
&lt;br /&gt;
For each node, the algorithm will rank its neighborhood (outgoing links) according to the provided link strength attribute.&lt;br /&gt;
* If &#039;&#039;&#039;uniform&#039;&#039;&#039; is selected (default), links are first weighted according to their Simmelian strength and afterwards ranked according to this newly created link attribute (termed &#039;&#039;triadType300&#039;&#039;).&lt;br /&gt;
* &#039;&#039;&#039;Otherwise&#039;&#039;&#039;, the rankings will be calculated according to the link strength attribute that was provided.&lt;br /&gt;
&lt;br /&gt;
The resulting neighborhood rankings are saved within a new link attribute termed &#039;&#039;rank&#039;&#039;.&lt;br /&gt;
&lt;br /&gt;
==== min overlap ====&lt;br /&gt;
&lt;br /&gt;
This parameter allows to specify a threshold for the minimal required overlap for a link not to be removed from the network; see next paragraphs for more information on the calculation of the overlap. Setting &#039;&#039;min overlap&#039;&#039; to zero will imply that the overlap value has no effect with regard to removing links from the network.&lt;br /&gt;
&lt;br /&gt;
==== max ranking ====&lt;br /&gt;
&lt;br /&gt;
Given a pair of nodes, the algorithm will calculate the overlap of top-ranked other nodes in their neighborhoods.&lt;br /&gt;
You can use the &#039;&#039;max ranking&#039;&#039; parameter to specify the maximum rank which is still reagrded as top-rank.&lt;br /&gt;
That is, those neighbors that have been attached a rank greater than &#039;&#039;max ranking&#039;&#039; will be disregarded when calculating the overlap.&lt;br /&gt;
&lt;br /&gt;
==== restricted ====&lt;br /&gt;
&lt;br /&gt;
Use this parameter to define for which pairs of actors the overlap of top-ranked neighborhoods is calculated:&lt;br /&gt;
&lt;br /&gt;
* if selected (default), the overlap calculation is restricted to those links which have been top-ranked themselves&lt;br /&gt;
* if de-selected, the overlap calculation is performed for each pair of connected actors&lt;br /&gt;
&lt;br /&gt;
=== Execution ===&lt;br /&gt;
&lt;br /&gt;
[[File:Tcc-apply.png]]&lt;/div&gt;</summary>
		<author><name>Nick</name></author>
	</entry>
	<entry>
		<id>https://visone.ethz.ch/wiki/index.php?title=Triadic_cohesion_clustering&amp;diff=1305</id>
		<title>Triadic cohesion clustering</title>
		<link rel="alternate" type="text/html" href="https://visone.ethz.ch/wiki/index.php?title=Triadic_cohesion_clustering&amp;diff=1305"/>
		<updated>2013-02-09T20:46:56Z</updated>

		<summary type="html">&lt;p&gt;Nick: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&#039;&#039;&#039;Note: this page documents a visone functionality that will be in the next release.&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
More background information is presented at XXXIII Sunbelt Social Networks Conference of the International Network for Social Network Analysis (INSNA),&lt;br /&gt;
Hamburg, Germany, May 21-26, 2013:&lt;br /&gt;
&lt;br /&gt;
*  Bobo Nick, Conrad Lee, Pádraig Cunningham, Ulrik Brandes: &amp;quot;Triadic Cohesion in Social Networks&amp;quot;&lt;br /&gt;
&lt;br /&gt;
Please address questions and comments to [[User:Nick|Bobo Nick]].&lt;br /&gt;
&lt;br /&gt;
== Where to find ==&lt;br /&gt;
&lt;br /&gt;
Access is given via the [[analysis tab]] in the left-hand side of the visone window:&lt;br /&gt;
set &#039;&#039;level&#039;&#039; to &#039;&#039;&#039;grouping&#039;&#039;&#039;, set &#039;&#039;class&#039;&#039; to &#039;&#039;&#039;clustering&#039;&#039;&#039;, and set &#039;&#039;measure&#039;&#039; to &#039;&#039;&#039;triadic cohesion clustering (TCC)&#039;&#039;&#039;.&lt;br /&gt;
&lt;br /&gt;
[[File:Tcc-wheretofind.png]]&lt;br /&gt;
&lt;br /&gt;
== How to use ==&lt;br /&gt;
&lt;br /&gt;
=== Configuration ===&lt;br /&gt;
&lt;br /&gt;
[[File:Tcc-configure.png]]&lt;br /&gt;
&lt;br /&gt;
==== link strength ====&lt;br /&gt;
&lt;br /&gt;
For each node, the algorithm will rank its neighborhood (outgoing links) according to the provided link strength attribute.&lt;br /&gt;
* If &#039;&#039;&#039;uniform&#039;&#039;&#039; is selected (default), links are first weighted according to their Simmelian strength and afterwards ranked according to this newly created link attribute (termed &#039;&#039;triadType300&#039;&#039;).&lt;br /&gt;
* &#039;&#039;&#039;Otherwise&#039;&#039;&#039;, the rankings will be calculated according to the link strength attribute that was provided.&lt;br /&gt;
&lt;br /&gt;
The resulting neighborhood rankings are saved within a new link attribute termed &#039;&#039;rank&#039;&#039;.&lt;br /&gt;
&lt;br /&gt;
==== min overlap ====&lt;br /&gt;
&lt;br /&gt;
This parameter allows to specify a threshold for the minimal required overlap for a link not be removed from the network; see next paragraphs for more information on the calculation of the overlap.&lt;br /&gt;
&lt;br /&gt;
==== max ranking ====&lt;br /&gt;
&lt;br /&gt;
Given a pair of nodes, the algorithm will calculate the overlap of top-ranked other nodes in their neighborhoods.&lt;br /&gt;
You can use the &#039;&#039;max ranking&#039;&#039; parameter to specify the maximum rank which is still reagrded as top-rank.&lt;br /&gt;
That is, those neighbors that have been attached a rank greater than &#039;&#039;max rank&#039;&#039; will be disregarded when calculating the overlap.&lt;br /&gt;
&lt;br /&gt;
==== restricted ====&lt;br /&gt;
&lt;br /&gt;
Use this parameter to decide for which pairs of actors the overlap of top-ranked neighborhoods is calculated.&lt;br /&gt;
&lt;br /&gt;
* if selected (default), the overlap calculation is restricted to those links which have been top-ranked themselves&lt;br /&gt;
* if de-selected, the overlap calculation is performed for each connected pair of actors&lt;br /&gt;
&lt;br /&gt;
=== Execution ===&lt;br /&gt;
&lt;br /&gt;
[[File:Tcc-apply.png]]&lt;/div&gt;</summary>
		<author><name>Nick</name></author>
	</entry>
	<entry>
		<id>https://visone.ethz.ch/wiki/index.php?title=Triadic_cohesion_clustering&amp;diff=1304</id>
		<title>Triadic cohesion clustering</title>
		<link rel="alternate" type="text/html" href="https://visone.ethz.ch/wiki/index.php?title=Triadic_cohesion_clustering&amp;diff=1304"/>
		<updated>2013-02-09T18:58:15Z</updated>

		<summary type="html">&lt;p&gt;Nick: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&#039;&#039;&#039;Note: this page documents a visone functionality that will be in the next release.&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
More background information is presented at XXXIII Sunbelt Social Networks Conference of the International Network for Social Network Analysis (INSNA),&lt;br /&gt;
Hamburg, Germany, May 21-26, 2013:&lt;br /&gt;
&lt;br /&gt;
*  Bobo Nick, Conrad Lee, Pádraig Cunningham, Ulrik Brandes: &amp;quot;Triadic Cohesion in Social Networks&amp;quot;&lt;br /&gt;
&lt;br /&gt;
Please address questions and comments to [[User:Nick|Bobo Nick]].&lt;br /&gt;
&lt;br /&gt;
== Where to find ==&lt;br /&gt;
&lt;br /&gt;
Access is given via the [[analysis tab]] in the left-hand side of the visone window:&lt;br /&gt;
set &#039;&#039;level&#039;&#039; to &#039;&#039;&#039;grouping&#039;&#039;&#039;, set &#039;&#039;class&#039;&#039; to &#039;&#039;&#039;clustering&#039;&#039;&#039;, and set &#039;&#039;measure&#039;&#039; to &#039;&#039;&#039;triadic cohesion clustering (TCC)&#039;&#039;&#039;.&lt;br /&gt;
&lt;br /&gt;
[[File:Tcc-wheretofind.png]]&lt;br /&gt;
&lt;br /&gt;
== How to use ==&lt;br /&gt;
&lt;br /&gt;
=== Configuration ===&lt;br /&gt;
&lt;br /&gt;
[[File:Tcc-configure.png]]&lt;br /&gt;
&lt;br /&gt;
==== link strength ====&lt;br /&gt;
&lt;br /&gt;
For each node, the algorithm will rank its neighborhood (outgoing links) according to the provided link strength attribute.&lt;br /&gt;
* If &#039;&#039;&#039;uniform&#039;&#039;&#039; is selected (default), links are first weighted according to their Simmelian strength and afterwards ranked according to this newly created link attribute (termed &#039;&#039;triadType300&#039;&#039;).&lt;br /&gt;
* &#039;&#039;&#039;Otherwise&#039;&#039;&#039;, the rankings will be calculated according to the link strength attribute that was provided.&lt;br /&gt;
&lt;br /&gt;
The neighborhood rankings are saved within a new link attribute termed &#039;&#039;rank&#039;&#039;.&lt;br /&gt;
&lt;br /&gt;
==== min overlap ====&lt;br /&gt;
&lt;br /&gt;
==== max ranking ====&lt;br /&gt;
&lt;br /&gt;
==== restricted ====&lt;br /&gt;
&lt;br /&gt;
=== Execution ===&lt;br /&gt;
&lt;br /&gt;
[[File:Tcc-apply.png]]&lt;/div&gt;</summary>
		<author><name>Nick</name></author>
	</entry>
	<entry>
		<id>https://visone.ethz.ch/wiki/index.php?title=Triadic_cohesion_clustering&amp;diff=1303</id>
		<title>Triadic cohesion clustering</title>
		<link rel="alternate" type="text/html" href="https://visone.ethz.ch/wiki/index.php?title=Triadic_cohesion_clustering&amp;diff=1303"/>
		<updated>2013-02-09T18:26:44Z</updated>

		<summary type="html">&lt;p&gt;Nick: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&#039;&#039;&#039;Note: this page documents a visone functionality that will be in the next release.&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
More background information is presented at XXXIII Sunbelt Social Networks Conference of the International Network for Social Network Analysis (INSNA),&lt;br /&gt;
Hamburg, Germany, May 21-26, 2013:&lt;br /&gt;
&lt;br /&gt;
*  Bobo Nick, Conrad Lee, Pádraig Cunningham, Ulrik Brandes: &amp;quot;Triadic Cohesion in Social Networks&amp;quot;&lt;br /&gt;
&lt;br /&gt;
Please address questions and comments to [[User:Nick|Bobo Nick]].&lt;br /&gt;
&lt;br /&gt;
== Where to find ==&lt;br /&gt;
&lt;br /&gt;
Access is given via the [[analysis tab]] in the left-hand side of the visone window:&lt;br /&gt;
set &#039;&#039;level&#039;&#039; to &#039;&#039;&#039;grouping&#039;&#039;&#039;, set &#039;&#039;class&#039;&#039; to &#039;&#039;&#039;clustering&#039;&#039;&#039;, and set &#039;&#039;measure&#039;&#039; to &#039;&#039;&#039;triadic cohesion clustering (TCC)&#039;&#039;&#039;.&lt;br /&gt;
&lt;br /&gt;
[[File:Tcc-wheretofind.png]]&lt;br /&gt;
&lt;br /&gt;
== How to use ==&lt;br /&gt;
&lt;br /&gt;
=== Configuration ===&lt;br /&gt;
&lt;br /&gt;
[[File:Tcc-configure.png]]&lt;br /&gt;
&lt;br /&gt;
=== Execution ===&lt;br /&gt;
&lt;br /&gt;
[[File:Tcc-apply.png]]&lt;/div&gt;</summary>
		<author><name>Nick</name></author>
	</entry>
	<entry>
		<id>https://visone.ethz.ch/wiki/index.php?title=Triadic_cohesion_clustering&amp;diff=1302</id>
		<title>Triadic cohesion clustering</title>
		<link rel="alternate" type="text/html" href="https://visone.ethz.ch/wiki/index.php?title=Triadic_cohesion_clustering&amp;diff=1302"/>
		<updated>2013-02-09T18:10:09Z</updated>

		<summary type="html">&lt;p&gt;Nick: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&#039;&#039;&#039;Note: this page documents a visone functionality that will be in the next release.&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
More background information is presented at XXXIII Sunbelt Social Networks Conference of the International Network for Social Network Analysis (INSNA),&lt;br /&gt;
Hamburg, Germany, May 21-26, 2013:&lt;br /&gt;
&lt;br /&gt;
*  Bobo Nick, Conrad Lee, Pádraig Cunningham, Ulrik Brandes: &amp;quot;Triadic Cohesion in Social Networks&amp;quot;&lt;br /&gt;
&lt;br /&gt;
Please address questions and comments to [[User:Nick|Bobo Nick]].&lt;br /&gt;
&lt;br /&gt;
== where to find ==&lt;br /&gt;
&lt;br /&gt;
[[File:Tcc-wheretofind.png]]&lt;br /&gt;
&lt;br /&gt;
== how to use ==&lt;br /&gt;
&lt;br /&gt;
=== configuration ===&lt;br /&gt;
&lt;br /&gt;
[[File:Tcc-configure.png]]&lt;br /&gt;
&lt;br /&gt;
=== execution ===&lt;br /&gt;
&lt;br /&gt;
[[File:Tcc-apply.png]]&lt;/div&gt;</summary>
		<author><name>Nick</name></author>
	</entry>
	<entry>
		<id>https://visone.ethz.ch/wiki/index.php?title=File:Tcc-apply.png&amp;diff=1301</id>
		<title>File:Tcc-apply.png</title>
		<link rel="alternate" type="text/html" href="https://visone.ethz.ch/wiki/index.php?title=File:Tcc-apply.png&amp;diff=1301"/>
		<updated>2013-02-09T18:07:36Z</updated>

		<summary type="html">&lt;p&gt;Nick: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&lt;/div&gt;</summary>
		<author><name>Nick</name></author>
	</entry>
	<entry>
		<id>https://visone.ethz.ch/wiki/index.php?title=File:Tcc-configure.png&amp;diff=1300</id>
		<title>File:Tcc-configure.png</title>
		<link rel="alternate" type="text/html" href="https://visone.ethz.ch/wiki/index.php?title=File:Tcc-configure.png&amp;diff=1300"/>
		<updated>2013-02-09T18:07:15Z</updated>

		<summary type="html">&lt;p&gt;Nick: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&lt;/div&gt;</summary>
		<author><name>Nick</name></author>
	</entry>
	<entry>
		<id>https://visone.ethz.ch/wiki/index.php?title=File:Tcc-wheretofind.png&amp;diff=1299</id>
		<title>File:Tcc-wheretofind.png</title>
		<link rel="alternate" type="text/html" href="https://visone.ethz.ch/wiki/index.php?title=File:Tcc-wheretofind.png&amp;diff=1299"/>
		<updated>2013-02-09T18:06:33Z</updated>

		<summary type="html">&lt;p&gt;Nick: uploaded a new version of &amp;amp;quot;File:Tcc-wheretofind.png&amp;amp;quot;&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&lt;/div&gt;</summary>
		<author><name>Nick</name></author>
	</entry>
	<entry>
		<id>https://visone.ethz.ch/wiki/index.php?title=File:Tcc-wheretofind.png&amp;diff=1298</id>
		<title>File:Tcc-wheretofind.png</title>
		<link rel="alternate" type="text/html" href="https://visone.ethz.ch/wiki/index.php?title=File:Tcc-wheretofind.png&amp;diff=1298"/>
		<updated>2013-02-09T17:50:08Z</updated>

		<summary type="html">&lt;p&gt;Nick: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&lt;/div&gt;</summary>
		<author><name>Nick</name></author>
	</entry>
	<entry>
		<id>https://visone.ethz.ch/wiki/index.php?title=Triadic_cohesion_clustering&amp;diff=1297</id>
		<title>Triadic cohesion clustering</title>
		<link rel="alternate" type="text/html" href="https://visone.ethz.ch/wiki/index.php?title=Triadic_cohesion_clustering&amp;diff=1297"/>
		<updated>2013-02-09T17:36:54Z</updated>

		<summary type="html">&lt;p&gt;Nick: Created page with &amp;quot;&amp;#039;&amp;#039;&amp;#039;Note: this page documents a visone functionality that will be in the next release.&amp;#039;&amp;#039;&amp;#039;  More background information is presented at XXXIII Sunbelt Social Networks Conference of...&amp;quot;&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&#039;&#039;&#039;Note: this page documents a visone functionality that will be in the next release.&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
More background information is presented at XXXIII Sunbelt Social Networks Conference of the International Network for Social Network Analysis (INSNA),&lt;br /&gt;
Hamburg, Germany, May 21-26, 2013:&lt;br /&gt;
&lt;br /&gt;
*  Bobo Nick, Conrad Lee, Pádraig Cunningham, Ulrik Brandes: &amp;quot;Triadic Cohesion in Social Networks&amp;quot;&lt;br /&gt;
&lt;br /&gt;
Please address questions and comments to [[User:Nick|Bobo Nick]].&lt;/div&gt;</summary>
		<author><name>Nick</name></author>
	</entry>
	<entry>
		<id>https://visone.ethz.ch/wiki/index.php?title=Link_list&amp;diff=692</id>
		<title>Link list</title>
		<link rel="alternate" type="text/html" href="https://visone.ethz.ch/wiki/index.php?title=Link_list&amp;diff=692"/>
		<updated>2011-08-17T13:01:59Z</updated>

		<summary type="html">&lt;p&gt;Nick: Created page with &amp;quot;== data format ==  A link list is a line by line enumeration of dyadic information. Cells within each line have to be separated by the same delimiter  (semicolon, comma, colon or...&amp;quot;&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== data format ==&lt;br /&gt;
&lt;br /&gt;
A link list is a line by line enumeration of dyadic information.&lt;br /&gt;
Cells within each line have to be separated by the same delimiter  (semicolon, comma, colon or space). &lt;br /&gt;
&lt;br /&gt;
Specifically, the first two cells contain the identifiers for the source and target nodes, while all other cells contain link attribute values.&lt;br /&gt;
The first line of a link list might specify labels for the different cells.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Example (semicolon as delimiter, first line contains labels):&lt;br /&gt;
&lt;br /&gt;
 name;name;calls;texts&lt;br /&gt;
 Alice;Bob;2;5&lt;br /&gt;
 Charlie;Bob;0;1&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== data import ==&lt;br /&gt;
&lt;br /&gt;
Network data stored as link list in a .txt or .csv file can be read into visone via the menu &#039;&#039;&#039;file, open&#039;&#039;&#039;.&lt;br /&gt;
In the file open dialog choose &#039;&#039;files of type&#039;&#039; &#039;&#039;&#039;link list files (.txt, .csv)&#039;&#039;&#039; and select the appropriate file in the file browser.&lt;br /&gt;
&lt;br /&gt;
Clicking on &#039;&#039;ok&#039;&#039; opens an import options dialog. You have to specify, whether the first line contains cell labels and you have&lt;br /&gt;
to select the appropriate cell delimiter, which was used to separate different cells within single lines. The textframe field has only to be taken into account, if you want to use the chosen delimiter within any entry (i.e. the textframe tells visone to include a delimiter as part of an entry instead of staring a new entry).&lt;br /&gt;
If you are not sure about which settings to choose, select &#039;&#039;&#039;file view&#039;&#039;&#039; to have a glimpse at the content of the file.&lt;br /&gt;
&lt;br /&gt;
visone&#039;s link list reader is very fault-tolerant and tries to read as much as possible. New nodes and attributes are created on demand. Lines without at least two cells are ignored.&lt;/div&gt;</summary>
		<author><name>Nick</name></author>
	</entry>
	<entry>
		<id>https://visone.ethz.ch/wiki/index.php?title=.dl&amp;diff=691</id>
		<title>.dl</title>
		<link rel="alternate" type="text/html" href="https://visone.ethz.ch/wiki/index.php?title=.dl&amp;diff=691"/>
		<updated>2011-08-17T11:47:42Z</updated>

		<summary type="html">&lt;p&gt;Nick: Created page with &amp;quot;Descriptions of the UCINET file format (.dl) can be found on the web, e.g., [http://www.analytictech.com/networks/dataentry.htm here].&amp;quot;&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;Descriptions of the UCINET file format (.dl) can be found on the web, e.g., [http://www.analytictech.com/networks/dataentry.htm here].&lt;/div&gt;</summary>
		<author><name>Nick</name></author>
	</entry>
	<entry>
		<id>https://visone.ethz.ch/wiki/index.php?title=Supported_network_formats&amp;diff=690</id>
		<title>Supported network formats</title>
		<link rel="alternate" type="text/html" href="https://visone.ethz.ch/wiki/index.php?title=Supported_network_formats&amp;diff=690"/>
		<updated>2011-08-17T11:41:59Z</updated>

		<summary type="html">&lt;p&gt;Nick: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[.graphml|GraphML files (.graphml)]]&lt;br /&gt;
&lt;br /&gt;
[[adjacency matrix|adjacency matrix files (.txt or .csv)]]&lt;br /&gt;
&lt;br /&gt;
[[link list|link list files (.txt or .csv)]]&lt;br /&gt;
&lt;br /&gt;
[[.dl|UCINET .dl files (.dl)]]&lt;br /&gt;
&lt;br /&gt;
Pajek graph files (.net)&lt;br /&gt;
&lt;br /&gt;
edge list files (.el)&lt;br /&gt;
&lt;br /&gt;
Siena files (.dat)&lt;br /&gt;
&lt;br /&gt;
[[RSiena session file|RSiena session files]] (.txt or .csv or .dat or .prn)&lt;/div&gt;</summary>
		<author><name>Nick</name></author>
	</entry>
	<entry>
		<id>https://visone.ethz.ch/wiki/index.php?title=Installation_(tutorial)&amp;diff=654</id>
		<title>Installation (tutorial)</title>
		<link rel="alternate" type="text/html" href="https://visone.ethz.ch/wiki/index.php?title=Installation_(tutorial)&amp;diff=654"/>
		<updated>2011-04-12T09:34:28Z</updated>

		<summary type="html">&lt;p&gt;Nick: heap size&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;This [[Trails|trail]] explains how to download, install, and run visone and its various extensions.&lt;br /&gt;
To use the core visone program you&#039;ll need only to read the first section &#039;&#039;Installing visone&#039;&#039; and, potentially, the second section on the installation of the java runtime environment. The other sections explain how to install and run several extension packages that can be used in connection with visone.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Installing visone ==&lt;br /&gt;
&lt;br /&gt;
Installing visone is very simple. You can start it either from you local hard disk or use visone webstart. To download visone and start it from your &#039;&#039;&#039;local hard disk&#039;&#039;&#039; do the following two steps:&lt;br /&gt;
&lt;br /&gt;
# Go to the visone download page [http://visone.info/doku.php?id=download:index] and save the latest current version (e.g., visone.2.6.3.jar) on your hard disk, for instance, on your desktop.&lt;br /&gt;
# Execute the downloaded file (for instance, by double-clicking on it). The visone window opens and visone is ready for use!&lt;br /&gt;
(For larger projects, you might want to allocate more memory for the JVM [http://de.wikipedia.org/wiki/Java_Virtual_Machine] by executing the downloaded file from a command prompt: &amp;quot;java -Xmx256m -jar visone-2.6.3.jar&amp;quot; ...256m increases the default java heap size (128 MB) to 256 MB.)&lt;br /&gt;
&lt;br /&gt;
Even simpler is starting the program via &#039;&#039;&#039;visone webstart&#039;&#039;&#039;. To do this go to the visone Website [http://visone.info] and click on the link &#039;&#039;webstart visone&#039;&#039; in the green download box on the left. Tell your browser to execute the file &#039;&#039;visone.jnlp&#039;&#039;.&lt;br /&gt;
(note: visone webstart uses a maximum heap size of 256 MB by default)&lt;br /&gt;
&lt;br /&gt;
== Troubleshooting (I): installing the java runtime environment (JRE) ==&lt;br /&gt;
&lt;br /&gt;
If the visone window does not open and if you get a message similar to &amp;quot;cannot open file: visone-2.6.3.jar&amp;quot;, then it is most likely that the Java Runtime Environment (JRE) is not installed on your computer. In this case do the following steps.&lt;br /&gt;
&lt;br /&gt;
# Go to the Oracle Webpage [http://www.oracle.com/technetwork/java/javase/downloads/index.html].&lt;br /&gt;
# Search in the list for Java SE Runtime Environment (JRE) (version 6 or higher) and click on download. Follow the instructions.&lt;br /&gt;
# Once you have installed the JRE, do as described in the previous section.&lt;br /&gt;
&lt;br /&gt;
== Installing the R connection ==&lt;br /&gt;
&lt;br /&gt;
=== Rserve installation===&lt;br /&gt;
We assume that you have an [http://www.r-project.org R] installation running (install the latest version fitting to your system from the link).&lt;br /&gt;
For a connection between visone and R we additionally need the RServe packages.&lt;br /&gt;
You can install this package directly from R:&lt;br /&gt;
* start an R console (the R GUI under windows, or type &amp;quot;R&amp;quot; on a terminal in Linux/MacOS)&lt;br /&gt;
* in the R console run the command: &amp;lt;code&amp;gt;install.packages(&amp;quot;Rserve&amp;quot;, dependencies=T)&amp;lt;/code&amp;gt;&lt;br /&gt;
* make sure the installation completed successfully&lt;br /&gt;
* you can close R (i.e. by running the command &amp;lt;code&amp;gt;q()&amp;lt;/code&amp;gt;, no need to save anything)&lt;br /&gt;
Now, your R should be ready for visone.&lt;br /&gt;
&lt;br /&gt;
The following  subsections explain how to set the R connection properties in the [[option dialog]] (menu &#039;&#039;&#039;file, options&#039;&#039;&#039;).&lt;br /&gt;
&lt;br /&gt;
===basic connection properties===&lt;br /&gt;
Here you tell visone where your R installation resides.&lt;br /&gt;
On some systems this is not problematic, sometimes you have to give the exact place where R is installed.&lt;br /&gt;
If you try this on a Linux or MacOS, try not to touch anything.&lt;br /&gt;
If this does not work for you, configure the following options:&lt;br /&gt;
&lt;br /&gt;
* &amp;quot;use R in system path&amp;quot; - use this option if you have a regular R installation on a Linux or MacOS and the binary is in the path &lt;br /&gt;
* &amp;quot;path to R/Rserve dir&amp;quot; - if the first option does not work for you (or you want to start a specific R installation) give the path to the executable here (the directory where the executable &amp;quot;RServe.exe&amp;quot; (Windows) or &amp;quot;R&amp;quot; (all other) file is located)&lt;br /&gt;
* &amp;quot;use Rserve&amp;quot; - if you are on a windows system, R needs to be started using a specific command, in this case check this box and give the path to the &amp;quot;Rserve.exe&amp;quot; to the option above&lt;br /&gt;
Sometimes it is necessary to copy the file &amp;quot;Rserve.exe&amp;quot; from the library section (i.e. &amp;lt;code&amp;gt;C:\Users\Peter\Documents\R&amp;lt;/code&amp;gt;) to the bin section (i.e. &amp;lt;code&amp;gt;C:\Program Files\R\R-2.12.2\bin\i386&amp;lt;/code&amp;gt;) of your R installation.&lt;br /&gt;
&lt;br /&gt;
===library configuration===&lt;br /&gt;
In some cases R has a problem to find its libraries when started from visone. If you experience problems with library installation, i.e. visone connects, but cannot install&lt;br /&gt;
libraries or send graphs to R, you can configure the location of your libraries here.&lt;br /&gt;
This is also an option to have a unique place where all the visone installed R libraries will reside.&lt;br /&gt;
The option is &lt;br /&gt;
* &amp;quot;library path&amp;quot; - paste the path were your libraries are installed or should be installed. Use &amp;quot;NULL&amp;quot; for default (system) path.&lt;br /&gt;
&lt;br /&gt;
===start your own R===&lt;br /&gt;
If you&#039;re planning to start R on a remote machine or the other options do not work for you, you can run your own instance of R and have visone connect to it:&lt;br /&gt;
* &amp;quot;don&#039;t start R, but use&amp;quot;  - check this if you would like visone to use an R instance started by you&lt;br /&gt;
* &amp;quot;server or ip&amp;quot; - give the name of the server or its ip adress&lt;br /&gt;
* &amp;quot;port&amp;quot; - the port visone should connect to&lt;br /&gt;
In case you have trouble connecting, you can always start your own R-session.&lt;br /&gt;
To do this, start the usual R console, make sure your completed the RServe installation (see above) and run:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;code&amp;gt;&lt;br /&gt;
library(Rserve)&lt;br /&gt;
&amp;lt;/code&amp;gt;&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;code&amp;gt;&lt;br /&gt;
Rserve()&lt;br /&gt;
&amp;lt;/code&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Starting visone on a computer prepared in this way should give you a proper connection to R.&lt;br /&gt;
&lt;br /&gt;
Learn more about R - especially RSiena and some more on the connection options in a&lt;br /&gt;
[http://visone.info/lib/exe/fetch.php?media=docs:visonesiena_man.pdf short guide on how to use Rsiena from within visone].&lt;br /&gt;
&lt;br /&gt;
== KNIME installation ==&lt;br /&gt;
&lt;br /&gt;
Get a copy of Knime from [http://www.knime.org http://www.knime.org] and install it.&lt;br /&gt;
&lt;br /&gt;
Now we need to install the &amp;quot;bison-plugin&amp;quot;, go to &amp;quot;Help-&amp;gt;Install new software&amp;quot;&lt;br /&gt;
add &amp;quot;http://tech.knime.org/update/bison&amp;quot; as update site and install the BisoNet plugin, especially &amp;quot;visone Integration&amp;quot; is needed.&lt;br /&gt;
&lt;br /&gt;
After this installation you should find a number of new nodes in the &amp;quot;BisoNet&amp;quot;-category which can be used to create, manipulate or analyze networks.&lt;br /&gt;
In the subcategory &amp;quot;visone&amp;quot; you find the &amp;quot;Input Connector&amp;quot;-Node which is used to receive networks from visone and the &amp;quot;Output-Connector&amp;quot;-Node, used to send networks&lt;br /&gt;
to visone.&lt;br /&gt;
&lt;br /&gt;
For a test, keep your Knime running, add an &amp;quot;Input Connector&amp;quot;-Node and start visone. See further details in the page [[Knime menu]].&lt;/div&gt;</summary>
		<author><name>Nick</name></author>
	</entry>
	<entry>
		<id>https://visone.ethz.ch/wiki/index.php?title=R_console_(tutorial)&amp;diff=632</id>
		<title>R console (tutorial)</title>
		<link rel="alternate" type="text/html" href="https://visone.ethz.ch/wiki/index.php?title=R_console_(tutorial)&amp;diff=632"/>
		<updated>2011-04-06T15:29:58Z</updated>

		<summary type="html">&lt;p&gt;Nick: /* Plotting to a PDF file */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;This [[Trails|trail]] illustrates how to send network data from visone to R and back. [http://www.r-project.org/ The R project] for statistical computing offers a rich set of methods for data analysis and modeling which becomes accessible from visone through the R console. We assume that you have installed the R connection as it is explained in the [[Installation_(trail)#Installing_the_R_connection|installation trail]]. This trail assumes that you have basic understanding about how to work with visone as it is, for instance, explained in the trail on [[Visualization_and_analysis_(trail)|visualization and analysis]]. You do &#039;&#039;not&#039;&#039; need to have any previous knowledge about R to follow this trail; nevertheless, to exploit the full potential offered by R you could consult documentation and tutorials linked from the [http://www.r-project.org/ R-project page].&lt;br /&gt;
&lt;br /&gt;
To follow the steps illustrated in this trail you should download the network file &#039;&#039;Egonet.graphml&#039;&#039; which is linked from and explained in the page [[Egoredes_(data)]]. Further you should remove all ties that are not rated as &#039;&#039;very likely&#039;&#039; in the same manner as it is explained in the last section of the [[Visualization_and_analysis_(trail)#Selecting_elements_dependent_on_attribute_values|visualization and analysis trail]].&lt;br /&gt;
&lt;br /&gt;
==Sending networks from visone to R==&lt;br /&gt;
&lt;br /&gt;
To send the network from visone to R open the [[R console tab]], choose a name in the textfield &#039;&#039;&#039;r name&#039;&#039;&#039; (you might just accept visone&#039;s suggestion for this name, which should be &#039;&#039;egonet&#039;&#039;), and click on the &#039;&#039;&#039;send&#039;&#039;&#039; button. After clicking on &#039;&#039;&#039;send&#039;&#039;&#039; visone starts the Rserve connection and opens the R-console. If this does not work you should check the settings of the [[Option_dialog#R_-_connection|R connection options]] accessible via the &#039;&#039;&#039;file, options&#039;&#039;&#039; menu. If it works you should get a message like&lt;br /&gt;
  ready to serve&lt;br /&gt;
  visone: sendActiveNet egonet&lt;br /&gt;
  done&lt;br /&gt;
  visone: lsIGraph&lt;br /&gt;
  &amp;quot;egonet&amp;quot; &lt;br /&gt;
in the message field of the R console.&lt;br /&gt;
&lt;br /&gt;
[[File:R_console_ls.png]]&lt;br /&gt;
&lt;br /&gt;
You can list all variables that are in the R workspace by typing&lt;br /&gt;
  ls()&lt;br /&gt;
in the input field at the bottom of the R console and pressing the Enter-Key (currently there is one object called &#039;&#039;egonet&#039;&#039;).&lt;br /&gt;
As we&#039;ll see soon, &#039;&#039;egonet&#039;&#039; is an object of class &#039;&#039;igraph&#039;&#039; which is an R package obtainable from a [http://cran.r-project.org/ CRAN Website] (this site also gives you access to R tutorials and documentation). The igraph package is documented in more detail on [http://igraph.sourceforge.net/ http://igraph.sourceforge.net/].&lt;br /&gt;
&lt;br /&gt;
==Getting basic statistics about an igraph object==&lt;br /&gt;
&lt;br /&gt;
The class of the object &#039;&#039;egonet&#039;&#039; in the R workshop is printed when executing the command &lt;br /&gt;
  class(egonet)&lt;br /&gt;
As we can see the class of &#039;&#039;egonet&#039;&#039; is &#039;&#039;igraph&#039;&#039;. The igraph documentation linked above gives a complete list of all methods available for this class. In the following we describe how to inspect what is encoded in the given object and how to get simple summary statistics.&lt;br /&gt;
Executing the command&lt;br /&gt;
  summary(egonet)&lt;br /&gt;
outputs basic information such as the number of vertices and edges, the names of vertex and edge attributes, as well as a list of all edges.&lt;br /&gt;
&lt;br /&gt;
[[File:R_console_summary.png]]&lt;br /&gt;
&lt;br /&gt;
=== Exploring attributes ===&lt;br /&gt;
&lt;br /&gt;
The names of all vertex or edge attributes are printed with&lt;br /&gt;
  list.vertex.attributes(egonet)&lt;br /&gt;
  list.edge.attributes(egonet)&lt;br /&gt;
To see the values of the vertex or edge attributes one needs to understand the concept of &#039;&#039;vertex iterators&#039;&#039; and &#039;&#039;edge iterators&#039;&#039; in igraph. The vertex iterator of graph &#039;&#039;egonet&#039;&#039; is returned by typing the command&lt;br /&gt;
  V(egonet)&lt;br /&gt;
When executing this you see just the list of vertex &#039;&#039;name&#039;&#039;s which are here the numbers from 1 to 45. To obtain the values of an attribute (e.g., &#039;&#039;Afrm&#039;&#039;) type&lt;br /&gt;
  V(egonet)$Afrm&lt;br /&gt;
which returns the vector of countries of origin of the various actors.&lt;br /&gt;
&lt;br /&gt;
[[File:R_console_afrm.png]]&lt;br /&gt;
&lt;br /&gt;
Useful summary statistics include information about how many actors originate from the various countries. However, typing the &lt;br /&gt;
command&lt;br /&gt;
  summary(V(egonet)$Afrm)&lt;br /&gt;
just outputs information about the class and size of the list of countries of origin:&lt;br /&gt;
  Length   Class      Mode &lt;br /&gt;
  45       character  character&lt;br /&gt;
which is not very informative. To obtain the list of unique values for the &#039;&#039;Afrm&#039;&#039; attribute, you can type&lt;br /&gt;
  unique(V(egonet)$Afrm)&lt;br /&gt;
which returns the names of five different countries. To count the number of actors in each of the countries, it is most convenient to convert the vector of character strings into a &#039;&#039;factor&#039;&#039; and save this factor in a new variable (e.g., called &#039;&#039;from&#039;&#039;) by typing the command&lt;br /&gt;
  from &amp;lt;- as.factor(V(egonet)$Afrm)&lt;br /&gt;
Finally the command&lt;br /&gt;
  summary(from)&lt;br /&gt;
returns the list of unique values along with the number of actors in each of the classes. In our example this is&lt;br /&gt;
  Colombia   Dominican Republic  Puerto Rico  Spain  United States &lt;br /&gt;
  2          14                  5            1      23&lt;br /&gt;
&lt;br /&gt;
=== Indexing of vertex and edge iterators ===&lt;br /&gt;
&lt;br /&gt;
[[File:R_console_iterator.png|400px|thumb|right]] Vertex iterators can be restricted to subsets by specifying a logical vector (or a command that produces one) in square brackets after the iterator. For instance, the command&lt;br /&gt;
  V(egonet)[2:5]&lt;br /&gt;
returns the values 3 to 6. This seeming contradiction is explained by the fact that counting of indices in vertex or edge iterators starts at zero; thus, the name of the vertex at position 0 is 1, the name of the vertex at position 2 is 3, and so on.&lt;br /&gt;
The result of such a restriction operation on an vertex iterator is itself a vertex iterator and, thus, provides access to vertex attributes. For instance, typing&lt;br /&gt;
  V(egonet)[2:5]$Afrm&lt;br /&gt;
returns the countries of origin of actors indexed by 2 to 5 (i.e., named 3 to 6). The command&lt;br /&gt;
  V(egonet)[Acit == &amp;quot;new york&amp;quot;]$Afrm&lt;br /&gt;
gives you the countries of origin of all actors whose attribute &#039;&#039;Acit&#039;&#039; (encoding the city of residence) equals &#039;&#039;new york&#039;&#039;, and so on. &lt;br /&gt;
&lt;br /&gt;
An edge iterator is returned via the command&lt;br /&gt;
  E(egonet)&lt;br /&gt;
and offers access to edge attributes similar as for vertices.&lt;br /&gt;
&lt;br /&gt;
Vertex iterators and edge iterators can be indexed by more complex conditions. Actually, any logical vector whose length equals the number of vertices (respectively edges) can be used as an argument in the square brackets following vertex iterators (respectively edge iterators).  The following lines illustrate such indexing tasks. To select all actors whose origin is in the US and save this iterator in a variable &#039;&#039;actors.from.usa&#039;&#039; type&lt;br /&gt;
  actors.from.usa &amp;lt;- V(egonet)[Afrm  == &amp;quot;United States&amp;quot;]&lt;br /&gt;
All edges connecting two actors from the US are obtained by&lt;br /&gt;
  edges.within.usa &amp;lt;- E(egonet)[actors.from.usa %--% actors.from.usa]&lt;br /&gt;
The command &#039;&#039;%--%&#039;&#039; is a special command used in edge iterators between two vertex iterators; it selects all edges connecting vertices from the two specified subsets (which might be identical, as in the example above).&lt;br /&gt;
Edges with at least one actor from the US are selected by&lt;br /&gt;
  edges.incident.usa &amp;lt;- E(egonet)[adj(actors.from.usa)]&lt;br /&gt;
&lt;br /&gt;
To select all edges within any of the classes defined by Afrm we first construct a logical vector for edges that is true if and only if the &#039;&#039;Afrm&#039;&#039; attribute of the two connected vertices is identical and then use it as an argument in &#039;&#039;E(egonet)[...]&#039;&#039;. Therefore type&lt;br /&gt;
  el &amp;lt;- get.edgelist(egonet) +1 &lt;br /&gt;
  within.class.edges &amp;lt;- V(egonet)[el[,1]]$Afrm == V(egonet)[el[,2]]$Afrm&lt;br /&gt;
  E(egonet)[within.class.edges]&lt;br /&gt;
The variable &#039;&#039;el&#039;&#039; is just a matrix with two columns containing the vertex ids of adjacent vertices. The &#039;&#039;+1&#039;&#039; in the first line is necessary because ids start with zero.&lt;br /&gt;
&lt;br /&gt;
Vertex and edge iterators can be restricted in various other ways; see the [http://igraph.sourceforge.net/ igraph documentation for details].&lt;br /&gt;
&lt;br /&gt;
== Analyzing distributions of centralities in igraph ==&lt;br /&gt;
&lt;br /&gt;
The igraph package offers methods to compute various established centrality measures (refer to the [http://igraph.sourceforge.net/ igraph documentation] for a complete list of available methods). While many of these could also be directly computed in visone without the detour via the R console, R directly offers statistical descriptions and analysis of the computed values. This is demonstrated in the following. The vertex degrees are returned by the command&lt;br /&gt;
  degree(egonet)&lt;br /&gt;
Let&#039;s save this vector in a variable &#039;&#039;d&#039;&#039; by typing &lt;br /&gt;
  d &amp;lt;- degree(egonet)&lt;br /&gt;
Mean, standard deviation, and summary statistics (including min, max, quartiles, and median) are computed by&lt;br /&gt;
  mean(d)&lt;br /&gt;
  sd(d)&lt;br /&gt;
  summary(d)&lt;br /&gt;
&lt;br /&gt;
To display these (or other) statistics separately for each class of actors defined by the country of origin (or any other attribute), execute the command&lt;br /&gt;
  tapply(d, from, summary)&lt;br /&gt;
The three arguments of &#039;&#039;tapply&#039;&#039; have the following meaning: &#039;&#039;d&#039;&#039; is the vector of values to which the function should be applied, &#039;&#039;from&#039;&#039; is the factor whose unique values determine the different classes, and &#039;&#039;summary&#039;&#039; is the function to be computed (instead of &#039;&#039;summary&#039;&#039;, you could also type &#039;&#039;mean&#039;&#039;, &#039;&#039;sd&#039;&#039;, and so on).&lt;br /&gt;
&lt;br /&gt;
[[File:R_console_tapply.png]]&lt;br /&gt;
&lt;br /&gt;
== Loading networks from R into visone ==&lt;br /&gt;
&lt;br /&gt;
[[File:R_console_load.png|200px|thumb|right]] As networks can be sent from visone to R, you can also load objects of class &#039;&#039;igraph&#039;&#039; into visone. Loading the current R object &#039;&#039;egonet&#039;&#039; would be of no use since this network is already in visone and has not been modified. Loading networks from R into visone is useful when some values that have been computed in R and attached to the igraph object should be accessible as vertex or edge attributes in visone. This offers numerous possibilities to transform attributes, as it will be demonstrated in the following.&lt;br /&gt;
&lt;br /&gt;
First let&#039;s copy &#039;&#039;egonet&#039;&#039; into a new igraph object named &#039;&#039;g&#039;&#039; by executing &lt;br /&gt;
  g &amp;lt;- egonet&lt;br /&gt;
(This rather serves to demonstrate how new variables for igraph objects can be loaded into visone; we could also have attached the new data directly to &#039;&#039;egonet&#039;&#039;.) To attach a new attribute named &#039;&#039;Degree&#039;&#039; that encodes the previously computed node degrees type&lt;br /&gt;
  V(g)$Degree &amp;lt;- d&lt;br /&gt;
Degrees could have been computed in visone as well. However, R offers methods to transform such values that are not implemented directly in visone. For instance, the variable &#039;&#039;DegreeCentered&#039;&#039; computed and attached via&lt;br /&gt;
  V(g)$DegreeCentered &amp;lt;- d-mean(d)&lt;br /&gt;
encodes the differences between the individual degrees and the mean (so that nodes with relatively small degrees get negative values and nodes with relatively high degrees get positive values). Likewise&lt;br /&gt;
  V(g)$LogDegree &amp;lt;- log(d)&lt;br /&gt;
attaches the logarithmized degrees to the graph (this transformation is quite useful in networks with skewed degree distributions, e.g., [[Random_networks_generation#preferential|preferential attachment]] graphs). Note that while visone directly offers some possibilities to [[Managing_attributes_(trail)#Transforming_attributes|transform attributes]], logarithmic transformations are not implemented; in contrast, R as a programming language, imposes no such restrictions.&lt;br /&gt;
&lt;br /&gt;
Finally, loading the network along with all old and new attributes into visone can be done via the [[R console tab]] as explained in the following. Click once on the &#039;&#039;&#039;refresh&#039;&#039;&#039; button to show all R variables of class igraph (note that this shows the variable &#039;&#039;g&#039;&#039; but not the vector of degrees &#039;&#039;d&#039;&#039;). Selecting &#039;&#039;g&#039;&#039; and pushing the &#039;&#039;&#039;load&#039;&#039;&#039; button opens a new network tab with a network called &#039;&#039;g&#039;&#039;. You can inspect the newly attached attributes via the [[attribute manager]].&lt;br /&gt;
&lt;br /&gt;
== File import and export in R ==&lt;br /&gt;
&lt;br /&gt;
=== Saving and loading R objects ===&lt;br /&gt;
&lt;br /&gt;
Variables in the R workspace can be saved to and read from the disk. If you just want to save the igraph objects (the network together with all attributes) you could as well load them into visone and save them as [[GraphML]]. However, your R workspace might contain other variables that are not of class &#039;&#039;igraph&#039;&#039;. To save objects it is convenient to set the working directory. The path to the current working directory can be obtained by&lt;br /&gt;
  getwd()&lt;br /&gt;
which currently outputs in many cases the directory where the &#039;&#039;Rserve.exe&#039;&#039; file is located (see the [[Option_dialog#R_-_connection| R connection settings]]). To set it to a different directory type&lt;br /&gt;
  setwd(&amp;quot;&amp;lt;path_to_directory&amp;gt;&amp;quot;)&lt;br /&gt;
(Chose a directory to which you have write-access.) Saving an R object (for instance, the network &#039;&#039;egonet&#039;&#039;) can be done by &lt;br /&gt;
  save(egonet, file=&amp;quot;egonet.rda&amp;quot;)&lt;br /&gt;
This creates a file &#039;&#039;egonet.rda&#039;&#039; in the specified working directory. (Here, &#039;&#039;egonet.rda&#039;&#039; is an arbitray filename that you can chose as you wish. ) All objects in the workspace can be saved by &lt;br /&gt;
  save.image(file=&amp;quot;myWorkspace.rda&amp;quot;)&lt;br /&gt;
Conversely, to read objects from a file in the current working directory type&lt;br /&gt;
  load(file=&amp;quot;egonet.rda&amp;quot;)&lt;br /&gt;
(This makes sense if you have closed the R connection and you want to recover the object &#039;&#039;egonet&#039;&#039;.) R objects that have been saved to disk can, of course, also been imported into any other R environment (see [http://www.r-project.org/ http://www.r-project.org/] for more information).&lt;br /&gt;
&lt;br /&gt;
=== Plotting to a PDF file ===&lt;br /&gt;
&lt;br /&gt;
To plot a diagram, such as the degrees of a network, to a PDF file type&lt;br /&gt;
  pdf(&amp;quot;myDiagram.pdf&amp;quot;)&lt;br /&gt;
  plot(d, type=&amp;quot;b&amp;quot;)&lt;br /&gt;
  dev.off()&lt;br /&gt;
This writes a PDF file &#039;&#039;myDiagram.pdf&#039;&#039; to the current working directory; this file can be viewed, e.g., with Adobe&#039;s Acrobat Reader, printed, or used as a figure in some other document. The R plot command is a very general and powerful tool to create statistical graphics; for more information see the documentation linked from the [http://www.r-project.org/ R Project Website].&lt;br /&gt;
&lt;br /&gt;
=== Executing R code from a file ===&lt;br /&gt;
&lt;br /&gt;
Especially if you are working on a larger project it is convenient not just to save the data but also the R code to recompute some of the results or to modify some analyses. R code can be executed from text-files by the &#039;&#039;source&#039;&#039; command. For instance,&lt;br /&gt;
  source(&amp;quot;myRCode.R&amp;quot;)&lt;br /&gt;
executes all commands from the file &#039;&#039;myRCode.R&#039;&#039; located in the current working directory. Note that this file must be a &#039;&#039;&#039;plain text file&#039;&#039;&#039; (see [http://en.wikipedia.org/wiki/Text_editor http://en.wikipedia.org/wiki/Text_editor] for explanation) containing commands like the examples provided in typewriter font in the boxes on this page. Conversely, &lt;br /&gt;
  sink(&amp;quot;myROutput.txt&amp;quot;)&lt;br /&gt;
directs the R output to a file &#039;&#039;myROutput.txt&#039;&#039; in the current working directory. This is convenient when executing R commands that produce complex output.&lt;br /&gt;
&lt;br /&gt;
== Fitting exponential random graph models (ERGMs) ==&lt;br /&gt;
&lt;br /&gt;
Since networks can be sent from visone to R you get the possibility to use many powerful contributed R packages for network analysis and modeling. In this section we illustrate the use of some methods provided by the &#039;&#039;&#039;statnet&#039;&#039;&#039; package written by Mark S. Handcock, David R. Hunter, Carter T. Butts, Steven M. Goodreau, and Martina Morris; see the [http://statnetproject.org/ statnet project Website] for additional information, including documentation and tutorials. In particular, we are going to demonstrate how to fit an exponential random graph model (ERGM) to a network sent from visone to R. ERGMs are sophisticated statistical network models that can deal with complex dependencies among observations, including homophily, reciprocity, preferential attachment, and triangular closure. Note that ERGMs are mainly applied to time-independent networks; an option for modeling network dynamics is the [[RSiena|&#039;&#039;&#039;RSiena&#039;&#039;&#039;]] package that can be used from within visone as it is illustrated in the [[RSiena_(trail)| RSiena trail]].&lt;br /&gt;
&lt;br /&gt;
=== Installing new packages ===&lt;br /&gt;
&lt;br /&gt;
To estimate an ERGM we need to install the R packages &#039;&#039;&#039;network&#039;&#039;&#039;, &#039;&#039;&#039;sna&#039;&#039;&#039;, and &#039;&#039;&#039;ergm&#039;&#039;&#039;, all of which are part of the statnet package. To install these packages separately type (after appropriate replacement of &amp;lt;code&amp;gt;&amp;lt;path to R library dir&amp;gt;&amp;lt;/code&amp;gt; and &amp;lt;code&amp;gt;&amp;lt;url of R mirror site&amp;gt;&amp;lt;/code&amp;gt;)  &lt;br /&gt;
  install.packages(&amp;quot;network&amp;quot;, lib = &amp;quot;&amp;lt;path to R library dir&amp;gt;&amp;quot;, repos = &amp;quot;&amp;lt;url of R mirror site&amp;gt;&amp;quot;)&lt;br /&gt;
  library(network, lib.loc = &amp;quot;&amp;lt;path to R library dir&amp;gt;&amp;quot;)&lt;br /&gt;
&lt;br /&gt;
  install.packages(&amp;quot;sna&amp;quot;, lib = &amp;quot;&amp;lt;path to R library dir&amp;gt;&amp;quot;, repos = &amp;quot;&amp;lt;url of R mirror site&amp;gt;&amp;quot;)&lt;br /&gt;
  library(sna, lib.loc = &amp;quot;&amp;lt;path to R library dir&amp;gt;&amp;quot;)&lt;br /&gt;
&lt;br /&gt;
  install.packages(&amp;quot;ergm&amp;quot;, lib = &amp;quot;&amp;lt;path to R library dir&amp;gt;&amp;quot;, repos = &amp;quot;&amp;lt;url of R mirror site&amp;gt;&amp;quot;)&lt;br /&gt;
  library(ergm, lib.loc = &amp;quot;&amp;lt;path to R library dir&amp;gt;&amp;quot;)&lt;br /&gt;
&lt;br /&gt;
For the R library you can set the same path as in the [[Option_dialog#R_-_connection| R connection settings]]; a list of mirror sites can be found at [http://cran.r-project.org/mirrors.html http://cran.r-project.org/mirrors.html] (copy the URL of any mirror site, including the http:// prefix, and use it in quotes as a value for the &#039;&#039;&#039;repos&#039;&#039;&#039; argument in the commands above). &lt;br /&gt;
&lt;br /&gt;
Since &amp;lt;code&amp;gt;igraph&amp;lt;/code&amp;gt; and &amp;lt;code&amp;gt;network&amp;lt;/code&amp;gt; are both packages for networks, they define some methods with identical names. This can lead to problems when a method from one package is executed on an object from the other. A workaround for such problems would be to save the objects that you want to work with, close the R connection, open it again, install only the package that you need, and reload the data objects.&lt;br /&gt;
&lt;br /&gt;
=== Converting an igraph to a network object ===&lt;br /&gt;
&lt;br /&gt;
The &amp;lt;code&amp;gt;ergm&amp;lt;/code&amp;gt; package works on network objects from the package &amp;lt;code&amp;gt;network&amp;lt;/code&amp;gt;. Thus, the current &amp;lt;code&amp;gt;igraph&amp;lt;/code&amp;gt; object first has to be converted into this class. This can be done in two steps: getting the adjacency matrix for the &#039;&#039;egonet&#039;&#039; object by&lt;br /&gt;
  adj &amp;lt;- get.adjacency(egonet)&lt;br /&gt;
and then creating a network from this adjacency matrix by executing the following line (note that the &amp;lt;code&amp;gt;directed&amp;lt;/code&amp;gt; attribute must be set to &amp;lt;code&amp;gt;FALSE&amp;lt;/code&amp;gt;, otherwise the network will be directed)&lt;br /&gt;
  net &amp;lt;- as.network(adj, directed=FALSE)&lt;br /&gt;
Executing&lt;br /&gt;
  summary(net)&lt;br /&gt;
shows that the ties have been correctly converted from the &amp;lt;code&amp;gt;igraph&amp;lt;/code&amp;gt; package to &amp;lt;code&amp;gt;network&amp;lt;/code&amp;gt; but, so far, no vertex or edge attributes are attached to the &amp;lt;code&amp;gt;net&amp;lt;/code&amp;gt; object. This can be done by, e.g.,&lt;br /&gt;
  set.vertex.attribute(net,&amp;quot;From&amp;quot;, V(egonet)$Afrm)&lt;br /&gt;
  set.vertex.attribute(net,&amp;quot;City&amp;quot;, V(egonet)$Acit)&lt;br /&gt;
&lt;br /&gt;
Conversely, to create an igraph from an adjacency matrix use the command &amp;lt;code&amp;gt;graph.adjacency(adj, mode=&amp;quot;undirected&amp;quot;)&amp;lt;/code&amp;gt; (we don&#039;t need this at the moment).&lt;br /&gt;
&lt;br /&gt;
=== Computing observed statistics ===&lt;br /&gt;
&lt;br /&gt;
The &#039;&#039;&#039;ergm&#039;&#039;&#039; package enables the computation of the observed values of various network statistics, such as number of triangles, number of k-stars, and many more. To get these values call the &amp;lt;code&amp;gt;summary&amp;lt;/code&amp;gt; method on an ERGM formula object. For instance,&lt;br /&gt;
  summary(net ~ triangle + kstar(2) + nodematch(&amp;quot;City&amp;quot;))&lt;br /&gt;
returns the number of triangles in the network, the number of 2-stars, and the number of edges connecting actors that live in the same city. In our example, this is&lt;br /&gt;
  triangle   kstar2   nodematch.City &lt;br /&gt;
  543        1857     143 &lt;br /&gt;
To see other statistics that can be used in an ERGM formula see the section on &amp;lt;code&amp;gt;ergm.terms&amp;lt;/code&amp;gt; in the statnet documentation linked from [http://statnetproject.org http://statnetproject.org].&lt;br /&gt;
&lt;br /&gt;
=== Estimating ERGMs ===&lt;br /&gt;
&lt;br /&gt;
Exponential random graph models (ERGMs) assign a network &amp;lt;math&amp;gt;G&amp;lt;/math&amp;gt; a probability of the form&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;P(G)=\frac{1}{\kappa(\theta)}\exp\left(\sum_{i=1}^k\theta_i\cdot s_i(G)\right)&amp;lt;/math&amp;gt;, where&lt;br /&gt;
* the &amp;lt;math&amp;gt;s_i&amp;lt;/math&amp;gt; are functions mapping from the set of networks (the &#039;&#039;population&#039;&#039; of the random graph model) to the real numbers; the &amp;lt;math&amp;gt;s_i&amp;lt;/math&amp;gt; are called &#039;&#039;&#039;(network) statistics&#039;&#039;&#039; and are typically chosen by the researcher based on theory&lt;br /&gt;
* &amp;lt;math&amp;gt;\theta=(\theta_1,\dots,\theta_k)&amp;lt;/math&amp;gt; is a vector of free &#039;&#039;&#039;parameters&#039;&#039;&#039; associated with statistics; the parameters are typically estimated via maximum likelihood estimation (MLE) given an observed network&lt;br /&gt;
* &amp;lt;math&amp;gt;\kappa(\theta)&amp;lt;/math&amp;gt; is a normalization constant for the random graph model&lt;br /&gt;
&lt;br /&gt;
The statistics are typically (functions of) counts of small subgraphs such as edges, stars, triangles, or edges connecting actors that have specific attribute values. The interpretation of the estimated parameters is as follwing. If, for instance, the parameter associated with the triangle count statistic is (significantly) positive, then networks with more triangles have higher probability - assuming that all other statistics remain constant. This would demonstrate a tendency for transitive closure as described in the saying &#039;&#039;the friend of a friend is a friend&#039;&#039;. The specification, estimation, and interpretation of ERGMs is quite involved and cannot be sufficiently treated in this page; for more information we refer to the statnet tutorial linked  from [http://statnetproject.org http://statnetproject.org]. In the following, we illustrate merely &#039;&#039;how&#039;&#039; ERGMs can be specified and estimated in statnet.&lt;br /&gt;
&lt;br /&gt;
Computing maximum likelihood estimates for ERGM parameters can be done by calling the &amp;lt;code&amp;gt;ergm&amp;lt;/code&amp;gt; on an ERGM formula. For instance,&lt;br /&gt;
  model &amp;lt;- ergm(net ~ edges + nodematch(&amp;quot;From&amp;quot;) + nodematch(&amp;quot;City&amp;quot;) + gwesp(0.1, fixed=TRUE))&lt;br /&gt;
estimates the parameters of a model with four statistics: number of edges, numbers of edges connecting actors with the same country of origin, respectively the same city of residence, and the so-called &#039;&#039;geometrically weighted edgewise shared partners&#039;&#039; statistic. The latter has a similar interpretation as the triangle statistic but is less likely to lead to degenerate models; see the statnet documentation for details. Calling&lt;br /&gt;
  summary(model)&lt;br /&gt;
prints basic information about the model, including estimated parameters and standard errors. In our example, we get (note that the results might change from call to call, since the estimation algorithm itself is probabilistic)&lt;br /&gt;
  ==========================&lt;br /&gt;
  Summary of model fit&lt;br /&gt;
  ==========================&lt;br /&gt;
  Formula:   net ~ edges + nodematch(&amp;quot;From&amp;quot;) + nodematch(&amp;quot;City&amp;quot;) + gwesp(0.1, fixed = TRUE)&lt;br /&gt;
  Newton-Raphson iterations:  6 &lt;br /&gt;
  MCMC sample of size 10000 &lt;br /&gt;
  Monte Carlo MLE Results:&lt;br /&gt;
                  Estimate     Std. Error MCMC s.e. p-value    &lt;br /&gt;
  edges            -4.1438     3.8443     0.193     0.281    &lt;br /&gt;
  nodematch.From    0.8223     0.1459     0.006     &amp;lt;1e-04 ***&lt;br /&gt;
  nodematch.City    0.8212     0.1553     0.002     &amp;lt;1e-04 ***&lt;br /&gt;
  gwesp.fixed.0.1   3.0107     3.4763     0.175      0.387    &lt;br /&gt;
  ---&lt;br /&gt;
  Signif. codes:  0 &#039;***&#039; 0.001 &#039;**&#039; 0.01 &#039;*&#039; 0.05 &#039;.&#039; 0.1 &#039; &#039; 1 &lt;br /&gt;
     Null  Deviance: 1372.43  on 990  degrees of freedom&lt;br /&gt;
  Residual Deviance:  484.89  on 986  degrees of freedom&lt;br /&gt;
           Deviance:  887.54  on   4  degrees of freedom&lt;br /&gt;
  AIC: 492.89    BIC: 512.48 &lt;br /&gt;
From these results we can conclude that ties are more likely between actors that stem from the same countries of origin (significantly positive estimate for the parameter associated with the &amp;lt;code&amp;gt;nodematch.From&amp;lt;/code&amp;gt; statistic) and ties are more likely between actors that live in the same city (&amp;lt;code&amp;gt;nodematch.City&amp;lt;/code&amp;gt;). We could not find evidence for transitive closure - controlling for country of origin and city of residence - since the parameter associated with &amp;lt;code&amp;gt;gwesp.fixed.0.1&amp;lt;/code&amp;gt; is not significant. &lt;br /&gt;
&lt;br /&gt;
== References ==&lt;br /&gt;
&lt;br /&gt;
Gábor Csárdi and Tamás Nepusz. The &#039;&#039;&#039;igraph&#039;&#039;&#039; library. [http://igraph.sourceforge.net/ http://igraph.sourceforge.net/].&lt;br /&gt;
&lt;br /&gt;
Mark S. Handcock, David R. Hunter, Carter T. Butts, Steven M. Goodreau, and Martina Morris (2003). &#039;&#039;&#039;statnet&#039;&#039;&#039;: Software tools for the Statistical Modeling of Network Data. URL [http://statnetproject.org http://statnetproject.org].&lt;br /&gt;
&lt;br /&gt;
The R project for statistical computing [http://www.r-project.org/ http://www.r-project.org/]&lt;/div&gt;</summary>
		<author><name>Nick</name></author>
	</entry>
	<entry>
		<id>https://visone.ethz.ch/wiki/index.php?title=File:Zoom_100.png&amp;diff=536</id>
		<title>File:Zoom 100.png</title>
		<link rel="alternate" type="text/html" href="https://visone.ethz.ch/wiki/index.php?title=File:Zoom_100.png&amp;diff=536"/>
		<updated>2011-03-28T12:13:40Z</updated>

		<summary type="html">&lt;p&gt;Nick: uploaded a new version of &amp;amp;quot;File:Zoom 100.png&amp;amp;quot;&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;visone icon zoom 100&lt;/div&gt;</summary>
		<author><name>Nick</name></author>
	</entry>
	<entry>
		<id>https://visone.ethz.ch/wiki/index.php?title=File:Zoom_100.png&amp;diff=535</id>
		<title>File:Zoom 100.png</title>
		<link rel="alternate" type="text/html" href="https://visone.ethz.ch/wiki/index.php?title=File:Zoom_100.png&amp;diff=535"/>
		<updated>2011-03-28T12:12:26Z</updated>

		<summary type="html">&lt;p&gt;Nick: uploaded a new version of &amp;amp;quot;File:Zoom 100.png&amp;amp;quot;&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;visone icon zoom 100&lt;/div&gt;</summary>
		<author><name>Nick</name></author>
	</entry>
	<entry>
		<id>https://visone.ethz.ch/wiki/index.php?title=File:Knime_on.gif&amp;diff=534</id>
		<title>File:Knime on.gif</title>
		<link rel="alternate" type="text/html" href="https://visone.ethz.ch/wiki/index.php?title=File:Knime_on.gif&amp;diff=534"/>
		<updated>2011-03-28T12:09:52Z</updated>

		<summary type="html">&lt;p&gt;Nick: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&lt;/div&gt;</summary>
		<author><name>Nick</name></author>
	</entry>
	<entry>
		<id>https://visone.ethz.ch/wiki/index.php?title=File:Knime_off.gif&amp;diff=533</id>
		<title>File:Knime off.gif</title>
		<link rel="alternate" type="text/html" href="https://visone.ethz.ch/wiki/index.php?title=File:Knime_off.gif&amp;diff=533"/>
		<updated>2011-03-28T12:09:25Z</updated>

		<summary type="html">&lt;p&gt;Nick: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&lt;/div&gt;</summary>
		<author><name>Nick</name></author>
	</entry>
	<entry>
		<id>https://visone.ethz.ch/wiki/index.php?title=Main_Page&amp;diff=229</id>
		<title>Main Page</title>
		<link rel="alternate" type="text/html" href="https://visone.ethz.ch/wiki/index.php?title=Main_Page&amp;diff=229"/>
		<updated>2011-01-04T16:53:00Z</updated>

		<summary type="html">&lt;p&gt;Nick: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;visone (&#039;&#039;italian for mink&#039;&#039;)&lt;br /&gt;
is a software for the &#039;&#039;&#039;visual&#039;&#039;&#039; creation, transformation,&lt;br /&gt;
exploration, analysis, and representation of network data,&lt;br /&gt;
jointly developed at the University of Konstanz and the Karlsruhe Institute of Technology since 2001.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
To provide easy and fast access for newbies and support advanced users equally, the visone wiki &lt;br /&gt;
is built on these main categories:&lt;br /&gt;
&lt;br /&gt;
* [[Trails]] guide through &#039;&#039;&#039;common usage scenarios&#039;&#039;&#039;; they are probably the easiest way to learn visone &lt;br /&gt;
&lt;br /&gt;
* Complementary, a &#039;&#039;&#039;quick reference guide&#039;&#039;&#039; is describing&lt;br /&gt;
** [[GUI|Graphical User Interface]] components and their functionalities and &lt;br /&gt;
** [[Concepts|Algorithms, Methods, Concepts]] underlying the implementation&lt;br /&gt;
&lt;br /&gt;
* [[Applications|Data sets and research applications]] provide additional guidance future applications can build on&lt;/div&gt;</summary>
		<author><name>Nick</name></author>
	</entry>
	<entry>
		<id>https://visone.ethz.ch/wiki/index.php?title=Main_Page&amp;diff=228</id>
		<title>Main Page</title>
		<link rel="alternate" type="text/html" href="https://visone.ethz.ch/wiki/index.php?title=Main_Page&amp;diff=228"/>
		<updated>2011-01-04T16:51:56Z</updated>

		<summary type="html">&lt;p&gt;Nick: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;visone (&#039;&#039;italian for mink&#039;&#039;)&lt;br /&gt;
is a software for the &#039;&#039;&#039;visual&#039;&#039;&#039; creation, transformation,&lt;br /&gt;
exploration, analysis, and representation of network data,&lt;br /&gt;
jointly developed at the University of Konstanz and the Karlsruhe Institute of Technology since 2001.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
To provide easy and fast access for newbies and support advanced users equally, the visone wiki &lt;br /&gt;
is built on these main categories:&lt;br /&gt;
&lt;br /&gt;
* [[Trails]] guide through &#039;&#039;&#039;common usage scenarios&#039;&#039;&#039;; they are probably the easiest way to learn visone &lt;br /&gt;
&lt;br /&gt;
* Complementary, a &#039;&#039;&#039;quick reference guide&#039;&#039;&#039; is describing&lt;br /&gt;
** [[GUI|Graphical User Interface]] components and their functionalities and &lt;br /&gt;
** [[Concepts|Algorithms, Methods, Concepts]] underlying their implementation&lt;br /&gt;
&lt;br /&gt;
* [[Applications|Data sets and research applications]] provide additional guidance future applications can build on&lt;/div&gt;</summary>
		<author><name>Nick</name></author>
	</entry>
	<entry>
		<id>https://visone.ethz.ch/wiki/index.php?title=Main_Page&amp;diff=227</id>
		<title>Main Page</title>
		<link rel="alternate" type="text/html" href="https://visone.ethz.ch/wiki/index.php?title=Main_Page&amp;diff=227"/>
		<updated>2010-12-20T16:54:21Z</updated>

		<summary type="html">&lt;p&gt;Nick: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;visone (&#039;&#039;italian for mink&#039;&#039;)&lt;br /&gt;
is a software for the &#039;&#039;&#039;visual&#039;&#039;&#039; creation, transformation,&lt;br /&gt;
exploration, analysis, and representation of network data,&lt;br /&gt;
jointly developed at the University of Konstanz and the Karlsruhe Institute of Technology since 2001.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
To provide easy and fast access for newbies and support advanced users equally, the visone wiki &lt;br /&gt;
is built on four main categories:&lt;br /&gt;
&lt;br /&gt;
* [[Trails]] guide through common usage scenarios; they are probably the easiest way to learn visone &lt;br /&gt;
&lt;br /&gt;
* [[GUI|Graphical User Interface]] descriptions provide a quick reference on what which components do &lt;br /&gt;
&lt;br /&gt;
* [[Concepts|Algorithms, Methods, Concepts]] underlying the implementation are explained in detail separately&lt;br /&gt;
&lt;br /&gt;
* [[Applications|Data sets and research applications]] provide additional guidance future applications can build on&lt;/div&gt;</summary>
		<author><name>Nick</name></author>
	</entry>
	<entry>
		<id>https://visone.ethz.ch/wiki/index.php?title=Main_Page&amp;diff=226</id>
		<title>Main Page</title>
		<link rel="alternate" type="text/html" href="https://visone.ethz.ch/wiki/index.php?title=Main_Page&amp;diff=226"/>
		<updated>2010-12-20T16:52:21Z</updated>

		<summary type="html">&lt;p&gt;Nick: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;visone (&#039;&#039;italian for mink&#039;&#039;)&lt;br /&gt;
is a software for the &#039;&#039;&#039;visual&#039;&#039;&#039; creation, transformation,&lt;br /&gt;
exploration, analysis, and representation of network data,&lt;br /&gt;
jointly developed at the University of Konstanz and the Karlsruhe Institute of Technology since 2001.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
To provide easy and fast access for newbies and support advanced users equally, the visone wiki &lt;br /&gt;
is built on four main categories:&lt;br /&gt;
&lt;br /&gt;
* [[Trails]] guide through common usage scenarios; they are probably the easiest way to learn visone &lt;br /&gt;
* [[GUI|Graphical User Interface]] descriptions provide a quick reference on what which components do &lt;br /&gt;
* [[Concepts|Algorithms, Methods, Concepts]] underlying the implementation are explained in detail separately&lt;br /&gt;
* [[Applications|Data sets and research applications]] provide additional guidance future applications can build on&lt;/div&gt;</summary>
		<author><name>Nick</name></author>
	</entry>
	<entry>
		<id>https://visone.ethz.ch/wiki/index.php?title=Main_Page&amp;diff=225</id>
		<title>Main Page</title>
		<link rel="alternate" type="text/html" href="https://visone.ethz.ch/wiki/index.php?title=Main_Page&amp;diff=225"/>
		<updated>2010-12-20T16:49:31Z</updated>

		<summary type="html">&lt;p&gt;Nick: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;visone (&#039;&#039;italian for mink&#039;&#039;)&lt;br /&gt;
is a software for the &#039;&#039;&#039;visual&#039;&#039;&#039; creation, transformation,&lt;br /&gt;
exploration, analysis, and representation of network data,&lt;br /&gt;
jointly developed at the University of Konstanz and the Karlsruhe Institute of Technology since 2001.&lt;br /&gt;
&lt;br /&gt;
To provide easy and fast access for newbies and support advanced users equally, the visone wiki &lt;br /&gt;
is built on four main categories:&lt;br /&gt;
&lt;br /&gt;
* [[Trails]] guide through common usage scenarios; they are probably the easiest way to learn visone &lt;br /&gt;
* [[GUI|Graphical User Interface]] description provides a quick reference on what which components do &lt;br /&gt;
* [[Concepts|Algorithms, Methods, Concepts]] underlying the implementation are explained in detail separately&lt;br /&gt;
* [[Applications|Data sets and research applications]] provide additional guidance future applications can build on&lt;/div&gt;</summary>
		<author><name>Nick</name></author>
	</entry>
	<entry>
		<id>https://visone.ethz.ch/wiki/index.php?title=Main_Page&amp;diff=224</id>
		<title>Main Page</title>
		<link rel="alternate" type="text/html" href="https://visone.ethz.ch/wiki/index.php?title=Main_Page&amp;diff=224"/>
		<updated>2010-12-20T16:48:37Z</updated>

		<summary type="html">&lt;p&gt;Nick: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;visone (&#039;&#039;italian for mink&#039;&#039;)&lt;br /&gt;
is a software for the &#039;&#039;&#039;visual&#039;&#039;&#039; creation, transformation,&lt;br /&gt;
exploration, analysis, and representation of network data,&lt;br /&gt;
jointly developed at University of Konstanz and Karlsruhe Institute of Technology since 2001.&lt;br /&gt;
&lt;br /&gt;
To provide easy and fast access for newbies and support advanced users equally, the visone wiki &lt;br /&gt;
is built on four main categories:&lt;br /&gt;
&lt;br /&gt;
* [[Trails]] guide through common usage scenarios; they are probably the easiest way to learn visone &lt;br /&gt;
* [[GUI|Graphical User Interface]] description provides a quick reference on what which components do &lt;br /&gt;
* [[Concepts|Algorithms, Methods, Concepts]] underlying the implementation are explained in detail separately&lt;br /&gt;
* [[Applications|Data sets and research applications]] provide additional guidance future applications can build on&lt;/div&gt;</summary>
		<author><name>Nick</name></author>
	</entry>
	<entry>
		<id>https://visone.ethz.ch/wiki/index.php?title=Attribute_manager&amp;diff=223</id>
		<title>Attribute manager</title>
		<link rel="alternate" type="text/html" href="https://visone.ethz.ch/wiki/index.php?title=Attribute_manager&amp;diff=223"/>
		<updated>2010-12-20T16:22:18Z</updated>

		<summary type="html">&lt;p&gt;Nick: /* operations */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;The attribute manager is started by clicking on its icon [[File:Attribute_manager.png|link=attribute_manager]] in visone&#039;s toolbar or pressing the attribute manager button in the [[selection_tab|selection tab]].&lt;br /&gt;
&lt;br /&gt;
As opposed to the attributes tab of the [[node_properties_dialog#attributes|node properties dialog]] and [link_properties_dialog#attributes|link properties dialog]], that only allow to change the value of already existing attributes manually, the attribute manager provides a variety of possibilities related to the creation, configuration and automatical modification of attributes.&lt;br /&gt;
&lt;br /&gt;
== categories ==&lt;br /&gt;
&lt;br /&gt;
There are 4 times 4 (2) selectable categories within the attribute manager, e.g. node attribute configuration:&lt;br /&gt;
&lt;br /&gt;
[[File:Attribute_manager2.png]]&lt;br /&gt;
&lt;br /&gt;
The four radio buttons in the top line are used to select the kind of attribute one wants to manage, namely&lt;br /&gt;
* node attributes&lt;br /&gt;
* link attributes&lt;br /&gt;
* dyad attributes&lt;br /&gt;
* graph attributes&lt;br /&gt;
&lt;br /&gt;
The four radio buttons on the left-hand side are used to specify what kind of management one is looking for, namely&lt;br /&gt;
* configuration management (manually)&lt;br /&gt;
* value management (manually)&lt;br /&gt;
* operation involving value management (automatically)&lt;br /&gt;
* import &amp;amp; export management (automatically)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== manual modifications ==&lt;br /&gt;
&lt;br /&gt;
Note, that attribute values are typically not added manually (which would be tiresome). It is more usual that attributes are [[#import_and_export|imported]] from files or computed by a [[analysis_tab|network analysis algorithm]]...&lt;br /&gt;
&lt;br /&gt;
=== configuration ===&lt;br /&gt;
&lt;br /&gt;
* check mark: the check mark in the left column defines the attribute that is displayed as label (for nodes/links)&lt;br /&gt;
* name field: enables the (re-)definition of attribute names; to create a new attribute you have to use this field to define a name first&lt;br /&gt;
* type selection: defines the type (text, binary, integer, decimal, text list, integer list, decimal list) of the attribute&lt;br /&gt;
* default: can be used to define a default value for this attribute that is assigned to all nodes automatically (since only declaring the name and type of an attribute function does not define its values)&lt;br /&gt;
* description&lt;br /&gt;
&lt;br /&gt;
Don&#039;t forget to press the apply button at the bottom of the attribute manager.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== values ===&lt;br /&gt;
&lt;br /&gt;
The values category can be used to explore the values that the nodes/links (or the selected nodes/links, if there are selected nodes/links) assume on all attribute functions that are declared. You can also modify the values if the &#039;&#039;&#039;allow editing&#039;&#039;&#039; box at the bottom right of the attribute manager is checked. Additionally, you can specify whether to &#039;&#039;&#039;show default values&#039;&#039;&#039; (bottom left) and whether to display only a subset of attributes (use check marks at the top).&lt;br /&gt;
&lt;br /&gt;
Values that are &#039;&#039;not assigned&#039;&#039; yet, are marked &#039;&#039;N/A&#039;&#039;.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== automatical modifications ==&lt;br /&gt;
&lt;br /&gt;
=== operations ===&lt;br /&gt;
&lt;br /&gt;
The operations category provides means to change a node/link attribute function as a whole.&lt;br /&gt;
&lt;br /&gt;
You might just want to &#039;&#039;&#039;copy&#039;&#039;&#039; or &#039;&#039;&#039;delete&#039;&#039;&#039; (select according &#039;&#039;operation&#039;&#039;) an existing attribute function (select according &#039;&#039;attribute&#039;&#039;) - and provide a new name of the &#039;&#039;result attribute&#039;&#039; (if you don&#039;t want to delete or, in general, overwrite the current one).&lt;br /&gt;
&lt;br /&gt;
You can also &#039;&#039;&#039;rank&#039;&#039;&#039; the nodes/links in &#039;&#039;&#039;ascending&#039;&#039;&#039; or &#039;&#039;&#039;descending&#039;&#039;&#039; &#039;&#039;order&#039;&#039; with regard to an &#039;&#039;attribute&#039;&#039;, creating an integer type &#039;&#039;result attribute&#039;&#039;.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Merge to list&#039;&#039;&#039; enables you to select a number of &#039;&#039;source attributes&#039;&#039; (pressing Crtl key to add single ones or holding shift key to select a number of successive ones) to be merged into a text &#039;&#039;result attribute&#039;&#039;, being a comma separated list of these values.&lt;br /&gt;
&lt;br /&gt;
There are also a number of possibilities to &#039;&#039;&#039;convert list values&#039;&#039;&#039;, namely calculating the &#039;&#039;&#039;maximum&#039;&#039;&#039;, &#039;&#039;&#039;minimum&#039;&#039;&#039;, &#039;&#039;&#039;average&#039;&#039;&#039;, or &#039;&#039;&#039;sum&#039;&#039;&#039; of entries (integer/decimal list), or &#039;&#039;&#039;concatenate&#039;&#039;&#039; them (text list).&lt;br /&gt;
&lt;br /&gt;
Finally, &#039;&#039;&#039;manipulate values&#039;&#039;&#039; provides means to automatically&lt;br /&gt;
* &#039;&#039;&#039;invert&#039;&#039;&#039; (note, that a zero attribute value will result in a N/A entry in the result attribute!)&lt;br /&gt;
* &#039;&#039;&#039;reverse&#039;&#039;&#039; &lt;br /&gt;
* &#039;&#039;&#039;add&#039;&#039;&#039; a specified &#039;&#039;offset&#039;&#039;&lt;br /&gt;
* &#039;&#039;&#039;scale&#039;&#039;&#039; with a specified &#039;&#039;scalar&#039;&#039;&lt;br /&gt;
* &#039;&#039;&#039;normalize&#039;&#039;&#039; (i.e. each value is divided by the maximum values)&lt;br /&gt;
* &#039;&#039;&#039;standardize&#039;&#039;&#039; (i.e. each value is divided by the sum of all values)&lt;br /&gt;
* &#039;&#039;&#039;round&#039;&#039;&#039; to specified &#039;&#039;fraction digits&#039;&#039;&lt;br /&gt;
* &#039;&#039;&#039;round up&#039;&#039;&#039; to specified &#039;&#039;fraction digits&#039;&#039;&lt;br /&gt;
the values of an attribute function.&lt;br /&gt;
&lt;br /&gt;
=== import and export ===&lt;br /&gt;
&lt;br /&gt;
When importing attributes from a .csv file you have to specify how the data shall be joined.&lt;br /&gt;
That is, the .csv file should contain a column that is named according to the &#039;&#039;&#039;join by&#039;&#039;&#039; attribute of the network.&lt;br /&gt;
It is also possible to import an additional link attribute via a .csv matrix (nodes IDs in the matrix have to be the same as in the network).&lt;br /&gt;
&lt;br /&gt;
When exporting attributes you can specify how the data shall be sorted, using the attribute selected for &#039;&#039;&#039;sort by&#039;&#039;&#039;.&lt;br /&gt;
&lt;br /&gt;
If you are working with more than one network tabs, you can also export one specified attribute of all open networks as a table.&lt;/div&gt;</summary>
		<author><name>Nick</name></author>
	</entry>
	<entry>
		<id>https://visone.ethz.ch/wiki/index.php?title=Transformation_tab&amp;diff=222</id>
		<title>Transformation tab</title>
		<link rel="alternate" type="text/html" href="https://visone.ethz.ch/wiki/index.php?title=Transformation_tab&amp;diff=222"/>
		<updated>2010-12-20T11:44:04Z</updated>

		<summary type="html">&lt;p&gt;Nick: Created page with &amp;#039;== links ==  === simplify ===  ...   === split ===  ...   === merge ===  ...   === direction ===  ...   === confirmation ===  ...   == nodes ==  === group by attribute ===  ...  …&amp;#039;&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== links ==&lt;br /&gt;
&lt;br /&gt;
=== simplify ===&lt;br /&gt;
&lt;br /&gt;
...&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== split ===&lt;br /&gt;
&lt;br /&gt;
...&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== merge ===&lt;br /&gt;
&lt;br /&gt;
...&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== direction ===&lt;br /&gt;
&lt;br /&gt;
...&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== confirmation ===&lt;br /&gt;
&lt;br /&gt;
...&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== nodes ==&lt;br /&gt;
&lt;br /&gt;
=== group by attribute ===&lt;br /&gt;
&lt;br /&gt;
...&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== network ==&lt;br /&gt;
&lt;br /&gt;
=== link graph ===&lt;br /&gt;
&lt;br /&gt;
...&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== two mode ===&lt;br /&gt;
&lt;br /&gt;
...&lt;/div&gt;</summary>
		<author><name>Nick</name></author>
	</entry>
	<entry>
		<id>https://visone.ethz.ch/wiki/index.php?title=Analysis_tab&amp;diff=221</id>
		<title>Analysis tab</title>
		<link rel="alternate" type="text/html" href="https://visone.ethz.ch/wiki/index.php?title=Analysis_tab&amp;diff=221"/>
		<updated>2010-12-20T11:32:28Z</updated>

		<summary type="html">&lt;p&gt;Nick: Created page with &amp;#039;== indexing ==  === node centrality ===  ...   === node density ===  ...   === node distance ===  ...   === link centrality ===  ...   === node and link centrality ===  ...   ===…&amp;#039;&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== indexing ==&lt;br /&gt;
&lt;br /&gt;
=== node centrality ===&lt;br /&gt;
&lt;br /&gt;
...&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== node density ===&lt;br /&gt;
&lt;br /&gt;
...&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== node distance ===&lt;br /&gt;
&lt;br /&gt;
...&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== link centrality ===&lt;br /&gt;
&lt;br /&gt;
...&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== node and link centrality ===&lt;br /&gt;
&lt;br /&gt;
...&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== value of endnodes ===&lt;br /&gt;
&lt;br /&gt;
...&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== edge weight normalizations ===&lt;br /&gt;
&lt;br /&gt;
...&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== grouping ==&lt;br /&gt;
&lt;br /&gt;
=== clustering ===&lt;br /&gt;
&lt;br /&gt;
...&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== cohesiveness ===&lt;br /&gt;
&lt;br /&gt;
...&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== connectedness ===&lt;br /&gt;
&lt;br /&gt;
...&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== role equivalence ===&lt;br /&gt;
&lt;br /&gt;
...&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== bipartition ===&lt;br /&gt;
&lt;br /&gt;
...&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== siena ==&lt;br /&gt;
&lt;br /&gt;
...&lt;/div&gt;</summary>
		<author><name>Nick</name></author>
	</entry>
	<entry>
		<id>https://visone.ethz.ch/wiki/index.php?title=Visualization_tab&amp;diff=220</id>
		<title>Visualization tab</title>
		<link rel="alternate" type="text/html" href="https://visone.ethz.ch/wiki/index.php?title=Visualization_tab&amp;diff=220"/>
		<updated>2010-12-20T11:22:15Z</updated>

		<summary type="html">&lt;p&gt;Nick: Created page with &amp;#039;== layout ==  === node layout ===  ...   === link routing ===  ...   === label placement ===  ...   == mapping ==  ...   == geometry ==  === affine transformations ===   ...  ===…&amp;#039;&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== layout ==&lt;br /&gt;
&lt;br /&gt;
=== node layout ===&lt;br /&gt;
&lt;br /&gt;
...&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== link routing ===&lt;br /&gt;
&lt;br /&gt;
...&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== label placement ===&lt;br /&gt;
&lt;br /&gt;
...&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== mapping ==&lt;br /&gt;
&lt;br /&gt;
...&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== geometry ==&lt;br /&gt;
&lt;br /&gt;
=== affine transformations ===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
...&lt;br /&gt;
&lt;br /&gt;
=== procrustes analysis ===&lt;br /&gt;
&lt;br /&gt;
...&lt;/div&gt;</summary>
		<author><name>Nick</name></author>
	</entry>
	<entry>
		<id>https://visone.ethz.ch/wiki/index.php?title=User:Nick&amp;diff=219</id>
		<title>User:Nick</title>
		<link rel="alternate" type="text/html" href="https://visone.ethz.ch/wiki/index.php?title=User:Nick&amp;diff=219"/>
		<updated>2010-12-20T11:16:17Z</updated>

		<summary type="html">&lt;p&gt;Nick: Created page with &amp;#039;Information about me can be found on my homepage [http://www.inf.uni-konstanz.de/~nick/].&amp;#039;&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;Information about me can be found on my homepage [http://www.inf.uni-konstanz.de/~nick/].&lt;/div&gt;</summary>
		<author><name>Nick</name></author>
	</entry>
	<entry>
		<id>https://visone.ethz.ch/wiki/index.php?title=R_console_tab&amp;diff=218</id>
		<title>R console tab</title>
		<link rel="alternate" type="text/html" href="https://visone.ethz.ch/wiki/index.php?title=R_console_tab&amp;diff=218"/>
		<updated>2010-12-20T09:52:21Z</updated>

		<summary type="html">&lt;p&gt;Nick: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;The R console tab enables to send network data from visone to R (using the igraph package) and vice versa.&lt;br /&gt;
Refer to [[option_dialog#R_-_connection|visone&#039;s option dialog]] to get more information on how to set up the visone R connection.&lt;br /&gt;
&lt;br /&gt;
== tab ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;r name&#039;&#039;&#039;: defines the name of the igraph network variable in R that the visone network is assigned to (by default this is the name that was assigned to the network in visone...)&lt;br /&gt;
* &#039;&#039;&#039;send active net&#039;&#039;&#039;: &#039;&#039;&#039;send&#039;&#039;&#039; the network from the active visone tab to R, creating an igraph network variable with the specified r name (this will open the console, if it has not been shown yet)&lt;br /&gt;
* &#039;&#039;&#039;show r variables&#039;&#039;&#039;: &#039;&#039;&#039;refresh&#039;&#039;&#039;  the overview of network objects that are available in R (shown below the refresh button)&lt;br /&gt;
* &#039;&#039;&#039;load selected net&#039;&#039;&#039;: &#039;&#039;&#039;load&#039;&#039;&#039; the network object that is selected in the overview from R to a new visone tab (the name of the network will be the name of the R object; the asterisk reminds you, that it has not been saved yet); alternatively you can double-click on the according network object in the overview&lt;br /&gt;
&lt;br /&gt;
* show console: this button is used to (re)show the console without sending a network&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== console ==&lt;br /&gt;
&lt;br /&gt;
There are three tabs displaying different messages regarding the R connection:&lt;br /&gt;
* &#039;&#039;&#039;visone&#039;&#039;&#039;: all messages that originate from visone&lt;br /&gt;
* &#039;&#039;&#039;user&#039;&#039;&#039;: all messages that originate from user input in the console&lt;br /&gt;
* &#039;&#039;&#039;all&#039;&#039;&#039;: both, user and visone messages&lt;br /&gt;
&lt;br /&gt;
At the bottom of the console you find the&lt;br /&gt;
* &#039;&#039;&#039;input&#039;&#039;&#039; field that can be used to invoke any R commands&lt;br /&gt;
* &#039;&#039;&#039;close&#039;&#039;&#039; button that closes the R console window (but not the connection to R)&lt;/div&gt;</summary>
		<author><name>Nick</name></author>
	</entry>
	<entry>
		<id>https://visone.ethz.ch/wiki/index.php?title=Selection_tab&amp;diff=217</id>
		<title>Selection tab</title>
		<link rel="alternate" type="text/html" href="https://visone.ethz.ch/wiki/index.php?title=Selection_tab&amp;diff=217"/>
		<updated>2010-12-20T09:51:50Z</updated>

		<summary type="html">&lt;p&gt;Nick: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;The selection tab is a convenient way to manage selections in visone, complementing [[node selection dialog]], [[link selection dialog]] and the [[attribute manager]].&lt;br /&gt;
&lt;br /&gt;
A selection overview is shown at the top of the selection tab. The table displays:&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;name&#039;&#039;&#039;: a name/value that is associated with some nodes or links&lt;br /&gt;
* &#039;&#039;&#039;nodes&#039;&#039;&#039;: the number of nodes associated with this name/value&lt;br /&gt;
* &#039;&#039;&#039;links&#039;&#039;&#039;: the number of links associated with this name/value&lt;br /&gt;
&lt;br /&gt;
Directly under the overview you find three buttons:&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;add&#039;&#039;&#039;: is used to add those nodes and links to the selection overview, which are currently selected in the network (the associated name will be the name of this selection); alternatively yon can use &#039;&#039;add to selection&#039;&#039; in the [[node_context_menu#add_as_selection|node context menu]] or [[link_context_menu#add_as_selection|link context menu]]&lt;br /&gt;
* &#039;&#039;&#039;remove&#039;&#039;&#039;: is used to remove the nodes and links associated with the highlighted name from the selection overview (but not from the network!)&lt;br /&gt;
* &#039;&#039;&#039;remove all&#039;&#039;&#039;: is used to clear the selection overview&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
At the bottom of the selection tab additional categories can be expanded:&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;add from attribute&#039;&#039;&#039;: is used to &#039;&#039;&#039;add&#039;&#039;&#039; all node/links to the selection overview, mapped on the values of the selected &#039;&#039;&#039;attribute&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;store to attribute&#039;&#039;&#039;: is used to &#039;&#039;&#039;store&#039;&#039;&#039; the selection overview as a text list into a new node and link &#039;&#039;&#039;attribute&#039;&#039;&#039;, i.e. all values associated with a node or link are stored in a text list for the node/link&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
At the very bottom of the selection tab you find a button to invoke the [[attribute manager]] directly.&lt;/div&gt;</summary>
		<author><name>Nick</name></author>
	</entry>
	<entry>
		<id>https://visone.ethz.ch/wiki/index.php?title=Attribute_manager&amp;diff=216</id>
		<title>Attribute manager</title>
		<link rel="alternate" type="text/html" href="https://visone.ethz.ch/wiki/index.php?title=Attribute_manager&amp;diff=216"/>
		<updated>2010-12-20T09:44:10Z</updated>

		<summary type="html">&lt;p&gt;Nick: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;The attribute manager is started by clicking on its icon [[File:Attribute_manager.png|link=attribute_manager]] in visone&#039;s toolbar or pressing the attribute manager button in the [[selection_tab|selection tab]].&lt;br /&gt;
&lt;br /&gt;
As opposed to the attributes tab of the [[node_properties_dialog#attributes|node properties dialog]] and [link_properties_dialog#attributes|link properties dialog]], that only allow to change the value of already existing attributes manually, the attribute manager provides a variety of possibilities related to the creation, configuration and automatical modification of attributes.&lt;br /&gt;
&lt;br /&gt;
== categories ==&lt;br /&gt;
&lt;br /&gt;
There are 4 times 4 (2) selectable categories within the attribute manager, e.g. node attribute configuration:&lt;br /&gt;
&lt;br /&gt;
[[File:Attribute_manager2.png]]&lt;br /&gt;
&lt;br /&gt;
The four radio buttons in the top line are used to select the kind of attribute one wants to manage, namely&lt;br /&gt;
* node attributes&lt;br /&gt;
* link attributes&lt;br /&gt;
* dyad attributes&lt;br /&gt;
* graph attributes&lt;br /&gt;
&lt;br /&gt;
The four radio buttons on the left-hand side are used to specify what kind of management one is looking for, namely&lt;br /&gt;
* configuration management (manually)&lt;br /&gt;
* value management (manually)&lt;br /&gt;
* operation involving value management (automatically)&lt;br /&gt;
* import &amp;amp; export management (automatically)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== manual modifications ==&lt;br /&gt;
&lt;br /&gt;
Note, that attribute values are typically not added manually (which would be tiresome). It is more usual that attributes are [[#import_and_export|imported]] from files or computed by a [[analysis_tab|network analysis algorithm]]...&lt;br /&gt;
&lt;br /&gt;
=== configuration ===&lt;br /&gt;
&lt;br /&gt;
* check mark: the check mark in the left column defines the attribute that is displayed as label (for nodes/links)&lt;br /&gt;
* name field: enables the (re-)definition of attribute names; to create a new attribute you have to use this field to define a name first&lt;br /&gt;
* type selection: defines the type (text, binary, integer, decimal, text list, integer list, decimal list) of the attribute&lt;br /&gt;
* default: can be used to define a default value for this attribute that is assigned to all nodes automatically (since only declaring the name and type of an attribute function does not define its values)&lt;br /&gt;
* description&lt;br /&gt;
&lt;br /&gt;
Don&#039;t forget to press the apply button at the bottom of the attribute manager.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== values ===&lt;br /&gt;
&lt;br /&gt;
The values category can be used to explore the values that the nodes/links (or the selected nodes/links, if there are selected nodes/links) assume on all attribute functions that are declared. You can also modify the values if the &#039;&#039;&#039;allow editing&#039;&#039;&#039; box at the bottom right of the attribute manager is checked. Additionally, you can specify whether to &#039;&#039;&#039;show default values&#039;&#039;&#039; (bottom left) and whether to display only a subset of attributes (use check marks at the top).&lt;br /&gt;
&lt;br /&gt;
Values that are &#039;&#039;not assigned&#039;&#039; yet, are marked &#039;&#039;N/A&#039;&#039;.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== automatical modifications ==&lt;br /&gt;
&lt;br /&gt;
=== operations ===&lt;br /&gt;
&lt;br /&gt;
The operations category provides means to change a node/link attribute function as a whole.&lt;br /&gt;
&lt;br /&gt;
You might just want to &#039;&#039;&#039;copy&#039;&#039;&#039; or &#039;&#039;&#039;delete&#039;&#039;&#039; (select according &#039;&#039;operation&#039;&#039;) an existing attribute function (select according &#039;&#039;attribute&#039;&#039;) - and provide a new name of the &#039;&#039;result attribute&#039;&#039; (if you don&#039;t want to delete or, in general, overwrite the current one).&lt;br /&gt;
&lt;br /&gt;
You can also &#039;&#039;&#039;rank&#039;&#039;&#039; the nodes/links in &#039;&#039;&#039;ascending&#039;&#039;&#039; or &#039;&#039;&#039;descending&#039;&#039;&#039; &#039;&#039;order&#039;&#039; with regard to an &#039;&#039;attribute&#039;&#039;, creating an integer type &#039;&#039;result attribute&#039;&#039;.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Merge to list&#039;&#039;&#039; enables you to select a number of &#039;&#039;source attributes&#039;&#039; (pressing Crtl key to add single ones or holding shift key to select a number of successive ones) to be merged into a text &#039;&#039;result attribute&#039;&#039;, being a comma separated list of these values.&lt;br /&gt;
&lt;br /&gt;
There is also a number of possibilities to &#039;&#039;&#039;convert to values&#039;&#039;&#039;, such as &#039;&#039;&#039;maximum&#039;&#039;&#039;, &#039;&#039;&#039;minimum&#039;&#039;&#039;, &#039;&#039;&#039;average&#039;&#039;&#039;, &#039;&#039;&#039;sum&#039;&#039;&#039;, if the attribute type allows such operations. Additionally, you are able to &#039;&#039;&#039;concatenate&#039;&#039;&#039; a list to single entries.&lt;br /&gt;
&lt;br /&gt;
Finally, &#039;&#039;&#039;manipulate values&#039;&#039;&#039; provides means to automatically&lt;br /&gt;
* &#039;&#039;&#039;invert&#039;&#039;&#039; (note, that a zero attribute value will result in a N/A entry in the result attribute!)&lt;br /&gt;
* &#039;&#039;&#039;reverse&#039;&#039;&#039; &lt;br /&gt;
* &#039;&#039;&#039;add&#039;&#039;&#039; a specified &#039;&#039;offset&#039;&#039;&lt;br /&gt;
* &#039;&#039;&#039;scale&#039;&#039;&#039; with a specified &#039;&#039;scalar&#039;&#039;&lt;br /&gt;
* &#039;&#039;&#039;normalize&#039;&#039;&#039; (i.e. each value is divided by the maximum values)&lt;br /&gt;
* &#039;&#039;&#039;standardize&#039;&#039;&#039; (i.e. each value is divided by the sum of all values)&lt;br /&gt;
* &#039;&#039;&#039;round&#039;&#039;&#039; to specified &#039;&#039;fraction digits&#039;&#039;&lt;br /&gt;
* &#039;&#039;&#039;round up&#039;&#039;&#039; to specified &#039;&#039;fraction digits&#039;&#039;&lt;br /&gt;
the values of an attribute function.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== import and export ===&lt;br /&gt;
&lt;br /&gt;
When importing attributes from a .csv file you have to specify how the data shall be joined.&lt;br /&gt;
That is, the .csv file should contain a column that is named according to the &#039;&#039;&#039;join by&#039;&#039;&#039; attribute of the network.&lt;br /&gt;
It is also possible to import an additional link attribute via a .csv matrix (nodes IDs in the matrix have to be the same as in the network).&lt;br /&gt;
&lt;br /&gt;
When exporting attributes you can specify how the data shall be sorted, using the attribute selected for &#039;&#039;&#039;sort by&#039;&#039;&#039;.&lt;br /&gt;
&lt;br /&gt;
If you are working with more than one network tabs, you can also export one specified attribute of all open networks as a table.&lt;/div&gt;</summary>
		<author><name>Nick</name></author>
	</entry>
	<entry>
		<id>https://visone.ethz.ch/wiki/index.php?title=R_console_tab&amp;diff=215</id>
		<title>R console tab</title>
		<link rel="alternate" type="text/html" href="https://visone.ethz.ch/wiki/index.php?title=R_console_tab&amp;diff=215"/>
		<updated>2010-12-16T16:59:30Z</updated>

		<summary type="html">&lt;p&gt;Nick: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;The R console tab enables to send network data from visone to R (using the igraph package) and vice versa.&lt;br /&gt;
Refer to [[option_dialog#R_-_connection|visone&#039;s option dialog]] to get more information on how to set up the visone R connection.&lt;br /&gt;
&lt;br /&gt;
== tab ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;r name&#039;&#039;&#039;: defines the name of the igraph network variable in R that the visone network is assigned to (by default this is the name that was assigned to the network in visone...)&lt;br /&gt;
* &#039;&#039;&#039;send active net&#039;&#039;&#039;: &#039;&#039;&#039;send&#039;&#039;&#039; the network from the active visone tab to R, creating an igraph network variable with the speficied r name (this will open the console, if it has not been shown yet)&lt;br /&gt;
* &#039;&#039;&#039;show r varibles&#039;&#039;&#039;: &#039;&#039;&#039;refresh&#039;&#039;&#039;  the overview of network objects that are available in R (shown below the refresh button)&lt;br /&gt;
* &#039;&#039;&#039;load selected net&#039;&#039;&#039;: &#039;&#039;&#039;load&#039;&#039;&#039; the network object that is selected in the overview from R to a new visone tab (the name of the network will be the name of the R object; the asterisk reminds you, that it has not been saved yet); alternatively you can double-click on the according network object in the overview&lt;br /&gt;
&lt;br /&gt;
* show console: this button is used to (re)show the console without sending a network&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== console ==&lt;br /&gt;
&lt;br /&gt;
There are three tabs displaying different messsages regarding the R connection:&lt;br /&gt;
* &#039;&#039;&#039;visone&#039;&#039;&#039;: all messages that originate from visone&lt;br /&gt;
* &#039;&#039;&#039;user&#039;&#039;&#039;: all messages that originate from user input in the console&lt;br /&gt;
* &#039;&#039;&#039;all&#039;&#039;&#039;: both, user and visone messages&lt;br /&gt;
&lt;br /&gt;
At the bottom of the console you find the&lt;br /&gt;
* &#039;&#039;&#039;input&#039;&#039;&#039; field that can be used to invoke any R commands&lt;br /&gt;
* &#039;&#039;&#039;close&#039;&#039;&#039; button that closes the R console window (but not the connection to R)&lt;/div&gt;</summary>
		<author><name>Nick</name></author>
	</entry>
	<entry>
		<id>https://visone.ethz.ch/wiki/index.php?title=R_console_tab&amp;diff=214</id>
		<title>R console tab</title>
		<link rel="alternate" type="text/html" href="https://visone.ethz.ch/wiki/index.php?title=R_console_tab&amp;diff=214"/>
		<updated>2010-12-16T16:57:51Z</updated>

		<summary type="html">&lt;p&gt;Nick: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;The R console tab enables to send network data from visone to R (using the igraph package) and vice versa.&lt;br /&gt;
Refer to [[option_dialog#R_-_connection|visone&#039;s option dialog]] to get more information on how to set up the visone R connection.&lt;br /&gt;
&lt;br /&gt;
== tab ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;r name&#039;&#039;&#039;: defines the name of the igraph network variable in R that the visone network is assigned to (by default this is the name that was assigned to the network in visone...)&lt;br /&gt;
* &#039;&#039;&#039;send active net&#039;&#039;&#039;: &#039;&#039;&#039;send&#039;&#039;&#039; the network from the active visone tab to R, creating an igraph network variable with the speficied r name (this will open the console, if it has not been shown yet)&lt;br /&gt;
* &#039;&#039;&#039;show r varibles&#039;&#039;&#039;: &#039;&#039;&#039;refresh&#039;&#039;&#039;  the overview of network objects that are available in R (shown below the refresh button)&lt;br /&gt;
* &#039;&#039;&#039;load selected net&#039;&#039;&#039;: &#039;&#039;&#039;load&#039;&#039;&#039; the network object that is selected in the overview from R to a new visone tab (the name of the network will be the name of the R object; the asterisk reminds you, that it has not been saved yet); alternatively you can double-click on the according network object in the overview&lt;br /&gt;
&lt;br /&gt;
* show console: this button is used to (re)show the console without sending a network&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== console ==&lt;br /&gt;
&lt;br /&gt;
There are three tabs displaying different messsages regarding the R connection:&lt;br /&gt;
* &#039;&#039;&#039;visone&#039;&#039;&#039;: all messages that originate from visone&lt;br /&gt;
* &#039;&#039;&#039;user&#039;&#039;&#039;: all messages that originate from user input in the console&lt;br /&gt;
* &#039;&#039;&#039;all&#039;&#039;&#039;: both, user and visone messages&lt;br /&gt;
&lt;br /&gt;
At the bottom of the console you find:&lt;br /&gt;
* &#039;&#039;&#039;input&#039;&#039;&#039; field: can be used to invoke any R commands&lt;br /&gt;
* &#039;&#039;&#039;close&#039;&#039;&#039; button: closes the R console (but not the connection to R)&lt;/div&gt;</summary>
		<author><name>Nick</name></author>
	</entry>
</feed>