Article Per Year (5 Year)
p-Index From 2021 - 2026
0.23
P-Index
This Author published in this journals
All Journal Indonesian Journal of Electrical Engineering and Computer Science
A. J. Ishak
Universiti Putra Malaysia

Published : 2 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search

 1 
Aromatic Herbs Classification by using Discriminant Analysis Techniques N. F.M. Radzi; A. Che Soh; A. J. Ishak; M. K. Hasan; U. K. Mohamad Yusof
Indonesian Journal of Electrical Engineering and Computer Science Vol 5, No 3: March 2017
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v5.i3.pp530-535

Abstract

An electronic nose was used to distinguish between selected herb samples according to their family group species. This paper aims to evaluate the potential of using the electronic nose to characterize three groups of families of twelve herb species based on the discriminant analysis approach. The feature extraction involves the use of a signal processing technique that simplifies classification and yields optimal results. Two discriminant techniques:- the principal component analysis (PCA) and the multiple discriminant analysis (MDA) were used to investigate the potential to distinguish herb species between several herbs within the same family group. The results showed that the twelve herb species can be better classified using the MDA method compared to the PCA method.
Guidance system based on Dijkstra-ant colony algorithm with binary search tree for indoor parking system K. Ibrahim Ata; A. Che Soh; A. J. Ishak; H. Jaafar
Indonesian Journal of Electrical Engineering and Computer Science Vol 24, No 2: November 2021
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v24.i2.pp1173-1182

Abstract

A common algorithm to solve the single-source shortest path (SSSP) is the Dijkstra algorithm. However, the traditional Dijkstra’s is not accurate and need more time to perform the path in order it should visit all the nodes in the graph. In this paper, the Dijkstra-ant colony algorithm (ACO) with binary search tree (BST) has been proposed. Dijkstra and ACO are integrated to produce the smart guidance algorithm for the indoor parking system. Dijkstra algorithm initials the paths to finding the shortest path while ACO optimizes the paths. BST has been used to store the paths that Dijkstra algorithm initialled. The proposed algorithm is aimed to control the shortest path as well as guide the driver towards the nearest vacant available space near the entrance. This solution depending on applying the optimization on an optimal path while the traditional ACO is optimizing the random path based on the greedy algorithm hence we get the most optimal path. Moreover, the reason behind using the BST is to make the generation of the path by Dijkstra’s algorithm more accurate and less time performance. The results show a range of 8.3% to 26.8% improvement in the proposed path compared to the traditional Dijkstra’s algorithm.
Co-Authors A. Che Soh H. Jaafar K. Ibrahim Ata M. K. Hasan N. F.M. Radzi U. K. Mohamad Yusof