Article Per Year (5 Year)
p-Index From 2021 - 2026
6.684
P-Index
This Author published in this journals
All Journal SAMUDERA Jurnal Transformatika Jurnal Edukasi dan Penelitian Informatika (JEPIN) CESS (Journal of Computer Engineering, System and Science) INFORMAL: Informatics Journal InfoTekJar : Jurnal Nasional Informatika dan Teknologi Jaringan JOURNAL OF INFORMATICS AND TELECOMMUNICATION ENGINEERING JOURNAL OF APPLIED INFORMATICS AND COMPUTING METHOMIKA: Jurnal Manajemen Informatika & Komputerisasi Akuntansi Jurnal Sisfokom (Sistem Informasi dan Komputer) ILKOM Jurnal Ilmiah Jurnal Nasional Pendidikan Teknik Informatika (JANAPATI) JISKa (Jurnal Informatika Sunan Kalijaga) Jurnal Informasi dan Teknologi JTIK (Jurnal Teknik Informatika Kaputama) Jurnal Sistem Komputer dan Informatika (JSON) Jurnal Pengabdian kepada Masyarakat Nusantara Jurnal Computer Science and Information Technology (CoSciTech) International Journal of Engineering, Science and Information Technology Multica Science and Technology jeti TECHSI - Jurnal Teknik Informatika Sisfo: Jurnal Ilmiah Sistem Informasi International Journal of Information System & Innovative Technology Multidisiplin Pengabdian Kepada Masyarakat (M-PKM) Jurnal Malikussaleh Mengabdi Journal of Advanced Computer Knowledge and Algorithms Scientific Journal of Informatics International Journal of Information System and Innovative Technology
Rozzi Kesuma Dinata
Program Studi Teknik Informatika, Unversitas Malikussaleh, Aceh Utara 24351, Indonesia
Religion Agriculture, Biological Sciences & Forestry Humanities Astronomy Biochemistry, Genetics & Molecular Biology Chemical Engineering, Chemistry & Bioengineering Chemistry Civil Engineering, Building, Construction & Architecture Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Earth & Planetary Sciences Economics, Econometrics & Finance Education Electrical & Electronics Engineering Energy Engineering Environmental Science Health Professions Industrial & Manufacturing Engineering Languange, Linguistic, Communication & Media Library & Information Science Materials Science & Nanotechnology Mathematics Mechanical Engineering Nursing Physics Social Sciences Transportation Other

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

Found 6 Documents
Search
Journal : INFORMAL: Informatics Journal

 1 
Analisis K-Means Clustering pada Data Sepeda Motor Rozzi Kesuma Dinata; Safwandi Safwandi; Novia Hasdyna; Nur Azizah
INFORMAL: Informatics Journal Vol 5 No 1 (2020): INFORMAL - Informatics Journal
Publisher : Faculty of Computer Science, University of Jember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/isj.v5i1.17071

Abstract

K-Means is a data mining algorithm that can be used to grouping or clustering data. This research using k-means for clustering the data of motorcycle based on consumer needs. The dataset used in this research is Honda and Yamaha motorcycle which taken from the dialers in Dewantara District, Aceh. The data tested by grouping 300 data of motorcycle with different attributes into 3 clusters, which are cheap, normal, and expensive. The distribution of the data we separate it using 45 data in 15 times of test. Each test used 3 different data randomly selected on each test. To calculate the distance of each motorcycle data that have been inputted to each centroid, we used the Euclidean Distance formula. Data in this cluster system can be used as a recommendation for users in selecting the motorcycle that they interest the most. The results of the performance on each test finished in 15 times shown that the average value of Precision by 76%, Recall by 76% and the accuracy by 81%.
Algoritma Honey Encryption dalam Sistem Pendataan Sertifikat Tanah dan Bangunan di Universitas Malikussaleh Sujacka Retno; Novia Hasdyna; Mutasar Mutasar; Rozzi Kesuma Dinata
INFORMAL: Informatics Journal Vol 5 No 3 (2020): Informatics Journal (INFORMAL)
Publisher : Faculty of Computer Science, University of Jember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/isj.v5i3.20804

