scholarly journals The Identification of Balinese Scripts’ Characters in Papyrus Based on Semantic Feature and K Nearest Neighbor

2016 ◽  
Vol 1 (3) ◽  
pp. 177
Author(s):  
Made Sudarma ◽  
I Wayan Agus Surya Darma
Keyword(s):  
Feature Extraction ◽  
Cultural Heritage ◽  
Cultural Values ◽  
Nearest Neighbor ◽  
Classification Algorithm ◽  
Semantic Feature ◽  
K Nearest Neighbor ◽  
Nearest Neighborhood

Papyrus script is a cultural heritage in Bali. As we know, that the papyrus is a cultural matter which is rich in valuable cultural values. Issues or problems encountered today is that the papyrus are not well maintained. Thus, many papyrus becomes damaged because it is not stored properly. Papyrus script was written using Balinese script’s characters which having different features compared with Latin’s characters. Balinese script can be recognized with feature extraction owned by each Balinese script. KNN is a classification algorithm based on nearest neighborhood. KNN can be used to classify Balinese script’s features so that the test Balinese script’s features which having nearest neighborhood value with the trained Balinese script’s features will be recognized as the same Balinese script

scholarly journals A High Performace of Local Binary Pattern on Classify Javanese Character Classification

2018 ◽  
Vol 5 (1) ◽  
pp. 8 ◽  
Author(s):  
Ajib Susanto ◽  
Daurat Sinaga ◽  
Christy Atika Sari ◽  
Eko Hari Rachmawanto ◽  
De Rosal Ignatius Moses Setiadi
Keyword(s):  
Feature Extraction ◽  
Image Classification ◽  
Local Binary Pattern ◽  
Nearest Neighbor ◽  
Classification Algorithm ◽  
K Nearest Neighbor ◽  
Characteristic Extraction ◽  
Research Objects ◽  
Character Classification

The classification of Javanese character images is done with the aim of recognizing each character. The selected classification algorithm is K-Nearest Neighbor (KNN) at K = 1, 3, 5, 7, and 9. To improve KNN performance in Javanese character written by the author, and to prove that feature extraction is needed in the process image classification of Javanese character. In this study selected Local Binary Patter (LBP) as a feature extraction because there are research objects with a certain level of slope. The LBP parameters are used between [16 16], [32 32], [64 64], [128 128], and [256 256]. Experiments were performed on 80 training drawings and 40 test images. KNN values after combination with LBP characteristic extraction were 82.5% at K = 3 and LBP parameters [64 64].

scholarly journals Motor Imagery EEG Classification Based on Decision Tree Framework and Riemannian Geometry

2019 ◽  
Vol 2019 ◽  
pp. 1-13 ◽  
Author(s):  
Shan Guan ◽  
Kai Zhao ◽  
Shuning Yang
Keyword(s):  
Feature Extraction ◽  
Decision Tree ◽  
Motor Imagery ◽  
Nearest Neighbor ◽  
Recognition Rate ◽  
Classification Algorithm ◽  
Classification Error ◽  
K Nearest Neighbor ◽  
Feature Extraction Algorithm ◽  
Extraction Algorithm

This paper proposes a novel classification framework and a novel data reduction method to distinguish multiclass motor imagery (MI) electroencephalography (EEG) for brain computer interface (BCI) based on the manifold of covariance matrices in a Riemannian perspective. For method 1, a subject-specific decision tree (SSDT) framework with filter geodesic minimum distance to Riemannian mean (FGMDRM) is designed to identify MI tasks and reduce the classification error in the nonseparable region of FGMDRM. Method 2 includes a feature extraction algorithm and a classification algorithm. The feature extraction algorithm combines semisupervised joint mutual information (semi-JMI) with general discriminate analysis (GDA), namely, SJGDA, to reduce the dimension of vectors in the Riemannian tangent plane. And the classification algorithm replaces the FGMDRM in method 1 with k-nearest neighbor (KNN), named SSDT-KNN. By applying method 2 on BCI competition IV dataset 2a, the kappa value has been improved from 0.57 to 0.607 compared to the winner of dataset 2a. And method 2 also obtains high recognition rate on the other two datasets.

Handwritten Balinesse Character Recognition using K-Nearest Neighbor

2018 ◽  
Author(s):  
I Wayan Agus Surya Darma
Keyword(s):  
Feature Extraction ◽  
Success Rate ◽  
Character Recognition ◽  
Nearest Neighbor ◽  
Recognition System ◽  
Extraction Process ◽  
K Nearest Neighbor ◽  
Nearest Neighbor Algorithm ◽  
K Nearest Neighbor Algorithm ◽  
Character Feature

Balinese character recognition is a technique to recognize feature or pattern of Balinese character. Feature of Balinese character is generated through feature extraction process. This research using handwritten Balinese character. Feature extraction is a process to obtain the feature of character. In this research, feature extraction process generated semantic and direction feature of handwritten Balinese character. Recognition is using K-Nearest Neighbor algorithm to recognize 81 handwritten Balinese character. The feature of Balinese character images tester are compared with reference features. Result of the recognition system with K=3 and reference=10 is achieved a success rate of 97,53%.

scholarly journals A Comparative Survey of Feature Extraction and Machine Learning Methods in Diverse Acoustic Environments

