.png){kind=icon}
返回
LVQ algorithm with instance weighting for generation of prototype-based rules
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neunet.2011.05.013.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Crisp and fuzzy-logic rules are used for comprehensible representation of data, but rules based on similarity to prototypes are equally useful and much less known. Similarity-based methods belong to the most accurate data mining approaches. A large group of such methods is based on instance selection and optimization, with the Learning Vector Quantization (LVQ) algorithm being a prominent example. Accuracy of LVQ depends highly on proper initialization of prototypes and the optimization mechanism. This paper introduces prototype initialization based on context dependent clustering and modification of the LVQ cost function that utilizes additional information about class-dependent distribution of training vectors. This approach is illustrated on several benchmark datasets, finding simple and accurate models of data in the form of prototype-based rules. (C) 2011 Elsevier Ltd. All rights reserved.
Keyword:
Learning Vector Quantization
Knowledge-based clustering
Prototype-based rules
Similarity-based methods
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.3
论文数:
7.9K
被引数:
3.0W
.png){kind=icon}
查看更多内容