Article Per Year (5 Year)
p-Index From 2020 - 2025
4.434
P-Index
This Author published in this journals
All Journal IAES International Journal of Artificial Intelligence (IJ-AI) Jurnal Ilmu Pertanian Indonesia Agromet MANAJEMEN IKM: Jurnal Manajemen Pengembangan Industri Kecil Menengah Jurnal Pustakawan Indonesia FORUM STATISTIKA DAN KOMPUTASI Seminar Nasional Aplikasi Teknologi Informasi (SNATI) Jurnal Ilmu Komputer dan Informasi Jurnal Pembangunan Wilayah dan Kota Agrikultura Jurnal Keteknikan Pertanian Proceedings of KNASTIK TELKOMNIKA (Telecommunication Computing Electronics and Control) Jurnal Ilmu Komputer dan Agri-Informatika Forum Agribisnis SITEKIN: Jurnal Sains, Teknologi dan Industri Jurnal Teknologi Informasi dan Ilmu Komputer Journal of ICT Research and Applications Jurnal Pengelolaan Sumberdaya Alam dan Lingkungan (Journal of Natural Resources and Environmental Management) International Journal of Advances in Intelligent Informatics Jurnal Aplikasi Bisnis dan Manajemen (JABM) E-Journal Widyariset JOIN (Jurnal Online Informatika) Jurnal RESTI (Rekayasa Sistem dan Teknologi Informasi) Informatika Pertanian Kinetik: Game Technology, Information System, Computer Network, Computing, Electronics, and Control JITK (Jurnal Ilmu Pengetahuan dan Komputer) Jurnal Informatika Universitas Pamulang Jurnal ULTIMATICS CYBERNETICS BHUMI: Jurnal Agraria dan Pertanahan Komputasi: Jurnal Ilmiah Ilmu Komputer dan Matematika JURNAL METEOROLOGI DAN GEOFISIKA Building of Informatics, Technology and Science Journal of Robotics and Control (JRC) Indonesian Journal of Electrical Engineering and Computer Science Computer Science and Information Technologies Jurnal Tanah dan Iklim Widyariset Aiti: Jurnal Teknologi Informasi Jurnal Pustakawan Indonesia Makara Journal of Science Eduvest - Journal of Universal Studies J-Icon : Jurnal Komputer dan Informatika Jurnal Sistem Informasi
Agus Buono
Department Of Computer Science, Faculty Of Mathematics And Natural Science, Bogor Agricultural University, Jalan Meranti, Kampus IPB Darmaga, Bogor 16680,
Aerospace Engineering Agriculture, Biological Sciences & Forestry Astronomy Automotive Engineering Biochemistry, Genetics & Molecular Biology Chemical Engineering, Chemistry & Bioengineering Chemistry Civil Engineering, Building, Construction & Architecture Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Earth & Planetary Sciences Economics, Econometrics & Finance Electrical & Electronics Engineering Energy Engineering Environmental Science Health Professions Immunology & microbiology Industrial & Manufacturing Engineering Law, Crime, Criminology & Criminal Justice Library & Information Science Materials Science & Nanotechnology Mathematics Mechanical Engineering Neuroscience Physics Social Sciences Other

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

Found 77 Documents
Search

 4   5   6   7   8 
Similarity Measurement for Speaker Identification Using Frequency of Vector Pairs Inggih Permana; Agus Buono; Bib Paruhum Silalahi
Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 8: August 2014
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v12.i8.pp6205-6210

Abstract

