Wamiliana Wamiliana

Prof. Dr. Wamiliana Wamiliana


Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
28 June 2024 in Journal of Information Systems Engineering and Business Intelligence
Verified
Journal Article
Open access
PDF file
ZAZaenal Abidin
Zaenal Abidin
AJAkmal Junaidi
Akmal Junaidi
WWWamiliana Wamiliana
Wamiliana Wamiliana
Background: Stemming is significantly essential in natural language processing (NLP) due to the ability to minimize word variations to fundamental forms. This procedure facilitates the analysis of textual data and enhances the precision of classification and information retrieval. Objective: Previous related systematic literature review has not been conducted on stemming and lemmatization in regional languages in Indonesia. Therefore, this study aims to conduct a systematic literature review to capture the latest developments in stemming and lemmatization in regional languages in Indonesia. Methods: This study was carried out using Kitchenham method, analyzing 35 studies extracted from 740, which were obtained from Scopus, IEEE Xplore, and Google Scholar, and published between 2014 and 2023. Results: The results showed that study trends in stemming possessed the potential to continue developing every year. Additionally, the main element in stemming and lemmatization studies was found to be the availability of digital dictionaries in regional languages. This was because greater number of basic vocabularies contributed more positively to stemming or lemmatization. The availability of word morphology information in regional languages would be constructive for making rule-based stemmers. Meanwhile, corpus-based stemming and lemmatization studies could only be conducted for languages with a large corpus to ensure there were various affixed words to process. Conclusion: Based on SLR study, stemming and lemmatization in regional languages in Indonesia developed significantly from 2014 to 2023. The two main strategies applied included using available digital dictionaries and language morphology information. However, the main challenges encountered were the limited number of vocabulary words in the dictionaries and testing various rule-based methods. Keywords: Lemmatization, Morphology, Rule-based, Stemming, Systematic Literature Review.

20 January 2020 in IIUM Engineering Journal
Verified
Journal Article
Open access
PDF file
WWWamiliana Wamiliana
Wamiliana Wamiliana
MUM. Usman
M. Usman
WWWarsito Warsito
Warsito Warsito
WWWarsono Warsono
Warsono Warsono
JDJamal I. Daoud
Jamal I. Daoud
The Minimum Spanning Tree (MST) is one of the famous problems that is used mostly as the backbone in many network design problems. Given a graph G(V,E), where V is the set of vertices and E is the set of edges connecting vertices in V, and for every edge eij there is an associated weight cij ?0. The Multi Period Degree Constrained Minimum Spanning Tree (MPDCMST) is a problem of finding an MST while also considering the degree constrained on every vertex, and satisfying vertices installation requirement on every period. Two algorithms (WWM1 and WWM2) are proposed for solving this problem. GNU OCTAVE is used for coding and visualization. GNU is a recursive acronym for "GNU's Not Unix!", and that name is chosen because it is like Unix but differs from Unix because it is free and contains no Unix code. Those algorithms were implemented using 300 randomly generated problems. Moreover, we compare WWM1 and WWM2 algorithms using existing data from the literature and the results show that WWM2 is the best. ABSTRAK: Minimum Spanning Tree (MST) merupakan salah satu masalah mahsyur yang banyak digunakan sebagai tulang belakang kepada masalah banyak rekaan jaringan. Menerusi graf G(V,E), di mana V adalah himpunan titik dan E adalah himpunan garis yang menghubungkan titik-titik dalam V, dan bagi setiap garis eij terdapat berat berhubung cij ?0, Multi-period Degree Constrained Minimum Spanning Tree (MPDCMST) merupakan masalah dalam menentukan MST, pada masa sama turut menimbangkan kekangan pada setiap titik vertek, dan memenuhi syarat keperluan pemasangan pada setiap detik. Dua algoritma (WWM1 dan WWM2) dicadangkan bagi menyelesaikan masalah ini. GNU OCTAVE digunakan bagi pengaturcaraan dan visualisasi. GNU merupakan suatu singkatan kepada “GNU's Not Unix”, dan nama tersebut dipilih karena ianya seperti Unix, tetapi berbeza dari Unix kerana ia percuma dan tidak mempunyai kod Unix. Algoritma tersebut dilaksana dengan menggunakan 300 masalah terhasil secara rawak. Tambahan, algoritma WWM1 dan WWM2 dibandingkan dengan kajian terdahulu dan hasil kajian menunjukkan WWM2 adalah terbaik.

