Variations of the two-spiral task
The two-spiral task is a well-known benchmark for binary classification. The data consist of
points on two intertwined spirals which cannot be linearly separated. This article reviews …
points on two intertwined spirals which cannot be linearly separated. This article reviews …
The nearest-farthest subspace classification for face recognition
The nearest subspace (NS) classification is an efficient method to solve face recognition
problem by using the linear regression technique. This method is based on the assumption …
problem by using the linear regression technique. This method is based on the assumption …
From classifiers to discriminators: A nearest neighbor rule induced discriminant analysis
The current discriminant analysis method design is generally independent of classifiers, thus
the connection between discriminant analysis methods and classifiers is loose. This paper …
the connection between discriminant analysis methods and classifiers is loose. This paper …
Classification and feature extraction by simplexization
Techniques for classification and feature extraction are often intertwined. In this paper, we
contribute to these two aspects via the shared philosophy of simplexizing the sample set. For …
contribute to these two aspects via the shared philosophy of simplexizing the sample set. For …
Fruit disease recognition using improved sum and difference histogram from images
Diseases in fruit cause devastating problem in production and availability. The classical
approach of fruit disease recognition is based on the naked eye observation by experts …
approach of fruit disease recognition is based on the naked eye observation by experts …
Neighborhood feature line segment for image classification
In this paper, two improved classifiers based on the nearest feature line (NFL) are proposed
for image classification, where the neighborhood feature line segment-I (NFLS-I) classifier …
for image classification, where the neighborhood feature line segment-I (NFLS-I) classifier …
An angle-based neighborhood graph classifier with evidential reasoning
Y Yang, DQ Han, J Dezert - Pattern Recognition Letters, 2016 - Elsevier
A classification approach called angle-based neighborhood graph (ANG) is proposed in this
paper, which can flexibly define the neighborhood of a given query sample based on the …
paper, which can flexibly define the neighborhood of a given query sample based on the …
A novel classifier based on shortest feature line segment
DQ Han, CZ Han, Y Yang - Pattern Recognition Letters, 2011 - Elsevier
A new approach called shortest feature line segment (SFLS) is proposed to implement
pattern classification in this paper, which can retain the ideas and advantages of nearest …
pattern classification in this paper, which can retain the ideas and advantages of nearest …
Improving the k‐nearest neighbour rule: using geometrical neighbourhoods and manifold‐based metrics
H Altιnçay - Expert Systems, 2011 - Wiley Online Library
Sample weighting and variations in neighbourhood or data‐dependent distance metric
definitions are three principal directions considered for improving the k‐NN classification …
definitions are three principal directions considered for improving the k‐NN classification …
A generalization of dissimilarity representations using feature lines and feature planes
Even though, under representational restrictions, the nearest feature rules and the
dissimilarity-based classifiers are feasible alternatives to the nearest neighbor method; …
dissimilarity-based classifiers are feasible alternatives to the nearest neighbor method; …