Article Per Year (5 Year)
p-Index From 2019 - 2024
1.978
P-Index
This Author published in this journals
All Journal ComEngApp : Computer Engineering and Applications Journal IJCCS (Indonesian Journal of Computing and Cybernetics Systems) Seminar Nasional Aplikasi Teknologi Informasi (SNATI) Jurnal Buana Informatika Perfecting a Video Game with Game Metrics Prosiding Seminar Nasional Sains Dan Teknologi Fakultas Teknik Jurnal Teknik Elektro Dinamika Informatika Jurnal Ilmiah Kursor Proceeding of the Electrical Engineering Computer Science and Informatics Journal of Engineering and Technological Sciences Jurnal Edukasi dan Penelitian Informatika (JEPIN) jurnal Teknologi Informasi Magister Proceeding of the Electrical Engineering Computer Science and Informatics Edu Komputika Journal Communications in Science and Technology Conference SENATIK STT Adisutjipto Yogyakarta Jurnal Otomasi Kontrol dan Instrumentasi IJID (International Journal on Informatics for Development) Jurnal Informatika IJITEE (International Journal of Information Technology and Electrical Engineering) Indonesian Journal of Electrical Engineering and Computer Science Jurnal Nasional Teknik Elektro dan Teknologi Informasi Prosiding Seminar Nasional Rekayasa Teknologi Industri dan Informasi ReTII Teknomatika: Jurnal Informatika dan Komputer
Teguh Bharata Adji
Departemen Teknik Elektro Dan Teknologi Informasi Fakultas Teknik, Universitas Gadjah Mada
Aerospace Engineering Automotive Engineering Chemical Engineering, Chemistry & Bioengineering Civil Engineering, Building, Construction & Architecture Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Earth & Planetary Sciences Education Electrical & Electronics Engineering Energy Engineering Environmental Science Industrial & Manufacturing Engineering Materials Science & Nanotechnology Mechanical Engineering Physics Transportation

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

Found 46 Documents
Search

 1   2   3   4   5 
Serendipity Identification Using Distance-Based Approach Widhi Hartanto; Noor Akhmad Setiawan; Teguh Bharata Adji
IJITEE (International Journal of Information Technology and Electrical Engineering) Vol 5, No 1 (2021): March 2021
Publisher : Department of Electrical Engineering and Information Technology,Faculty of Engineering UGM

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.22146/ijitee.62344

Abstract

The recommendation system is a method for helping consumers to find products that fit their preferences. However, recommendations that are merely based on user preference are no longer satisfactory. Consumers expect recommendations that are novel, unexpected, and relevant. It requires the development of a serendipity recommendation system that matches the serendipity data character. However, there are still debates among researchers about the available common definition of serendipity. Therefore, our study proposes a work to identify serendipity data's character by directly using serendipity data ground truth from the famous Movielens dataset. The serendipity data identification is based on a distance-based approach using collaborative filtering and k-means clustering algorithms. Collaborative filtering is used to calculate the similarity value between data, while k-means is used to cluster the collaborative filtering data. The resulting clusters are used to determine the position of the serendipity cluster. The result of this study shows that the average distance between the recommended movie cluster and the serendipity movie cluster is 0.85 units, which is neither the closest cluster nor the farthest cluster from the recommended movie cluster.
User Curiosity Factor in Determining Serendipity of Recommender System Arseto Satriyo Nugroho; Igi Ardiyanto; Teguh Bharata Adji
IJITEE (International Journal of Information Technology and Electrical Engineering) Vol 5, No 3 (2021): September 2021
Publisher : Department of Electrical Engineering and Information Technology,Faculty of Engineering UGM

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.22146/ijitee.67553

Abstract

Recommender rystem (RS) is created to solve the problem by recommending some items among a huge selection of items that will be useful for the e-commerce users. RS prevents the users from being flooded by information that is irrelevant for them.Unlike information retrieval (IR) systems, the RS system's goal is to present information to the users that is accurate and preferably useful to them. Too much focus on accuracy in RS may lead to an overspecialization problem, which will decrease its effectiveness. Therefore, the trend in RS research is focusing beyond accuracy methods, such as serendipity. Serendipity can be described as an unexpected discovery that is useful. Since the concept of a recommendation system is still evolving today, formalizing the definition of serendipity in a recommendation system is very challenging.One known subjective factor of serendipity is curiosity. While some researchers already addressed curiosity factor, it is found that the relationships between various serendipity component as perceived by the users and their curiosity levels is still yet to be researched. In this paper, the method to determine user curiosity model by considering the variation of rated items was presented, then relation to serendipity components using existing user feedback data was validated. The finding showed that the curiosity model was related to some user-perceived values of serendipity, but not all. Moreover, it also had positive effect on broadening the user preference. 
Shape analysis for classification of breast nodules on digital ultrasound images Hanung Adi Nugroho; Hesti Khuzaimah Nurul Yusufiyah; Teguh Bharata Adji; Widhia K.Z Oktoeberza
Indonesian Journal of Electrical Engineering and Computer Science Vol 13, No 2: February 2019
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v13.i2.pp837-844

