Garuda - Garba Rujukan Digital

p-Index From 2019 - 2024

0.61

P-Index

This Author published in this journals

All Journal International Journal of Electrical and Computer Engineering Jurnal Informatika Proceedings of KNASTIK Perfecting a Video Game with Game Metrics JUTI: Jurnal Ilmiah Teknologi Informasi Proceeding of the Electrical Engineering Computer Science and Informatics Journal of Engineering and Technological Sciences Proceeding of the Electrical Engineering Computer Science and Informatics Jurnal RESTI (Rekayasa Sistem dan Teknologi Informasi) Jambura Journal of Informatics

Benhard Sitohang

Institut Teknologi Bandung

Author-ID : 382764

Computer Science & IT Dentistry Education Electrical & Electronics Engineering Engineering Library & Information Science

Published : 14 Documents Claim Missing Document

Claim Missing Document

Articles

1 2

INTEGRASI ALGORITMA POHON KEPUTUSAN C4.5 YANG DIKEMBANGKAN KE DALAM OBJECT-RELATIONAL DBMS Moertini, Veronica S.; Sitohang, Benhard; Santosa, Oerip S.
JUTI: Jurnal Ilmiah Teknologi Informasi Vol 6, No 2 Juli 2007
Publisher : Department of Informatics, Institut Teknologi Sepuluh Nopember

Integrasi teknik-teknik data mining ke dalam DBMS, khususnya Object-Relational DBMS (ORDBMS), masih merupakan bidang penelitian yang aktif. Isu utama pada integrasi ini adalah: peleburan algoritma data mining ke dalam ORDBMS dengan memanfaatkan fitur-fiturnya untuk memperbaiki kualitas teknik tersebut. Pada penelitian ini, algoritma klasifikasi C4.5 dikembangkan dengan pendekatan aljabar relasional dan diintegrasikan ke dalam ORDBMS sebagai prosedur-prosedur tersimpan Java dan berbasis SQL, dengan tujuan untuk meningkatkan skalabilitas dan efisiensinya. Hasil eksperimen menunjukkan bahwa algoritma yang sudah diintegrasikan berhasil memperbaiki skalabilitas dan pada kasus khusus juga memperbaiki efisiensi. Kata kunci: pengembangan algoritma C.5, integrasi C4.5 ke dalam Object-Relational DBMS, algoritma C4.5, perbaikan skalabilitas C4.5.

Algorithms of Clustering and Classifying Batik Images Based on Color, Contrast and Motif Moertini, Veronica S.; Sitohang, Benhard
Journal of Engineering and Technological Sciences Vol 37, No 2 (2005)
Publisher : ITB Journal Publisher, LPPM ITB

An interactive system could be provided for batik customers with the aim of helping them in selecting the right batiks. The system should manage a collection of batik images along with other information such as fashion color type, the contrast degree, and motif. This research aims to find methods of clustering and classifying batik images based on fashion color, contrast and motif. A color clustering algorithm using HSV color system is proposed. Two algorithms for contrast clustering, both utilize wavelet, are proposed. Six algorithms for clustering and classifying batik images based on group of motifs, employing shape- and texture-based techniques, are explored and proposed. Wavelet is used in image pre-processing, Canny detector is used to detect image edges. Experiments are conducted to evaluate the performance of the algorithms. The result of experiments shows that fashion color and contrast clustering algorithms perform quite well. Three of motif based clustering and classification algorithms perform fairly well, further work is needed to increase the accuracy and to refine the classification into detailed motif.

EXPLORING A BETTER SEARCHBASED IMPLEMENTATION ON SECONDORDER MUTANT GENERATION Tuloli, Mohamad Syafri; Sitohang, Benhard; Hendradjaya, Bayu
Jambura Journal of Informatics VOLUME 1 NOMOR 1, APRIL 2019
Publisher : Universitas Negeri Gorontalo

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (545.479 KB)

Pengujian perangkat lunak adalah bagian dari proses pengembangan perangkat lunak, dengan tujuan utama untuk mengurangi/menghilangkan kesalahan pada perangkat lunak, hal ini umumnya dilakukan dengan menjalankan kasus-uji. Salah satu teknik untuk mengkur dan meningkatkan kualitas dari kasus uji adalah pengujian mutasi, tetapi walaupun sudah terbukti keefektifannya, teknik ini masih memiliki suatu kendala besar, yaitu tidak praktis untuk digunakan karena melibatkan pembangkitan dan eksekusi dari jumlah mutan yang besar. Belakangan ini penggunaan optimisasi berbasis-pencarian pada permasalahan pengujian perangkat lunak sedang popular. Pada penelitian ini, dilakukan eksplorasi penggunaan optimasi berbasis-pencarian pada pembangkitan mutan (variasi dari program), dengan tujuan untuk menghasilkan mutan yang tidak dapat dideteksi oleh kasus-uji, karena mutan jenis ini memiliki dapat kekurangan dari kasus-uji. Metode usulan dibandingkan dengan algoritma pembangkitan second-order mutant yang umum digunakan, dan juga dibandingkan dengan pendekatan berbasispencarian lainnya. Hasil menunjukkan bahwa metode usulan dapat membangkitkan lebih banyak mutantidak-terdeteksi (undetected-mutant) daripada dengan metode pembangitan mutan yang umum. Metode usulan memiliki performansi yang lebih rendah daripada metode pembangkitan berbasis-pencarian benchmark, tetapi performansinya dapat ditingkatkan dengan melakukan perubahan pada representasi solusi, dan dengan adopsi parameter optimasi yang digunakan oleh metode pembanding.

