Article Per Year (5 Year)
p-Index From 2021 - 2026
0.23
P-Index
This Author published in this journals
All Journal Journal of Innovation Information Technology and Application (JINITA) Jurnal INFOTEL
Mohammad Syarief
University of Trunojoyo
Computer Science & IT Decision Sciences, Operations Research & Management Electrical & Electronics Engineering Engineering

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

Found 2 Documents
Search

 1 
Maize Leaf Disease Image Classification Using Bag of Features Wahyudi Setiawan; Mohammad Syarief; Novi Prastiti
JURNAL INFOTEL Vol 11 No 2 (2019): May 2019
Publisher : LPPM INSTITUT TEKNOLOGI TELKOM PURWOKERTO

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.20895/infotel.v11i2.428

Abstract

Image classification is an image grouping based on similarities features. The features extraction stage is a crucial factor for classifying an image. In the conventional image classification, the features commonly used are morphology, color, and texture with various derivative features. The type and number of appropriate features will affect the classification results. In this study, image classification by using the Bag of Features (BOF) method which can generate features automatically. It consists of 4 stages: feature point location by using grid method, feature extraction by using Speed Up Robust Feature (SURF), clustering word-visual vocabularies by using k-means, and classification by using Support Vector Machine (SVM). The classification data are maize leaf images from the PlantVillage-Dataset. The data consists of 3 types of images: RGB, grayscale, and segmentation images. Each type includes four classes: healthy, Cercospora, common rust, and northern leaf blight. There are 50 images for each class. We used two scenarios of testing for each type of data: training and validation, 70% and 80% images for training, and the rest for validation. Experimental results showed that the validation accuracies of RGB, grayscale, and segmentation images were 82%, 77%, and 85%.
Improving Computational Efficiency and Accuracy of Damerau-Levenshtein Distance for Indonesian Spelling Correction using Cosine Similarity husni husni; Yoga Dwitya Pramudita; Mohammad Syarief; Army Justitia; Ika Oktavia Suzanti
Journal of Innovation Information Technology and Application (JINITA) Vol 7 No 2 (2025): JINITA, December 2025
Publisher : Politeknik Negeri Cilacap

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35970/jinita.v7i2.2893

Abstract

Spelling correction is an automatic correction feature useful in detecting spelling errors and providing word suggestions if necessary. Spelling correction is one of the crucial preprocessing phases in text mining. The Damerau-Levenshtein Distance method is one of the spelling correction methods that has high accuracy. This method has four types of operations: insertion, deletion, substitution, and transposition. The basic approach in detecting spelling errors in the Indonesian language is to use a dictionary search. Despite its accuracy, the Damerau-Levenshtein Distance method has a slow computation time. Furthermore, when the dictionary contains several suggested words that have the same distance from the target word, it will be difficult to prioritize the most appropriate suggestions. To overcome this problem, we introduce a caching mechanism to store previously calculated corrections, thereby speeding up the computation process. In addition, we use the cosine similarity method to rank words in Damerau-Levenshtein Distance results. The results of our approach have a significant improvement in accuracy, increasing from 72.13% to 83.60% by integrating caching and cosine similarity for ranking, which shows a significant improvement in both efficiency and effectiveness
Co-Authors Army Justitia Husni Husni Ika Oktavia Suzanti Novi Prastiti Wahyudi Setiawan Yoga Dwitya Pramudita