A Dynamic Modularity Based Community Detection Algorithm for Large-scale Networks: DSLM

Date

2015-08-28

Author

Aktunc, Riza
Toroslu, İsmail Hakkı
Ozer, Mert
Davulcu, Hasan

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

102
views

0
downloads

In this work, a new fast dynamic community detection algorithm for large scale networks is presented. Most of the previous community detection algorithms are designed for static networks. However, large scale social networks are dynamic and evolve frequently over time. To quickly detect communities in dynamic large scale networks, we proposed dynamic modularity optimizer framework (DMO) that is constructed by modifying well-known static modularity based community detection algorithm. The proposed framework is tested using several different datasets. According to our results, community detection algorithms in the proposed framework perform better than static algorithms when large scale dynamic networks are considered.

URI

https://hdl.handle.net/11511/36475

DOI

https://doi.org/10.1145/2808797.2808822

Collections

Department of Computer Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

Dynamic modularity based community detection for large scale networks Aktunç, Rıza; Toroslu, İsmail Hakkı; Department of Computer Engineering (2015) In this work, a new fast dynamic community detection framework for large scale networks is presented. Most of the previous community detection algorithms are designed for static networks. Static modularity optimizer framework (SMO), which is introduced by Waltman & Van Eck, consists of such community detection algorithms. However, large scale social networks are dynamic and evolve frequently over time. To quickly detect communities in dynamic large scale networks, we proposed dynamic modularity optimizer fr...
A new multiobjective simulated annealing algorithm Tekinalp, Ozan (Springer Science and Business Media LLC, 2007-09-01) A new multiobjective simulated annealing algorithm for continuous optimization problems is presented. The algorithm has an adaptive cooling schedule and uses a population of fitness functions to accurately generate the Pareto front. Whenever an improvement with a fitness function is encountered, the trial point is accepted, and the temperature parameters associated with the improving fitness functions are cooled. Beside well known linear fitness functions, special elliptic and ellipsoidal fitness functions,...
A Novel Neural Network Method for Direction of Arrival Estimation with Uniform Cylindrical 12-Element Microstrip Patch Array Caylar, Selcuk; Dural, Guelbin; Leblebicioğlu, Mehmet Kemal (2008-01-01) In this study a new neural network algorithm is proposed for real time multiple source tracking problem with cylindrical patch antenna array based on a previous v reported Modified Neural Multiple Source Tracking Algorithm(MN-MUST). The proposed algorithm, namely Cylindrical Microstrip Patch Array Modified Neural Multiple Source Tracking Algorithm (CMN-MUST) implements W-MUST algorithm on a cylindrical microsttip patch array structure. CMN-MUST algorithm uses the advantage of directive pattern of microstrip...
A Hybrid Movie Recommender Using Dynamic Fuzzy Clustering Gurcan, Fatih; Birtürk, Ayşe Nur (2015-09-24) We propose an online hybrid recommender strategy named content-boosted collaborative filtering with dynamic fuzzy clustering (CBCFdfc) based on content boosted collaborative filtering algorithm which aims to improve the prediction accuracy and efficiency. CBCFdfc combines content-based and collaborative characteristics to solve problems like sparsity, new item and over-specialization. CBCFdfc uses fuzzy clustering to keep a certain level of prediction accuracy while decreasing online prediction time. We com...
A Buffer Zone Computation Algorithm for Corridor Rendering in GIS Er, Emre; Kilinc, Ismail; Gezici, Goerkem; Baykal, Buyurman (2009-09-16) This work defines a corridor rendering algorithm with variable leg buffer distances and the algorithm also supports geographic world model. A corridor is defined by a path and two distances for each leg to make a buffered zone around the path. Rendering of a corridor is a challenging task in GIS applications. Corridor is extensively used on mission computer displays on command and control platforms and civilian air control centers. Line buffering [1] and offset curve [2] approximations are the special case ...

Citation Formats

R. Aktunc, İ. H. Toroslu, M. Ozer, and H. Davulcu, “A Dynamic Modularity Based Community Detection Algorithm for Large-scale Networks: DSLM,” 2015, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/36475.