期刊
FUZZY SETS AND SYSTEMS
卷 158, 期 19, 页码 2134-2152出版社
ELSEVIER
DOI: 10.1016/j.fss.2007.04.023
关键词
K-nearest neighbor; classifiers; crisp; rough; fuzzy; rough-fuzzy and fuzzy-rough
In this paper, classification efficiency of the conventional K-nearest neighbor algorithm is enhanced by exploiting fuzzy-rough uncertainty. The simplicity and nonparametric characteristics of the conventional K-nearest neighbor algorithm remain intact in the proposed algorithm. Unlike the conventional one, the proposed algorithm does not need to know the optimal value of K. Moreover, the generated class confidence values, which are interpreted in terms of fuzzy-rough ownership values, do not necessarily sum up to one. Consequently, the proposed algorithm can distinguish between equal evidence and ignorance, and thus the semantics of the class confidence values becomes richer. It is shown that the proposed classifier generalizes the conventional and fuzzy KNN algorithms. The efficacy of the proposed approach is discussed on real data sets. (c) 2007 Elsevier B.V All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据