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
Tue Nov 30 2021
Journal Name
Iraqi Journal Of Science
Inspecting Hybrid Data Mining Approaches in Decision Support Systems for Humanities Texts Criticism
...Show More Authors

The majority of systems dealing with natural language processing (NLP) and artificial intelligence (AI) can assist in making automated and automatically-supported decisions. However, these systems may face challenges and difficulties or find it confusing to identify the required information (characterization) for eliciting a decision by extracting or summarizing relevant information from large text documents or colossal content.   When obtaining these documents online, for instance from social networking or social media, these sites undergo a remarkable increase in the textual content. The main objective of the present study is to conduct a survey and show the latest developments about the implementation of text-mining techniqu

... Show More
View Publication Preview PDF
Scopus (1)
Scopus Crossref
Publication Date
Sat Jan 20 2024
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
Comparison of Complex Sadik and KAJ Transforms for Ordinary Differential Equations to the Response of an Uncompressed Forced Oscillator
...Show More Authors

In this paper we have presented a comparison between two novel integral transformations that are of great importance in the solution of differential equations. These two transformations are the complex Sadik transform and the KAJ transform. An uncompressed forced oscillator, which is an important application, served as the basis for comparison. The application was solved and exact solutions were obtained. Therefore, in this paper, the exact solution was found based on two different integral transforms: the first integral transform complex Sadik and the second integral transform KAJ. And these exact solutions obtained from these two integral transforms were new methods with simple algebraic calculations and applied to different problems.

... Show More
View Publication Preview PDF
Crossref
Publication Date
Wed Aug 31 2022
Journal Name
Iraqi Journal Of Science
Data Mining Methods for Extracting Rumors Using Social Analysis Tools
...Show More Authors

       Rumors are typically described as remarks whose true value is unknown. A rumor on social media has the potential to spread erroneous information to a large group of individuals. Those false facts will influence decision-making in a variety of societies. In online social media, where enormous amounts of information are simply distributed over a large network of sources with unverified authority, detecting rumors is critical. This research proposes that rumor detection be done using Natural Language Processing (NLP) tools as well as six distinct Machine Learning (ML) methods (Nave Bayes (NB), random forest (RF), K-nearest neighbor (KNN), Logistic Regression (LR), Stochastic Gradient Descent (SGD) and Decision Tree (

... Show More
View Publication Preview PDF
Scopus (1)
Scopus Crossref
Publication Date
Sun Jun 12 2011
Journal Name
Baghdad Science Journal
An algorithm for binary codebook design based on the average bitmap replacement error (ABPRE)
...Show More Authors

In this paper, an algorithm for binary codebook design has been used in vector quantization technique, which is used to improve the acceptability of the absolute moment block truncation coding (AMBTC) method. Vector quantization (VQ) method is used to compress the bitmap (the output proposed from the first method (AMBTC)). In this paper, the binary codebook can be engender for many images depending on randomly chosen to the code vectors from a set of binary images vectors, and this codebook is then used to compress all bitmaps of these images. The chosen of the bitmap of image in order to compress it by using this codebook based on the criterion of the average bitmap replacement error (ABPRE). This paper is suitable to reduce bit rates

... Show More
View Publication Preview PDF
Crossref
Publication Date
Mon Apr 03 2023
Journal Name
International Journal Of Online And Biomedical Engineering (ijoe)
An Integrated Grasshopper Optimization Algorithm with Artificial Neural Network for Trusted Nodes Classification Problem
...Show More Authors

Wireless Body Area Network (WBAN) is a tool that improves real-time patient health observation in hospitals, asylums, especially at home. WBAN has grown popularity in recent years due to its critical role and vast range of medical applications. Due to the sensitive nature of the patient information being transmitted through the WBAN network, security is of paramount importance. To guarantee the safe movement of data between sensor nodes and various WBAN networks, a high level of security is required in a WBAN network. This research introduces a novel technique named Integrated Grasshopper Optimization Algorithm with Artificial Neural Network (IGO-ANN) for distinguishing between trusted nodes in WBAN networks by means of a classifica

... Show More
View Publication
Scopus Clarivate Crossref
Publication Date
Fri Aug 28 2020
Journal Name
Iraqi Journal Of Science
Image Retrieval Using Data Mining Technique
...Show More Authors

Even though image retrieval is considered as one of the most important research areas in the last two decades, there is still room for improvement since it is still not satisfying for many users. Two of the major problems which need to be improved are the accuracy and the speed of the image retrieval system, in order to achieve user satisfaction and also to make the image retrieval system suitable for all platforms. In this work, the proposed retrieval system uses features with spatial information to analyze the visual content of the image. Then, the feature extraction process is followed by applying the fuzzy c-means (FCM) clustering algorithm to reduce the search space and speed up the retrieval process. The experimental results show t

... Show More
View Publication Preview PDF
Crossref (1)
Scopus Crossref
Publication Date
Thu Dec 26 2024
Journal Name
International Journal Of Data And Network Science
Multi-objective of wind-driven optimization as feature selection and clustering to enhance text clustering
...Show More Authors

Text Clustering consists of grouping objects of similar categories. The initial centroids influence operation of the system with the potential to become trapped in local optima. The second issue pertains to the impact of a huge number of features on the determination of optimal initial centroids. The problem of dimensionality may be reduced by feature selection. Therefore, Wind Driven Optimization (WDO) was employed as Feature Selection to reduce the unimportant words from the text. In addition, the current study has integrated a novel clustering optimization technique called the WDO (Wasp Swarm Optimization) to effectively determine the most suitable initial centroids. The result showed the new meta-heuristic which is WDO was employed as t

... Show More
View Publication Preview PDF
Crossref (1)
Scopus Crossref
Publication Date
Thu Apr 01 2021
Journal Name
Applied Soft Computing
Evolutionary multi-objective set cover problem for task allocation in the Internet of Things
...Show More Authors

Scopus (5)
Crossref (5)
Scopus Clarivate Crossref
Publication Date
Thu Apr 01 2021
Journal Name
Applied Soft Computing
Evolutionary multi-objective set cover problem for task allocation in the Internet of Things
...Show More Authors

View Publication
Scopus (5)
Crossref (5)
Scopus Clarivate Crossref
Publication Date
Sun Dec 01 2002
Journal Name
Iraqi Journal Of Physics
An edge detection algorithm matching visual contour perception
...Show More Authors

For several applications, it is very important to have an edge detection technique matching human visual contour perception and less sensitive to noise. The edge detection algorithm describes in this paper based on the results obtained by Maximum a posteriori (MAP) and Maximum Entropy (ME) deblurring algorithms. The technique makes a trade-off between sharpening and smoothing the noisy image. One of the advantages of the described algorithm is less sensitive to noise than that given by Marr and Geuen techniques that considered to be the best edge detection algorithms in terms of matching human visual contour perception.

View Publication Preview PDF