Incremental Density-Based Link Clustering Algorithm for Community Detection in Dynamic Networks

<table class="figure-group"><tr class="fig-image" id="a"><td><object data="https://static.hindawi.com/articles/mpe/volume-2016/1873504/figures/1873504.fig.006a.svgz" name="1873504.fig.006a" type="image/svg+xml"></object></td></tr><tr class="fig-caption"><td><b>(a) </b>Community structure at <svg height="8.69875pt" id="M259" style="vertical-align:-0.3499298pt" version="1.1" viewbox="-0.0498162 -8.34882 24.2832 8.69875" width="24.2832pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M324 430H196L233 583L223 592L145 529L120 430H54L29 396L31 388H111L56 126C33 15 54 -12 77 -12C137 -12 214 57 250 95L233 119C208 92 155 59 138 59C126 59 120 70 131 125L186 390L298 394L324 430Z" id="g113-117"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="341" vert-adv-y="341"></glyph.data></g><g transform="matrix(.013,0,0,-0.013,7.339,0)"><path d="M535 230V280H52V230H535Z" id="g117-33"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="587" vert-adv-y="587"></glyph.data></g><g transform="matrix(.013,0,0,-0.013,17.875,0)"><path d="M384 0V27C293 34 287 42 287 114V635C232 613 172 594 109 583V559L157 557C201 555 205 550 205 499V114C205 42 199 34 109 27V0H384Z" id="g113-50"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="480" vert-adv-y="480"></glyph.data></g></svg> moment</td></tr><tr class="fig-image" id="b"><td><object data="https://static.hindawi.com/articles/mpe/volume-2016/1873504/figures/1873504.fig.006b.svgz" name="1873504.fig.006b" type="image/svg+xml"></object></td></tr><tr class="fig-caption"><td><b>(b) </b>Community structure at<i> t</i> moment</td></tr></table>

<div>Demonstration of overlapping node community formation.</div>

Mathematical Problems in Engineering

fig6

Figure 6

Figure 6: Incremental Density-Based Link Clustering Algorithm for Community Detection in Dynamic Networks 