.png){kind=icon}
返回
Dissimilarity learning for nominal data
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patcog.2003.12.015.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Defining a good distance (dissimilarity) measure between patterns is of crucial importance in many classification and clustering algorithms. While a lot of work has been performed on continuous attributes, nominal attributes are more difficult to handle. A popular approach is to use the value difference metric (VDM) to define a real-valued distance measure on nominal values. However, VDM treats the attributes separately and ignores any possible interactions among attributes. In this paper, we propose the use of adaptive dissimilarity matrices for measuring the dissimilarities between nominal values. These matrices are learned via optimizing an error function on the training samples. Experimental results show that this approach leads to better classification performance. Moreover, it also allows easier interpretation of (dis)similarity between different nominal values. (C) 2004 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.
Keyword:
nominal attributes
pattern classification
dissimilarities
distance measure
classifiers
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
暂无机构信息
引用论文
A review and empirical evaluation of feature weighting methods for a class of lazy learning algorithms一类懒惰学习算法的特征加权方法综述与实证评价
.png){kind=icon}
PREAI
分享收藏分享收藏
分享收藏Colchicine: Its mechanism of action and efficacy in crystal-induced inflammation秋水仙碱: 其在晶体诱导的炎症中的作用机制和功效
PREAI
分享收藏
分享收藏 没有更多内容
没有更多内容