Article Per Year (5 Year)
p-Index From 2021 - 2026
5.586
P-Index
This Author published in this journals
All Journal JURNAL MATEMATIKA STATISTIKA DAN KOMPUTASI SAINSMAT JURNAL DERIVAT: JURNAL MATEMATIKA DAN PENDIDIKAN MATEMATIKA Journal of Mathematics Education and Application (JMEA) PYTHAGORAS: Jurnal Program Studi Pendidikan Matematika Jurnal Matematika: MANTIK Journal of Mathematics and Mathematics Education (JMME) JMPM: Jurnal Matematika dan Pendidikan Matematika Desimal: Jurnal Matematika BAREKENG: Jurnal Ilmu Matematika dan Terapan Dinamisia: Jurnal Pengabdian Kepada Masyarakat Jambura Journal of Mathematics Jurnal Matematika UNAND ILKOMNIKA: Journal of Computer Science and Applied Informatics ESTIMASI: Journal of Statistics and Its Application Jambura Journal of Biomathematics (JJBM) Euler : Jurnal Ilmiah Matematika, Sains dan Teknologi Griya Journal of Mathematics Education and Application Journal of Science and Technology Unnes Journal of Mathematics Journal of Fundamental Mathematics and Applications (JFMA) Jurnal Riset Mahasiswa Matematika Trigonometri: Jurnal Matematika dan Ilmu Pengetahuan Alam Indonesian Journal of Mathematics and Applications Hexagon: Jurnal Ilmu dan Pendidikan Matematika The Indonesian Journal of Computer Science Bilangan: Jurnal Ilmiah Matematika, Kebumian dan Angkasa Amalgamasi: Journal of Mathematics and Applications Indonesian Journal of Computational and Applied Mathematics Jurnal Didaktik Matematika SAINSMAT: Jurnal Ilmiah Ilmu Pengetahuan Alam
NISKY IMANSYAH YAHYA
Universitas Negeri Gorontalo
Astronomy Biochemistry, Genetics & Molecular Biology Chemical Engineering, Chemistry & Bioengineering Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Economics, Econometrics & Finance Education Electrical & Electronics Engineering Energy Engineering Mathematics Mechanical Engineering Physics Social Sciences Transportation Other

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

Found 41 Documents
Search

 1   2   3   4   5 
Pengelompokkan Kabupaten/Kota Provinsi Jawa Timur Berdasarkan Indikator Kesejahteraan Rakyat Menggunakan Metode Elbow dan Algoritma K-Prototype Mohamad Rivaldi Koni; Ismail Djakaria; Nisky Imansyah Yahya
ESTIMASI: Journal of Statistics and Its Application Vol. 4, No. 1, Januari, 2023 : Estimasi
Publisher : Hasanuddin University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.20956/ejsa.vi.24837

Abstract

People's welfare is the goal of the State of Indonesia which is contained in the official state document, namely the opening of the 1945 Constitution paragraph IV, this can be interpreted to enjoy an affluent life, free from poverty and is a human right for every citizen in Indonesia. The grouping process is carried out to see the level of people's welfare for each Regency/City in East Java. In this study, before grouping, the number of clusters was selected using the Elbow method. After that do the grouping with the K-Prototype Algorithm. Furthermore, using Kruskal Wallis and Chi-Square, the test was carried out to determine the variables that influence grouping. The results of the study obtained the 3 best clusters using the Elbow method, grouping with the K-Prototype Algorithm where cluster 1 consisted of 4 Regencies/Cities, Cluster 2 consisted of 18 Regencies/Cities and cluster 3 consisted of 16 Regencies/Cities. Furthermore, the results of Kruskal Wallis and Chi-Square get 4 influential variables in the grouping, the 4 variables are the Number of Poor Population, Expenditures Per Capita, Open Unemployment Rate and Sources of Water for Drinking.
Total Rainbow Connection Number Of Shackle Product Of Antiprism Graph (〖AP〗_3) Melisa Huntala; Muhammad Rezky Friesta Payu; Nisky Imansyah Yahya
Jurnal Matematika, Statistika dan Komputasi Vol. 20 No. 1 (2023): SEPTEMBER, 2023
Publisher : Department of Mathematics, Hasanuddin University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.20956/j.v20i1.24833

Abstract

