Claim Missing Document
Check
Articles

Found 6 Documents
Search

ANALISIS SENTIMEN PUBLIK PADA MEDIA SOSIAL TWITTER TERHADAP PELAKSANAAN PILKADA SERENTAK MENGGUNAKAN ALGORITMA SUPPORT VECTOR MACHINE Atika Rahmawati; Aris Marjuni; Junta Zeniarja
CCIT Journal Vol 10 No 2 (2017): CCIT JOURNAL
Publisher : Universitas Raharja

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (167.708 KB) | DOI: 10.33050/ccit.v10i2.539

Abstract

Pilkada Serentak is a very important event for the future viability regions and countries. Through this election people can cast their vote and elect representatives of the people according to their choice. Public respond can be expressed through twitter social media. Using twitter social media sentiment analysis can then be made about the public response to the implementation of the election simultaneously. The classification process can be detected via text tweeted by twitter users. In this study, the classification of responses detected by text because it is easily obtained and applied. This study determined the classification of the response to the Indonesian language text and increase accuracy by using SVM.Tweet classification method used by the categorical approach is divided into two classes tweet basic level: positive and negative. Data collected from Indonesian twitter tweet as much as 3000. The labeling is not done manually but using clustering method that divides the 3000 data into two groups. Cluster 1 as a group of positive tweets and Cluster 2 as a negative group tweet.2700 for training data and 300 for the test data. The stage of pre-processing the data includetokenization, casenormalization, stop word detection, and stemming. The process of classification using Support Vector Machine (SVM). Accuracy of SVM showed the highest yield that is 91% compared to the k-means clustering with the results of 82%.
PENCARIAN POLA ASOSIASI UNTUK PENATAAN BARANG DENGAN MENGGUNAKAN PERBANDINGAN ALGORITMA APRIORI DAN FP-GROWTH (STUDY KASUS DISTRO EPO STORE PEMALANG) Abu Salam; Junta Zeniarja; Wibowo Wicaksono; Lutfi Kharisma
Dinamik Vol 23 No 2 (2018)
Publisher : Universitas Stikubank

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (885.64 KB) | DOI: 10.35315/dinamik.v23i2.7178

Abstract

Analisis keranjang pasar merupakan study tentang proses analisis untuk mencari sebuah aturan asosiasi dalam mencermati pola-pola pembelian konsumen pada setiap transaksi penjualan, pola-pola pembelian yang sudah di dapat dari pencarian dataset kemudian dapat digunakan untuk merencakan strategi penjualan seperti harga diskon jika membeli barang A dan B atau menunjukan tata letak pada barang yang ditemukan pada proses pencarian pola asosiasi yang menghasilkan aturan asosiasi, pola asosiasi sendiri memiliki beberapa metode untuk mencari aturan asosiasi dan yang sering dipakai dalam pencarian aturan asosiasi adalah Apriori dan FP-Growth dimana kedua metode ini menghasilkan aturan asosiasi dengan tingkat lift ratio yang tinggi dimana jika lift ratio bernilai >1 sudah dinyatakan valid sehingga semakin besar tingkat lift ratio pada aturan asosiasi yang ditemukan maka akan semakin kuat aturan asosiasi tersebut, pada penelitian ini penulis melakukan pencarian aturan asosiasi pada data penjualan epo store pada bulan November, Desember 2017 dan Januari 2018, dengan menggunakan dua metode pencarian asosiasi yaitu apriori dan FP-Growth untuk membandingkan metode mana yang lebih baik dalam pencarian aturan asosiasi serta untuk melakukan perencanaan penjualan berupa tata letak dari metode yang memiliki tingkat lift ratio tertinggi.
Implementasi Algoritma K-Means Dalam Pengklasteran untuk Rekomendasi Penerima Beasiswa PPA di UDINUS Abu Salam; Diyan Adiatma; Junta Zeniarja
JOINS (Journal of Information System) Vol 5, No 1 (2020): Edisi Mei 2020
Publisher : Universitas Dian Nuswantoro

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1772.802 KB) | DOI: 10.33633/joins.v5i1.3350

Abstract

Rekomendasi penerima beasiswa Peningkatan Prestasi Akademik (PPA) dikelompokkan menjadi 2 cluster yaitu diterima dan tidak diterima untuk mendapatkan beasiswa. Algoritma K-Means merupakan teknik unsupervised learning yang dapat digunakan dalam mengelompokkan data pengajuan beasiswa. Tujuan dari penelitian ini adalah untuk merekomendasikan penerima beasiswa dengan menggunakan algoritma k-means, hasil rekomendasi berupa penempatan data pendaftar beasiswa ke masing-masing kelompok cluster yang dihasilkan. Eksperimen proses clustering dilakukan menggunakan data pendaftar beasiswa PPA dari biro kemahasiswaan udinus tahun 2016 sebanyak 441 pendaftar beasiswa PPA. Melalui seleksi atribut, k-means ini melakukan perhitungan untuk menempatkan setiap data ke cluster yang sudah ditentukan. Sebanyak 154 mahasiswa direkomendasikan mendapatkan beasiswa PPA sedangkan 287 mahasiswa tidak mendapatkan. 
Implementasi Algoritma K-Nearest Neighbor Berbasis Forward Selection Untuk Prediksi Mahasiswa Non Aktif Universitas Dian Nuswantoro Semarang Abu Salam; Ferry Bintang Nugroho; Junta Zeniarja
JOINS (Journal of Information System) Vol 5, No 1 (2020): Edisi Mei 2020
Publisher : Universitas Dian Nuswantoro

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1774.334 KB) | DOI: 10.33633/joins.v5i1.3351

