Abstract
Fuzzy-rough sets have enjoyed much attention in recent years as an effective way in which to extend rough set theory such that it can deal with real-valued data. More recently, fuzzy-rough sets have been employed for the task of classification. This has led to the development of approaches such as fuzzy-rough nearest-neighbour (FRNN) and its extension based on vaguely-quantified rough sets (VQNN). These methods perform well and experimental evaluation demonstrates that VQNN in particular is very effective for dealing with data in the presence of noise. In this paper, the underlying mechanisms of FRNN and VQNN are investigated and analysed. The theoretical proof and empirical evaluation show that the resulting classification of FRNN and VQNN depends only upon the highest similarity and greatest summation of the similarities of each class, respectively. This fact is exploited in order to formulate the novel methods proposed in this paper: similarity nearest-neighbour (SNN) and aggregated-similarity nearest-neighbour (ASNN). These two novel approaches are equivalent to FRNN and VQNN, but do not employ the concepts or framework of fuzzy-rough sets. Instead only fuzzy similarity is used. Experimental evaluation confirms the observation that these new methods maintain the classification performance of the existing advanced fuzzy-rough nearest-neighbour-based classifiers. In addition, the underlying mathematical foundation is simplified. (C) 2012 Elsevier Inc. All rights reserved.
Original language | English |
---|---|
Pages (from-to) | 184-195 |
Number of pages | 12 |
Journal | International Journal of Approximate Reasoning |
Volume | 54 |
Issue number | 1 |
Early online date | 14 Jul 2012 |
DOIs | |
Publication status | Published - Jan 2013 |
Keywords
- Similarity function
- FEATURE-SELECTION
- MACHINE
- Classification
- Nearest neighbour
- ROC
- CURVES
- SETS
- Fuzzy-rough sets