Similarity measurement is an important part of speaker identification. This study has modified the similarity measurement technique performed in previous studies. Previous studies used the sum of the smallest distance between the input vectors and the codebook vectors of a particular speaker. In this study, the technique has been modified by selecting a particular speaker codebook which has the highest frequency of vector pairs. Vector pair in this case is the smallest distance between the input vector and the vector in the codebook. This study used Mel Frequency Cepstral Coefficient (MFCC) as feature extraction, Self Organizing Map (SOM) as codebook maker and Euclidean as a measure of distance. The experimental results showed that the similarity measuring techniques proposed can improve the accuracy of speaker identification. In the MFCC coefficients 13, 15 and 20 the average accuracy of identification respectively increased as much as 0.61%, 0.98% and 1.27%.
Ant Colony Optimization Modelling for Task Allocation in Multi-Agent System for Multi-Target Iis Rodiah; Medria Kusuma Dewi Hardhienata; Agus Buono; Karlisa Priandana
Jurnal RESTI (Rekayasa Sistem dan Teknologi Informasi) Vol 6 No 6 (2022): Desember 2022
Publisher : Ikatan Ahli Informatika Indonesia (IAII)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.29207/resti.v6i6.4201

Abstract

Task allocation in multi-agent system can be defined as a problem of allocating a number of agents to the task. One of the problems in task allocation is to optimize the allocation of heterogeneous agents when there are multiple tasks which require several capabilities. To solve that problem, this research aims to modify the Ant Colony Optimization (ACO) algorithm so that the algorithm can be employed for solving task allocation problems with multiple tasks. In this research, we optimize the performance of the algorithm by minimizing the task completion cost as well as the number of overlapping agents. We also maximize the overall system capabilities in order to increase efficiency. Simulation results show that the modified ACO algorithm has significantly decreased overall task completion cost as well as the overlapping agents factor compared to the benchmark algorithm.
SELEKSI FITUR YANG BERPENGARUH MENGGUNAKAN NILAI MEAN PADA KLASIFIKASI FRAGMEN METAGENOME Arini Aha Pekuwali; Wisnu Ananta Kusuma; Agus Buono
J-Icon : Jurnal Komputer dan Informatika Vol 8 No 1 (2020): Maret 2020
Publisher : Universitas Nusa Cendana

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35508/jicon.v8i1.2188

Abstract

Pekuwali (2018) has conducted research into the classification of metagenome fragments using spaced k-mers. Optimize the arrangement of features using Genetic Algorithms. Pekuwali (2018) concluded that the best arrangement of features or called chromosomes is 111111110001 with a fitness value of 85.42. Chromosome 111111110001 produces 336 features of extracting DNA fragments. This research aims to find out which features influence classi fi cation and the resulting accuracy. The method used is the Mean value. The mean value method was chosen because the data distribution is normal or close to normal. This study concludes that the influential features in the classification are features 22 to 27 with an accuracy of 78.83% and features 38 to 43 with an accuracy of 79.67%.
Modified Q-Learning Algorithm for Mobile Robot Real-Time Path Planning using Reduced States Hidayat; Agus Buono; Karlisa Priandana; Sri Wahjuni
Jurnal RESTI (Rekayasa Sistem dan Teknologi Informasi) Vol 7 No 3 (2023): Juni 2023
Publisher : Ikatan Ahli Informatika Indonesia (IAII)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.29207/resti.v7i3.4949

Abstract

Path planning is an essential algorithm in any autonomous mobile robot, including agricultural robots. One of the reinforcement learning methods that can be used for mobile robot path planning is the Q-Learning algorithm. However, the conventional Q-learning method explores all possible robot states in order to find the most optimum path. Thus, this method requires extensive computational cost especially when there are considerable grids to be computed. This study modified the original Q-Learning algorithm by removing the impassable area, so that these areas are not considered as grids to be computed. This modified Q-Learning method was simulated as path finding algorithm for autonomous mobile robot operated at the Agribusiness and Technology Park (ATP), IPB University. Two simulations were conducted to compare the original Q-Learning method and the modified Q-Learning method. The simulation results showed that the state reductions in the modified Q-Learning method can lower the computation cost to 50.71% from the computation cost of the original Q-Learning method, that is, an average computation time of 25.74s as compared to 50.75s, respectively. Both methods produce similar number of states as the robot’s optimal path, i.e. 56 states, based on the reward obtained by the robot while selecting the path. However, the modified Q-Learning algorithm is capable of finding the path to the destination point with a minimum learning rate parameter value of 0.2 when the discount factor value is 0.9.
Texture Analysis of Citrus Leaf Images Using BEMD for Huanglongbing Disease Diagnosis Sumanto; Agus Buono; Karlisa Priandana; Bib Paruhum Silalahi; Elisabeth Sri Hendrastuti
JOIN (Jurnal Online Informatika) Vol 8 No 1 (2023)
Publisher : Department of Informatics, UIN Sunan Gunung Djati Bandung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.15575/join.v8i1.1075