Abstract

Masalah yang muncul berkaitan dengan status mahasiswa salah satunya adalah status mahasiswa yang non aktif. Beberapa faktor penyebab status non aktif tersebut diantaranya adalah faktor ekonomi, kemampuan akademik, dan lain – lain. Manajemen perguruan tinggi perlu mengidentifikasi serta melakukan tindakan terhadap mahasiswa yang mempunyai status “tidak diharapkan” untuk mengetahui faktor munculnya masalah tersebut perlu dilakukan evaluasi saat pertengahan masa studi mahasiswa guna mencegah sedini mungkin munculnya mahasiswa yang diindikasi terdapat status tidak aktif untuk mengurangi dampak yang ditimbulkan akibat status non aktif tersebut. Pada penelitian ini akan dilakukan prediksi mahasiswa non aktif menggunakan algoritma klasifikasi K-Nearest Neighbor yang dikombinasikan dengan metode forward selection untuk seleksi atribut yang diharapkan mampu meningkatkan nilai akurasi pada proses klasifikasi. Nilai akurasi yang didapatkan pada algoritma K-Nearest Neighbor sebesar 96.43% sedangkan pada algoritma K-Nearest Neighbor berbasis Forward Selection sebesar 97.27%. Kata Kunci: Mahasiswa Non Aktif, Forward Selection, K-Nearest Neighbor
Seleksi Fitur dan Perbandingan Algoritma Klasifikasi untuk Prediksi Kelulusan Mahasiswa Junta Zeniarja; Abu Salam; Farda Alan Ma'ruf
Jurnal Rekayasa Elektrika Vol 18, No 2 (2022)
Publisher : Universitas Syiah Kuala

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (650.804 KB) | DOI: 10.17529/jre.v18i2.24047

Abstract

Students are a major part of the life cycle of a university. The number of students graduating from a university often has a small ratio when compared to the number of students obtained in the same academic year. This small student graduation rate can be caused by several aspects, such as the many student activities accompanied by economic aspects, as well as other aspects. This makes it mandatory for a university to have a model that can take into account whether the student can graduate on time or not. One of the main factors that determine the reputation of a university is student graduation on time. The higher the level of new students at a university, with the same ratio, there must also be students who graduate on time. An increase in the number of student data and academic data occurs if many students do not graduate on time from all registered students. So that it will affect the image and reputation of the university which can later threaten the accreditation value of the university. To overcome this, we need a model that can predict student graduation so that it can be used as policy making later. The purpose of this study is to propose the best classification model by comparing the highest level of accuracy of several classification algorithms including Naïve Bayes, Random Forest, Decision Tree, K-Nearest Neighbor (K-NN) and Support Vector Machine (SVM) to predict student graduation. In addition, the feature selection process is also used before the classification process to optimize the model. The use of feature selection in this model with the best features using 12 regular attribute features and 1 attribute as a label. It was found that the classification model using the Random Forest algorithm was chosen, with the highest accuracy value reaching 77.35% better than other algorithms.
Seleksi Fitur dan Perbandingan Algoritma Klasifikasi untuk Prediksi Kelulusan Mahasiswa Junta Zeniarja; Abu Salam; Farda Alan Ma'ruf
Jurnal Rekayasa Elektrika Vol 18, No 2 (2022)
Publisher : Universitas Syiah Kuala

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.17529/jre.v18i2.24047

Abstract

Students are a major part of the life cycle of a university. The number of students graduating from a university often has a small ratio when compared to the number of students obtained in the same academic year. This small student graduation rate can be caused by several aspects, such as the many student activities accompanied by economic aspects, as well as other aspects. This makes it mandatory for a university to have a model that can take into account whether the student can graduate on time or not. One of the main factors that determine the reputation of a university is student graduation on time. The higher the level of new students at a university, with the same ratio, there must also be students who graduate on time. An increase in the number of student data and academic data occurs if many students do not graduate on time from all registered students. So that it will affect the image and reputation of the university which can later threaten the accreditation value of the university. To overcome this, we need a model that can predict student graduation so that it can be used as policy making later. The purpose of this study is to propose the best classification model by comparing the highest level of accuracy of several classification algorithms including Naïve Bayes, Random Forest, Decision Tree, K-Nearest Neighbor (K-NN) and Support Vector Machine (SVM) to predict student graduation. In addition, the feature selection process is also used before the classification process to optimize the model. The use of feature selection in this model with the best features using 12 regular attribute features and 1 attribute as a label. It was found that the classification model using the Random Forest algorithm was chosen, with the highest accuracy value reaching 77.35% better than other algorithms.