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 
ANALISIS SENTIMEN TWITTER TERHADAP NYAMUK WOLBACHIA MENGGUNAKAN METODE LSTM DENGAN PENDEKATAN NLTK Lakoro, Tiara; K. Nasib, Salmun; Imansyah Yahya, Nisky; S. Panigoro, Hasan; Nurmardia Abdussamad, Siti
Trigonometri: Jurnal Matematika dan Ilmu Pengetahuan Alam Vol. 6 No. 2 (2025): Trigonometri: Jurnal Matematika dan Ilmu Pengetahuan Alam
Publisher : Cahaya Ilmu Bangsa Institute

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.3483/trigonometri.v6i2.12266

Abstract

Dengue Hemorrhagic Fever (DHF) is one of the major health issues in Indonesia. One of the preventive measures is the Wolbachia mosquito program. However, the implementation of this program has sparked various reactions from the public, which can be observed through social media, particularly Twitter. This study aims to analyze public sentiment towards Wolbachia mosquitoes using the Long Short-Term Memory (LSTM) method and the Natural Language Toolkit (NLTK) approach. Data was collected through a crawling process from Twitter using keywords related to "Wolbachia mosquitoes." Preprocessing was then carried out using NLTK, including tokenization, stopword removal, and stemming. The data was manually labeled into positive, negative, and neutral sentiment categories. The LSTM model was used for sentiment classification with the best parameters, including 100 neurons, a learning rate of 0.001, a sigmoid activation function, a batch size of 32, and 7 epochs. The results indicate that the LSTM model used was able to classify sentiment with an accuracy of 95%, precision of 94%, recall of 97%, and an F1-score of 95%. This demonstrates that the LSTM method with the NLTK approach is effective in analyzing public sentiment towards
Bilangan Terhubung Titik Pelangi pada Graf Garis, Graf Tengah, dan Graf Total dari Graf Panci Jusuf, Anryan; Nurwan, Nurwan; Yahya, Nisky Imansyah; Yahya, Lailany; Nasib, Salmun K.; Asriadi, Asriadi
Hexagon: Jurnal Ilmu dan Pendidikan Matematika Vol. 2 No. 2 (2024): October
Publisher : LPPM Universitas Terbuka

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33830/hexagon.v2i2.10000.

Abstract

Salah satu konsep dalam bidang teori graf yang berkaitan erat dengan pewarnaan titik pelangi adalah bilangan terhubung titik pelangi. Sebuah graf G dikatakan terhubung titik pelangi jika terdapat setidaknya satu jalur yang menghubungkan titik-titik dengan warna yang berbeda. Konsep ini mengacu pada jumlah minimum warna yang dibutuhkan untuk mewarnai sebuah graf G sehingga graf tersebut terhubung dengan titik pelangi dan dilambangkan dengan rvc(G). Topik pewarnaan titik pelangi dapat dieksplorasi dalam berbagai bentuk pengembangan graf dengan memanfaatkan graf garis, graf tengah dan graf total. Graf garis L(G) adalah graf yang titik-titiknya merupakan sisi-sisi dari G, dan jika u, v ≥ E(G) maka uv ≥ E(L(G)) sedemikian sehingga u dan v saling berbagi titik di G. Graf tengah M(G), merupakan sebuah graf dengan himpunan titiknya merupakan gabungan antara kumpulan titik dan kumpulan sisi dari graf G. Sedangkan graf total T(G), yaitu graf yang titiknya didapatkan dari himpunan titim dan himpunan sisi dari graf G, dimana setiap titik V(G)saling terhubung. Pada penelitian ini, saya membahas bilangan terhubung titik pelangi yang terhubung pada graf garis, graf tengah dan graf total dari graf panci (Pnm) dengan m ≥ 6. Berdasarkan hasil yang diperoleh, didapatkan teorema bilangan terhubung titik pelangi pada graf garis dari graf panci rvc(L(Pn_m)), graf tengah dari graf panci rvc(M(Pn_m)), dan graf total dari graf panci rvc(T(Pn_m)).
Bilangan Terhubung Pelangi pada Graf Tengah dari Graf Ilalang Rauf, Dewi Nur Angriani; Achmad, Novianita; Yahya, Nisky Imansyah; Nurwan, Nurwan; Nasib, Salmun K.; Asriadi, Asriadi
Jurnal Riset Mahasiswa Matematika Vol 4, No 4 (2025): Jurnal Riset Mahasiswa Matematika
Publisher : Mathematics Department, Maulana Malik Ibrahim State Islamic University of Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.18860/jrmm.v4i4.31475