Function if  is said to be k total rainbows in , for each pair of vertex  there is a path called  with each edge and each vertex on the path will have a different color. The total connection number is denoted by trc  defined as the minimum number of colors needed to make graph  to be total rainbow connected. Total rainbow connection numbers can also be applied to graphs that are the result of operations. The denoted shackle graph  is a graph resulting from the denoted graph  where t is number of copies of G. This research discusses rainbow connection numbers rc and total rainbow connection trc(G) using the shackle operation, where  is the antiprism graph . Based on this research, rainbow connection numbers rc shack , and total rainbow connection trc shack for .
Total Rainbow Connection Number of Corona Product of Book Graph(Bn) and Pencil Graf(Pcm) Randi Mooduto; Lailany Yahya; Nisky Imansyah Yahya
Sainsmat : Jurnal Ilmiah Ilmu Pengetahuan Alam Vol 12, No 2 (2023): September
Publisher : Fakultas Matematika dan Ilmu Pengetahuan Alam Universitas Negeri Makassar

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35580/sainsmat122423112023

Abstract

Let G be a simple and finite graph. Rainbow connection and total rainbow connection c are set c : G → {1,2,. . . , k} where k is the minimal color on graph G. A rainbow connection number(rc) is a pattern by giving different colors to the connection edges (E(G)) so that a rainbow path is formed. The total rainbow connection number (trc) is a payment pattern by giving color to vertices (V(G)) and edges (E(G)) in graph G so that a total rainbow path is formed. This article discusses rainbow connection numbers (rc) and total rainbow connection numbers (trc) in the corona graph of book graph (Bn) and pencil graph (Pcm). The results obtained are rc(Bn ⨀ Pcm) = 2n+3 and trc(Bn ⨀ Pcm) = 4n+5, 3 ≤ n ≤ 5.
Algoritma Dijkstra dan Algoritma Greedy Untuk Optimasi Rute Pengiriman Barang Pada Kantor Pos Gorontalo Novria Fatmawati Lakutu; Sri Lestari Mahmud; Muhammad Rifai Katili; Nisky Imansyah Yahya
Euler : Jurnal Ilmiah Matematika, Sains dan Teknologi EULER: Volume 11 Issue 1 June 2023
Publisher : Universitas Negeri Gorontalo

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.34312/euler.v11i1.18244

Abstract

Delivery of goods is one of the services used in the online buying and selling process at the Post Office company. Companies need a performance in the distribution of goods that is more time-consuming and cost-efficient, so it requires determination in selecting the shortest path. Many algorithms have been used to help find the shortest path for distributing goods, including the Dijkstra Algorithm and the Greedy Algorithm. In this study, the application of the two algorithms is to find routes between sub-districts that are the destination of goods delivery, then compare to see which algorithm is more optimal. Based on the calculation results, the Dijkstra Algorithm can provide a more optimal solution with a total mileage obtained of 304.90 Km, while the Greedy Algorithm produces a total distance of 441.60 Km.
Optimization the Management of Tihu Village Resources to Increase the Income of Village Communities: Optimalisasi Pengelolaan Sumber Daya Desa Tihu untuk Meningkatkan Penghasilan Masyarakat Desa La Ode Nashar Nashar; Novianita Achmad Novianita; Nisky Imansyah Yahya Nisky
Dinamisia : Jurnal Pengabdian Kepada Masyarakat Vol. 7 No. 5 (2023): Dinamisia: Jurnal Pengabdian Kepada Masyarakat
Publisher : Universitas Lancang Kuning

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.31849/dinamisia.v7i5.13290

Abstract

Geographically Tihu village is located on the coast where the majority of its residents work as fishermen. Skipjack tuna is a type of fish that is abundant in Tihu village. The habit of fishermen distributing their catch to consumers causes the economic value of sales to be less than optimal. Processing skipjack tuna into shredded fish and nuggets will support the increased income of the society of Tihu village. This society service provides training to the Tihu village society to make floss, nuggets and coconut cookies according to BPOM standards as well as packaging and online marketing method. This training was carried out so that the Tihu village society could optimize their natural resources to increase their income.
Implementation of Cryptography Using the RSA (Rivest-Shamir-Adleman) Algorithm in Encoding Text Messages and Documents Sari, Septi Rahmita; Resmawan, Resmawan; Yahya, Nisky Imansyah; Yahya, Lailany
JOSTECH Journal of Science and Technology Vol 4, No 1: Maret 2024
Publisher : UIN Imam Bonjol Padang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.15548/jostech.v4i1.8280

Abstract

