Article Per Year (5 Year)
p-Index From 2019 - 2024
5.369
P-Index
This Author published in this journals
All Journal Jurnal Ilmu Komputer JURNAL REKAYASA DAN MANAJEMEN AGROINDUSTRI E-Journal of Tourism (JELIKU) Jurnal Elektronik Ilmu Komputer Udayana Jurnal Buana Informatika Jurnal Teknologi Informasi dan Ilmu Komputer Jurnal Teknologi Informasi dan Komputer JITK (Jurnal Ilmu Pengetahuan dan Komputer) SINTECH (Science and Information Technology) Journal Jurnal WIDYA LAKSMI (Jurnal Pengabdian Kepada Masyarakat) Jurnal Pengabdian Informatika (JUPITA) Jurnal Nasional Teknologi Informasi dan Aplikasinya
Ngurah Agus Sanjaya ER
Universitas Udayana
Agriculture, Biological Sciences & Forestry Arts Humanities Computer Science & IT Control & Systems Engineering Economics, Econometrics & Finance Education Engineering Languange, Linguistic, Communication & Media Library & Information Science Social Sciences Other

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

Found 52 Documents
Search

 1   2   3   4   5 
Analisis Perbandingan Ketahanan Metode Steganografi LSB dan BPCS Menggunakan Metode Steganalisis Binary Similarity Measures Sanjaya ER, Ngurah Agus; Suardiyana Putra, I Putu Edy
Jurnal Buana Informatika Vol 3, No 1 (2012): Jurnal Buana Informatika Volume 3 Nomor 1 Januari 2012
Publisher : Universitas Atma Jaya Yogyakarta

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

Abstract

Abstract. Least significant bit (LSB) and Bit Plane Complexity Segmentation (BPCS) are two of the most commonly used steganoraphy methods. LSB is relatively simple and can be quickly implemented while BPCS offers an advantage in the capacity of storing hidden messages. These two methods are considered good if and only if the hidden messages in each of them are robust from a steganalysis implementation. This research specifically performs the robustness checks for both methods by using the Binary Similarity Measures (BSM). BSM measures the correlations between bits in a bit-plane to detect the message hidden in an image. Our test results show that the larger the size of the message hidden by using the BPCS method, the smaller is its detection probability. On the contrary, the size of the hidden message is directly proportional to its probability of being discovered in the LSB method. Keywords: steganography, Least Significant Bit, Bit Plane Complexity Segmentation, steganalysis, Binary Similarity Measures Abstrak. Least Significant Bit (LSB) dan Bit Plane Complexity Segmentation (BPCS) merupakan dua metode steganografi yang umum digunakan. LSB dapat diimplementasikan secara cepat dan sederhana sedangkan BPCS menawarkan kelebihan dalam penampungan kapasitas pesan rahasia. Agar dapat dikatakan sebagai metode steganografi yang baik maka kedua metode tersebut harus dapat mempertahankan pesan yang disisipkan dari serangan metode steganalisis. Penelitian yang dilakukan bertujuan untuk mengetahui ketahanan dari masing-masing metode menggunakan metode steganalisis Binary Similarity Measures (BSM). BSM mengukur korelasi antar bit-bit dalam suatu bit-plane untuk mengetahui keberadaan pesan pada citra. Hasil penelitian mengungkapkan bahwa semakin besar pesan yang disisipkan pada suatu citra menggunakan metode BPCS, maka kemungkinan terdeteksinya pesan akan berkurang. Hal ini berbanding terbalik dengan metode LSB dimana ukuran pesan yang disisipkan berbanding lurus dengan kemungkinan terdeteksinya pesan tersebut.Kata Kunci: Steganografi, Least Significant Bit, Bit Plane Complexity Segmentation, Steganalisis, Binary Similarity Measures
Analisis Perbandingan Ketahanan Metode Steganografi LSB dan BPCS Menggunakan Metode Steganalisis Binary Similarity Measures Sanjaya ER, Ngurah Agus; Suardiyana Putra, I Putu Edy
Jurnal Buana Informatika Vol 3, No 1 (2012): Jurnal Buana Informatika Volume 3 Nomor 1 Januari 2012
Publisher : Universitas Atma Jaya Yogyakarta

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24002/jbi.v3i1.317

Abstract