PQL: KONVERSI SINTAKS SQL MENJADI SINTAKS PQL Sitohang, Benhard; Widagdo, Tricya Esterina
Jurnal Informatika Vol 8, No 2 (2007): NOVEMBER 2007
Publisher : Institute of Research and Community Outreach - Petra Christian University

The aim of our research presented was to evaluate the semantic coverability of PQL (Public Query Language) as a query language, compared to SQL (Structured Query Language). Our approach in doing the evaluation was to develop conversion rules from SQL to PQL statements, by using relational expressions as the intermediate language. The SQL syntaxes were grouped into four categories, based on the number of relations used in the queries and whether the queries were nested or not. Based on the conversions results, it can be concluded that all of SQL statements that include one or more relations with natural join operations - with or without nested sub queries - can be converted into PQL statements. Abstract in Bahasa Indonesia : Evaluasi cakupan semantik PQL (Public Query Language) sebagai satu query, dibandingkan dengan SQL, merupakan kajian utama pada penelitian tentang konversi yang dijelaskan pada makalah ini. Pendekatan dalam evaluasi tersebut, dilakukan dengan mengembangkan dan uji-coba konversi dari SQL menjadi PQL, dengan menggunakan operator relasi sebagai media konversi. Dari pengembangan konversi ini telah dapat mengelompokkan, bahwa semua sintaks SQL yang didasarkan pada natural join dan melibatkan 1 atau beberapa relasi, dapat dikonversi menjadi sintaks PQL, baik query yang bersarang (nested) maupun tidak bersarang. Kata kunci: Public Query Language (PQL), Structured Query Language (SQL), model relasi, operator relasi.

TPDA2 ALGORITHM FOR LEARNING BN STRUCTURE FROM MISSING VALUE AND OUTLIERS IN DATA MINING Sitohang, Benhard; Saptawati, G.A. Putri
Jurnal Informatika Vol 7, No 2 (2006): NOVEMBER 2006
Publisher : Institute of Research and Community Outreach - Petra Christian University

Three-Phase Dependency Analysis (TPDA) algorithm was proved as most efficient algorithm (which requires at most O(N4) Conditional Independence (CI) tests). By integrating TPDA with "node topological sort algorithm", it can be used to learn Bayesian Network (BN) structure from missing value (named as TPDA1 algorithm). And then, outlier can be reduced by applying an "outlier detection & removal algorithm" as pre-processing for TPDA1. TPDA2 algorithm proposed consists of those ideas, outlier detection & removal, TPDA, and node topological sort node.

PENCARIAN BERBASIS KONTEN: STUDI KASUS SISTEM IDENTIFIKASI OTOMATIS SIDIK JARI Indrawan, Gede; Heryanto, Hery; Sitohang, Benhard
Proceedings of KNASTIK 2010
Publisher : Duta Wacana Christian University

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

Pencarian berbasis konten non-alfanumerik (tanpa menggunakan meta data atau atribut atau tag tambahan pada data original) dilakukan pada contoh kasus sistem identifikasi otomatis sidik jari. Sistem identifikasi otomatis sidik jari merupakan sistem yang menghilangkan atau meminimalkan peran ahli dalam identifikasi seseorang berdasarkan masukan data biometrik, yaitu citra sidik jari. Studi kasus berbasis pada proyek open source dan berdasarkan pola MVC, dimulai dari desain Model (bagian back-end, meliputi desain struktur data di basis data), Controller (berbagai algoritma yang digunakan dalam pra pemrosesan dan pemrosesan citra sidik jari, ekstraksi fitur citra sidik jari, pembentukan template hasil ekstraksi fitur untuk disimpan di basis data, pencarian dan pencocokan template masukan terhadap template yang tersimpan di basis data), dan View (antar muka masukan dan keluaran). Paper ini menititikberatkan studi kasus pada pemrosesan sistem sederhana yang memberikan dasar pemahaman dalam implementasi sistem nyata yang merupakan suatu sistem identifikasi otomatis sidik jari skala besar dengan akurasi dan kecepatan sebagai parameter utama.

