Preferred Language
Articles
/
2hatUocBVTCNdQwCDkSU
Community detection model for dynamic networks based on hidden Markov model and evolutionary algorithm
...Show More Authors

Finding communities of connected individuals in complex networks is challenging, yet crucial for understanding different real-world societies and their interactions. Recently attention has turned to discover the dynamics of such communities. However, detecting accurate community structures that evolve over time adds additional challenges. Almost all the state-of-the-art algorithms are designed based on seemingly the same principle while treating the problem as a coupled optimization model to simultaneously identify community structures and their evolution over time. Unlike all these studies, the current work aims to individually consider this three measures, i.e. intra-community score, inter-community score, and evolution of community over time. Here, we adopt a new perspective towards detecting the evolution of community structures. The proposed method realizes the decomposition of the problem into three essential components; searching in: intra-community connections, inter-community connections, and community evolution. A multi-objective optimization problem is defined to account for the different intra and inter community structures. Further, we formulate the community evolution problem as a Hidden Markov Model in an attempt to dexterously track the most likely sequence of communities. Then the new model, called Hidden Markov Model-based Multi-Objective evolutionary algorithm for Dynamic Community Detection (HMM-MODCD), uses a multi-objective evolutionary algorithm and Viterbi algorithm for formulating objective functions and providing temporal smoothness over time for clustering dynamic networks. The performance of the proposed algorithm is evaluated on synthetic and real-world dynamic networks and compared against several state-of-the-art algorithms. The results clearly demonstrate the effectiveness of the proposed algorithm to outperform other algorithms.

Scopus Clarivate Crossref
View Publication
Publication Date
Sat Nov 30 2019
Journal Name
Journal Of Engineering And Applied Sciences
Using Particle Swarm Optimization Algorithm to Address the Multicollinearity Problem
...Show More Authors

View Publication
Scopus (2)
Scopus Crossref
Publication Date
Sun Feb 25 2024
Journal Name
Baghdad Science Journal
Human Pose Estimation Algorithm Using Optimized Symmetric Spatial Transformation Network
...Show More Authors

Human posture estimation is a crucial topic in the computer vision field and has become a hotspot for research in many human behaviors related work. Human pose estimation can be understood as the human key point recognition and connection problem. The paper presents an optimized symmetric spatial transformation network designed to connect with single-person pose estimation network to propose high-quality human target frames from inaccurate human bounding boxes, and introduces parametric pose non-maximal suppression to eliminate redundant pose estimation, and applies an elimination rule to eliminate similar pose to obtain unique human pose estimation results. The exploratory outcomes demonstrate the way that the proposed technique can pre

... Show More
View Publication Preview PDF
Scopus (2)
Scopus Crossref
Publication Date
Sun Sep 03 2017
Journal Name
Baghdad Science Journal
Scale-Invariant Feature Transform Algorithm with Fast Approximate Nearest Neighbor
...Show More Authors

There is a great deal of systems dealing with image processing that are being used and developed on a daily basis. Those systems need the deployment of some basic operations such as detecting the Regions of Interest and matching those regions, in addition to the description of their properties. Those operations play a significant role in decision making which is necessary for the next operations depending on the assigned task. In order to accomplish those tasks, various algorithms have been introduced throughout years. One of the most popular algorithms is the Scale Invariant Feature Transform (SIFT). The efficiency of this algorithm is its performance in the process of detection and property description, and that is due to the fact that

... Show More
View Publication Preview PDF
Scopus (3)
Crossref (3)
Scopus Crossref
Publication Date
Thu Feb 01 2024
Journal Name
Ain Shams Engineering Journal
Performance enhancement of high degree Charlier polynomials using multithreaded algorithm
...Show More Authors

View Publication
Scopus (6)
Crossref (5)
Scopus Clarivate Crossref
Publication Date
Sun Mar 01 2009
Journal Name
Al-khwarizmi Engineering Journal
Multidimensional Systolic Arrays of LMS Algorithm Adaptive (FIR) Digital Filters
...Show More Authors

