2020
DOI: 10.1109/access.2019.2963471
|View full text |Cite
|
Sign up to set email alerts
|

Can Reverse Nearest Neighbors Perceive Unknowns?

Abstract: A novel open set classifier is presented in this work, where the neighborhood of a test instance is determined using the principles of Reverse k-nearest neighbors (RkNN). The RkNN count of an instance can have any non-negative value less or equal to the size of the training set. While dealing with an open dataset, consisting of known and unknown classes, the zero count can provide a possible solution for detecting the unknown class. Positive RkNN count along with the nearest RkNN distance information are used … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
2
1

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 26 publications
0
2
0
Order By: Relevance
“…Sadhukhan and Palit (2019) proposed an oversampling scheme for multi‐label imbalanced datasets, where the space for oversampling is determined via reverse‐nearest neighbourhood. In a recent work by Sadhukhan (2020), a scheme is devised on principles of reverse nearest neighbourhood to tackle the problem of open set classification.…”
Section: Related Workmentioning
confidence: 99%
“…Sadhukhan and Palit (2019) proposed an oversampling scheme for multi‐label imbalanced datasets, where the space for oversampling is determined via reverse‐nearest neighbourhood. In a recent work by Sadhukhan (2020), a scheme is devised on principles of reverse nearest neighbourhood to tackle the problem of open set classification.…”
Section: Related Workmentioning
confidence: 99%
“…Aiming at the problem of target recognition in an open environment, Scheirer and other scholars defined the problem of open set recognition (OSR) and established the theoretical framework of OSR [3] . Under this framework, scholars have proposed a series of algorithms, which can be roughly divided into the following categories:1) Based on support vector machine (SVM), such as W-SVM [4] , PI-SVM , etc.;2) Based on sparse representation (SR), such as SR-OSR algorithm [6] ;3) Based on distance criteria, such as Nearest Non-Outlier [7] , reverse k-nearest neighbor classifier [8] , etc.;4) Based on deep neural network (DNN), such as deep open classifier [9] , category condition encoder [10] , etc.;5) Based on edge distribution, such as Extremum Value Machine algorithm [11] . Under the open set condition, the OSR method has achieved a good recognition effect, but the relevant achievements are mainly concentrated in the field of computer vision.…”
Section: Introductionmentioning
confidence: 99%