Preferred Language
Articles
/
ijs-6945
An Evolutionary Bi-clustering Algorithm for Community Mining in Complex Networks
...Show More Authors

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 optimization problem where a modularity-based ( ) and normalized mutual information ( ) metrics are formulated to describe the problem. An evolutionary algorithm is then expressed in the light of its characteristic components to tackle the problem. The presentation will highlight the possible alternative that can be adopted in this study for individual representation, fitness evaluations, and crossover and mutation operators. The results point out that adopting as a fitness function carries out more correct solutions than adopting the modularity function . Moreover, the strength of mutation has a background role. When coupled with non elite selection, increasing mutation probability could results in better solutions. However, when elitism is used, increasing mutation probability could bewilder the behavior of EA.
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 optimization problem where a modularity-based ( ) and normalized mutual information ( ) metrics are formulated to describe the problem. An evolutionary algorithm is then expressed in the light of its characteristic components to tackle the problem. The presentation will highlight the possible alternative that can be adopted in this study for individual representation, fitness evaluations, and crossover and mutation operators. The results point out that adopting as a fitness function carries out more correct solutions than adopting the modularity function . Moreover, the strength of mutation has a background role. When coupled with non elite selection, increasing mutation probability could results in better solutions. However, when elitism is used, increasing mutation probability could bewilder the behavior of EA.

View Publication Preview PDF
Quick Preview PDF
Publication Date
Thu Jul 01 2021
Journal Name
Iraqi Journal Of Science
The Influence of NMI against Modularity in Community Detection Problem: A Case Study for Unsigned and Signed Networks
...Show More Authors

Community detection is useful for better understanding the structure of complex networks. It aids in the extraction of the required information from such networks and has a vital role in different fields that range from healthcare to regional geography, economics, human interactions, and mobility. The method for detecting the structure of communities involves the partitioning of complex networks into groups of nodes, with extensive connections within community and sparse connections with other communities. In the literature, two main measures, namely the Modularity (Q) and Normalized Mutual Information (NMI) have been used for evaluating the validation and quality of the detected community structures. Although many optimization algo

... Show More
Scopus (1)
Crossref (1)
Scopus Crossref
Publication Date
Wed Apr 10 2019
Journal Name
Engineering, Technology & Applied Science Research
Content Based Image Clustering Technique Using Statistical Features and Genetic Algorithm
...Show More Authors

Text based-image clustering (TBIC) is an insufficient approach for clustering related web images. It is a challenging task to abstract the visual features of images with the support of textual information in a database. In content-based image clustering (CBIC), image data are clustered on the foundation of specific features like texture, colors, boundaries, shapes. In this paper, an effective CBIC) technique is presented, which uses texture and statistical features of the images. The statistical features or moments of colors (mean, skewness, standard deviation, kurtosis, and variance) are extracted from the images. These features are collected in a one dimension array, and then genetic algorithm (GA) is applied for image clustering.

... Show More
View Publication
Scopus (5)
Crossref (2)
Scopus Crossref
Publication Date
Sat Jan 30 2021
Journal Name
Iraqi Journal Of Science
Using Non-dominated Sorting Particle Swarm Optimization Algorithm II for Bi-objective Flow Shop Scheduling Problems
...Show More Authors

A hybrid particulate swarm optimization (hybrid) combination of an optimization algorithm of the particle swarm and a variable neighborhood search algorithm is proposed for the multi-objective permutation flow shop scheduling problem (PFSP) with the smallest cumulative completion time and the smallest total flow time. Algorithm for hybrid particulate swarm optimization (HPSO) is applied to maintain a fair combination of centralized search with decentralized search. The Nawaz-Enscore-Ham )NEH) heuristic algorithm in this hybrid algorithm is used to initialize populations in order to improve the efficiency of the initial solution. The method design is based on ascending order (ranked-order-value, ROV), applying the continuous PSO algorithm