Abstract

Plant diseases significantly threaten agricultural productivity, necessitating accurate identification and classification of plant lesions for improved crop quality. Citrus plants, belonging to the Rutaceae family, are highly susceptible to diseases such as citrus canker, black spot, and the devastating Huanglongbing (HLB) disease. Traditional approaches for disease detection rely on expert knowledge and time-consuming laboratory tests, which hinder rapid and effective disease management. Therefore, this study explores an alternative method that combines the Bidimensional Empirical Mode Decomposition (BEMD) algorithm for texture feature extraction and Support Vector Machine (SVM) classification to improve HLB diagnosis. The BEMD algorithm decomposes citrus leaf images into Intrinsic Mode Functions (IMFs) and a residue component. Classification experiments were conducted using SVM on the IMFs and residue features. The results of the classification experiments demonstrate the effectiveness of the proposed method. The achieved classification accuracies, ranging from 61% to 77% for different numbers of classes, the results show that the residue component achieved the highest classification accuracy, outperforming the IMF features. The combination of the BEMD algorithm and SVM classification presents a promising approach for accurate HLB diagnosis, surpassing the performance of previous studies that utilized GLCM-SVM techniques. This research contributes to developing efficient and reliable methods for early detection and classification of HLB-infected plants, essential for effective disease management and maintaining agricultural productivity.
AN IT2FS MODEL FOR SHARIA CREDIT SCORING: ANALYSIS & DESIGN Galih Kurniawan Sidik; Taufik Djatna; Agus Buono
Jurnal Sistem Informasi Vol. 9 No. 2 (2013): Jurnal Sistem Informasi (Journal of Information System)
Publisher : Faculty of Computer Science Universitas Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (267.186 KB) | DOI: 10.21609/jsi.v9i2.352

Abstract

Credit scoring system is a classic problem which is still interesting to study. There are many studies on credit scoring. But, most of them only discuss feasibility analysis. In fact, credit scoring system should accommodate all processes from feasibility analysis until the end of contract. This study is aimed to analyze and design scoring of default status and fines computation processes in Islamic bank. BPMN 2.0 was used to model their processes. Beside that, this study proposed new mechanisms and algorithms using Interval Type-2 Fuzzy Sets for maintaining Sharia rules and fairness guarantee. The results showed that the new methods offer more fair and comply to sharia than existing methods.
Analysis and review of the possibility of using the generative model as a compression technique in DNA data storage: review and future research agenda Muhammad Rafi Muttaqin; Yeni Herdiyeni; Agus Buono; Karlisa Priandana; Iskandar Zulkarnaen Siregar
International Journal of Advances in Intelligent Informatics Vol 9, No 3 (2023): November 2023
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26555/ijain.v9i3.1063

Abstract

