cover
Article Per Year (5 Year)
All
Home Page
OAI Link
Editorial Team
Contact
Reviewer
Google Scholar
Contact Name
-
Contact Email
-
Phone
-
Journal Mail Official
-
Editorial Address
-
Location
Kota bandung,
Jawa barat
INDONESIA
Indonesian Journal on Computing (Indo-JC)
Published by Universitas Telkom
ISSN : 24609056     EISSN : -     DOI : -
Core Subject : Science,
Computer Science & IT
Indonesian Journal on Computing (Indo-JC) is an open access scientific journal intended to bring together researchers and practitioners dealing with the general field of computing. Indo-JC is published by School of Computing, Telkom University (Indonesia).
Arjuna Subject : -
Articles 198 Documents
 10   11   12   13   14 
Implementasi Dempster Shafer dalam Pembentukkan Portofolio Mean Varian Muhammad Iqbal Cholil; Deni Saepudin; Aniq Atiqi Rohmawati
Indonesia Journal on Computing (Indo-JC) Vol. 5 No. 1 (2020): Maret, 2020
Publisher : School of Computing, Telkom University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.34818/INDOJC.2020.5.1.371

Abstract

Implementasi Dempster Shafer dalam pembentukkan portofolio saham Mean Varian menghasilkan nilai performansi saham yang menjadi acuan untuk pemilihan saham kedalam portofolio saham Mean Varian. Nilai performansi saham dihasilkan dari data variansi return dan faktor fundamental saham Indeks LQ45 yang dihitung menggunakan aturan kombinasi Dempster Shafer. Saham dengan nilai performansi tertinggi dipilih kedalam portofolio saham Mean Varian. Pada penelitian ini, terdapat 10 saham yang dipilih ke dalam portofolio saham yaitu BSDE, GGRM, INDF, SGRO, SMGR, SCMA, MNCN, BBCA, HMSP, dan BMTR dengan menghasilkan portofolio return sebesar 0,0125. Evaluasi kinerja portofolio diterapkan dengan menggunakan metode Sharpe Ratio dengan hasil yang didapat portofolio saham dengan metode Dempster Shafer sebesar 0,2063 dan portofolio saham Mean Varian tanpa Dempster Shafer sebesar 0,0905. Hasil dari penelitian ini, portofolio saham Mean Varian dengan metode Dempster Shafer memiliki kinerja portofolio yang lebih baik dibandingkan portofolio saham Mean Varian tanpa metode Dempster Shafer. Kata Kunci: Dempster Shafer, Portofolio Return, Portofolio Mean Varian, Sharpe Ratio
Determining N-Days Tourist Route Using Swap Operator Based Artificial Bee Colony Algorithm Ayunda Farah Istiqamah; Z K Abdurahman Baizal; Yusza Reditya Murti
Indonesia Journal on Computing (Indo-JC) Vol. 5 No. 1 (2020): Maret, 2020
Publisher : School of Computing, Telkom University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.34818/INDOJC.2020.5.1.382

Abstract

Traveling is one of the activities chosen by many people to spend holidays. Some tourists want to go on vacation in a place they have never visited before, so they need a tool to plan a tour. Planning this tour includes determining tourist route. We analogize the determination of tourist routes using Traveling Salesman Problem (TSP). The main objective of this study was to find the optimal tourist route using Swap Operator Based Artificial Bee Colony Algorithm. We use Multi-Attribute Utility Theory (MAUT) to accommodate user needs for the route that recommended by the system. The criteria for user preferences used in this study are: 1) routes with as many tourist attractions as possible, 2) routes that pass popular destinations, and 3) routes with minimal costs. Based on the experiment results, Swap Operator Based Artificial Bee Colony gives more optimal results than the Simulated Annealing, especially in terms of the number of tourist attractions (nodes) that can be visited in one trip.Keywords: Multi-Attribute Utility Theory, Swap Operator Based Artificial Bee Colony Algorithm, Traveling Salesman Problem
Eye State Prediction Based on EEG Signal Data Neural Network and Evolutionary Algorithm Optimization Untari Novia Wisesty; Hifzi Priabdi; Rita Rismala; Mahmud Dwi Sulistiyo
Indonesia Journal on Computing (Indo-JC) Vol. 5 No. 1 (2020): Maret, 2020
Publisher : School of Computing, Telkom University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.34818/INDOJC.2020.5.1.372