Abstract

Bilangan terhubung pelangi yang dinotasikan dengan adalah jumlah warna terkecil yang diperlukan untuk mewarnai sisi-sisi dari sebuah graf  sehingga graf tersebut menjadi terhubung pelangi. Bilangan terhubung pelangi dapat dipelajari dalam berbagai bentuk pengembangan graf yang dimodifikasi, termasuk graf tengah.  Semua jenis graf, baik yang sederhana maupun yang kompleks, dapat direpresentasikan sebagai graf tengah. Sebuah graf tengah yang dinotasikan dengan  dibentuk dari sebuah graf dan didefinisikan sebagai . Dua buah simpul pada  bersisian jika dan hanya jika keduanya bersisian dengan sebuah sisi pada , atau salah satu simpul pada  bersisian dengan sebuah sisi pada . Penelitian ini membahas tentang pewarnaan pelangi pada graf tengah dari graf ilalang  dengan  dan  Berdasarkan penelitian diperoleh teorema pelangi bilangan terhubung pada graf tengah graf ilalang untuk 
Perbandingan Seleksi Fitur Forward Selection dan Backward Elimination pada Algoritma Support Vector Machine Suharmin, Wandayana Nur'Amanah; Hasan, Isran K.; Yahya, Nisky Imansyah
The Indonesian Journal of Computer Science Vol. 14 No. 2 (2025): The Indonesian Journal of Computer Science
Publisher : AI Society & STMIK Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33022/ijcs.v14i2.4755

Abstract

Support Vector Machine (SVM) is an effective and robust classification method, particularly when applied to high-dimensional data. However, high-dimensional data often contain irrelevant features that can lead to suboptimal SVM performance. Therefore, a feature selection process is necessary to optimize classification performance by eliminating irrelevant and redundant features from the original dataset. This research aims to compare the Forward Selection and Backward Elimination feature selection methods within the Support Vector Machine Algorithm for classification using the Poverty Depth Index data in Papua Province. The results indicated that applying the Support Vector Machine with Forward Selection feature selection achieved a classification accuracy of 93%, whereas Backward Elimination feature selection achieved a classification accuracy of 97%. Based on these classification accuracy results, it can be concluded that applying Support Vector Machine with Backward Elimination feature selection results in better performance than Forward Selection.
Pemanfaatan Pelabelan Harmonis Graf Ular S_n Dalam Kriptografi Polialfabetik Tahir, Fauzia D.; Katili, Muh Rifai; Yahya, Nisky Imansyah; Wungguli, Djihad; Asriadi; Nurwan; Armayani Arsal
Jurnal Derivat: Jurnal Matematika dan Pendidikan Matematika Vol. 12 No. 2 (2025): Jurnal Derivat (Agustus 2025)
Publisher : Pendidikan Matematika Universitas PGRI Yogyakarta

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.31316/j.derivat.v12i2.7815

Abstract

