Article Per Year (5 Year)
p-Index From 2021 - 2026
0.61
P-Index
This Author published in this journals
All Journal International Journal of Electrical and Computer Engineering Jurnal Informatika Proceedings of KNASTIK TELKOMNIKA (Telecommunication Computing Electronics and Control) JUTI: Jurnal Ilmiah Teknologi Informasi Journal of Mathematical and Fundamental Sciences Journal of Engineering and Technological Sciences Journal of ICT Research and Applications Proceeding of the Electrical Engineering Computer Science and Informatics Jurnal RESTI (Rekayasa Sistem dan Teknologi Informasi) IT JOURNAL RESEARCH AND DEVELOPMENT Jambura Journal of Informatics
Benhard Sitohang
Institut Teknologi Bandung
Astronomy Chemistry Computer Science & IT Control & Systems Engineering Dentistry Earth & Planetary Sciences Education Electrical & Electronics Engineering Engineering Library & Information Science Mathematics Physics

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

Found 24 Documents
Search

 1   2   3 
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

Abstract

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.
A New Copyright Protection for Vector Map using FFT-based Watermarking Shelvie Nidya Neyman; I Nyoman Prama Pradnyana; Benhard Sitohang
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 12, No 2: June 2014
Publisher : Universitas Ahmad Dahlan

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

Abstract

This study proposed a new approach of copyright protection for vector map using robust watermarking on FFT algorithm. A copyright marker inserted in vector map as the watermark. In addition to data origin authentication capabilities watermark, RSA cryptographic algorithm is used when generating the watermark. Quality measurement of the results was based on the three characteristics of digital watermarking: (1) invisibility using RMSE calculations, (2) fidelity with the farthest distance and (3) NC calculation and gemotrical level of robustness against attacks. Result of experiments showed that the approach used in this study succeeded in inserting copyright as watermark on vector maps. Invisibility test showed good results, demonstrated by RMSE close to zero. Fidelity of the watermarked map was also maintained. Level of watermark robustness against geometric attacks on vector map results has been maintained within the limits that these attacks do not affect the watermark bit value directly.
Algorithms of Clustering and Classifying Batik Images Based on Color, Contrast and Motif Veronica S. Moertini; Benhard Sitohang
Journal of Engineering and Technological Sciences Vol. 37 No. 2 (2005)
Publisher : Institute for Research and Community Services, Institut Teknologi Bandung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/itbj.eng.sci.2005.37.2.5

Abstract

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.
Minimizing the Estimated Solution Cost with A* Search to Support Minimal Mapping Repair Inne Gartina Husein; Benhard Sitohang; Saiful Akbar
Proceeding of the Electrical Engineering Computer Science and Informatics Vol 4: EECSI 2017
Publisher : IAES Indonesia Section

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1322.664 KB) | DOI: 10.11591/eecsi.v4.1080

Abstract

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.
PQL: Operasi Komposisi dan Jaringan Semantik Data Benhard Sitohang
Journal of Mathematical and Fundamental Sciences Vol. 33 No. 2 (2001)
Publisher : Institute for Research and Community Services (LPPM) ITB

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

Abstract