Sensors ◽  
2021 ◽  
Vol 21 (4) ◽  
pp. 1274
Author(s):  
Daniel Bonet-Solà ◽  
Rosa Ma Alsina-Pagès
Keyword(s):  
Machine Learning ◽  
Feature Extraction ◽  
Best Practice ◽  
Nearest Neighbor ◽  
Gaussian Mixture ◽  
Machine Learning Algorithms ◽  
Multimedia Retrieval ◽  
Natural Environments ◽  
K Nearest Neighbor ◽  
Acoustic Environments

Acoustic event detection and analysis has been widely developed in the last few years for its valuable application in monitoring elderly or dependant people, for surveillance issues, for multimedia retrieval, or even for biodiversity metrics in natural environments. For this purpose, sound source identification is a key issue to give a smart technological answer to all the aforementioned applications. Diverse types of sounds and variate environments, together with a number of challenges in terms of application, widen the choice of artificial intelligence algorithm proposal. This paper presents a comparative study on combining several feature extraction algorithms (Mel Frequency Cepstrum Coefficients (MFCC), Gammatone Cepstrum Coefficients (GTCC), and Narrow Band (NB)) with a group of machine learning algorithms (k-Nearest Neighbor (kNN), Neural Networks (NN), and Gaussian Mixture Model (GMM)), tested over five different acoustic environments. This work has the goal of detailing a best practice method and evaluate the reliability of this general-purpose algorithm for all the classes. Preliminary results show that most of the combinations of feature extraction and machine learning present acceptable results in most of the described corpora. Nevertheless, there is a combination that outperforms the others: the use of GTCC together with kNN, and its results are further analyzed for all the corpora.

scholarly journals KNN classifier based approach for multi-class sentiment analysis of twitter data

2018 ◽  
Vol 7 (3) ◽  
pp. 1372
Author(s):  
Soudamini Hota ◽  
Sudhir Pathak
Keyword(s):  
Sentiment Analysis ◽  
Opinion Mining ◽  
Nearest Neighbor ◽  
Learning Algorithm ◽  
Online News ◽  
Classification Algorithm ◽  
Sentiment Classification ◽  
Supervised Machine Learning ◽  
K Nearest Neighbor ◽  
News Reports

‘Sentiment’ literally means ‘Emotions’. Sentiment analysis, synonymous to opinion mining, is a type of data mining that refers to the analy-sis of data obtained from microblogging sites, social media updates, online news reports, user reviews etc., in order to study the sentiments of the people towards an event, organization, product, brand, person etc. In this work, sentiment classification is done into multiple classes. The proposed methodology based on KNN classification algorithm shows an improvement over one of the existing methodologies which is based on SVM classification algorithm. The data used for analysis has been taken from Twitter, this being the most popular microblogging site. The source data has been extracted from Twitter using Python’s Tweepy. N-Gram modeling technique has been used for feature extraction and the supervised machine learning algorithm k-nearest neighbor has been used for sentiment classification. The performance of proposed and existing techniques is compared in terms of accuracy, precision and recall. It is analyzed and concluded that the proposed technique performs better in terms of all the standard evaluation parameters. 

scholarly journals A novel content based image retrieval system using K-means/KNN with feature extraction

2012 ◽  
Vol 9 (4) ◽  
pp. 1645-1661 ◽  
Author(s):  
Ray-I Chang ◽  
Shu-Yu Lin ◽  
Jan-Ming Ho ◽  
Chi-Wen Fann ◽  
Yu-Chun Wang
Keyword(s):  
Feature Extraction ◽  
Image Retrieval ◽  
Nearest Neighbor ◽  
Clustering Algorithms ◽  
Content Based Image Retrieval ◽  
K Nearest Neighbor ◽  
Color Analysis ◽  
Image Retrieval System ◽  
First Time ◽  
System Designs

Image retrieval has been popular for several years. There are different system designs for content based image retrieval (CBIR) system. This paper propose a novel system architecture for CBIR system which combines techniques include content-based image and color analysis, as well as data mining techniques. To our best knowledge, this is the first time to propose segmentation and grid module, feature extraction module, K-means and k-nearest neighbor clustering algorithms and bring in the neighborhood module to build the CBIR system. Concept of neighborhood color analysis module which also recognizes the side of every grids of image is first contributed in this paper. The results show the CBIR systems performs well in the training and it also indicates there contains many interested issue to be optimized in the query stage of image retrieval.

scholarly journals Design and Analysis System of KNN and ID3 Algorithm for Music Classification based on Mood Feature Extraction

2017 ◽  
Vol 7 (1) ◽  
pp. 486
Author(s):  
Made Sudarma ◽  
I Gede Harsemadi
Keyword(s):  
Feature Extraction ◽  
Processing Time ◽  
Nearest Neighbor ◽  
Extraction Process ◽  
Performance Comparison ◽  
K Nearest Neighbor ◽  
K Value ◽  
Id3 Algorithm ◽  
Analysis System ◽  
Music Information

Each of music which has been created, has its own mood which is emitted, therefore, there has been many researches in Music Information Retrieval (MIR) field that has been done for recognition of mood to music.  This research produced software to classify music to the mood by using K-Nearest Neighbor and ID3 algorithm.  In this research accuracy performance comparison and measurement of average classification time is carried out which is obtained based on the value produced from music feature extraction process.  For music feature extraction process it uses 9 types of spectral analysis, consists of 400 practicing data and 400 testing data.  The system produced outcome as classification label of mood type those are contentment, exuberance, depression and anxious.  Classification by using algorithm of KNN is good enough that is 86.55% at k value = 3 and average processing time is 0.01021.  Whereas by using ID3 it results accuracy of 59.33% and average of processing time is 0.05091 second.

Sign in / Sign up

Export Citation Format

Share Document