40 research outputs found

    Tree based visualization of the multilevel hierarchical organization prevalent in 2 real-life networks.

    No full text
    <p>Tree based visualization of the multilevel hierarchical organization prevalent in 2 real-life networks.</p

    a) Visualization of the weighted networks (<i>W</i><sup><i>t</i></sup>) mapping evolution of communities over 5 time-stamps. <i>W</i><sup><i>t</i></sup> tracks evolution of a cluster between two consecutive time-stamps. The colors represent the weight of the edges in <i>W</i><sup><i>t</i></sup>. The weights can take value in the range [0, 1] i.e. 0 ≤ <i>w</i>(V<sup><i>t</i></sup>(<i>j</i>, <i>k</i>)) ≤ 1. b) Visualization and tracking of community evolution by Netgram for the clusters obtained from the Kernel Spectral Clustering with Memory Effect (MKSC) algorithm [28] for Birthdeath dataset.

    No full text
    <p>Netgram showcases the birth, death, merge, split, expansion, shrinkage and continuation of communities for the Birthdeath dataset over 5 time-stamps (T<sub>1</sub>, T<sub>2</sub>, T<sub>3</sub>, T<sub>4</sub> and T<sub>5</sub>). We represent each community with a different colour circle and the size is ∝ the number of nodes in that community. From Fig 2b, we can observe the death of clusters <b>C6</b> & <b>C7</b> at time-stamps T<sub>3</sub> and T<sub>4</sub> respectively. Similarly, we can see birth of clusters <b>NewC14</b> & <b>NewC15</b> at time-stamp T<sub>4</sub> and T<sub>5</sub> respectively. We also observe that cluster <b>C11</b> merges with <b>C5</b> at time-stamp T<sub>2</sub> and cluster <b>C8</b> splits into 2 clusters at time-stamp T<sub>4</sub>. We can observe that cluster <b>C8</b> has expanded at time-stamp T<sub>3</sub>. The cluster <b>C8</b> also contracts at time-stamp T<sub>4</sub> as it splits into 2 clusters. Cluster <b>C1</b> demonstrates continuation over time.</p

    Language Teaching for Democratic Citizenship

    No full text
    <p>We observe that several edges have been removed in comparison to <a href="http://www.plosone.org/article/info:doi/10.1371/journal.pone.0137502#pone.0137502.g011" target="_blank">Fig 11</a>. The life time of community <b>C7</b> has been shortened to just 2 time-stamps and some edges with weights less than <i>ρ</i> have been removed from community <b>C3</b>.</p

    Algorithm 3: <i>GreedyFirstOrder</i>.

    No full text
    <p>Algorithm 3: <i>GreedyFirstOrder</i>.</p

    Visualization of communities for Mergesplit dataset obtained by Louvain [5] method keeping <i>ρ</i> = 0.45 and <i>ν</i> = 0.1.

    No full text
    <p>We observe that several edges have been removed in comparison to <a href="http://www.plosone.org/article/info:doi/10.1371/journal.pone.0137502#pone.0137502.g011" target="_blank">Fig 11</a>. The life time of community <b>C7</b> has been shortened to just 2 time-stamps and some edges with weights less than <i>ρ</i> have been removed from community <b>C3</b>.</p

    Visualization of evolution of communities for the NIPS dataset by Netgram toolkit.

    No full text
    <p>Visualization of evolution of communities for the NIPS dataset by Netgram toolkit.</p

    Algorithm 3: Greedy Solution to Handle Cross-Overs.

    No full text
    <p>Algorithm 3: Greedy Solution to Handle Cross-Overs.</p

    Word clouds for top words in the communities detected by MKSC method [28, 29] over the first few time-stamps for the NIPS dataset.

    No full text
    <p>Word clouds for top words in the communities detected by MKSC method [<a href="http://www.plosone.org/article/info:doi/10.1371/journal.pone.0137502#pone.0137502.ref028" target="_blank">28</a>, <a href="http://www.plosone.org/article/info:doi/10.1371/journal.pone.0137502#pone.0137502.ref029" target="_blank">29</a>] over the first few time-stamps for the NIPS dataset.</p

    MH-KSC algorithm for the PGP network. Communities with same colour belong to one cluster.

    No full text
    <p>MH-KSC algorithm for the PGP network. Communities with same colour belong to one cluster.</p
    corecore