Sari. Public Query Language (PQL) adalah bahaas penelusuran (query) pada basis data model relasi, yang lebih bersifat user friendly relative terhadap bahasa penelusuran pada Generasi ke-IV (SQL, QBE, QUEL, dll). Dari sisi struktur bahasa, PQL didasarkan pada struktur sintaks linier (tidak terdapat struktur blok rekursif). Pada sisi tampilan, hasil eksekusi dibentuk berdasarkan definisi entitas (bukan tuppel, seperti pada SQL). Dengan demikian duplikasi data pada tampilan dapat dihilangkan. Proses query dan prinsip tampilan yang dimaksudkan pada PQL dapat diimplementasikan dalam DBMS, dengan menerapkan teknik penggabungan (operator komposisi), yang didasarkan pada prinsip operator join dan navigasi pada jaringan semantik data. Operator komposisi dan jaringan semantik data adalah topik utama penelitian yang dijelaskan pada tulisan ini. PQL: Composition Operator and Semantic Data NetworkAbstract. Public Query Language (PQL) is the syntax of query for relational database, which is categorized as highly user friendly compared to the 4-th generation language (SQL, QBE, QUEL,etc.). As a query language, PQL is constructed as linear syntax (without block recursive). Visualization of the result is constructed as an entity (not tupple, as happened in SQL). As a consequence, duplication of data on the results could be rejected. Query process and the principle of visualization of result of PQL can be adapted as part of DBMS, using composition method  (Composition Operator), developed as an interpretation of join operator and navigation, supported by Data Semantic Network. Both Composition Operator and Data Semantic Network are main topic discussed in this article, as the result of this research on PQL.
Eksekusi Paralel Operator Relasi dari Transaksi pada Basis Data Model Relasi Benhard Sitohang
Journal of Mathematical and Fundamental Sciences Vol. 25 No. 1 (1992)
Publisher : Institute for Research and Community Services (LPPM) ITB

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

Abstract

Waktu tanggap SMBDR dicaoba diperbaiki dengan mengantisipasi eksekusi seluruh operator relasi dari transaksi secara parallel. Pada makalah ini, dijelaskan pendekatan yang memungkinkan eksekusi secara parallel (berupa usulan pendefinisian operator bebas), uji-coba, serta analisis untuk mengetahui sejauh mana perbaikan tersebut dapat dicapat. Hasil uji-coba pada sistem computer PDP-11/44, sistem operasi Xenix, digunakan mengidentifikasi kendala-kendala yang berperan dalam menentukan perbaikan termaksud. Waktu tanggap beberapa transaksi uji-coba yang dieksekusi secara parallel ternyata lebih baik daripada eksekusi secara sekuensial (reduksi : 11,36%). Beberapa transaksi uji coba lainnya kurang memberikan hasil yang mendukung hipotesa (reduksi : -60,87%). Improvement of RDBMS response-time was tried by anticipating to execute all relational operators of the transaction as a parallel process. This paper explains an approach which enables parallel execution (by defining "free operators"), test-case and analysis to know how far the improvement can be attained. Test-case result on PDP-11/44, under Xenix, was used to identify others constraints which plays role to the improvement. Response-time of test-case which parallel-execution performed better then sequential-execution (reduction : 11.,36 %). Others test-case transactions don't present satisfying result to the hypotheses (reduction : -6O,87 %).
Improvement of CB & BC Algorithms (CB* Algorithm) for Learning Structure of Bayesian Networks as Classifier in Data Mining Benhard Sitohang; G. A. Putri Saptawati
Journal of ICT Research and Applications Vol. 1 No. 1 (2007)
Publisher : LPPM ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/itbj.ict.2007.1.1.3

Abstract

There are two categories of well-known approach (as basic principle of classification process) for learning structure of Bayesian Network (BN) in data mining (DM): scoring-based and constraint-based algorithms. Inspired by those approaches, we present a new CB* algorithm that is developed by considering four related algorithms: K2, PC, CB, and BC. The improvement obtained by our algorithm is derived from the strength of its primitives in the process of learning structure of BN. Specifically, CB* algorithm is appropriate for incomplete databases (having missing value), and without any prior information about node ordering.
Ranking the Online Documents Based on Relative Credibility Measures Ahmad Dahlan; Dwi H. Widyantoro; Suhono H. Supangkat; Benhard Sitohang
Journal of ICT Research and Applications Vol. 3 No. 1 (2009)
Publisher : LPPM ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/itbj.ict.2009.3.1.2

Abstract