Cryptography can be used in prevent data, one of the preventive measures is by encoding messages. Cryptography is the study of encoding messages or ways of data protection. In encoding the content of messages, there is an algorithm conventionally used nowadays, the RSA (Rivest-Shamir-Adleman) algorithm. The RSA algorithm is a method that has two different keys for each encryption and decryption process but is still interrelated to maintain security in processing the data. In finding the key, the RSA algorithm utilizes the rule of prime number. The larger the prime number used as a key, the harder it is to find a large number as a factor. This research describes the process of encrypting text messages, the content of documents using the RSA algorithm, and the key generation process. Those processes are done by converting plaintext into ciphertext using ASCII code, which is 256 long, and using PKCS (Public Key Cryptography Standards) is the encryption process on the RSA algorithm. This study uses Pyhton programming language to implement the RSA algorithm on text messages and documents. As a recommendation to the subsequent studies, it is proper to use algorithms or other programming languages to secure messages.
On The Rainbow Connection Of Middle Graph Of Firecracker Graphs (F_(n,4)) Rahim, Delvira Masita; Nurwan, Nurwan; Yahya, Nisky Imansyah; Wungguli, Djihad; Arsal, Armayani
JMEA : Journal of Mathematics Education and Application Vol 4, No 1 (2025): Februari
Publisher : JMEA : Journal of Mathematics Education and Application

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30596/jmea.v4i1.22686

Abstract

Coloring in graph theory includes various approaches, one of which is rainbow coloring which is closely related to the concept of rainbow connected numbers which refers to the least number of colors needed to color the edges in a graph so that every two vertices connected in a rainbow path have the same color and is denoted by rc(G). Rainbow coloring can be studied in several forms of graph development, one of which is the middle graph. All types of graphs, both simple and complex, can be represented as a middle graph. A middle graph is a graph whose vertices are obtained from the vertices and edges of graph G and is denoted by V (M(G)) = V (G)∪(G). Two points in a middle graph are considered adjacent if and only if they are adjacent edges in G or one of the points is adjacent to an edge of G. In this research, we discuss the number rc(G) on the middle graph of firecracker graph (F_(n,4))  with n ≥ 2. Based on the research results, we obtain the rainbow connected number theorem on the middle graph of firecrackers graph rc(M(F_(n,4))) = 3n + 2 for n ≥ 2.
Bilangan Terhubung Pelangi pada Graf Ferris Wheel (Fw_n) Lakisa, Narti; Nurwan, Nurwan; Nasib, Salmun K.; Yahya, Nisky Imansyah
JMPM: Jurnal Matematika dan Pendidikan Matematika Vol 7 No 1 (2022): March - August 2022
Publisher : Prodi Pendidikan Matematika Universitas Pesantren Tinggi Darul Ulum Jombang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26594/jmpm.v7i1.2337

Abstract

Pada penelitian ini didefinisikan graf baru yang dinamakan graf ferris wheel yang dinotasikan dengan Fw_n. Graf ferris wheel dengan 2n+1 titik dan 5n sisi dihasilkan dengan menggabungkan dua buah graf yaitu graf lingkaran dan graf roda dengan menambahkan sisi sebanyak 2n. Tujuan dari penelitian ini adalah menentukan bilangan terhubung pelangi pada graf ferris wheel dengan bilangan bulat positif n>=3 dengan langkah-langkah; menggambar graf ferris wheel, menentukan bilangan terhubung pelangi dan membuktikan teorema bilangan terhubung pelangi pada graf ferris wheel. Metode dalam penelitian ini adalah studi literatur. Hasilnya diperoleh bilangan terhubung pelangi pada graf ferris wheel yaitu rc(Fw_3 atau Fw_4)=2, rc(Fw_5 atau Fw_6)=3, rc(Fw_7 atau Fw_8)=4, rc(Fw_9 atau Fw_10)=5, dan rc(Fw_n)=j+6 jika n=3j+11, 3j+12, dan 3j+13 untuk j>=0
Pewarnaan Pelangi pada Graf Garis dari Graf Ilalang (S_(3,r)) Rauf, Dewi Nur Angriani; Achmad, Novianita; Yahya, Nisky Imansyah
Griya Journal of Mathematics Education and Application Vol. 5 No. 1 (2025): Maret 2025
Publisher : Pendidikan Matematika FKIP Universitas Mataram

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.29303/griya.v5i1.529

Abstract