Abstract

One of the imaging modalities for early detection of breast cancer malignancy is ultrasonography (USG).  The malignancy can be analysed from the characteristic of nodule shape.  This study aims to develop a method for classifying the shape of breast nodule into two classes, namely regular and irregular classes.  The input image is pre-processed by using the combination of adaptive median filter and speckle reduction bilateral filtering (SRBF) to reduce speckle noises and to eliminate the image label.  Afterwards, the filtered image is segmented based on active contour followed by feature extraction process.  Nine extracted features, i.e. roundness, slimness and seven features of invariant moments, are used to classify nodule shape using multi-layer perceptron (MLP).  The performance of the proposed method is evaluated using 105 breast nodule images which comprise of 57 regular and 48 irregular nodule images.  The results of classification process achieve the level of accuracy, sensitivity and specificity at 96.20%, 97.90% and 94.70%, respectively.  These results indicate that the proposed method successfully classifies the breast nodule images based on shape analysis.
Kinerja Metode Load Balancing dan Fault Tolerance Pada Server Aplikasi Chat Sampurna Dadi Riskiono; Selo Sulistyo; Teguh Bharata Adji
Retii Prosiding Seminar Nasional ReTII ke-11 2016
Publisher : Institut Teknologi Nasional Yogyakarta

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

Abstract

Perkembangan aplikasi social network telah tumbuh begitu cepat dengan berbagai aplikasi yang didukung oleh piranti cerdas sebagai platform untuk menjalankannya. Salah satu aplikasi social network yang digunakan adalah aplikasi chat. Ketika jumlah pengguna yang mengakses layanan chat meningkat  dan server tidak dapat mengatasinya tentu ini akan menjadi masalah yang mengakibatkan layanan server terhenti disebabkan adanya beban berlebih yang diterima oleh suatu server tunggal. Oleh karena itu diperlukan penelitian untuk merancang bagaimana membangun sistem server yang dapat menangani banyaknya permintaan layanan  yang masuk agar beban dari server chat dapat diatasi. Hal ini bertujuan untuk meningkatkan pelayanan untuk setiap permintaan yang dikirim oleh pengguna. Salah satu solusi dari permasalahan tersebut adalah penggunaan banyak server. Perlu metode untuk mendistribusikan beban agar merata di masing-masing server, yaitu dengan menerapkan metode load balancing untuk mengatur pemerataan beban tersebut. Selanjutnya akan dilakukan evaluasi sebelum dan sesudah penerapan load balancing. Sedangkan untuk ketersediaan yang tinggi diperoleh ketika server memiliki kemampuan dalam melakukan failover atau berpindah ke server yang lain bila terjadi kegagalan. Sehingga penerapan load balancing dan fault tolerance dapat meningkatkan layanan kinerja aplikasi chat dan memperkecil kesalahan yang terjadi. Kata Kunci: load balancer, fault tolerance, sistem serverchat, beban berlebih.
KONVERSI DATA KE FORMAT DNA DAN PERBANDINGAN HASIL KOMPRESINYA MENGGUNAKAN GENCOMPRESS TERHADAP WINRAR Heilbert Armando Mapaly; Teguh Bharata Adji; Noor Akhmad Setiawan
Jurnal Teknomatika Vol 6 No 1 (2013): TEKNOMATIKA
Publisher : Fakultas Teknik dan Teknologi Informasi, Universitas Jenderal Achmad Yani Yogyakarta

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

Abstract