A multidimensional systolic arrays realization of LMS algorithm by a method of mapping regular algorithm onto processor array, are designed. They are based on appropriately selected 1-D systolic array filter that depends on the inner product sum systolic implementation. Various arrays may be derived that exhibit a regular arrangement of the cells (processors) and local interconnection pattern, which are important for VLSI implementation. It reduces latency time and increases the throughput rate in comparison to classical 1-D systolic arrays. The 3-D multilayered array consists of 2-D layers, which are connected with each other only by edges. Such arrays for LMS-based adaptive (FIR) filter may be opposed the fundamental requirements of fa

... Show More
View Publication Preview PDF
Publication Date
Mon Jun 05 2023
Journal Name
Journal Of Economics And Administrative Sciences
Selection of variables Affecting Red Blood Cell by Firefly Algorithm
...Show More Authors

Some maps of the chaotic firefly algorithm were selected to select variables for data on blood diseases and blood vessels obtained from Nasiriyah General Hospital where the data were tested and tracking the distribution of Gamma and it was concluded that a Chebyshevmap method is more efficient than a Sinusoidal map method through mean square error criterion.

View Publication Preview PDF
Crossref
Publication Date
Tue Nov 17 2015
Journal Name
International Journal Of Computer Applications
Categorization of ‘Holy Quran-Tafseer’ using K-Nearest Neighbor Algorithm
...Show More Authors

View Publication
Crossref (1)
Crossref
Publication Date
Wed Jun 01 2022
Journal Name
Journal Of King Saud University - Computer And Information Sciences
Heuristic initialization of PSO task scheduling algorithm in cloud computing
...Show More Authors

View Publication
Scopus (171)
Crossref (126)
Scopus Clarivate Crossref
Publication Date
Thu Dec 31 2020
Journal Name
Iraqi Journal Of Market Research And Consumer Protection
SYNTHESIS OF THE NEW NAPROXEN SELECTIVE ELECTRODE BASED ON IMPRINTED POLYMER USING DIFFERENT MONOMERS AND ITS DETERMINATION AT PHARMACEUTICAL PREPARATION: SYNTHESIS OF THE NEW NAPROXEN SELECTIVE ELECTRODE BASED ON IMPRINTED POLYMER USING DIFFERENT MONOMERS AND ITS DETERMINATION AT PHARMACEUTICAL PREPARATION
...Show More Authors

ABSTRACT

Naproxen(NPX) imprinted liquid electrodes of polymers are built using polymerization precipitation. The molecularly imprinted (MIP) and non imprinted (NIP) polymers were synthesized using NPX as a template. In the polymerization precipitation involved, styrene(STY) was used as monomer, N,N-methylenediacrylamide (N,N-MDAM) as a cross-linker and benzoyl peroxide (BPO) as an initiator. The molecularly imprinted membranes and the non-imprinted membranes were prepared using acetophenone(AOPH) and di octylphathalate(DOP)as plasticizers in PVC matrix. The slopes and detection limits of the liquid electrodes ranged from)-18.1,-17.72 (mV/decade and )4.0 x 10-

... Show More
View Publication Preview PDF
Publication Date
Mon Jul 01 2019
Journal Name
International Journal Of Swarm Intelligence Research
A New Strategy Based on GSABAT to Solve Single Objective Optimization Problem
...Show More Authors

This article proposes a new strategy based on a hybrid method that combines the gravitational search algorithm (GSA) with the bat algorithm (BAT) to solve a single-objective optimization problem. It first runs GSA, followed by BAT as the second step. The proposed approach relies on a parameter between 0 and 1 to address the problem of falling into local research because the lack of a local search mechanism increases intensity search, whereas diversity remains high and easily falls into the local optimum. The improvement is equivalent to the speed of the original BAT. Access speed is increased for the best solution. All solutions in the population are updated before the end of the operation of the proposed algorithm. The diversification f

... Show More
View Publication Preview PDF
Scopus (4)
Crossref (4)
Scopus Clarivate Crossref