The rainbow connection number, denoted by rc(G), is the minimum number of colors required to color the edges of a graph G such that the graph is rainbow connected. A graph G is said to be rainbow connected if every pair of vertices in the graph has at least one rainbow path, a path in which each edge has a different color. Rainbow coloring has been extensively studied on various types of graphs and their modifications, including line graphs. The line graph L(G) of a graph is a graph whose vertex set is V(L(G)) = E(G), meaning each vertex in represents an edge of . Two vertices in L(G) are adjacent if and only if their corresponding edges in G share a common vertex. This study examines the rainbow coloring of the line graph of the ilalang graph (Sn,r) for n = 3 and r>= 3. Based on the research findings, the rainbow connection number of the line graph of the ilalang graph is given by the theorem rc(L(S3,r)) = r for r>= 3.
Optimization of LightGBM Model with Bayesian Optimization for Malware Detection Kasim, Afrianto Pratama; Nasib, Salmun K.; Hasan, Isran K.; Wungguli, Djihad; Yahya, Nisky Imansyah
ILKOMNIKA Vol 7 No 1 (2025): Volume 7, Number 1, April 2025
Publisher : Lembaga Penelitian dan Pengabdian Masyarakat

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.28926/ilkomnika.v7i1.722

Abstract

Cyberattacks through malware on Android devices continue to rise, making accurate detection crucial. This research optimizes the LightGBM model using Bayesian Optimization to enhance accuracy and efficiency in detecting Android malware. A feature selection mechanism based on Attention Mechanism is applied to select the most relevant features for classification. The dataset used comes from the Canadian Institute for Cybersecurity (CIC) and consists of 17,804 Android applications, with a balanced distribution between malware and normal applications. The dataset is split into ratios of 80%:20%, 75%:25%, and 70%:30%. Feature selection reduces the number of features from 9503 to 300, 500, and 1000. The LightGBM model is then optimized with Bayesian Optimization to fine-tune parameters such as learning rate, number of iterations, and maximum number of leaves. The model's performance is evaluated using accuracy, precision, and recall metrics. Experimental results show that the model achieves 96,99% accuracy, 97,30% precision, and 96,70% recall with an 80%:20% dataset split and 1000 features. The combination of Attention Mechanism and Bayesian Optimization effectively improves processing efficiency without compromising performance.
Co-Authors Afifah Farhanah Akadji Akadji, Afifah Farhanah Anitha Saravanakumar Armayani Arsal Aruchamy, Pradeepa Asriadi Asriadi Asriadi Asriadi Bertu Rianto Takaendengan Cindy Aisa Putri Noor Dennynatalis Taha Dhandapani, Prasantha Bharathi Djihad Wungguli Fatmawati, Ainun Franky Alfrits Oroh Fuzi Sandra Talibo Ganesan, Gomathi Hanz Franklyn Bachruddin Wewengkang Hasan S. Panigoro Imran, Nurain Indrawati Lihawa Ismail Djakaria Ismail Saputra R. Harmain Isran K Hasan Jayalakshmi Periyannan Jusuf, Anryan K. Nasib, Salmun Karim, Finansiya S. Abd. Karina Anselia Mamonto Kasim, Afrianto Pratama Khairun Nisa Humolungo La Ode Nashar Lailany Yahya Lakisa, Narti Lakoro, Tiara Mahagaonkar, Pralahad Meilan Sigar Melisa Huntala Mohamad Rivaldi Moha Mokodompit, Marcela Muhammad Rezky F. Payu Muhammad Rifai Katili Narti Lakisa Novianita Achmad Novria Fatmawati Lakutu Nurmardia Abdussamad, Siti Nursiya Bito Nurwan Nurwan Nurwan Nurwan, Nurwan Pranata, Widya Eka Prasantha Bharathi Dhandapani Prasetyo, Deny Ardika Rahim, Delvira Masita Rahmi, Emli Randi Mooduto Randi Mooduto Rauf, Dewi Nur Angriani Resmawan Resmawan Salmun K. Nasib Salmun K. Nasib Sari, Septi Rahmita Sembiring, Rinawati Sidik, Amelia T. R. Siti Nurmardia Abdussamad Sri Lestari Mahmud Suharmin, Wandayana Nur'Amanah Sumarno Ismail Taha, Dennynatalis Tahir, Fauzia D Tahir, Fauzia D. Taufik, Mohamad Alfiransyah Trieke Nurfadilah Harun Wahdania A.T. Ja’a Zulkifli Alamtaha