Abstract. Least significant bit (LSB) and Bit Plane Complexity Segmentation (BPCS) are two of the most commonly used steganoraphy methods. LSB is relatively simple and can be quickly implemented while BPCS offers an advantage in the capacity of storing hidden messages. These two methods are considered good if and only if the hidden messages in each of them are robust from a steganalysis implementation. This research specifically performs the robustness checks for both methods by using the Binary Similarity Measures (BSM). BSM measures the correlations between bits in a bit-plane to detect the message hidden in an image. Our test results show that the larger the size of the message hidden by using the BPCS method, the smaller is its detection probability. On the contrary, the size of the hidden message is directly proportional to its probability of being discovered in the LSB method. Keywords: steganography, Least Significant Bit, Bit Plane Complexity Segmentation, steganalysis, Binary Similarity Measures Abstrak. Least Significant Bit (LSB) dan Bit Plane Complexity Segmentation (BPCS) merupakan dua metode steganografi yang umum digunakan. LSB dapat diimplementasikan secara cepat dan sederhana sedangkan BPCS menawarkan kelebihan dalam penampungan kapasitas pesan rahasia. Agar dapat dikatakan sebagai metode steganografi yang baik maka kedua metode tersebut harus dapat mempertahankan pesan yang disisipkan dari serangan metode steganalisis. Penelitian yang dilakukan bertujuan untuk mengetahui ketahanan dari masing-masing metode menggunakan metode steganalisis Binary Similarity Measures (BSM). BSM mengukur korelasi antar bit-bit dalam suatu bit-plane untuk mengetahui keberadaan pesan pada citra. Hasil penelitian mengungkapkan bahwa semakin besar pesan yang disisipkan pada suatu citra menggunakan metode BPCS, maka kemungkinan terdeteksinya pesan akan berkurang. Hal ini berbanding terbalik dengan metode LSB dimana ukuran pesan yang disisipkan berbanding lurus dengan kemungkinan terdeteksinya pesan tersebut.Kata Kunci: Steganografi, Least Significant Bit, Bit Plane Complexity Segmentation, Steganalisis, Binary Similarity Measures
Basic Word Extraction Algorithm Based on Morphological Rules for Balinese Texts Negara, I Made Wahyu Guna; Sanjaya ER, Ngurah Agus
JELIKU (Jurnal Elektronik Ilmu Komputer Udayana) Vol 8 No 4 (2020): JELIKU Volume 8 No 4, Mei 2020
Publisher : Informatics Department, Faculty of Mathematics and Natural Sciences, Udayana University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24843/JLK.2020.v08.i04.p06

Abstract

Stemming is the process of extracting the root word of an affixed word. The process is intended to reduce the variations in the word. In this research, we are interested in applying stemming on Balinese language. Previous works on stemming of the Balinese language applied rule-based method but only prefix and suffix were considered. Moreover, the rules were constructed without providing much attention to the morphology of the Balinese language. Rule-based method can be verified and validated with ease on simple problem but fail to do so on problems with high complexity such as Balinese language. To overcome the weaknesses of rule-based stemming on Balinese language, we propose a method that reduce all variations of affix on Balinese language by combining the rule- based approach and the Balinese language morphology. Based on experiments carried out, our proposed method obtained an average stemming accuracy of 99% which is better than 96.67% achieved by the previous method. Keywords: Stemming, Balinese language, Rule-based
Penerapan Metode Adaboost Untuk Multi-Label Classification Pada Dokumen Teks Purnajiwa Arimbawa, I Gede Angga; Sanjaya ER, Ngurah Agus
JELIKU (Jurnal Elektronik Ilmu Komputer Udayana) Vol 9 No 1 (2020): JELIKU Volume 9 No 1, Agustus 2020
Publisher : Informatics Department, Faculty of Mathematics and Natural Sciences, Udayana University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24843/JLK.2020.v09.i01.p13

Abstract

The significant increase in the amount of text data makes the reasons for applying the classification to the text very clear. The manual classification process carried out by humans is very inefficient and ineffective. This limitation opens up great opportunities for the development of automatic text classifications. In the case of article classification, it is more relevant to use multi-label classification, because an article can be categorized into multiple labels. Many approaches can be used to implement a multi-label classification of text. The supervised-learning method in the field of machine learning is a popular method for this problem. In the review conducted, there were journals that carried out a comparative analysis of the supervised method in the multi-label classification. Based on the review conducted, the AdaBoost Algorithm gives better results than other algorithms. Many approaches can be used to implement a multi-label classification of text. The supervised-learning method in the field of machine learning is a popular method for this problem. In the review conducted, some journals carried out a comparative analysis of the supervised method in the multi-label classification. Based on the review conducted, the AdaBoost Algorithm gives better results than other algorithms. Based on research conducted by the AdaBoost algorithm, it gives more optimal results on the dataset with TF-IDF weighting than TF. The results of accuracy, precision, recall, and f-measure given are higher when compared with the comparison algorithm used. The computing time used by the AdaBoost algorithm is faster than the comparison algorithm used.
Syllabification of Balinese Words Using the Syllabification Algorithm Putra, Gede Bagus Prawira; Sanjaya ER, Ngurah Agus
JELIKU (Jurnal Elektronik Ilmu Komputer Udayana) Vol 8 No 2 (2019): Jeliku Volume 8 No 2, November 2019
Publisher : Informatics Department, Faculty of Mathematics and Natural Sciences, Udayana University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24843/JLK.2019.v08.i02.p03

