Article Per Year (5 Year)
p-Index From 2020 - 2025
0.444
P-Index
This Author published in this journals
All Journal Jurnal CoreIT
Iskandar (Scopus ID: 55316114000), Iwan
Unknown Affiliation
Computer Science & IT

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

Found 2 Documents
Search

 1 
The Implementation of Data Mining to Determine the Level of Students' Understanding in Utilizing E-Learning Using the K-Nearest Neighbor Method Iskandar (Scopus ID: 55316114000), Iwan; Candra, Reski Mai
Jurnal CoreIT: Jurnal Hasil Penelitian Ilmu Komputer dan Teknologi Informasi Vol 10, No 2 (2024): December 2024
Publisher : Fakultas Sains dan Teknologi, Universitas Islam Negeri Sultan Syarif Kasim Riau

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24014/coreit.v10i2.33728

Abstract

The implementation of Information Technology is increasingly developing due to the growing demand. According to data obtained from the Indonesian Internet Service Providers Association (APJII) 2022 report, the number of internet users in Indonesia is 210.02 million, an increase of 27.9 million from the previous year. The application of E-Learning in various schools, campuses, and educational courses has been carried out. The utilization of e-learning media undoubtedly facilitates educators in transferring their knowledge to students. This research evaluates the level of understanding of each student who has used E-Learning during Covid-19 as a learning medium. In obtaining this level of understanding, the K-Nearest Neighbor (K-NN) method is applied. The data analyzed are based on assignment scores, quizzes, mid-term exams, and final exams from various related courses, namely Science and Mathematics Course Group, Programming Course Group, and Basic Informatics Course Group. A total of 1,627 data points were collected from the period between 2020 and 2021 when online learning was conducted using E-Learning. The data was processed using the KNN method with an 80:20 split between training and testing data. The analyzed K values were 3, 5, 7, 9, 11, 13, 15, 17, 19, and 21. The calculation results showed an accuracy of 75.69% at K=17 for the Basic Informatics Course Group, 77.61% at K=15 for the Science and Mathematics Course Group, and 96.20% at K=3 for the Programming Course Group.
Network Routing Optimization Using Tabu Search Algorithm in Dynamic Routing Iskandar (Scopus ID: 55316114000), Iwan
Jurnal CoreIT: Jurnal Hasil Penelitian Ilmu Komputer dan Teknologi Informasi Vol 9, No 2 (2023): December 2023
Publisher : Fakultas Sains dan Teknologi, Universitas Islam Negeri Sultan Syarif Kasim Riau

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24014/coreit.v9i2.26655

Abstract

Internet penetration is increasing along with the need for data packages for communication such as social media, chatting, video conferencing and others. On large-scale networks such as the Internet, dynamic routing is used to build routing protocol information in the routing table automatically. Currently, Djikstra's algorithm is used to solve the shortest path problem in dynamic routing. In this research, the optimization of the algorithm is carried out in determining the best path or trajectory. One of the optimization algorithms is the Tabu Search Algorithm which can guide heuristic local search procedures to explore the solution area outside the local optimum point. This optimization is assessed from the test parameters measured from the smallest cost. The data analyzed is in the form of bandwidth and topological flow. From the results of tracing the path of data packets sent through 9 routers using the Tabu Search algorithm with the parameters namely number of Neighbor Solutions = 50, Length of tabu list = 10, Maximum Number of Iterations = 100, the result of the path matrix value is 180.9676. The path taken is router 0-2-4-8-9
Co-Authors Reski Mai Candra