This research discusses harmonious labeling on the snake graph  and its application in polyalphabetic cryptography. A harmonious labeling is an injective function from the set of vertices to the set of integers modulo , defined as . This function induces an edge labeling function . For each edge connecting vertices  and , the edge label is given by , producing distinct edge labels. This study presents the construction process of harmonious labeling on the snake graph , where  and . The results show that the snake graph satisfies the conditions for being harmoniously labeled since each edge receives a unique label. The vertex set of  is defined as  and the edge set as  The harmonious labeling on this graph is then applied in cryptography, particularly in forming a cipher table used as a key in the polyalphabetic encryption and decryption process. This approach enhances cryptographic security, as a single plaintext letter can be transformed into various ciphertext possibilities, thereby increasing encryption strength and complicating message decryption attempts by unauthorized parties.  Keywords: harmonious labeling, snake graph, cryptography, polyalphabetic cipher
Penerapan Ensemble K-modes Pada Pengelompokkan Kelurahan di Kota Gorontalo Berdasarkan Kecanduan Game Online Remaja Taufik, Mohamad Alfiransyah; Achmad, Novianita; Abdussamad, Siti Nurmardia; Wungguli, Djihad; Yahya, Nisky Imansyah
Griya Journal of Mathematics Education and Application Vol. 5 No. 2 (2025): Juni 2025
Publisher : Pendidikan Matematika FKIP Universitas Mataram

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

Abstract

The swift advancement of digital technology has resulted in a heightened frequency of online game usage among teenagers, raising concerns about potential addiction. This study aims to cluster urban villages in Gorontalo City based on the characteristics of online game addiction in adolescents, to support the formulation of more effective preventive policies. The method used is ensemble clustering with K-modes algorithm approach, which is effective for mixed numeric and categorical data. Data were obtained through a survey of adolescents aged 10-24 years in all urban villages, including indicators of lack of attention from close people, self-control, lack of activities, stress or depression, social environment, parenting, length of time playing online games, frequency of playing online games and many favorite online games. The clustering results obtained 3 optimum clusters, where cluster 1 consists of 7 neighborhoods, cluster 2 consists of 17 neighborhoods and cluster 3 consists of 26 neighborhoods. Cluster 1 is a group of neighborhoods with a low risk and addiction level, cluster 2 with a moderate tendency, and cluster 3 with a high tendency.
Density based spatial clustering of application with noise using flower pollination algorithm for leptospirosis clustering Karim, Finansiya S. Abd.; Rahmi, Emli; Abdussamad, Siti Nurmardia; Hasan, Isran K.; Yahya, Nisky Imansyah
PYTHAGORAS : Jurnal Program Studi Pendidikan Matematika Vol 14, No 1 (2025): PYTHAGORAS: Jurnal Program Studi Pendidikan Matematika
Publisher : UNIVERSITAS RIAU KEPULAUAN, BATAM, INDONESIA

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33373/pyth.v14i1.7505

Abstract

Leptospirosis is an important health problem in Indonesia, with most cases found in East Java and Central Java provinces. This study aims to identify the distribution pattern of leptospirosis in the two provinces using a clustering approach. The Density-Based Spatial Clustering of Applications with Noise (DBSCAN) method is used to cluster areas based on leptospirosis spread factors, but DBSCAN requires optimal parameter determination for accurate results. Therefore, this research implements Flower Pollination Algorithm (FPA) to optimize the epsilon (ϵ) and minimum points (MinPts) parameters in DBSCAN. This research uses secondary data obtained from data on the Number of Natural Disaster Events by Regency / City in East Java and Central Java Provinces in 2023 and data on Population Density by Regency / City in East Java and Central Java Provinces in 2023. The population in this study uses all observations, namely all people in the districts and cities in East Java and Central Java. The sampling technique is saturated sampling, that is, the entire population in the study is sampled. The clustering results using FPA-DBSCAN resulted in two main clusters, with 30 districts/municipalities detected as noise, 23 districts/municipalities belonging to cluster 0, and 20 districts/municipalities in cluster 1. The validation test using Silhouette Coefficient showed a value of 0.1892, indicating that the clustering is quite valid. The results of this clustering can serve as a strategic reference for local governments in optimizing disease surveillance and targeted health interventions.
Rainbow vertex connection number and strong rainbow vertex connection number on slinky graph (SlnC4)) Akadji, Afifah Farhanah; Katili, Muhammad Rifai; Nasib, Salmun K.; Yahya, Nisky Imansyah
Desimal: Jurnal Matematika Vol. 4 No. 2 (2021): Desimal: Jurnal Matematika
Publisher : Universitas Islam Negeri Raden Intan Lampung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24042/djm.v4i2.7276