Minimizing the Estimated Solution Cost with A* Search to Support Minimal Mapping Repair Gartina Husein, Inne; Sitohang, Benhard; Akbar, Saiful
Proceeding of the Electrical Engineering Computer Science and Informatics Vol 4: EECSI 2017
Publisher : IAES Indonesia Section

Incoherent alignment has been the main focus in the matching process since 2010.Â Incoherent means that there is semantic or logic conflict in the alignment. This condition encouraged researches in ontology matching field to improve the alignment by repairing the incoherent alignment. Repair mapping will restore the incoherent to coherent mapping, by deleting unwanted mappings from the alignment. In order to minimize the impacts in the input alignment, repair process should be done as as minimal as possible. Definition of minimal could be (1) reducing the number of deleted mappings, or (2) reducing the total amount of deleted mappingsâ€™ confidence values. Repair process with new global technique conducted the repair with both minimal definitions. This technique could reduce the number of deleted mappings and total amount of confidence values at the same time. We proposed A * Search method to implement new global technique. This search method was capable to search the shortest path which representing the fewest number of deleted mappings, and also search the cheapest cost which representing the smallest total amount of deleted mappingsâ€™ confidence value. A* Search was both complete and optimal to minimize mapping repair size.

Coevolution of Second-order-mutant Mohamad Syafri Tuloli; Benhard Sitohang; Bayu Hendradjaya
International Journal of Electrical and Computer Engineering (IJECE) Vol 8, No 5: October 2018
Publisher : Institute of Advanced Engineering and Science

One of the obstacles that hinder the usage of mutation testing is its impracticality, two main contributors of this are a large number of mutants and a large number of test cases involves in the process. Researcher usually tries to address this problem by optimizing the mutants and the test case separately. In this research, we try to tackle both of optimizing mutant and optimizing test-case simultaneously using a coevolution optimization method. The coevolution optimization method is chosen for the mutation testing problem because the method works by optimizing multiple collections (population) of a solution. This research found that coevolution is better suited for multi-problem optimization than other single population methods (i.e. Genetic Algorithm), we also propose new indicator to determine the optimal coevolution cycle. The experiment is done to the artificial case, laboratory, and also a real case.

Simulation and Implementation Model of Productivity Measurement Internet Bandwidth Usage Tjahjanto Tjahjanto; Benhard Sitohang; Sudarso Kaderi Wiryono
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 13, No 3: September 2015
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12928/telkomnika.v13i3.1544

The Internet is used by a very large number of users, from the ordinary user community, through special users, like people with high intellectual level. The growth in the number of users is increasing very fast. Internet has also been used by multi-sector businesses with multi profession. It makes information the internet usage something very strategic, one of which information productivity internet bandwidth usage. This paper describes a model implementation and simulation of productivity measurement internet bandwidth usage, which describes all possible measurement values obtained, and is a continuation of previous research, which is the basic concept of productivity in the use of internet bandwidth and how to measure it, so that the measuring results can be used as a guide in determine the direction of policy and the provision of productive Internet bandwidth usage.

Progressive Mining of Sequential Patterns Based on Single Constraint Regina Yulia Yasmin; Putri Saptawati; Benhard Sitohang
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 15, No 2: June 2017
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12928/telkomnika.v15i2.5098

Data that were appeared in the order of time and stored in a sequence database can be processed to obtain sequential patterns. Sequential pattern mining is the process to obtain sequential patterns from database. However, large amount of data with a variety of data type and rapid data growth raise the scalability issue in data mining process. On the other hand, user needs to analyze data based on specific organizational needs. Therefore, constraint is used to impose limitation in the mining process. Constraint in sequential pattern mining can reduce the short and trivial sequential patterns so that the sequential patterns satisfy user needs. Progressive mining of sequential patterns, PISA, based on single constraint utilizes Period of Interest (POI) as predefined time frame set by user in progressive sequential tree. Single constraint checking in PISA utilizes the concept of anti monotonic or monotonic constraint. Therefore, the number of sequential patterns will decrease, the total execution time of mining process will decrease and as a result, the system scalability will be achieved.

Co-Authors Akbar, Saiful Anindya Prameswari Bayu Hendradjaya G.A. Putri Saptawati Gede Indrawan Hendradjaya, Bayu Hery Heryanto I Nyoman Prama Pradnyana Inne Gartina Husein Irfan Amal Jasman Pardede Kurniandha Yunastrian Marsa Ahmada Mohamad Syafri Tuloli Mohamad Syafri Tuloli Oerip S. Santosa Putri Saptawati Regina Yulia Yasmin Shelvie Nidya Neyman Sudarso Kaderi Wiryono Tjahjanto, Tjahjanto Tricya Esterina Widagdo Tuloli, Mohamad Syafri Veronica S. Moertini

Title

Found 14 Documents
Search

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Title Search

Found 14 Documents Search

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Title

Found 14 Documents
Search