Abstract

Abstract This research discusses the syllabification of Balinese words. The syllabification of Balinese words is necessary in determining padalingsa in pupuh. In order to be able to develop the application of technology in the field of pupuh literary, a system that can automatically find the correct division of a Balinese word into syllabels is required. Several studies have been conducted on the syllabification Spanish and Sinhala language using rule-based approach. Both of the studies achieved good accuracy score. Thus, in this research we apply the rule-based syllabification approach on Balinese words. The data used in this study were 257 Balinese words in which the system managed to correctly divide the word as many as 244 and obtained an accuracy score of 94.94%. Keywords: Syllabification Algorithm, Word, Balinese, Word Syllabification, Rule-based
Lemmatization in Balinese Language Purnajiwa Arimbawa, I Gede Angga; Sanjaya ER, Ngurah Agus
JELIKU (Jurnal Elektronik Ilmu Komputer Udayana) Vol 8 No 3 (2020): JELIKU Volume 8 No 3, February 2020
Publisher : Informatics Department, Faculty of Mathematics and Natural Sciences, Udayana University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24843/JLK.2020.v08.i03.p04

Abstract

Lemmatization is a process to extracting root word from an affixed word with the aim of reducing variations of the word into the root word. Previous researches on extraction of root word in Balinese Language has been done with rule- based methods to remove affixes from words. The weakness of the rule-based method is that it must comply with the set of rules provided. However, writings in Balinese often contain typographical errors because speakers tend to write words according to how the word is spoken instead of following the correct rules. In this research, we apply the Levenshtein distance method to overcome the aforementioned shortcoming. After all the rules applied to a given word fail, the Leven- shtein distance method is used to list all words that are ”close”. Next, we select the closest word as the root word of the given input. Based on the experiments, our proposed method achieved an accuracy of 96.01 %.
Building Balinese Part-of-Speech Tagger Using Hidden Markov Model (HMM) Pradiptha, I Gde Made Hendra; Sanjaya ER, Ngurah Agus
JELIKU (Jurnal Elektronik Ilmu Komputer Udayana) Vol 9 No 2 (2020): JELIKU Volume 9 No 2, November 2020
Publisher : Informatics Department, Faculty of Mathematics and Natural Sciences, Udayana University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24843/JLK.2020.v09.i02.p18

Abstract

Part-of-Speech tagging or word class labeling is a process for labeling a word class in a word in a sentence. Previous research on POS Tagger, especially for Indonesian, has been done using various approaches and obtained high accuracy values. However, not many researchers have built POS Tagger for Balinese. In this article, we are interested in building a POS Tagger for Balinese using a probabilistic approach, specifically the Hidden Markov Model (HMM). HMM is selected to deal with ambiguity since it gives higher accuracy and fast processing time. We used k-fold cross-validation (with k = 10) and tagged corpus around 3669 tokens with 21 tags. Based on the experiments conducted, the HMM method obtained an accuracy of 68.56%.
Peringkat Jawaban Esai Otomatis Menggunakan Metode Kesamaan Teks Abimanyu, Cokorda Gde; Sanjaya ER, Ngurah Agus
JELIKU (Jurnal Elektronik Ilmu Komputer Udayana) Vol 8 No 4 (2020): JELIKU Volume 8 No 4, Mei 2020
Publisher : Informatics Department, Faculty of Mathematics and Natural Sciences, Udayana University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24843/JLK.2020.v08.i04.p12

Abstract

Assesments are required in order to evaluate the performance of students. A typical method of learning assesments in class is by examination. An essay type exam is a form of assesment where there are no answer choices provided and generally applied to measure the students’ level of understanding of the knowledge. To asses the quality of the essay answers manually is a subjective task as well as time consuming. In this reasearch, we propose an automatic method of assessing essay answers by applying the cosine similarity method. In this research, the students’ answer document and the correct answer document are used as input. Both documents are then preprocessed and represented in vector form using word2vec. We then measure the similarity between the documents by calculating the cosine similarity of the two vectors. The cosine similarity values are converted back again and used as the final grades. The results of the final grade are then compared to the values given by the instructor to show accuracy of the proposed approach.
ANALISIS DAN IMPLEMENTASI PENJADWALAN DENGAN MENGGUNAKAN PENGEMBANGAN MODEL CROSSOVER DALAM ALGORITMA GENETIKA Yunantara, Made Darma; Astawa, I Gede Santi; ER, Ngr. Agus Sanjaya
JELIKU (Jurnal Elektronik Ilmu Komputer Udayana) Volume 1 No 2 - Nopember 2012
Publisher : Informatics Department, Faculty of Mathematics and Natural Sciences, Udayana University

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

Abstract