Abstract

A graph is said rainbow connected if no path has more than one vertices of the same color inside. The minimum number of colors required to make a graph to be rainbow vertex-connected is called rainbow vertex connection-number and denoted by rvc(G) . Meanwhile, the minimum number of colors  required to make a graph to be strongly rainbow vertex-connected is called strong rainbow vertex connection-number and denoted by srvc(G). Suppose there is a simple, limited, and finite graph G. Thus, G=(V(G),E(G)) with the determination of k-coloring c:V(G)->{1,2,...,k} . The reaserch aims at determining rainbow vertex connection-number and strong rainbow vertex connection-number on slinky graphs (Sl_nC_4). Moreover, the research method applies a literature study with the following procedures; drawing slinky graphs (Sl_nC_4), looking for patterns of rainbow vertex connection-number, and strong rainbow vertex connection-number on slinky graphs (Sl_nC_4), then proving the theorems obtained from the previous pattern. It is obtained rvc(Sl_nC_4)=2n-1, srvc(Sl_2C_4)=4, and srvc(Sl_nC_4) = 3n-3 for n>= 3. 
IMPELEMENTASI ALGORITMA WELCH-POWELL DALAM PENJADWALAN PIKET JAGA SEKRETARIAT ORGANISASI MAHASISWA PADA HIMPUNAN MAHASISWA JURUSAN MATEMATIKA UNIVERSITAS NEGERI GORONTALO Tahir, Fauzia D; Prasetyo, Deny Ardika; Yahya, Nisky Imansyah
Amalgamasi: Journal of Mathematics and Applications Vol. 4 No. 1 (2025): Amalgamasi: Journal of Mathematics and Applications
Publisher : Universitas Pasifik Morotai

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.55098/amalgamasi.v4.i1.pp30-39

Abstract

Graph theory is used to represent discrete objects and the relationships between them. One of its applications is scheduling through graph coloring. Scheduling duty shifts for an organizational secretariat often becomes a complex problem due to the varying class schedules of members. This article aims to implement graph coloring to arrange the duty schedule for HIMATIKA UNG using the Welch-Powell algorithm. This algorithm works by assigning different colors to adjacent vertices (representing members from the same class), resulting in a graph coloring with the minimum number of colors. The implementation results show that the chromatic number obtained is 6, representing six duty groups that do not overlap. This approach produces an optimal schedule that aligns with the academic schedules of HIMATIKA UNG members. The advantage of this algorithm lies in its efficiency in solving the problem and preventing overlapping schedules among members from the same class. The coloring process begins with the vertex of the highest degree as the initial step
Identifying the Fetal Heart Rate and gender with Intuitionistic Fuzzy Total edge Magic Labelling Aruchamy, Pradeepa; Mahagaonkar, Pralahad; Ganesan, Gomathi; Dhandapani, Prasantha Bharathi; Yahya, Nisky Imansyah
Jambura Journal of Biomathematics (JJBM) Volume 6, Issue 2: June 2025
Publisher : Department of Mathematics, Universitas Negeri Gorontalo

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.37905/jjbm.v6i2.30951

Abstract

The application of Intuitionistic fuzzy total edge magic labelling to a graphical image at the 20th week of gestation provides insights into facilitates gender prediction as well as assessment of fetal blood flow on a second-trimester Doppler ultrasound screen. Ultrasounds screen the fetal heart rate during the 20th week of gestation using Doppler ultrasound for blood flow. A fetal heart rate above 2.5 beats per second suggests a female baby, while a rate less than 2.5 beats per second indicates a male baby. We convert the fetal heart blood flow into a graphical image and label it using intuitionistic fuzzy total edge magic labelling.
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