Preferred Language
Articles
/
9RalVooBVTCNdQwCN5v5
Community Detection in Modular Complex Networks Using an Improved Particle Swarm Optimization Algorithm

     Community detection is an important and interesting topic for better understanding and analyzing complex network structures. Detecting hidden partitions in complex networks is proven to be an NP-hard problem that may not be accurately resolved using traditional methods. So it is solved using evolutionary computation methods and modeled in the literature as an optimization problem.  In recent years, many researchers have directed their research efforts toward addressing the problem of community structure detection by developing different algorithms and making use of single-objective optimization methods. In this study, we have continued that research line by improving the Particle Swarm Optimization (PSO) algorithm using a local improvement operator to effectively discover community structure in the modular complex networks when employing the modularity density metric as a single-objective function. The framework of the proposed algorithm consists of three main steps: an initialization strategy, a movement strategy based on perturbation genetic operators, and an improvement operator. The key idea behind the improvement operator is to determine and reassign the complex network nodes that are located in the wrong communities if the majority of their topological links do not belong to their current communities, making it appear that these nodes belong to another community. The performance of the proposed algorithm has been tested and evaluated when applied to publicly-available modular complex networks generated using a flexible and simple benchmark generator. The experimental results showed the effectiveness of the suggested method in discovering community structure over modular networks of different complexities and sizes.

Scopus Crossref
View Publication Preview PDF
Quick Preview PDF
Publication Date
Mon May 15 2017
Journal Name
Journal Of Theoretical And Applied Information Technology
Anomaly detection in text data that represented as a graph using dbscan algorithm

Anomaly detection is still a difficult task. To address this problem, we propose to strengthen DBSCAN algorithm for the data by converting all data to the graph concept frame (CFG). As is well known that the work DBSCAN method used to compile the data set belong to the same species in a while it will be considered in the external behavior of the cluster as a noise or anomalies. It can detect anomalies by DBSCAN algorithm can detect abnormal points that are far from certain set threshold (extremism). However, the abnormalities are not those cases, abnormal and unusual or far from a specific group, There is a type of data that is do not happen repeatedly, but are considered abnormal for the group of known. The analysis showed DBSCAN using the

... Show More
Preview PDF
Scopus (3)
Scopus
Publication Date
Thu Dec 01 2016
Journal Name
Swarm And Evolutionary Computation
A new multi-objective evolutionary framework for community mining in dynamic social networks

View Publication
Scopus (23)
Crossref (22)
Scopus Clarivate Crossref
Publication Date
Sun Feb 25 2024
Journal Name
Baghdad Science Journal
SBOA: A Novel Heuristic Optimization Algorithm

A new human-based heuristic optimization method, named the Snooker-Based Optimization Algorithm (SBOA), is introduced in this study. The inspiration for this method is drawn from the traits of sales elites—those qualities every salesperson aspires to possess. Typically, salespersons strive to enhance their skills through autonomous learning or by seeking guidance from others. Furthermore, they engage in regular communication with customers to gain approval for their products or services. Building upon this concept, SBOA aims to find the optimal solution within a given search space, traversing all positions to obtain all possible values. To assesses the feasibility and effectiveness of SBOA in comparison to other algorithms, we conducte

... Show More
View Publication Preview PDF
Scopus (4)
Crossref (2)
Scopus Crossref
Publication Date
Fri Mar 01 2024
Journal Name
Baghdad Science Journal
Best approximation in b-modular spaces

In this paper, some basic notions and facts in the b-modular space similar to those in the modular spaces as a type of generalization are given.  For example, concepts of convergence, best approximate, uniformly convexity etc. And then, two results about relation between semi compactness and approximation are proved which are used to prove a theorem on the existence of best approximation for a semi-compact subset of b-modular space.

View Publication Preview PDF
Scopus Crossref
Publication Date
Thu Apr 26 2018
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
Common Fixed Points in Modular Spaces

     In this paper,there are   new considerations about the dual of a modular spaces and weak convergence. Two common fixed point theorems for a -non-expansive mapping defined on a star-shaped weakly compact subset are proved,  Here the conditions of affineness, demi-closedness and Opial's property play an active role in the proving our results.

 

View Publication Preview PDF
Crossref (3)
Crossref
Publication Date
Sat Oct 31 2020
Journal Name
International Journal Of Intelligent Engineering And Systems
Automatic Computer Aided Diagnostic for COVID-19 Based on Chest X-Ray Image and Particle Swarm Intelligence

View Publication
Scopus (22)
Crossref (5)
Scopus Crossref
Publication Date
Fri Apr 01 2022
Journal Name
Baghdad Science Journal
Improved Firefly Algorithm with Variable Neighborhood Search for Data Clustering

Among the metaheuristic algorithms, population-based algorithms are an explorative search algorithm superior to the local search algorithm in terms of exploring the search space to find globally optimal solutions. However, the primary downside of such algorithms is their low exploitative capability, which prevents the expansion of the search space neighborhood for more optimal solutions. The firefly algorithm (FA) is a population-based algorithm that has been widely used in clustering problems. However, FA is limited in terms of its premature convergence when no neighborhood search strategies are employed to improve the quality of clustering solutions in the neighborhood region and exploring the global regions in the search space. On the

... Show More
View Publication Preview PDF
Scopus (12)
Crossref (3)
Scopus Clarivate Crossref
Publication Date
Tue Nov 01 2022
Journal Name
2022 International Conference On Data Science And Intelligent Computing (icdsic)
An improved Bi-LSTM performance using Dt-WE for implicit aspect extraction

In aspect-based sentiment analysis ABSA, implicit aspects extraction is a fine-grained task aim for extracting the hidden aspect in the in-context meaning of the online reviews. Previous methods have shown that handcrafted rules interpolated in neural network architecture are a promising method for this task. In this work, we reduced the needs for the crafted rules that wastefully must be articulated for the new training domains or text data, instead proposing a new architecture relied on the multi-label neural learning. The key idea is to attain the semantic regularities of the explicit and implicit aspects using vectors of word embeddings and interpolate that as a front layer in the Bidirectional Long Short-Term Memory Bi-LSTM. First, we

... Show More
View Publication Preview PDF
Scopus (4)
Crossref (2)
Scopus Crossref
Publication Date
Mon Oct 05 2020
Journal Name
International Journal Of Advanced Science And Technology
Improved Merging Multi Convolutional Neural Networks Framework of Image Indexing and Retrieval

Improved Merging Multi Convolutional Neural Networks Framework of Image Indexing and Retrieval

Publication Date
Fri May 01 2020
Journal Name
International Journal Of Advanced Science And Technology
Improved Merging Multi Convolutional Neural Networks Framework of Image Indexing and Retrieval

Background/Objectives: The purpose of current research aims to a modified image representation framework for Content-Based Image Retrieval (CBIR) through gray scale input image, Zernike Moments (ZMs) properties, Local Binary Pattern (LBP), Y Color Space, Slantlet Transform (SLT), and Discrete Wavelet Transform (DWT). Methods/Statistical analysis: This study surveyed and analysed three standard datasets WANG V1.0, WANG V2.0, and Caltech 101. The features an image of objects in this sets that belong to 101 classes-with approximately 40-800 images for every category. The suggested infrastructure within the study seeks to present a description and operationalization of the CBIR system through automated attribute extraction system premised on CN

... Show More