The amount of data in this world is getting higher, and overwriting technology also has severe challenges. Data growth is expected to grow to 175 ZB by 2025. Data storage technology in DNA is an alternative technology with potential in information storage, mainly digital data. One of the stages of storing information on DNA is synthesis. This synthesis process costs very high, so it is necessary to integrate compression techniques for digital data to minimize the costs incurred. One of the models used in compression techniques is the generative model. This paper aims to see if compression using this generative model allows it to be integrated into data storage methods on DNA. To this end, we have conducted a Systematic Literature Review using the PRISMA method in selecting papers. We took the source of the papers from four leading databases and other additional databases. Out of 2440 papers, we finally decided on 34 primary papers for detailed analysis. This systematic literature review (SLR) presents and categorizes based on research questions, namely discussing machine learning methods applied in DNA storage, identifying compression techniques for DNA storage, knowing the role of deep learning in the compression process for DNA storage, knowing how generative models are associated with deep learning, knowing how generative models are applied in the compression process, and knowing latent space can be formed. The study highlights open problems that need to be solved and provides an identified research direction.
Digital Marketing Alliance on Small Medium Enterprises (SMES): A Systematic Literature Review Trukan Sri Bahukeling; Arif Imam Suroso; Agus Buono; Popong Nurhayati
Jurnal Aplikasi Bisnis dan Manajemen (JABM) Vol. 10 No. 1 (2024): JABM, Vol. 10 No. 1, Januari 2024
Publisher : School of Business, Bogor Agricultural University (SB-IPB)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.17358/jabm.10.1.199

Abstract

The development of digital marketing continues to grow and increase rapidly. Strengthening digital marketing by SMEs encourages marketing alliances with other parties. Simultaneously, the digital marketing alliance literature accumulated with this growth, but research is still few and not consistently integrated. SMEs are widely regarded as engines of economic growth and a vital contributor to a country's GDP. A brief comprehensive review is needed to help researchers and practitioners understand the adoption of digital marketing alliance systems. This study aims to analyze and classify the literature on digital marketing alliances in SMEs. Design/methodology by conducting literature studies published between 2016-2021 in the journal listed in the Journal Citation Report. It is then analyzed according to a systematic literature review approach involving interpretation-based assessments of research methodologies and critical findings in the study. The direction of this research is expected in the future to have implications for academics and practitioners. The authors' conclusions develop a theoretical model of digital marketing alliance between government and private that is applied to SMEs, impacting to create excellence in the era of digitalization. The originality /value of this research is the first expected to take a holistically integrated approach to study the digital marketing alliance of SMEs. Keywords: digital marketing, marketing alliance, small medium enterprises (smes), literature studies
PERLUASAN METODE MFCC 1D KE 2D SEBAGAI ESKTRAKSI CIRI PADA SISTEM IDENTIFIKASI PEMBICARA MENGGUNAKAN HIDDEN MARKOV MODEL (HMM) Buono, Agus; Jatmiko, Wisnu; Kusumoputro, Benyamin
Makara Journal of Science Vol. 13, No. 1
Publisher : UI Scholars Hub

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

Abstract

The Extention of MFCC Technique from 1D to 2D as Feature Extractor for Speaker Identification System Using HMM. In this paper, we introduce an extension of Mel-Frequency Cepstrum Coefficients (1D-MFCC) methodology to bispectrum data, referred to as 2D-MFCC, for feature extraction. 2D-MFCC is based on 2D bispectrum data rather than 1D spectrum vector yielded by Fourier transform, so the filter in 1D-MFCC must be extend to 2D filter and using 2D cosine transform to get the mel-cepstrum coefficients from the filtered bispectrum values. Based on 2D-MFCC, we develop a speaker recognition system with Hidden Markov Model (HMM) as classifier. The experimental results show that the recognition rate is around 88%, 92% and 99% for 20, 40 and 60 data training, respectively
Modified Q-Learning Algorithm for Mobile Robot Path Planning Variation using Motivation Model Hidayat, Hidayat; Buono, Agus; Priandana, Karlisa; Wahjuni, Sri
Journal of Robotics and Control (JRC) Vol 4, No 5 (2023)
Publisher : Universitas Muhammadiyah Yogyakarta

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.18196/jrc.v4i5.18777

Abstract

