Preferred Language
Articles
/
ijs-1024
Finding Best Clustering For Big Networks with Minimum Objective Function by Using Probabilistic Tabu Search

     Fuzzy C-means (FCM) is a clustering method used for collecting similar data elements within the group according to specific measurements. Tabu is a heuristic algorithm. In this paper, Probabilistic Tabu Search for FCM implemented to find a global clustering based on the minimum value of the Fuzzy objective function. The experiments designed for different networks, and cluster’s number the results show the best performance based on the comparison that is done between the values of the objective function in the case of using standard FCM and Tabu-FCM, for the average of ten runs.

Scopus Crossref
View Publication Preview PDF
Quick Preview PDF
Publication Date
Tue Mar 30 2021
Journal Name
Iraqi Journal Of Science
Using Multi-Objective Bat Algorithm for Solving Multi-Objective Non-linear Programming Problem

Human beings are greatly inspired by nature. Nature has the ability to solve very complex problems in its own distinctive way. The problems around us are becoming more and more complex in the real time and at the same instance our mother nature is guiding us to solve these natural problems. Nature gives some of the logical and effective ways to find solutions to these problems. Nature acts as an optimized source for solving the complex problems.  Decomposition is a basic strategy in traditional multi-objective optimization. However, it has not yet been widely used in multi-objective evolutionary optimization.   

Although computational strategies for taking care of Multi-objective Optimization Problems (MOPs) h

... Show More
View Publication Preview PDF
Scopus (5)
Crossref (7)
Scopus Crossref
Publication Date
Fri Jan 01 2016
Journal Name
Statistics And Its Interface
Search for risk haplotype segments with GWAS data by use of finite mixture models

The region-based association analysis has been proposed to capture the collective behavior of sets of variants by testing the association of each set instead of individual variants with the disease. Such an analysis typically involves a list of unphased multiple-locus genotypes with potentially sparse frequencies in cases and controls. To tackle the problem of the sparse distribution, a two-stage approach was proposed in literature: In the first stage, haplotypes are computationally inferred from genotypes, followed by a haplotype coclassification. In the second stage, the association analysis is performed on the inferred haplotype groups. If a haplotype is unevenly distributed between the case and control samples, this haplotype is labeled

... Show More
View Publication
Scopus Clarivate Crossref
Publication Date
Wed Dec 18 2019
Journal Name
Baghdad Science Journal
A Modified Approach by Using Prediction to Build a Best Threshold in ARX Model with Practical Application

The proposal of nonlinear models is one of the most important methods in time series analysis, which has a wide potential for predicting various phenomena, including physical, engineering and economic, by studying the characteristics of random disturbances in order to arrive at accurate predictions.

In this, the autoregressive model with exogenous variable was built using a threshold as the first method, using two proposed approaches that were used to determine the best cutting point of [the predictability forward (forecasting) and the predictability in the time series (prediction), through the threshold point indicator]. B-J seasonal models are used as a second method based on the principle of the two proposed approaches in dete

... Show More
View Publication Preview PDF
Scopus (1)
Scopus Clarivate Crossref
Publication Date
Fri Jan 01 2021
Journal Name
International Journal Of Agricultural And Statistical Sciences
DYNAMIC MODELING FOR DISCRETE SURVIVAL DATA BY USING ARTIFICIAL NEURAL NETWORKS AND ITERATIVELY WEIGHTED KALMAN FILTER SMOOTHING WITH COMPARISON

Survival analysis is widely applied in data describing for the life time of item until the occurrence of an event of interest such as death or another event of understudy . The purpose of this paper is to use the dynamic approach in the deep learning neural network method, where in this method a dynamic neural network that suits the nature of discrete survival data and time varying effect. This neural network is based on the Levenberg-Marquardt (L-M) algorithm in training, and the method is called Proposed Dynamic Artificial Neural Network (PDANN). Then a comparison was made with another method that depends entirely on the Bayes methodology is called Maximum A Posterior (MAP) method. This method was carried out using numerical algorithms re

... Show More
Preview PDF
Scopus (1)
Scopus
Publication Date
Sun Apr 30 2023
Journal Name
Iraqi Journal Of Science
Fuzzy Based Clustering for Grayscale Image Steganalysis

Fuzzy Based Clustering for Grayscale Image Steganalysis

View Publication Preview PDF
Publication Date
Sat Dec 30 2023
Journal Name
Iraqi Journal Of Science
Finding the Best Analysis for the Sleeper Cells of Terrorist Acts in the Crowded Areas of Human Activities in the City of Baghdad

     Terrorist operations disturbed societies and threatened their existence due to destructive ideas carried by those groups that believe in radical change and the use of multiple methods to implement their ideas, as well as taking methods of concealment among society, so it has become difficult to detect them. The study's purpose is to locate sleeper cells of terrorist operations in areas dense with various human activities using remote sensing techniques and geographic information systems programs. The programs were used to analyze the group of terrorist incidents data that occurred in Baghdad in 2011 and study how to limit the crimes spreading in Baghdad. The study included building a model in spatial information systems for site

... Show More
View Publication Preview PDF
Scopus Crossref
Publication Date
Fri Jun 01 2007
Journal Name
Journal Of Al-nahrain University Science
ON THE GREEDY RADIAL BASIS FUNCTION NEURAL NETWORKS FOR APPROXIMATION MULTIDIMENSIONAL FUNCTIONS

The aim of this paper is to approximate multidimensional functions by using the type of Feedforward neural networks (FFNNs) which is called Greedy radial basis function neural networks (GRBFNNs). Also, we introduce a modification to the greedy algorithm which is used to train the greedy radial basis function neural networks. An error bound are introduced in Sobolev space. Finally, a comparison was made between the three algorithms (modified greedy algorithm, Backpropagation algorithm and the result is published in [16]).

View Publication Preview PDF
Crossref (1)
Crossref
Publication Date
Thu Jun 30 2022
Journal Name
Journal Of Economics And Administrative Sciences
Estimation of Time of Survival Rate by Using Clayton Function for the Exponential Distribution with Practical Application

Each phenomenon contains several variables. Studying these variables, we find mathematical formula to get the joint distribution and the copula that are a useful and good tool to find the amount of correlation, where the survival function was used to measure the relationship of age with the level of cretonne in the remaining blood of the person. The Spss program was also used to extract the influencing variables from a group of variables using factor analysis and then using the Clayton copula function that is used to find the shared binary distributions using multivariate distributions, where the bivariate distribution was calculated, and then the survival function value was calculated for a sample size (50) drawn from Yarmouk Ho

... Show More
View Publication Preview PDF
Crossref
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
Sat Oct 20 2018
Journal Name
Journal Of Economics And Administrative Sciences
Solve the problem of assignment by using multi-Objective programming

he assignment model represents a mathematical model that aims at expressing an important problem facing enterprises and companies in the public and private sectors, which are characterized by ensuring their activities, in order to take the appropriate decision to get the best allocation of tasks for machines or jobs or workers on the machines that he owns in order to increase profits or reduce costs and time As this model is called multi-objective assignment because it takes into account the factors of time and cost together and hence we have two goals for the assignment problem, so it is not possible to solve by the usual methods and has been resorted to the use of multiple programming The objectives were to solve the problem of

... Show More
View Publication Preview PDF
Crossref