Statistical learning algorithms often rely on the Euclidean distance. In practice, non-Euclidean or non-metric dissimilarity measures may arise when contours, spectra or shapes are compared by edit distances or as a consequence of robust object matching [1,2]. It is an open issue whether such measures are advantageous for statistical learning or whether they should be constrained to obey the me...

In solving pattern recognition problem in the Euclidean space, prototypes representing classes are de ned. On the other hand in the metric space, Nearest Neighbor method and K-Nearest Neighbor method are frequently used without de ning any prototypes. In this paper, we propose a new pattern recognition method for the metric space that can use prototypes which are the centroid of any three patte...

This paper presents a new face recognition method using virtual view-based eigenspace. This method provides a possible way to recognize human face of different views even when samples of a view are not available. To achieve this, we have developed a virtual human face generation technique that synthesizes human face of arbitrary views. By using a frontal and profile images of a specific subject...

A personality disorder is a condition of person with an extreme that causes the sufferer to have unhealthy and different thoughts patterns behavior from other people. The disorders discussed in this study consisted 110 diseases 300 case data 68 symptoms. Based on Basic Health Research (Riskesdas) 2018 data, it shows more than 19 million people aged 15 years over were affected by mental-emotiona...

Chloroplasts are organelles found in cells of green plants and eukaryotic algae that conduct photosynthesis. Knowing a protein's subchloroplast location provides in-depth insights about the protein's function and the microenvironment where it interacts with other molecules. In this paper, we present BS-KNN, a bit-score weighted K-nearest neighbor method for predicting proteins' subchloroplast l...

Dissimilarity measures, the basis of similarity-based retrieval, can be viewed as a distance and a similarity-based search as a nearest neighbor search. Though there has been extensive research on data structures and search methods to support nearest-neighbor searching, these indexing and dimension-reduction methods are generally not applicable to non-coordinate data and non-Euclidean distance ...

As an improved method of k-nearest neighbor classification, the local mean-based nonparametric classifier had the ability to resist the effects of noise and classify unbalanced data. When selecting the nearest k samples and calculating the distance between the test samples and the local mean-based vectors, it always used Euclidean distance. However, for multi-dimensional data, using Euclidean d...

Given a set S of n sites (points), and a distance measure d, the nearest neighbor searching problem is to build a data structure so that given a query point q, the site nearest to q can be found quickly. This paper gives a data structure for this problem; the data structure is built using the distance function as a “black box”. The structure is able to speed up nearest neighbor searching in a v...