Path planning is an essential algorithm in autonomous mobile robots, including agricultural robots, to find the shortest path and to avoid collisions with obstacles. Q-Learning algorithm is one of the reinforcement learning methods used for path planning. However, for multi-robot system, this algorithm tends to produce the same path for each robot. This research modifies the Q-Learning algorithm in order to produce path variations by utilizing the motivation model, i.e. achievement motivation, in which different motivation parameters will result in different optimum paths. The Motivated Q-Learning (MQL) algorithm proposed in this study was simulated in an area with three scenarios, i.e. without obstacles, uniform obstacles, and random obstacles. The results showed that, in the determined scenario, the MQL can produce 2 to 4 variations of optimum path without any potential of collisions (Jaccard similarity = 0%), in contrast to the Q-Learning algorithm that can only produce one optimum path variation. This result indicates that MQL can solve multi-robots path planning problems, especially when the number of robots is large, by reducing the possibility of collisions as well as decreasing the problem of queues. However, the average computational time of the MQL is slightly longer than that of the Q-Learning.
Co-Authors Ade Fruandta Adi Rakhman Aditya Cipta Raharja Agung Prajuhana Putra Akhmad Faqih Alif Kurniawan Alvin Fatikhunnada Anang Kurnia Angga Wahyu Pratama Aries Maesya Arif Imam Suroso Arini Aha Pekuwali Arini Pekuwali Astuti, Indah Puji Atik Pawestri Sulistyo Aziz Kustiyo Aziz Rahmad Benyamin Kusumoputro Bib Paruhum Silalahi Budi Nugroho Cece Sumantri Dhany Nugraha Ramdhany Dian Kartika Utami Djaksana, Yan Mitha Edi Santosa Ekowati Handharyani Elisabeth Sri Hendrastuti Endang Purnama Giri Erliza Hambali Erliza Noor Ernan Rustiadi Fadhilah Syafria Fadhilah Syafria Fajar Delli Wihartiko Fildza Novadiwanti Firdaus, Husni Firmansyah Ibrahim Fredicia Fredicia Galih Kurniawan Sidik Galih Kurniawan Sidik Galih Kurniawan Sidik Gema Parasti Mindara Gendut Suprayitno Gita Adhani GUNARSO GUNARSO Hastuadi Harsa Herianto Herianto Hidayat Hidayat Hidayat I Wayan Astika Ibrahim, Firmansyah Iis Rodiah Imas Sukaesih Sitanggang Indah Prasasti Indah Puji Astuti Indah Puji Astuti Indra Jaya Inggih Permana Inna Noviyanti Irman Hermadi Irmansyah . Irsal Las Irsal Las ISKANDAR ZULKARNAEN SIREGAR Kana Saputra S Karlisa Priandana Kikin H Mutaqin Kudang Boro Seminar Laila Sari Lubis Laila Sari Lubis Lailan Syaufina Lidya Ningsih Liyantono . M. Cholid Mawardi M. Mukhlis Marcelita, Faldiena Medria Kusuma Dewi Hardhienata Mohamad Solahudin Muhammad Ardiansyah Muhammad Rafi Muttaqin Mushthofa Mustakim Mustakim Mustakim Mustakim Muttaqin, Muhammad Rafi Niswati, Za'imatun Nova Firdaus Nurhayati, Yosi Popong Nurhayati Pratistya, Sayu Desty Puspita Kartika Sari Puspita Kartika Sari Putri Yuli Utami Raharja, Aditya Cipta Rahmat Hidayat Rizal Syarief Rizaldi Boer Rizki, Arviani RR. Ella Evrita Hestiandari Santo, Deni Sanusi Sanusi Sari Agustini Hafman Savitri, Siska Sholihah, Walidatush Sidik, Galih Kurniawan Siregar, Ardinsyah Sitanggang, Imas S. Siti Kania Kushadiani Siti Raehan Sony Hartono Wijaya Sri Dianing Asri Sri Nurdiati Sri Wahjuni Stephane Douady Suharno Suharno Suharno Sumanto, Sumanto Syeiva Nurul Desylvia Taufik Djatna Thoyyibah Tanjung Toto Haryanto Trukan Sri Bahukeling Uliniansyah, Mohammad Teduh Vicky Zilvan Wisnu Ananta Kusuma Wisnu Jatmiko Woro Estiningtyas Woro Estiningtyas Woro Estiningtyas Yandra Arkeman Yenni Vetrita Yoanda, Sely