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 10 Documents
 1 
Search results for , issue "Vol. 5 No. 2 (2020): September, 2020" : 10 Documents clear
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.
Pneumonia Classification from X-ray Images Using Residual Neural Network Abdan Hafidh Ahnafi; Anditya Arifianto; Kurniawan Nur Ramadhani
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.454

Abstract

Pneumonia is a virus, bacterium, and fungi infection disease which causes alveoli swelling and gets worse easily if it is not taken care of immediately. There are symptoms that can be recognized through x-ray images, for example the appearance of white mist in the lungs. A pneumonia classification system has already developed, but it still produced low accuracy. In this research we develop classification system by increasing the depth of CNN architecture using Residual Neural Network to improve accuracy from previous research. The dataset contains 2 classes which are pneumonia and normal, and trained to produce the best learning strategy with various scenarios. The model trained using data train that has been oversampling. The best scenario is achieved by ResNet152 architecture using dropout 0.5. This scenario achieved a result of 0.88 precision, 0.95 recall, 0.92 f1-score, and 0.89 of accuracy. The classification model on this research produces higher accuracy compared to the research of Enes Ayan, et.al. in 2019 which produced 0.87.
Classifying Skin Cancer in Digital Images Using Convolutional Neural Network with Augmentation Zeyhan Aliyah; Anditya Arifianto; Febryanti Sthevanie
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.455

Abstract

Skin cancer is a hazardous disease that can induces death if it is not taken care of immediately. The disease is hard to identified since the symptoms have similarities with other disease. An automatically classification system of skin cancer has been developed, but it still produced low accuracy. We use Convolutional Neural Network  to enhance the accuracy of the classification. There are 2 main scenarios conducted in this research using HAM10000 dataset which has 7 classes. We compared ResNet and VGGNet architectures and obtained ResNet50 with augmentation as the best model with the accuracy of 99% and 99% macro avg.
LBP Advantages over CNN Face Detection Method on Facial Recognition System in NOVA Robot Luqman Bramantyo Rahmadi; Kemas Muslim Lhaksmana; Donny Rhomanzah
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.456

Abstract

Network-optimized virtual assistant (NOVA) is a robot developed by Bandung Techno Park (BTP) that can interact with humans for various purposes, such as a receptionist robot. NOVA robot is still in development and one of the main focuses is adding face recognition features so that the robot can actively greet and interact with humans. Therefore, we propose a face recognition and tracking system based on neural networks. This system is developed using the Google FaceNet feature extraction method. Previously, face detection in NOVA robot was implemented by employing the multi-task cascaded convolutional networks (MTCNN) method, whereas face tracking on the system was realized by using the modification of the MOSSE object tracking method. However, we found that the implementation of MTCNN in NOVA robot cannot run better than 30 fps. Therefore, this paper aims to solve this issue by investigating conventional face detection methods that could outperform MTCNN in this regard. Tests conducted on the ChokePoint dataset demonstrates that the system with LBP can achieve 30.44 fps framerate with a precision of 95% and recall of 83%. The test results show that LBP is not only better than MTCNN in identifying faces but also more efficient to compute.
A Parallel Implementation of Dual-Pivot Quick Sort for Computers with Small Number of Processors Mohammad F. J. Klaib; Mutaz Rasmi Abu Sara; Masud Hasan
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.487

Abstract

Sorting algorithms are heavily used. Quicksort is one of the fastest comparison-based sorting algorithms. These days almost all computing devices have multiple processors. There is a strong need of finding efficient parallel versions of the most common algorithms that are widely used. The basic version of quick sort is sequential and uses only one pivot.  Recently, Yaroslavsky has proposed a modified version of the quick sort that uses two pivots and runs much faster than the single-pivot quick sort. Since then Java has incorporated this dual-pivot quick sort into its standard library for sorting. Although there are many parallel versions of the original single-pivot quick sort, there is a very few for the dual-pivot. Those few parallel versions of the dual-pivot quick sorts are compared with standard sort functions, rather than the dual-pivot quick sort itself. In this paper, we provide a parallel version of the dual-pivot quick sort algorithm of Yaroslavsky and implement it in Java. For comparison, we run both in small number of parallel processors. The experimental results show that our algorithm runs significantly faster than the Yaroslavsky’s algorithm. Moreover, our algorithm performs gradually better as the number of processors and the input size increase.
Sequence Chunking on Quran in English Translation using Bidirectional Long Short-Term Memory Try Arie; Muhammad Arif Bijaksana
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.492

Abstract

Every Moslem is obliged to read and understand the meanings of the Quran. The problem is the amount of information contained in the Quran so that ordinary people have difficulty understanding the Quran as a whole. Neural networks can be used to extract important information in the Quran to solve this problem. Therefore, the author proposes a model to identify and classify tags using sequence chunking. The system will use the Bi-LSTM model where the system will be given various token from the Quran as the inputs to be identified as the correct tags. The author is using the dataset obtained from website quran.com. The evaluation of the proposed model produces an f-measure value of 0.903.
Anaphora Resolution on Al-Quran with Indonesian Translation Arlinda Dwi Ardiyani; Moch Arif Bijaksana; Arief Fatchul Huda
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.496

Abstract

Al-Quran is the holy book of Islam, in Al-Quran we often find many cases of anaphora. Anaphora is a pronoun, for example “it” which refers to an object (antecedent) in the previous sentence. Antecedent of a pronoun is very important to understand the Al-Quran. Coreference Resolution with the classification model using the support vector machine method are needed to find out the antecedent. In this research, we use i feature and j feature for the extraction process. Based on the evaluation results, the system is able to find the antecedent of an anaphor with the best accuracy value of 86.36%.
The Effect of Information Gain Feature Selection for Hoax Identification in Twitter Using Classification Method Support Vector Machine Isep Mumu Mubaroq; Erwin Budi Setiawan
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.499

Abstract

Nowadays social media twitter is popular media for news dissemination. News has elements that can be distinguished types of news, such as hoax that has elements of panic, worry, and anxiety that can have a significant impact in various fields of social, economic, educational, and political. Hoax prevention efforts need as possible before news viral, by to be developed method with functions to identify and hoax analyze. in this research we have proposed an approach Machine Learning with method Support Vector Machine (SVM) supported by feature selection Information Gain (IG) added Term Frequency–Inverse Document Frequency (TF-IDF) for word weighting system performance is very optimal in increasing accuracy by 37,51%, with accuracy reaching 96.55%.

Page 1 of 1 | Total Record : 10

 1 

Filter by Year

2020 2020


Reset
Filter By Issues
All Issue Vol. 9 No. 3 (2024): December, 2024 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