Preferred Language
Articles
/
1RbmHYsBVTCNdQwC8Mdi
Modified Kohonen network algorithm for selection of the initial centres of Gustafson-Kessel algorithm in credit scoring
...Show More Authors

Credit risk assessment has become an important topic in financial risk administration. Fuzzy clustering analysis has been applied in credit scoring. Gustafson-Kessel (GK) algorithm has been utilised to cluster creditworthy customers as against non-creditworthy ones. A good clustering analysis implemented by good Initial Centres of clusters should be selected. To overcome this problem of Gustafson-Kessel (GK) algorithm, we proposed a modified version of Kohonen Network (KN) algorithm to select the initial centres. Utilising similar degree between points to get similarity density, and then by means of maximum density points selecting; the modified Kohonen Network method generate clustering initial centres to get more reasonable clustering results. The comparative was conducted using three credit scoring datasets: Australian, German and Taiwan. Internal and external indexes of validity clustering are computed and the proposed method was found to have the best performance in these three data sets.

Scopus
Publication Date
Mon Jan 01 2024
Journal Name
International Journal Of Research In Science And Technology
Encryption of Medical Image Based on Cascaded Design of AES Block Algorithm and Chaotic Map
...Show More Authors

Security concerns in the transfer of medical images have drawn a lot of attention to the topic of medical picture encryption as of late. Furthermore, recent events have brought attention to the fact that medical photographs are constantly being produced and circulated online, necessitating safeguards against their inappropriate use. To improve the design of the AES algorithm standard for medical picture encryption, this research presents several new criteria. It was created so that needs for higher levels of safety and higher levels of performance could be met. First, the pixels in the image are diffused to randomly mix them up and disperse them all over the screen. Rather than using rounds, the suggested technique utilizes a cascad

... Show More
View Publication
Crossref
Publication Date
Thu Apr 30 2020
Journal Name
Journal Of Economics And Administrative Sciences
Comparison Branch and Bound Algorithm with Penalty Function Method for solving Non-linear Bi-level programming with application
...Show More Authors

The problem of Bi-level programming is to reduce or maximize the function of the target by having another target function within the constraints. This problem has received a great deal of attention in the programming community due to the proliferation of applications and the use of evolutionary algorithms in addressing this kind of problem. Two non-linear bi-level programming methods are used in this paper. The goal is to achieve the optimal solution through the simulation method using the Monte Carlo method using different small and large sample sizes. The research reached the Branch Bound algorithm was preferred in solving the problem of non-linear two-level programming this is because the results were better.

View Publication
Crossref
Publication Date
Mon Jan 01 2018
Journal Name
International Journal Of Advanced Computer Science And Applications
Proposed an Adaptive Bitrate Algorithm based on Measuring Bandwidth and Video Buffer Occupancy for Providing Smoothly Video Streaming
...Show More Authors

View Publication
Scopus (7)
Crossref (2)
Scopus Crossref
Publication Date
Sun Dec 30 2018
Journal Name
Journal Of Engineering
A Cognition Path Planning with a Nonlinear Controller Design for Wheeled Mobile Robot Based on an Intelligent Algorithm
...Show More Authors

This paper presents a cognition path planning with control algorithm design for a nonholonomic wheeled mobile robot based on Particle Swarm Optimization (PSO) algorithm. The aim of this work is to propose the circular roadmap (CRM) method to plan and generate optimal path with free navigation as well as to propose a nonlinear MIMO-PID-MENN controller in order to track the wheeled mobile robot on the reference path. The PSO is used to find an online tune the control parameters of the proposed controller to get the best torques actions for the wheeled mobile robot. The numerical simulation results based on the Matlab package show that the proposed structure has a precise and highly accurate distance of the generated refere

... Show More
View Publication Preview PDF
Crossref (2)
Crossref
Publication Date
Tue Apr 02 2019
Journal Name
Artificial Intelligence Research
A three-stage learning algorithm for deep multilayer perceptron with effective weight initialisation based on sparse auto-encoder
...Show More Authors

A three-stage learning algorithm for deep multilayer perceptron (DMLP) with effective weight initialisation based on sparse auto-encoder is proposed in this paper, which aims to overcome difficulties in training deep neural networks with limited training data in high-dimensional feature space. At the first stage, unsupervised learning is adopted using sparse auto-encoder to obtain the initial weights of the feature extraction layers of the DMLP. At the second stage, error back-propagation is used to train the DMLP by fixing the weights obtained at the first stage for its feature extraction layers. At the third stage, all the weights of the DMLP obtained at the second stage are refined by error back-propagation. Network structures an

... Show More
View Publication
Crossref (1)
Crossref
Publication Date
Mon Oct 31 2022
Journal Name
International Journal Of Intelligent Engineering And Systems
Robot Path Planning in Unknown Environments with Multi-Objectives Using an Improved COOT Optimization Algorithm
...Show More Authors

Scopus (9)
Crossref (2)
Scopus Crossref
Publication Date
Wed May 09 2018
Journal Name
International Journal Of Advanced Computer Science And Applications
New Techniques to Enhance Data Deduplication using Content based-TTTD Chunking Algorithm
...Show More Authors

View Publication
Scopus (11)
Crossref (8)
Scopus Crossref
Publication Date
Sat Jun 01 2024
Journal Name
Journal Of Engineering
Copy Move Image Forgery Detection using Multi-Level Local Binary Pattern Algorithm
...Show More Authors

Digital image manipulation has become increasingly prevalent due to the widespread availability of sophisticated image editing tools. In copy-move forgery, a portion of an image is copied and pasted into another area within the same image. The proposed methodology begins with extracting the image's Local Binary Pattern (LBP) algorithm features. Two main statistical functions, Stander Deviation (STD) and Angler Second Moment (ASM), are computed for each LBP feature, capturing additional statistical information about the local textures. Next, a multi-level LBP feature selection is applied to select the most relevant features. This process involves performing LBP computation at multiple scales or levels, capturing textures at different

... Show More
Crossref
Publication Date
Sun Sep 24 2017
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
Algorithm to Solve Linear Volterra Fractional Integro-Differential Equation via Elzaki Transform
...Show More Authors

In this work, Elzaki transform (ET) introduced by Tarig Elzaki is applied to solve linear Volterra fractional integro-differential equations (LVFIDE). The fractional derivative is considered in the Riemman-Liouville sense. The procedure is based on the application of (ET) to (LVFIDE) and using properties of (ET) and its inverse. Finally, some examples are solved to show that this is computationally efficient and accurate.

View Publication Preview PDF
Publication Date
Mon Sep 25 2017
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
Algorithm to Solve Linear Volterra Fractional Integro-Differential Equation via Elzaki Transform
...Show More Authors

       In this work, Elzaki transform (ET) introduced by Tarig Elzaki is applied to solve linear Volterra fractional integro-differential equations (LVFIDE). The fractional derivative is considered in the Riemman-Liouville sense. The procedure is based on the application of (ET) to (LVFIDE) and using properties of (ET) and its inverse. Finally, some examples are solved to show that this is computationally efficient and accurate.

View Publication Preview PDF