SciRepID - Scientific Publication Search

Publication Search

41,520 articles from 397 journals · 1,447 citations tracked

Showing 1-2 of 2

Analytics

Ojugo, Arnold Adimabua; Akazue, Maureen Ifeanyi; Ejeh, Patrick Ogholuwarami; Ashioba, Nwanze Chukwudi; Odiakaose, Christopher Chukwufunaya +2 more

Journal of Computing Theories and Applications 2023 Universitas Dian Nuswantoro

The advent of the Internet as an effective means for resource sharing has consequently, led to proliferation of adversaries, with unauthorized access to network resources. Adversaries achieved fraudulent activities via carefully crafted attacks of large magnitude targeted at personal gains and rewards. With the cost of over $1.3Trillion lost globally to financial crimes and the rise in such fraudulent activities vis the use of credit-cards, financial institutions and major stakeholders must begin to explore and exploit better and improved means to secure client data and funds. Banks and financial services must harness the creative mode rendered by machine learning schemes to help effectively manage such fraud attacks and threats. We propose HyGAMoNNE – a hybrid modular genetic algorithm trained neural network ensemble to detect fraud activities. The hybrid, equipped with knowledge to altruistically detect fraud on credit card transactions. Results show that the hybrid effectively differentiates, the benign class attacks/threats from genuine credit card transaction(s) with model accuracy of 92%.

Dina Enjeli Sihombing; Faiz Ahyaningsih

Jurnal Riset Rumpun Ilmu Pendidikan 2023 Lembaga Pengembangan Kinerja Dosen

Travelling Salesman Problem (TSP) is a problem that is often encountered by a salesman who must travel exactly once to all consumers in a route and will return to the starting point of departure. Algorithm Genetic Algorithm is one way to find heuristic solutions based on the evolutionary ideas of natural selection and genetics. The aim is to find the optimal route for the distribution of bottled water products produced by PT. Mual Natio Maju Bersama. To find a solution, the chromosomes processed by the genetic algorithm are represented through the stages in the Genetic Algorithm individual initialization, fitness value, linear fitness ranking, roulette whell selection, crossover, and mutation. In order to achieve the optimum solution, namely The best path obtained is PT Mual Tio Maju Bersama –BUMDES Sait ni Huta - UD. Alvaro - UD. Lancelhot – UD. Alris – UD. Jamel – Toko Kelontong SRC Resi 2 – Toko Notra – UD. B Siringoringo – Toko Dahlia Siahaan – UD. Purba – UD. Cahaya – UD. Hutapea – UD. Gabe – UD. Setia II – UD. Larisma II – UD. Antoni – UD. Bona Siahaan – UD. Sederhana – Toko Manalu – UD. Setia I – Toko Ferdinan – UD. Alboy – Wisma Daun Mas – UD. Top Jaya – UD. Mega Silaban – BUMDES Silaitlait – UD. Rika – UD. Panamot – Piltik Coffee and Homestay Bandar Udara Silangit – UD. Rolas Boy – UD. Salamat Karya – UD. Simpang Jaya – UD. Lambok - Piltik Coffee and Homestay Siborongborong – UD. Bahagia – UD. Marlinca – UD. Heri Joel Pasaribu – UD. Ebenezer – UD. Mawar – UD. A Saudara – UD. SP Perdana – PDAM Mual Na Tio – UD. Rokkap - PT Mual Tio Maju Bersama. The best path length is 125.2700 cartesian units and the best fitness value is 0.008000.