Abstract

Eye state prediction is one study using EEG signals obtained to predict the state of the human eye several moments before. In its development, many researchers also have built eye states detection schemes, but the system built is only limited to classifying one record of input data obtained from the Emotive EPOC headset channel into the eye state. Therefore, this paper proposed eye state prediction system where the system can predict the state of the human eye some time previously based on the EEG signal series used. The proposed system consists of two parts, namely the prediction of the EEG signal value and eye state detection based on the value of the signal that has been obtained using Differential Evolution and Neural Network optimized by Evolution Strategies, respectively. The highest accuracy obtained from the eye state prediction system that has been built is 73.2%. These results are obtained by the best combination of parameters from the three methods used.
Performansi Implementasi Paralel OpenMP pada Persamaan Air Dangkal 2D untuk Simulasi Gelombang Runup Didit Adytia; Novalianda Jeriano
Indonesia Journal on Computing (Indo-JC) Vol. 5 No. 1 (2020): Maret, 2020
Publisher : School of Computing, Telkom University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.34818/INDOJC.2020.5.1.395

Abstract

Terdapat banyak aliran dangkal di alam seperti tsunami, aliran banjir, aliran pada sungai, pasang surut air laut, dan sebagainya. Aliran dangkal dapat disimulasikan dengan menggunakan Persamaan Air Dangkal atau Shallow Water Equations (SWE). Salah satu fenomena nonlinear yang penting dalam aliran dangkal adalah fenomena runup. Khususnya untuk menyimulasikan fenomena runup secara akurat, perlakuan khusus pada implementasi numerik dari model gelombang harus dilakukan. Pada artikel ini, persamaan SWE diimplementasikan dengan metode Finite Volume pada grid komputasi dengan model momentum conservative staggered grid. Untuk meningkatkan performasi komputasi terutama untuk menyimulasikan domain komputasi yang besar dengan resolusi grid tinggi, pada paper ini skema numerik tersebut diimplementasikan dengan metode arsitektur OpenMP. Performansi algoritma paralel dikuantifikasi dengan menghitung speedup dan efisiensi. Dari hasil paralelisasi tersebut, didapatkan efisiensi pada waktu komputasi untuk kasus-kasus dengan jumlah grid komputasi yang besar.
Klasifikasi Kanker Payudara Menggunakan Residual Neural Network Reynold Erwandi; Suyanto Suyanto
Indonesia Journal on Computing (Indo-JC) Vol. 5 No. 1 (2020): Maret, 2020
Publisher : School of Computing, Telkom University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.34818/INDOJC.2020.5.1.373

Abstract

Kanker Payudara menjadi salah satu penyebab kematian yang umum terutama pada kaum wanita. Di Amerika Serikat pada tahun 2015, kanker payudara menjadi jenis kanker yang paling banyak diderita dan menjadi kanker paling mematikan setelah kanker paru-paru. Studi terkait menyatakan bahwa pendeteksi dan penanggulangan secara diri menjadi faktor penting dalam menghadapi kanker payudara. Proses diagnosa kanker payudara secara tradisional memakan waktu yang cukup lama, terlebih lagi para ahli patologi belum 100% yakin atas hasil diagnosa mereka. Oleh karena itu dalampenelitian ini dibuatlah sebuah sistem dengan bantuan komputer yang dapat membantu para dokter untuk mengklasifikasi jenis sel payudara berdasarkan gambar histopatologi. Dalam penelitian ini, diusulkan sebuah metode menggunakan pendekatan deep convolutional neural network menggunakan arsitektur Residual Neural Network (ResNet) untuk pengklasifikasian berdasarkan gambar histopatologi pada dataset BreakHis. Performa terbaik yang dicapai dalam metode ini mencapai tingkat rata-rata akurasi 99,3% pada pengklasifikasian binary, dan tingkat rata-rata akurasi 94,6% pada pengklasifikasian multi-class yang mana hampir setara dengan kondisi state-ofthe-art saat penelitian ini ditulis.
Lexicon-Based Sentiment Analysis of Indonesian Language Student Feedback Evaluation Raginda Firdaus; Ibnu Asror; Anisa Herdiani
Indonesia Journal on Computing (Indo-JC) Vol. 6 No. 1 (2021): April, 2021
Publisher : School of Computing, Telkom University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.34818/INDOJC.2021.6.1.408

