Preferred Language
Articles
/
ijs-6380
Community Tracking in Time Evolving Networks: An Evolutionary Multi-objective Approach

In real world, almost all networks evolve over time. For example, in networks of friendships and acquaintances, people continually create and delete friendship relationship connections over time, thereby add and draw friends, and some people become part of new social networks or leave their networks, changing the nodes in the network. Recently, tracking communities encountering topological shifting drawn significant attentions and many successive algorithms have been proposed to model the problem. In general, evolutionary clustering can be defined as clustering data over time wherein two concepts: snapshot quality and temporal smoothness should be considered. Snapshot quality means that the clusters should be as precise as possible during the current time step. Temporal smoothness, on the other hand, means that the clusters should not changed dramatically between successive time steps. In this paper, a multi-objective optimization model, based on internal community density as snapshot metric, is proposed and compared with the state-of-the-art modularity based model. Both models are then used to solve the community tracking problem in dynamic social network. The problem, in both models, is stated as a multi-objective optimization problem and the decomposition based multi-objective evolutionary algorithm is used to solve the problem. Experimental results reveals that the proposed model significantly outperforms the already existing model in the ability of tracking more shifted communities.

View Publication Preview PDF
Quick Preview PDF
Publication Date
Sun Dec 01 2019
Journal Name
Applied Soft Computing
Scopus (7)
Crossref (5)
Scopus Clarivate Crossref
View Publication
Publication Date
Thu Dec 01 2016
Journal Name
Swarm And Evolutionary Computation
Scopus (23)
Crossref (22)
Scopus Clarivate Crossref
View Publication
Publication Date
Sun Nov 01 2020
Journal Name
2020 2nd Annual International Conference On Information And Sciences (aicis)
Scopus (3)
Crossref (1)
Scopus Crossref
View Publication
Publication Date
Mon Feb 01 2016
Journal Name
Swarm And Evolutionary Computation
Scopus (31)
Crossref (27)
Scopus Clarivate Crossref
Publication Date
Thu Oct 31 2019
Journal Name
Journal Of Theoretical And Applied Information Technology
Scopus (3)
Scopus
Preview PDF
Publication Date
Sun Mar 01 2020
Journal Name
Computer Networks
Scopus (6)
Crossref (3)
Scopus Clarivate Crossref
View Publication
Publication Date
Thu Apr 28 2022
Journal Name
Iraqi Journal Of Science
An Evolutionary Bi-clustering Algorithm for Community Mining in Complex Networks

A network (or formally a graph) can be described by a set of nodes and a set of edges connecting these nodes. Networks model many real-world phenomena in various research domains, such as biology, engineering and sociology. Community mining is discovering the groups in a network where individuals group of membership are not explicitly given. Detecting natural divisions in such complex networks is proved to be extremely NP-hard problem that recently enjoyed a considerable interest. Among the proposed methods, the field of evolutionary algorithms (EAs) takes a remarkable interest. To this end, the aim of this paper is to present the general statement of community detection problem in social networks. Then, it visits the problem as an optim

... Show More
View Publication Preview PDF
Publication Date
Sat Sep 27 2014
Journal Name
Soft Computing
Scopus (30)
Crossref (23)
Scopus Clarivate Crossref
View Publication
Publication Date
Fri Jul 01 2022
Journal Name
Iraqi Journal Of Science
Multi-layer Multi-objective Evolutionary Algorithm for Adjustable Range Set Covers Problem in Wireless Sensor Networks

Establishing complete and reliable coverage for a long time-span is a crucial issue in densely surveillance wireless sensor networks (WSNs). Many scheduling algorithms have been proposed to model the problem as a maximum disjoint set covers (DSC) problem. The goal of DSC based algorithms is to schedule sensors into several disjoint subsets. One subset is assigned to be active, whereas, all remaining subsets are set to sleep. An extension to the maximum disjoint set covers problem has also been addressed in literature to allow for more advance sensors to adjust their sensing range. The problem, then, is extended to finding maximum number of overlapped set covers. Unlike all related works which concern with the disc sensing model, the cont

... Show More
View Publication Preview PDF
Publication Date
Wed Nov 17 2021
Journal Name
Periodicals Of Engineering And Natural Sciences (pen)
Scopus (3)
Scopus Crossref
View Publication