Judul: Klasifikasi Khasiat Jamu dan Identifikasi Metabolit yang Potensial
Abstrak: Jamu adalah obat tradisional dari Indonesia yang bersifat herbal dan berasal dari tanaman-tanaman obat yang berkhasiat. Analisis tentang formula jamu dapat diperluas ke tingkat molekuler dengan menambahkan informasi senyawa yang terdapat pada tanaman obat sebagai komposisi formula jamu dan menggunakan model ini untuk memprediksi khasiat jamu berdasarkan senyawa aktifnya. Penelitian ini bertujuan menerapkan metode Random Forest untuk memprediksi khasiat jamu dan mengidentifikasi metabolit yang potensial. Data yang digunakan dalam penelitian ini diperoleh dari penelitian Wijaya et al. (2017) dan basis data KNApSAcK. Single Filtering dan Regularized Random Forest digunakan sebagai pra-proses data untuk reduksi data dan fitur. Akurasi tertinggi dalam memprediksi khasiat jamu dengan Random Forest diperoleh saat menggunakan data hasil praproses yaitu sebesar 95.59%. Jumlah metabolit yang berhasil diidentifikasi sebanyak 180 dari 11 kelas khasiat.
Keyword: Jamu, Klasifikasi, Metabolit, Random Forest

Judul: Prediksi Efikasi Jamu Berdasarkan Metabolit pada Tanaman Obat Menggunakan Deep Belief Network
Abstrak: Indonesia memiliki sekitar 30.000 dari total 40.000 tanaman tropis yang ada di dunia, dan 1000 spesies diantaranya dijadikan bahan baku pembuatan jamu. Jamu adalah obat tradisional Indonesia yang dipercaya secara turun temurun dan biasanya dibuat dari campuran berbagai tumbuhan. Dengan banyaknya bahan yang bisa dibuat menjadi formula Jamu, maka perlu dibuat landasan saintifik untuk memberikan pengetahuan ilmiah mengenai Jamu. Tumbuhan sebagai bahan penyusun Jamu memiliki kandungan senyawa atau metabolit yang berbeda-beda. Penelitian ini melakukan klasifikasi khasiat Jamu berdasarkan kandungan metabolit. dengan tahapan penelitian meliputi pra-proses data, tuning parameter, pembuatan model, dan analisa hasil. SMOTE digunakan pada tahap pra-proses sebagai teknik untuk mengatasi imbalance data. Pada penelitian ini, dilakukan perbandingan hasil klasifikasi terhadap data yang tidak seimbang dengan data yang seimbang. Hasil yang didapat penelitian ini adalah model Deep Belief Network yang dibuat bekerja lebih baik pada data yang seimbang, dengan akurasi 75.25%. Sedangkan untuk data yang tidak seimbang, akurasi yang didapatkan adalah 62.68%, Indonesia has about 30,000 of the total 40,000 tropical plants in the world, and 1000 species of which are used as raw materials for herbal medicine. Jamu is a traditional Indonesian medicine that is passed down from generation to generation and is usually made from a mixture of various plants. With so many ingredients that can be made into Jamu formulas, it is necessary to create a scientific basis to provide scientific knowledge about Jamu. Plants as ingredients for herbal medicine contain different compounds or metabolites. This study classified the efficacy of herbal medicine based on its metabolite content, with the research stages covering data pre-processing, parameters tuning, models building, and results analyzing. SMOTE is used in the pre-processing stage as a technique to overcome imbalance datasets. In this study, a comparison of the classification results was carried out on unbalanced data with balanced data. The result of this research is that the Deep Belief Network model is made to work better on balanced data, with an accuracy of 75.25%. As for the unbalanced data, the accuracy obtained is 62.68%.
Keyword: Deep Belief Network, Klasifikasi, Jamu, Metabolit, Obat Herbal, Classification, Deep Belief Network, Herbal Medicine, Jamu, Metabolite

Judul: The Construction of Greedy SVP LLL Algorithm
Abstrak: A lattice is a set of all integer linear combination of a set of linearly independent vectors in ℝ𝑛���. The independent vectors are called bases of lattice. Any lattice can be generated from many bases, and these bases have the same cardinality. In the lattice, the most fundamental and renowned problem is the Shortest Vector Problem (SVP). SVP is a tracking problem of the shortest nonzero vector in a lattice with equivalent bases. In two dimensions, SVP problem has resolved exactly by Gauss’ algorithm. When the lattice dimension is higher than two, A.K. Lenstra, H.W. Lenstra and L. Lovasz gave a LLL algorithm to compute approximation of nonzero shortest vector in the lattice. Reduced bases solution obtained from LLL algorithm still be an approximation and has polynomial running time of arbitrary dimension which large enough. In 1994, Schnoor and Euchner modified this LLL algorithm as a new variant which later was named deep insertion LLL algorithm. This algorithm is a modified version of the LLL algorithm to the terms of the exchange step to improve the accuracy of output of LLL reduced bases and applying it to the subset sum problem. The purpose of this research are: (1) Reconstruct the LLL algorithm and deep insertion LLL algorithm using a geometric approach. (2) Construct a greedy SVP LLL algorithm. (3) Implement the three algorithms in a symbolic programming language, and evaluate them experimentally. A bases ℬ=[𝐛���1,𝐛���2,…,𝐛���𝑛���] in ℝ𝑚��� is called reduced LLL with parameter 𝛿��� if satisfies: (a) |𝜇���𝑗���𝑖���|≤12, for every integer 𝑖���,𝑗��� with 1≤𝑖���<𝑗���<𝑛���. (b)𝛿���‖𝜋���𝑗���(𝐛���𝑗���)‖2≤‖𝜋���𝑗���(𝐛���𝑗���+1)‖2, for 𝑗���=1,2,…,𝑛���−1,where 𝛿��� is a reduced parameter of real numbers with 14<𝛿���<1. The first requirement is the reduced basis 𝛿��� must “nearly orthogonal” and in its computation case, this requirement can be reached out by using the Gram-Schmidt’s orthogonalization. While the second requirement is called exchange step, or used to called as Lovasz condition. By using both of these requirements, then they establish the LLL algorithm. Then, Schnoor and Euchner modify the LLL algorithm based on the requirements of the exchange step called the deep insertion LLL algorithm, where the exchange step is based on the comparison of the projected vector in orthogonal complement [𝐛���1,𝐛���2,…,𝐛���𝑘���−1]⊥ after j-th reduction. To construct greedy SVP LLL algorithm, the requirements of the exchange step is based on purely by comparing norm of lattice 𝐛���𝑗��� with norm lattice 𝐛���𝑖��� for 𝑖���=1,2,3…,𝑗���−1. The process of insertion reduced vector after the exchange step also has done greedily. Then, we calculate the number of arithmetic operation in greedy SVP LLL algorithm for further analysis. The result of our exprimentation for three algorithms on the certain matrix size shows that the running time of the three algorithms increases propotional to the size of the matrix. The result also shows that by using 𝛿���=34 for the LLL algorithm and the deep insertion LLL algorithm, and the greedy SVP LLL algorithm which is a new variant made by using no parameter of 𝛿���, outperform of the other of two previous algorithm in terms of speed with the same output.
Keyword: LLL algorithm, LLL deep insertion algorithm, greedy SVP LLL algorithm