Abstract

Student feedback for lecturer plays an important role, it used to improve the quality of lecturer in teaching. In general, student feedback consists of two types, quantitative feedback and qualitative feedback. For quantitative feedback, it can easily analyze using statistical calculations, because it contains closed questions with multiple choices. But for qualitative feedback, it is difficult to analyze, because it contains open questions with essay answers. Lecturers can analyze manually, but it takes extensive times and the results can be very subjective. To overcome this problem, sentiment analysis is applied to analyze textual data automatically in order to improve teaching evaluations. This research uses student feedback as dataset, and lexicon approach with InSet Lexicon. In this research, the evaluation result shows that system accuracy is 90.9%.
Apriori Association Rule for Course Recommender system Fakhri Fauzan; Dade Nurjanah; Rita Rismala
Indonesia Journal on Computing (Indo-JC) Vol. 5 No. 2 (2020): September, 2020
Publisher : School of Computing, Telkom University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.34818/INDOJC.2020.5.2.434

Abstract

Until recently, recommender systems have been applied in learning, such as to recommend appropriate courses. They are based on users’ ratings, learning history, or curriculum that provide relationship between courses. The last approach, however, can’t be applied to Massive Open Online Courses (MOOCs) that don’t maintain such information. Hence, course recommender systems for MOOCs must be based on other learners’ experience. This paper discusses such recommender systems. We apply Apriori Association Rule and the case study used in this study is the Canvas Network dataset and the HarvardX-MITx dataset. The proposed recommender system consists of a pre-processing to normalize data and reduce anomalous data, data cleaning to handle empty data, K-Modes clustering to group users, grouping registration transactions for filtering user registration transaction, and finally, rule formation using the Apriori Association Rule. The performance of the association rules obtained, a lift ratio evaluation metric is used. The experiments results show the best parameters in this study are 0.01 for minimum support and 0.6 for minimum confidence. With these two parameters, the number of rules and the average lift ratio value on the Canvas Network dataset are 110 rules and 19.055, while the HarvardX-MITx dataset is 48 rules and 3.662.
Penerapan Analisis Klaster untuk Seleksi Aset dalam Optimasi Portofolio Investasi Saham varid vaya yusuf; irma palupi; indwiarti indwiarti
Indonesia Journal on Computing (Indo-JC) Vol. 5 No. 2 (2020): September, 2020
Publisher : School of Computing, Telkom University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.34818/INDOJC.2020.5.2.438

Abstract

Manfaat diversifikasi dapat dioptimalkan dengan mengategorikan aset ke dalam kelas-kelas tertentu. Di dalam pasar keuangan, terdapat struktur hirarki antar saham dan dapat dianalisis dengan mengobservasi serangkaian harga saham yang saling berkorelasi. Penelitian terdahulu banyak berfokus pada dampak analisis klaster terhadap performa portofolio, namun sedikit yang meninjau sisi seleksi aset dalam benchmark-nya. Penelitian ini mengajukan tiga skenario alternatif seleksi aset untuk proses konstruksi portofolio berbasis klaster sebagai sudut pandang baru dalam penyusunan benchmark konstruksi portofolio. Dalam pelaksanaannya, digunakan ward’s method untuk melakukan klasterisasi terhadap saham berdasarkan data in-sample dari 606 perusahaan tercatat di BEI. Dilanjutkan dengan konstruksi portofolio dengan tangency portfolio sebagai preferensi portofolio optimal dan seleksi aset dengan tiga skenario alternatif. Performa portofolio diukur menggunakan rasio Sharpe dan rasio terhadap data out-sample. Analisis klaster yang dilakukan menunjukkan kualitas yang luar biasa dalam kelompokkelompok saham yang terbentuk. Portofolio dengan analisis klaster memberikan performa yang sangat baik, melebihi portofolio tanpa analisis klaster.
Peringkasan Teks Ekstraktif Menggunakan Binary Firefly Algorithm Ade Naufal Ammar; Suyanto Suyanto
Indonesia Journal on Computing (Indo-JC) Vol. 5 No. 2 (2020): September, 2020
Publisher : School of Computing, Telkom University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.34818/INDOJC.2020.5.2.440