1 January 2021 in Journal of Physics: Conference Series
Verified
Conference Paper
Open access
PDF file
DDDedi Darwis
Dedi Darwis
NPN B Pamungkas
N B Pamungkas
WWWamiliana Wamiliana
Wamiliana Wamiliana
Information security is an important aspect of information. The importance of the value of information in every aspect can result in attempts to transfer access or theft of data and information by unauthorized parties. One technique for securing data and information is by applying the digital image steganography technique. Many methods can be used in steganography, some of which are Least Significant Bit (LSB), Pixel Value Differencing (PVD), and Modulus Function (MF). Good steganography must produce a stego-image with an image quality that is not different from the original image or what is called a cover image and has the storage capacity to store confidential data and is resistant to robustness. The purpose of this study was to compare the LSB, MF, and PVD methods to serve as alternatives to the use of steganography techniques. The results of this study indicate that the LSB method has the best image quality compared to the MF and PVD methods. For storage capacity, the PVD algorithm has a better capacity than the LSB and MF methods. Meanwhile, the robustness of the LSB, PVD, and MF methods has resistance to cropping with a percentage of 10% at the bottom of the stego-image.

1 June 2021 in Cybernetics and Information Technologies
Verified
Journal Article
Open access
PDF file
DDDedi Darwis
Dedi Darwis
AJAkmal Junaidi
Akmal Junaidi
DSDewi Asiah Shofiana
Dewi Asiah Shofiana
WWWamiliana Wamiliana
Wamiliana Wamiliana
In this study we propose a new approach to tackle the cropping problem in steganography which is called Center Embedded Pixel Positioning (CEPP) which is based on Least Significant Bit (LSB) Matching by setting the secret image in the center of the cover image. The evaluation of the experiment indicated that the secret image can be retrieved by a maximum of total 40% sequential cropping on the left, right, up, and bottom of the cover image. The secret image also can be retrieved if the total asymmetric cropping area is 25% that covered two sides (either left-right, left-up or right-up). In addition, the secret image can also be retrieved if the total asymmetric cropping area is 70% if the bottom part is included. If asymmetric cropping area included three sides, then the algorithm fails to retrieve the secret image. For cropping in the botom the secret image can be extracted up to 70%.

1 October 2019 in Journal of Physics: Conference Series
Verified
Conference Paper
Open access
PDF file
DDDedi Darwis
Dedi Darwis
AJA Junaidi
A Junaidi
WWWamiliana Wamiliana
Wamiliana Wamiliana
The quality of steganographic images can be determined from several aspects. One of the testing techniques on steganography is cropping which is part of robustness testing. Under cropping process, it is possible that the secret message cannot be extracted from the stego-image. This happen because the pixels values on the stego-image embedded message changed and the message content on the stego-image will be lost. In this research we propose a new approach for solving that problem by using the algorithm based on Sequential Technique where the input process starts from the center of the cover. The secret information in the form of image and the cover image is also an image. By using this method, the secret image is safe although the cropping is done from left, right, above or bottom of the stego image.

1 October 2019 in Journal of Physics: Conference Series
Verified
Conference Paper
Open access
PDF file
WWWamiliana Wamiliana
Wamiliana Wamiliana
ANA Nuryaman
A Nuryaman
AMAmanto
Amanto
ASA Sutrisno
A Sutrisno
NPN A Prayoga
N A Prayoga
A connected graph is a graph where there exists at least a path joining every pair of the vertices in the graph, and a graph is called simple if that graph containing no loops nor parallel edges. Given a graph G (V, E) with n vertices and m edges, there are a lot of graph that can be formed, either connected or disconnected, or simple or not simple. In this paper we will discuss the number of connected vertex labelled graph of order five (n=5) and 4 ≤ m ≤ 10, with maximum number of parallel edges that connecting different pairs of vertices is five (the parallel edges that connecting the same pair of vertices are counted as one).