Teknik kompresi data saat ini merupakan hal yang penting dalam menyimpan media dalam bentuk digital. Secara umum, teknik kompresi terbagi menjadi lossy compression dan loseless compression. Penelitian ini mencoba untuk menerapkan konsep kompresi DNA yang bersifat loseless. Karena DNA hanya terdiri dari huruf a, c, g, dan t, maka kompresi ini hanya dapat diaplikasikan pada media teks, padahal, media yang ada saat ini tidak hanya berupa teks saja. Oleh sebab itu penelitian ini bertujuan untuk menemukan cara agar kompresi tersebut dapat diaplikasikan pada media lain serta membandingkan hasil kompresi tersebut dengan aplikasi WinRAR. Untuk dapat dikompresi dengan teknik kompresi DNA, semua file tersebut harus dikonversikan ke dalam bentuk DNA. Proses konversi tersebut dilakukan dengan mengubah kode binary yang ada pada file menjadi untaian rantai DNA. 00 diubah menjadi ‘a’, 01 diubah menjadi ‘c’, 10 diubah menjadi ‘g’ dan 11 diubah menjadi ‘t’. Walaupun pada konversi data ke format DNA ukuran file DNA menjadi lebih besar dari file awal, namun ukuran file hasil kompresi menjadi lebih kecil dari ukuran file awal karena memanfaatkan kelebihan teknik kompresi DNA. Ukuran file hasil kompresi dengan GenCompress menunjukkan hasil yang lebih baik dari WinRAR ketika terdapat pengulangan dengan jumlah yang sama pada isi file.
Point of Interest (POI) Recommendation System using Implicit Feedback Based on K-Means+ Clustering and User-Based Collaborative Filtering Sulis Setiowati; Teguh Bharata Adji; Igi Ardiyanto
Computer Engineering and Applications Journal Vol 13 No 1 (2024)
Publisher : Universitas Sriwijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.18495/comengapp.v13i1.388

Abstract

Recommendation system always involves huge volumes of data, therefore it causes the scalability issues that do not only increase the processing time but also reduce the accuracy. In addition, the type of data used also greatly affects the result of the recommendations. In the recommendation system, there are two common types of data namely implicit (binary) rating and explicit (scalar) rating. Binary rating produces lower accuracy when it is not handled with the properly. Thus, optimized K-Means+ clustering and user-based collaborative filtering are proposed in this research. The K-Means clustering is optimized by selecting the K value using the Davies-Bouldin Index (DBI) method. The experimental result shows that the optimization of the K values produces better clustering than Elbow Method. The K-Means+ and User-Based Collaborative Filtering (UBCF) produce precision of 8.6% and f-measure of 7.2%, respectively. The proposed method was compared to DBSCAN algorithm with UBCF, and had better accuracy of 1% increase in precision value. This result proves that K-Means+ with UBCF can handle implicit feedback datasets and improve precision.
Co-Authors Abdul Kadir Adhistya Erna Permanasari Adi Wijaya Adi Wijaya Aris Budianto, Aris Bagus Kurniawan Buana, Ratna Lestari Budiani Dwi Retno Puspita Sari Dyah Mustika, Dyah Faisal Najamuddin Fathan, Gess Fauziazzuhry Rahadian Gess Fathan Hairani Hairani Hamka, Cakra Aminuddin Hamka, Cakra Aminuddin Hanung Adi Nugroho Hanung Adi Nugroho Hanung Adi Nugroho Heilbert Armando Mapaly Hesti Khuzaimah Nurul Yusufiyah I Made Artha Agastya Igi Ardiyanto Ignatia Dhian Estu Karisma Ratri Indriana Hidayah KZ Widhia Oktoeberza Maghfirah Maghfirah Maghfirah Maghfirah Maghfirah Moch. Ari Nasichuddin Muhammad Esa Permana Putra Naufal Azmi Verdikha Nisrina Akbar Rizky Putri Noor Akhmad Setiawan Nugroho, Arseto Satriyo Nur Annisa Tresnasari Nurirwan Saputra, Nurirwan Rahadian, Fauziazzuhry Ratna Lestari Budiani Buana Ridi Ferdiana Risanuri Hidayat Rudy Hartanto Sampurna Dadi Riskiono Selo Sulistyo, Selo Setialana, Pradana SRI RAHAYU Sri Suning Kusumawardani Stefani, Brillian Stefani, Brillian Sudaryanto . Sudaryanto Sudaryanto Sulis Setiowati Syahroni Hidayat SYAIFULLOH AMIEN PANDEGA PERDANA Tari Mardiana Titik Hinayah Widhi Hartanto Widhia K.Z Oktoeberza Widiyanti, Tanty Yanuar Widyawan Wijaya, Adi