Information searching is the most popular activity in Internet. Usually the search engine provides the search results ranked by the relevance. However, for a certain purpose that concerns with information credibility, particularly citing information for scientific works, another approach of ranking the search engine results is required. This paper presents a study on developing a new ranking method based on the credibility of information. The method is built up upon two well-known algorithms, PageRank and Citation Analysis. The result of the experiment that used Spearman Rank Correlation Coefficient to compare the proposed rank (generated by the method) with the standard rank (generated manually by a group of experts) showed that the average Spearman 0 < rS < critical value. It means that the correlation was proven but it was not significant. Hence the proposed rank does not satisfy the standard but the performance could be improved.
The Concept of Data Model Pattern Based on Fully Communication Oriented Information Modeling (FCO-IM) Fazat Nur Azizah; Benhard Sitohang; Guido P. Bakema; Oerip S. Santoso
Journal of ICT Research and Applications Vol. 4 No. 1 (2010)
Publisher : LPPM ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/itbj.ict.2010.4.1.3

Abstract

Just as in many areas of software engineering, patterns have been used in  data modeling  to  create high quality  data  models.  We  provide  a  concept  of data  model  pattern  based  on  Fully  Communication  Oriented  Information Modeling  (FCO-IM),  a  fact  oriented  data  modeling  method.  A  data  model pattern is  defined  as  the relation  between  context, problem,  an d  solution.  This definition is adopted from the concept of pattern by Christopher Alexander. We define the concept of Information Grammar for Pattern (IG P) in the solution part of  a  pattern,  which  works  as  a  template  to  create  a  data  model.  The  IG P  also shows how a pattern can relate to other patterns. The data model pattern concept is then used to describe 15 data model patterns, organized into 4 categories. A case study on geographical location is provided to show the use of the concept in a real case.
Mengatasi Cold Start New User dalam Sistem Rekomendasi berbasis Pendekatan Hybrid: Review dan Analisis Bibliometrik Nasy`an Taufiq Al Ghifari; Benhard Sitohang; Gusti Ayu Putri Saptawati
IT Journal Research and Development Vol. 6 No. 1 (2021)
Publisher : UIR PRESS

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.25299/itjrd.2021.vol6(1).6118

Abstract

Increasing number of internet users today, the use of e-commerce becomes a very vital need. One of the keys that holds the success of the e-commerce system is the recommendation system. Collaborative filtering is the popular method of recommendation system. However, collaborative filtering still has issues including data sparsity, cold start, gray sheep, and dynamic taste. Some studies try to solve the issue with hybrid methods that use a combination of several techniques. One of the studies tried to solve the problem by building 7 blocks of hybrid techniques with various approaches. However, the study still has some problems left. In the case of cold start new users, actually, the method in the study has handled it with matrix factorizer block and item weight. But it will produce the same results for all users so that the resulting personalization is still lacking. This study aims to map an overview of the themes of recommendation system research that utilizes bibliometric analysis to assess the performance of scientific articles while exposing solution opportunities to cold start problems in the recommendation system. The results of the analysis showed that cold start problems can be solved by utilizing social network data and graph approaches.
Co-Authors Adikara, Fransiskus Ahmad Dahlan Ahmada, Marsa Akbar, Saiful Amal, Irfan Bayu Hendradjaya Bayu Hendradjaya Dwi H. Widyantoro Fazat Nur Azizah G. A. Putri Saptawati G.A. Putri Saptawati Gede Indrawan Guido P. Bakema Gusti Ayu Putri Saptawati Hendradjaya, Bayu Hery Heryanto I Nyoman Prama Pradnyana Inne Gartina Husein Jasman Pardede Masayu Leylia Khodra Mohamad Syafri Tuloli mohammad syafri tuloli Nasy`an Taufiq Al Ghifari Nasy`an Taufiq Al Ghifari Oerip S. Santosa Oerip S. Santoso Prameswari, Anindya Putri Saptawati Putri Saptawati Regina Yulia Yasmin Regina Yulia Yasmin Shelvie Nidya Neyman Sudarso Kaderi Wiryono Suhono H. Supangkat Tjahjanto, Tjahjanto Tricya Esterina Widagdo Veronica S. Moertini Veronica S. Moertini Veronica S. Moertini Yunastrian, Kurniandha