... Show More
View Publication Preview PDF
Scopus (7)
Crossref (3)
Scopus Crossref
Publication Date
Sun Jul 01 2018
Journal Name
Ieee Transactions On Intelligent Transportation Systems
Real-Time Intersection-Based Segment Aware Routing Algorithm for Urban Vehicular Networks
...Show More Authors

High vehicular mobility causes frequent changes in the density of vehicles, discontinuity in inter-vehicle communication, and constraints for routing protocols in vehicular ad hoc networks (VANETs). The routing must avoid forwarding packets through segments with low network density and high scale of network disconnections that may result in packet loss, delays, and increased communication overhead in route recovery. Therefore, both traffic and segment status must be considered. This paper presents real-time intersection-based segment aware routing (RTISAR), an intersection-based segment aware algorithm for geographic routing in VANETs. This routing algorithm provides an optimal route for forwarding the data packets toward their destination

... Show More
View Publication
Scopus (66)
Crossref (58)
Scopus Clarivate Crossref
Publication Date
Mon Mar 01 2010
Journal Name
Journal Of Computer Science
Dropping down the Maximum Item Set: Improving the Stylometric Authorship Attribution Algorithm in the Text Mining for Authorship Investigation
...Show More Authors

View Publication
Scopus (4)
Crossref (2)
Scopus 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
...Show More Authors

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 (3)
Crossref (2)
Scopus Crossref
Publication Date
Thu Jan 20 2022
Journal Name
Webology
Hybrid Intrusion Detection System based on DNA Encoding, Teiresias Algorithm and Clustering Method
...Show More Authors

Until recently, researchers have utilized and applied various techniques for intrusion detection system (IDS), including DNA encoding and clustering that are widely used for this purpose. In addition to the other two major techniques for detection are anomaly and misuse detection, where anomaly detection is done based on user behavior, while misuse detection is done based on known attacks signatures. However, both techniques have some drawbacks, such as a high false alarm rate. Therefore, hybrid IDS takes advantage of combining the strength of both techniques to overcome their limitations. In this paper, a hybrid IDS is proposed based on the DNA encoding and clustering method. The proposed DNA encoding is done based on the UNSW-NB15

... Show More
View Publication
Crossref (2)
Crossref
Publication Date
Thu May 18 2023
Journal Name
Journal Of Engineering
A Modified Strength Pareto Evolutionary Algorithm 2 based Environmental /Economic Power Dispatch
...Show More Authors

A Strength Pareto Evolutionary Algorithm 2 (SPEA 2) approach for solving the multi-objective Environmental / Economic Power Dispatch (EEPD) problem is presented in this paper. In the past fuel cost consumption minimization was the aim (a single objective function) of economic power dispatch problem. Since the clean air act amendments have been applied to reduce SO2 and NOX emissions from power plants, the utilities change their strategies in order to reduce pollution and atmospheric emission as well, adding emission minimization as other objective function made economic power dispatch (EPD) a multi-objective problem having conflicting objectives. SPEA2 is the improved version of SPEA with better fitness assignment, density estimation, an

... Show More
View Publication Preview PDF
Crossref
Publication Date
Fri Jul 01 2022
Journal Name
Iraqi Journal Of Science
Extractive Multi-Document Text Summarization Using Multi-Objective Evolutionary Algorithm Based Model
...Show More Authors

Automatic document summarization technology is evolving and may offer a solution to the problem of information overload. Multi-document summarization is an optimization problem demanding optimizing more than one objective function concurrently. The proposed work considers a balance of two significant objectives: content coverage and diversity while generating a summary from a collection of text documents. Despite the large efforts introduced from several researchers for designing and evaluating performance of many text summarization techniques, their formulations lack the introduction of any model that can give an explicit representation of – coverage and diversity – the two contradictory semantics of any summary. The design of gener

... Show More
View Publication Preview PDF
Publication Date
Sun Jan 01 2023
Journal Name
Computers, Materials & Continua
An Optimal Algorithm for Resource Allocation in D2D Communication
...Show More Authors

View Publication
Scopus Clarivate Crossref