Preferred Language
Articles
/
jeasiq-2018
Estimate The Survival Function By Using The Genetic Algorithm
...Show More Authors

  Survival analysis is the analysis of data that are in the form of times from the origin of time until the occurrence of the end event, and in medical research, the origin of time is the date of registration of the individual or the patient in a study such as clinical trials to compare two types of medicine or more if the endpoint It is the death of the patient or the disappearance of the individual. The data resulting from this process is called survival times. But if the end is not death, the resulting data is called time data until the event. That is, survival analysis is one of the statistical steps and procedures for analyzing data when the adopted variable is time to event and time. It could be days, weeks, months, or years from the start of the term registration until the event.

  This research is concerned with the question of estimating the survival function of observational data using one of the most important artificial intelligence algorithms which is the genetic algorithm and that In order to obtain optimum estimates for Weibull distribution parameters, this, in turn, is reflected in the estimation of survival function, whereby the genetic algorithm is employed in the maximum likelihood method, moment method, the least-squares method and the modified weighted least squares method. And for the capabilities of more efficient than traditional methods, and then will be a comparison between the roads depending on the experimental side is evaluated the best way depending on mean square error criterion of survival function, it will also be applied methods on the fact that data for patients with lung cancer and bronchitis.

The study found that the best way to estimate the Weibull distribution parameters and the survival function produced by the experimental side is the hybrid method of the least squares using the genetic algorithm.

Crossref
View Publication Preview PDF
Quick Preview PDF
Publication Date
Mon Nov 10 2025
Journal Name
2025 18th International Conference On Development In Esystem Engineering (dese)
Arrhythmia Recognition Algorithm Using Squared Krawtchouk-Tchebichef Polynomial-Based Feature Extraction
...Show More Authors

View Publication
Scopus Crossref
Publication Date
Sat Jun 01 2019
Journal Name
Journal Of Engineering And Applied Sciences
Enhancing LSB algorithm against brute-force attack using ASCII mapping technique
...Show More Authors

Publication Date
Fri Jan 01 2016
Journal Name
Journal Of Computer And Communications
Pathfinding in Strategy Games and Maze Solving Using A* Search Algorithm
...Show More Authors

View Publication
Crossref (23)
Crossref
Publication Date
Sun Jul 09 2023
Journal Name
Journal Of Engineering
MR Brain Image Segmentation Using Spatial Fuzzy C- Means Clustering Algorithm
...Show More Authors

conventional FCM algorithm does not fully utilize the spatial information in the image. In this research, we use a FCM algorithm that incorporates spatial information into the membership function for clustering. The spatial function is the summation of the membership functions in the neighborhood of each pixel under consideration. The advantages of the method are that it is less
sensitive to noise than other techniques, and it yields regions more homogeneous than those of other methods. This technique is a powerful method for noisy image segmentation. 

View Publication Preview PDF
Crossref (1)
Crossref
Publication Date
Mon Aug 01 2011
Journal Name
Journal Of Engineering
IMPLEMENTATION OF ROOT FINDING ALGORITHM OF MINIMUM PHASE FILTER USING VHDL
...Show More Authors

Root-finding is an oldest classical problem, which is still an important research topic, due to its impact on computational algebra and geometry. In communications systems, when the impulse response of the channel is minimum phase the state of equalization algorithm is reduced and the spectral efficiency will improved. To make the channel impulse response minimum phase the prefilter which is called minimum phase filter is used, the adaptation of the minimum phase filter need root finding algorithm. In this paper, the VHDL implementation of the root finding algorithm introduced by Clark and Hau is introduced.
VHDL program is used in the work, to find the roots of two channels and make them minimum phase, the obtained output results are

... Show More
View Publication Preview PDF
Crossref
Publication Date
Wed Feb 01 2023
Journal Name
Baghdad Science Journal
3-D Packing in Container using Teaching Learning Based Optimization Algorithm
...Show More Authors

The paper aims to propose Teaching Learning based Optimization (TLBO) algorithm to solve 3-D packing problem in containers. The objective which can be presented in a mathematical model is optimizing the space usage in a container. Besides the interaction effect between students and teacher, this algorithm also observes the learning process between students in the classroom which does not need any control parameters. Thus, TLBO provides the teachers phase and students phase as its main updating process to find the best solution. More precisely, to validate the algorithm effectiveness, it was implemented in three sample cases. There was small data which had 5 size-types of items with 12 units, medium data which had 10 size-types of items w

... Show More
View Publication Preview PDF
Scopus Clarivate Crossref
Publication Date
Fri Oct 03 2025
Journal Name
Mesopotamian Journal Of Computer Science
Enhanced TEA Algorithm Performance using Affine Transformation and Chaotic Arnold Map
...Show More Authors

In digital images, protecting sensitive visual information against unauthorized access is considered a critical issue; robust encryption methods are the best solution to preserve such information. This paper introduces a model designed to enhance the performance of the Tiny Encryption Algorithm (TEA) in encrypting images. Two approaches have been suggested for the image cipher process as a preprocessing step before applying the Tiny Encryption Algorithm (TEA). The step mentioned earlier aims to de-correlate and weaken adjacent pixel values as a preparation process before the encryption process. The first approach suggests an Affine transformation for image encryption at two layers, utilizing two different key sets for each layer. Th

... Show More
View Publication Preview PDF
Scopus Crossref
Publication Date
Fri May 05 2017
Journal Name
International Journal Of Science And Research (ijsr)
Automatic brain tumor segmentation from MRI images using region growing algorithm
...Show More Authors

LK Abood, RA Ali, M Maliki, International Journal of Science and Research, 2015 - Cited by 2

View Publication
Publication Date
Tue Oct 01 2019
Journal Name
2019 International Conference On Electrical Engineering And Computer Science (icecos)
An Evolutionary Algorithm for Community Detection Using an Improved Mutation Operator
...Show More Authors

View Publication
Scopus (6)
Crossref (2)
Scopus Clarivate Crossref
Publication Date
Tue May 01 2018
Journal Name
Journal Of Physics: Conference Series
Theoretical Calculation of the Electron Transport Parameters and Energy Distribution Function for CF3I with noble gases mixtures using Monte Carlo simulation program
...Show More Authors

View Publication
Scopus (1)
Crossref (1)
Scopus Clarivate Crossref