【24h】

A k-Winner-Takes-All Classifier for Structured Data

机译:结构化数据的k-赢家通吃所有分类器

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

摘要

We propose a k-winner-takes-all (KWTA) classifier for structures represented by graphs. The KWTA classifier is a neural network implementation of the k-nearest neighbor (KNN) rule. The commonly used comparator for identifying the k nearest neighbors of a given input structure is replaced by an inhibitory winner-takes-all network for k-maximum selection. Due to the principle elimination of competition the KWTA classifier circumvents the problem of determining computational intensive structural similarities between a given input structure and several model structures. In experiments on handwritten digits we compare the performance of the self-organizing KWTA classifier with the canonical KNN classifier, which uses a supervising comparator.
机译:我们为图表示的结构提出了一个k-winner-takes-all(KWTA)分类器。 KWTA分类器是k最近邻(KNN)规则的神经网络实现。用来确定给定输入结构的k个最近邻居的常用比较器被抑制赢家通吃所有网络所取代,用于k个最大选择。由于消除了竞争的原理,KWTA分类器规避了确定给定输入结构与几个模型结构之间的计算密集型结构相似性的问题。在手写数字的实验中,我们将自组织KWTA分类器与使用监督比较器的规范KNN分类器的性能进行了比较。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号