Search Results - (( mining classification parallel algorithm ) OR ( basic optimisation based algorithm ))

Parallel execution of distributed SVM using MPI (CoDLib) by Salleh N.S.M., Suliman A., Ahmad A.R.

Subjects:

Twofold Integer Programming Model for Improving Rough Set Classification Accuracy in Data Mining. by Saeed, Walid

“…This research opens a wide range of future work to be considered, which includes applying the proposed method in other areas such as web mining, text mining or multimedia mining; and extending the proposed approach to work in parallel computing in data mining.…”
Get full text
Get full text

Random sampling method of large-scale graph data classification by Rashed Mustafa, Mohammad Sultan Mahmud, Mahir Shadid

“…Effective analysis of graph data provides a deeper understanding of the data in data mining tasks, including classification, clustering, prediction, and recommendation systems. …”
Get full text
Get full text
Get full text

Enhanced convergence of Bat Algorithm based on dimensional and inertia weight factor by Ramli, Mohamad Raziff, Abal Abas, Zuraida, Desa, Mohammad Ishak, Zainal Abidin, Zaheera, Al Azzam, Malik Bader Hasan

Get full text
Get full text
Get full text

Parametric modelling of a TRMS using dynamic spread factor particle swarm optimisation by Toha, Siti Fauziah, Abd Latiff, I., Mohamad, M., Tokhi, M Osman

Get full text
Get full text
Get full text

Local search manoeuvres recruitment in the bees algorithm by Muhamad, Zaidi, Mahmuddin, Massudi, Nasrudin, Mohammad Faidzul, Sahran, Shahnorbanun

“…Swarm intelligence of honey bees had motivated many bioinspired based optimisation techniques. The Bees Algorithm (BA) was created specifically by mimicking the foraging behavior of foraging bees in searching for food sources.During the searching, the original BA ignores the possibilities of the recruits being lost during the flying.The BA algorithm can become closer to the nature foraging behavior of bees by taking account of this phenomenon.This paper proposes an enhanced BA which adds a neighbourhood search parameter which we called as the Local Search Manoeuvres (LSM) recruitment factor.The parameter controls the possibilities of a bee extends its neighbourhood searching area in certain direction.The aim of LSM recruitment is to decrease the number of searching iteration in solving optimization problems that have high dimensions.The experiment results on several benchmark functions show that the BA with LSM performs better compared to the one with basic recruitment.…”
Get full text
Get full text
Get full text

Unit commitment in power system using multi-agent evolutionary programming incorporating priority listing optimisation technique / Muhammad Nazree Che Othman by Che Othman, Muhammad Nazree

“…The search process then being refined using heuristic EP-based algorithm with multi-agent approach to produce the final solution. …”
Get full text
Get full text

Handover Parameter for Self-optimisation in 6g Mobile Networks: A Survey by Ukasyah Mahamod, Ibraheem Shayea, Hafizal Mohamad, Marinah Othman, Fauzun Abdullah Asuhaimi

Instance matching framework for heterogeneous semantic web content over linked data environment by Mansir, Abubakar

“…These discovered attributes serve as input to a modified training set generation component, where training sets are generated based on the potential attributes’ clusters. Property alignment check the irregular data associated to the generated sets to optimise the matching performance. …”
Get full text
Get full text

Gravitational energy harvesting system based on multistage braking technique for multilevel elevated car parking building by Al Kubaisi, Yasir Mahmood

“…Applying a methodology based on three basic aspects; Firstly, designing a (GEH) structure of a scaled-down prototype for the actual system describing the mechanism of the energy harvesting, which is inspired by the elevator structures. …”
Get full text
Get full text

Abnormal event detection in video surveillance / Lim Mei Kuan by Lim, Mei Kuan

“…Therefore, by considering tracking as an optimisation problem, the proposed SwATrack algorithm searches for the optimal distribution of motion model without making prior assumptions, or prior learning of the motion model. …”
Get full text
Get full text