首页> 外文期刊>International Journal of Fuzzy Systems >Prototypes Reduction and Feature Selection based on Fuzzy Boundary Area for Nearest Neighbor Classifiers
【24h】

Prototypes Reduction and Feature Selection based on Fuzzy Boundary Area for Nearest Neighbor Classifiers

机译:基于最近邻分类的模糊边界区域的原型减少和特征选择

获取原文
获取原文并翻译 | 示例
           

摘要

For prototype-based classifiers, the number of prototypes results in increasing the computational time so that it takes very long time for a prototype-based classifier to determine the class label of an associated data. Many researchers have been interested in the reduction of the number of prototypes without degradation of the classification ability of prototype-based classifiers. In this paper, we introduce a new method for generating prototypes based on the assumption that the prototypes positioned near the boundary surface are important for improving the classification abilities of nearest neighbor classifiers. The main issue of this paper is how to locate the new prototypes as close as possible to the boundary surface. To realize this, we consider possibilistic C-Means clustering and conditional C-Means clustering. The clusters obtained by using possibilistic C-Means clustering methods are used to define the boundary areas, and the conditional fuzzy C-Means clustering technique is used to determine the locations of prototypes within the already defined boundary areas. The design procedure is illustrated with the aid of numeric examples that provide a thorough insight into the effectiveness of the proposed method.
机译:对于基于原型的分类器,原型的数量导致计算时间增加,使得基于原型的分类器需要很长时间,以确定相关数据的类标签。许多研究人员一直对减少原型的数量而不会降低基于原型的分类器的分类能力的劣化。在本文中,我们引入了一种新方法,用于基于定位在边界表面附近的原型来产生原型的新方法,用于提高最近邻分类器的分类能力。本文的主要问题是如何尽可能接近边界表面定位新原型。为了实现这一点,我们考虑可能性C-Means聚类和条件C-Means聚类。通过使用可能性C-Means聚类方法获得的簇用于定义边界区域,并且条件模糊C-MEAREL聚类技术用于确定已经定义的边界区域内的原型的位置。借助于数字示例说明了设计过程,该数字示例提供了对所提出的方法的有效性的全面见解。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号