Abstract

Ada banyak informasi teks yang beredar di internet, tetapi manusia sulit mencerna semua informasi tersebut dalam waktu singkat. Peringkasan teks otomatis merupakan teknologi yang membantu seseorang untuk membaca suatu teks secara ringkas dengan menghasilkan ringkasan secara otomatis dari suatu teks tanpa adanya proses penyuntingan manusia terhadap ringkasan tersebut. Pertama, data dari situs diambil menggunakan teknik parsing. Pattern matching juga diperlukan untuk menyaring tag HTML dari data yang diambil sehingga menghasilkan teks murni. Setelah itu, dilanjutkan dengan tokenization untuk memecah teks menjadi kumpulan kata bermakna. Dengan Binary Firefly Algorithm, setiap bagian pada teks diberikan bobot berdasarkan skor kemiripan makna yang terkandung yang ditentukan oleh matriks TF-IDF. Dalam penelitian ini, ringkasan teks dibuat dengan mengambil tujuh bagian teks yang memiliki bobot tertinggi. Ringkasan kemudian dievaluasi menggunakan metrik ROUGE. Hasil penelitian menunjukkan bahwa dibandingkan dengan ringkasan abstraktif, ringkasan ekstraktif memberikan relative improvement sebesar 47,06% pada ROUGE-1, 34,4% pada ROUGE-2, dan 44,92% pada ROUGE-L.
Implementation of Naïve Bayes and Gini Index for Spam Email Classification Fikri Rozan Imadudin; Danang Triantoro Murdiansyah; Adiwijaya
Indonesia Journal on Computing (Indo-JC) Vol. 6 No. 1 (2021): April, 2021
Publisher : School of Computing, Telkom University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.34818/INDOJC.2021.6.1.452

Abstract

Email is a medium of information that is still frequently used by people today. At the moment email still has an endless problem that is spam email. Spam email is an email that can pollute, damage or disturb the recipient. In this study, we show the performance and accuracy of Multinomial Naïve Bayes (MNNB) and Complete Gini-Index Text (GIT) for use in spam email filtering. In this study, we used 6 cross-validations as testers for the built classification machines. We found that the average yield can exceed Multinomial Naïve Bayes without using feature selection which only uses 80000 features with a difference of 0.39%. Feature selection also increases speed during classification and can reduce features that are less relevant to the category to be classified.

Page 12 of 20 | Total Record : 198

 10   11   12   13   14 

Filter by Year

2016 2024


Reset
Filter By Issues
All Issue Vol. 9 No. 2 (2024): August, 2024 Vol. 9 No. 1 (2024): April, 2024 Vol. 8 No. 3 (2023): December 2023 Vol. 8 No. 2 (2023): August, 2023 Vol. 8 No. 1 (2023): April, 2023 Vol. 7 No. 3 (2022): December, 2022 Vol. 7 No. 2 (2022): August, 2022 Vol. 7 No. 1 (2022): April, 2022 Vol. 6 No. 3 (2021): December, 2021 Vol. 6 No. 2 (2021): September, 2021 Vol. 6 No. 1 (2021): April, 2021 Vol. 5 No. 3 (2020): December, 2020 Vol. 5 No. 2 (2020): September, 2020 Vol. 5 No. 1 (2020): Maret, 2020 Vol. 4 No. 3 (2019): December, 2019 Vol. 4 No. 2 (2019): September, 2019 Vol. 4 No. 1 (2019): Maret, 2019 Vol. 3 No. 2 (2018): September, 2018 Vol. 3 No. 1 (2018): Maret, 2018 Vol. 2 No. 2 (2017): September, 2017 Vol. 2 No. 1 (2017): Maret, 2017 Vol. 1 No. 2 (2016): September, 2016 Vol. 1 No. 1 (2016): March, 2016 More Issue