Abstract

The management of Land and Building Certificates at Universitas Malikussaleh is still using a manual library in Biro Perlengkapan which contains some problem whereas it can be burned accidentally refers to fire case in 2017 in Rektorat Building at Universitas Malikussaleh. Given the problem faced by the staff in Biro Perlengkapan, the authors idea is to create a database-based data processing system, the authors designed an integrated information system which be able to anticipated such problem in the future and saving time to collecting important certificates such Land and Building Certificates at Universitas Malikussaleh and protecting them with Honey Encryption algorithm. The information system based on desktop and works as a client-server system. The result of this research provide that the honey encryption algorithm can protect the data and it can solve the problem in management system of land and building certificates.
Sistem Informasi Pengawasan Taman Kota Pada Dinas Pasar, Kebersihan Dan Pertamanan Kabupaten Aceh Utara Rozzi Kesuma Dinata
INFORMAL: Informatics Journal Vol 1 No 2 (2016): INFORMAL : Informatics Journal
Publisher : Faculty of Computer Science, University of Jember

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Penggunaan Teknologi Informasi di Dinas Pasar, Kebersihan dan Pertamanan Kabupaten Aceh Utara, memberikan dampak positif bagi kemajuan dinas tersebut.  Sistem komputerasi menciptakan suatu bagian yang sangat terpenting dari kemajuan teknologi dan kemudahaan komunikasi saat ini. Untuk itu penulis ingin mengembangkan kecanggihan sistem komputer yang dapat meringankan kerja dari Dinas Pasar, Kebersihan dan Pertamanan. Penulis merancang dan membuat sistem informasi pengawasan taman kota pada Dinas Pasar, Kebersihan dan Pertamanan Kabupaten Aceh Utara sesuai dengan kebutuhan yang diharapkan oleh dinas tersebut. Hasil yang diperoleh dari sistem ini sangat membantu dan mempermudah kinerja dari pegawai di dinas tersebut dalam memantau kondisi pasar dan kebersihan taman kota di Kabupaten Aceh Utara.  
Sistem Informasi Pendataan Mahasiswa Kerja Praktek di Bank BRI Unit Cot Girek Kanca Lhokseumawe Rozzi Kesuma Dinata
INFORMAL: Informatics Journal Vol 1 No 3 (2016): INFORMAL: INFORMATICS JOURNAL
Publisher : Faculty of Computer Science, University of Jember

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Sistem informasi pendataan mahasiswa kerja praktek di Bank BRI Unit Cot Girek Kanca Lhokseumawe masih dilakukan secara manual dengan melakukan pendataan terhadap mahasiswa kerja praktek yang masih menggunakan media kertas sebagai bentu daftar pendataannya. Dalam setiap pendataan yang masih dilakukan dengan belum optimal ditakutkan akan menimbulkan hilangnya data yang mungkin masih diperlukan dimasa yang akan datang. Perkembangan sistem informasi dalam pendataan yang lebih baik dan modern dengan memperhatikan sisi keamanan dan keterjaminannya memang perlu diadakan sebagai pengganti bentuk pendataan yang masih manual dengan menggunakan kertas sekaligus dapat menjadi standar baru sistem pendataan mahasiswa kerja praktek di bank BRI Unit Cot Girek Kanca Lhokseumawe. Dalam penelitian ini selain memaparkan kajian teori yang digunakan sebagai dasar penyusunan, juga akan dibahas mengenai perancangan sistem informasi. Sehingga diharapkan dapat diimplementasikan dalam sebuah instansi yang akan memperbaiki segala kekurangan yang ada pada sistem lama
Analisis Matthew Correlation Coefficient pada K-Nearest Neighbor dalam Klasifikasi Ikan Hias Novia Hasdyna; Rozzi Kesuma Dinata
INFORMAL: Informatics Journal Vol 5 No 2 (2020): INFORMAL - Informatics Journal
Publisher : Faculty of Computer Science, University of Jember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/isj.v5i2.18907