Optimasi penjadwalan dapat dilakukan dengan berbagai metode salah satunya algoritmagenetika. Pada algoritma genetika dilakukan beberapa tahap dalam melakukan optimasipenjadwalan yaitu seleksi, crossover dan mutasi. Pada metode crossover kromosompenjadwalan akan diacak dan ditukarkan dengan kromosom yang lainya. Pada penelitian ini,dilakukan pengembangan terhadap metode crossover yang diambil dari metode crossover yangbiasa dilakukan di algoritma genetika. dimana pada metode crossover pada umumnyamemungkinkan terjadinya kerusakan pada kromosom.Terdapat 2 metode yang dikembangkan, pertama dengan memotong gen hanya pada genyang mengalami bentrok, dan yang kedua merandom gen yang akan dipotong. Gen dipotongsecara utuh tidak memotong ditengah gen, sehingga tidak merusak gen.Analisis terhadap hasil uji coba menunjukan bahwa pengembangan metode crossoverdapat diimplementasikan pada kasus penjadwalan dan terlihat bahwa metode yang memotonggen hanya pada gen yang bentrok lebih cepat mencapai nilai terbaik atau mendekati 1 daripadametode yang hanya merandom gen saja. Dari nilai akhir juga terlihat bahwa metode yangmemotong gen pada gen yang bentrok memiliki nilai akhir lebih baik. Selain itu kedua metodeini mampu meminimalisir kerusakan pada kromosom hasil dari crossover.
Location Named-Entity Recognition using Rule-Based Approach for Balinese Texts Anggita S, Ni Putu Ayu Sherly; Sanjaya ER, Ngurah Agus
JELIKU (Jurnal Elektronik Ilmu Komputer Udayana) Vol 9 No 3 (2021): JELIKU Volume 9 No 3, Februari 2021
Publisher : Informatics Department, Faculty of Mathematics and Natural Sciences, Udayana University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24843/JLK.2021.v09.i03.p15

Abstract

In Natural Language Processing (NLP), Named Recognition Entity (NER) is a sub-discussion widely used for research. The NER’s main task is to help identify and detect the entity-named in the sentence, such as personal names, locations, organizations, and many other entities. In this paper, we present a Location NER system for Balinese texts using a rule-based approach. NER in the Balinese document is an essential and challenging task because there is no research on this. The rule-based approach using human-made rules to extract entity name is one of the most famous ways to extract entity names as well as machine learning. The system aims to identify proper names in the corpus and classify them into locations class. Precision, recall, and F-measure used for the evaluation. Our results show that our proposed model is trustworthy enough, having average recall, precision, and f-measure values for the specific location entity, respectively, 0.935, 0.936, and 0.92. These results prove that our system is capable of recognizing named-entities of Balinese texts.
Co-Authors Abimanyu, Cokorda Gde Agus Muliantara Anak Agung Aditya Nugraha Anak Agung Istri Ngurah Eka Karyawati Anak Agung Sinta Trisnajayanti Anggita S, Ni Putu Ayu Sherly Arimbawa, I Gede Ayu Kadek Nadya Oktaviana Cokorda Gde Abimanyu Farin Istighfarizky Firman Ali Eka Atmojo Gusti Ayu Vidjaretha Wardana Hairul Lana HARI MULYAWAN I Gede Santi Astawa I Gede Wira Kusuma Jaya I Gst. Bgs. Arya Yudiastina I Gusti Agung Gede Arya Kadyanan I Gusti Ngurah Anom Cahyadi Putra I Gusti Ngurah I Kadek Agus Andika Putra I Ketut Satriawan I Komang Ari Mogi I Made Ady Wirawan I Made Ari Widiarsana I Made Surya Adi Palguna I Made Widiartha I Made Widiartha I Putu Diska Fortunawan I Putu Edy Suardiyana Putra I Putu Gede Hendra Suputra I WAYAN SANTIYASA I Wayan Sugiana Ida Bagus Gede Dwidasmara Karel Leo Rivaldo Kurniadi, Kenny Luh Arida Ayu Rahning Putri Luh Arimas Pertiwi Luh Gede Astuti Luh Putu Eka Nadya Wati LUH PUTU IDA HARINI M Faisal Afandi Made Agus Hendrayana Made Darma Yunantara Made Hanindia Prami Swari Made Widiartha Negara, I Made Wahyu Guna Ni Made Alisya Putri Hapsari Ni Made Dian Kurniasari Ni Made Julia Budiantari Ni Putu Ambalika Dewi Pijar Candra Mahatagandha Pradiptha, I Gde Made Hendra Putra, Gede Bagus Prawira Riana Pramesti Putri Riana Pramesti Putri Safira Sinta Wahyuni, Ni Made Wayan Citra Wulan Sucipta Putri Yasa, I Gede Cahya Purnama