首页> 外文会议>IEEE International Conference on Wireless and Telematics >Feature Selection using k-Medoid Algorithm for Categorization of Hadith Translation in English
【24h】

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

机译:基于k-Medoid算法的特征选择对英语中的圣训进行分类

获取原文

摘要

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-Nestrest邻居(k-NN)和最近质心(NC)算法完成的。所使用的数据是英语圣训的翻译。使用这种方法,可以期望计算时间更快,分类结果更好(准确性更高)。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号