Abstract

K-Nearest Neighbor (K-NN) is a machine learning algorithm that functions to classify data. This study aims to measure the performance of K-NN algorithm by using Matthew Correlation Coefficient (MCC). The data that used in this study are the ornamental fish which consisting of 3 classes named Premium, Medium, and Low. The analysis results of the Matthew Correlation Coefficient on K-NN using Euclidean Distance obtained the highest MCC value in Medium class which is 0.786542. The second highest MCC value is in Premium class which is 0.567434. The lowest MCC value is in Low class which is 0.435269. Overall, the MCC values is statistically which is 0,596415.
Algoritma Dijkstra dan Bellman-Ford dalam Sistem Pemetaan Barbershop di Kota Lhokseumawe Rozzi Kesuma Dinata; Bustami Bustami; Ar Razi; Muhammad Arasyi
INFORMAL: Informatics Journal Vol 7 No 2 (2022): Informatics Journal (INFORMAL)
Publisher : Faculty of Computer Science, University of Jember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/isj.v7i2.33303

Abstract

A Barbershop service provider is a company that provides hair care to the community. Many people are currently doing business in this field, and many business actors are opening Barbershops in a variety of locations, ranging from campuses to office districts to densely populated towns. In Lhokseumawe City, there are 12 Barbershops. The application's benefit is that it can identify the shortest path from the user's location to the selected Barbershop, as well as the Barbershop's location and a brief description of the Barbershops in Lhokseumawe City. Only the system's defined nodes can be used to find the fastest route to the Barbershop. Dijkstra's method was chosen because it works against all current alternative functions and provides the shortest path from all nodes, ensuring that the shortest path is produced optimally. Because the Bellman-Ford algorithm is a variant of the BFS (best-first-search) algorithm, which is also employed in the search for the closest distance when the search for the closest distance has a negative weight, it was chosen. The same results were obtained in picking the route based on the results of the route selection test. However, when the two techniques are compared in terms of program execution time, Dijkstra's algorithm is faster than the Bellman-Ford algorithm.
Co-Authors ., Yustizar Abdillah, Ahmad Fauzi Aidilof, Hafizh Al Kautsar Akbar, Hafizal Akram, Rizalul Alfika, Selly Alvanof, Mulia Andik Bintoro Ar Razi Ar Razi, Ar Razi Ardiansyah, Sakha Arif, M. Arif Saputra Asrianda Asrianda Azrai Putra Barumun Daulay Badriana, Badriana Berutu, Indah Fachlira Bustami Bustami Bustami Bustami Bustami Ditha, Ananda Eva Darnila Fadhilah, Cut Fajri, T Irfan Fajriana, Fajriana Fiasari, Fiasari Fikria, Putri Fuadi, Wahyu Gadis Ayu Sofiana Hafizal Akbar Haried Novriando Hasan Tahir Hasmar, Muhammad Al Hafiz Irfan Fajri, T. Irwanda Syahputra Iswari, Syahyana Jasmin, Nadya Khairul Muttaqin Khairunnisa Khairunnisa Khairunnisa Khairunnisa Lubis, Aulia Azzahra Ma'aruf Maryana Muhammad Al Hafiz Hasmar Muhammad Alif Muhammad Arasyi Muhammad Fikry Muhammad Iqbal Muhammad Nurfahmi Muhammad Rivai Munirul Ula Mursyidah Mursyidah Mutammimul Ula Mutasar Muttaqin Muttaqin Novia Hasdyna Novianda Novianda Nur Azizah Nurwijayanti Putra Barumun Daulay, Azrai Rahmat Hidayat Rahmat Hidayat Risawandi, Risawandi Rizki Suwanda Safwandi Safwandi Safwandi Safwandi Sahputra, Ilham Suci Ramadani Sujacka Retno T Irfan Fajri Tahir, Hasan Taskia, Narita Tjut Adek, Rizal Ulfa, Septia Mulya Yafis, Balqis Yesy Afrillia Zara Yunizar Zuboili, Zuboili Zulfa Zulfa