Feature Selection using k-Medoid Algorithm for Categorization of Hadith Translation in English

Firda A. Setiawati, Q. U. Safitri, A. Huda, Aep Saepulloh, W. Darmalaksana
{"title":"Feature Selection using k-Medoid Algorithm for Categorization of Hadith Translation in English","authors":"Firda A. Setiawati, Q. U. Safitri, A. Huda, Aep Saepulloh, W. Darmalaksana","doi":"10.1109/ICWT47785.2019.8978221","DOIUrl":null,"url":null,"abstract":"The problem of document classification is the number of features that are very large. the number of features depends on the number of terms or vocabulary used. Obviously, for every document, it contains only a small number of words in a vocabulary. So that will cause the number of elements zero. Therefore, a method is proposed to select some features that can represent all features. the method used is to cluster the vocabulary. representatives of each cluster of clustered results are used as a feature for each document in the categorization process. the categorization process is done by the k-Neirest Neighbor (k-NN) and Nearest Centroid (NC) algorithms. The data used is the translation of English hadith. with this method, it is expected that computation time will be faster and categorization result will be better (accuracy more precise).","PeriodicalId":220618,"journal":{"name":"2019 IEEE 5th International Conference on Wireless and Telematics (ICWT)","volume":"149 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE 5th International Conference on Wireless and Telematics (ICWT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICWT47785.2019.8978221","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

The problem of document classification is the number of features that are very large. the number of features depends on the number of terms or vocabulary used. Obviously, for every document, it contains only a small number of words in a vocabulary. So that will cause the number of elements zero. Therefore, a method is proposed to select some features that can represent all features. the method used is to cluster the vocabulary. representatives of each cluster of clustered results are used as a feature for each document in the categorization process. the categorization process is done by the k-Neirest Neighbor (k-NN) and Nearest Centroid (NC) algorithms. The data used is the translation of English hadith. with this method, it is expected that computation time will be faster and categorization result will be better (accuracy more precise).
基于k-媒质算法的英语圣训翻译分类特征选择
文档分类的问题是特征的数量非常大。特征的数量取决于所使用的术语或词汇的数量。显然,对于每个文档,它只包含词汇表中的少量单词。这将导致元素的个数为0。因此,提出了一种选择能够代表所有特征的部分特征的方法。使用的方法是对词汇进行聚类。在分类过程中,将聚类结果的每个簇的代表用作每个文档的特征。分类过程由k-最近邻(k-NN)和最近邻质心(NC)算法完成。所使用的资料是英文圣训的翻译。该方法计算速度更快,分类结果更好(准确率更高)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信