Results 31 to 40 of about 312,403 (279)
Nonparametrically consistent depth-based classifiers [PDF]
, 2015 We introduce a class of depth-based classification procedures that are of a nearest-neighbor nature. Depth, after symmetrization, indeed provides the center-outward ordering that is necessary and sufficient to define nearest neighbors.
Davy Paindaveine +3 more
core +1 more source
SLSB-forest:approximate k nearest neighbors searching on high dimensional data
Dianxin kexue, 2017 The study of approximate k nearest neighbors query has attracted broad attention.Local sensitive hash is one of the mainstream ways to solve this problem.Local sensitive hash and its varients have noted the following problems:the uneven distribution of ...
Tu QIAN +3 more
doaj +2 more sources
IEEE Access, 2020 Density peaks clustering (DPC) algorithm is a novel density-based clustering algorithm, which is simple and efficient, is not necessary to specify the number of clusters in advance, and can find any nonspherical class clusters.
Chunhua Ren +3 more
doaj +1 more source
Variable Selection and Parameter Tuning in High-Dimensional Prediction [PDF]
, 2010 In the context of classification using high-dimensional data such as microarray gene expression data, it is often useful to perform preliminary variable selection.
Bernau, Christoph +1 more
core +1 more source
Patch confidence k-nearest neighbors denoising [PDF]
2010 IEEE International Conference on Image Processing, 2010 Recently, patch-based denoising techniques have proved to be very effective. Indeed, they account for the correlations that exist among patches of natural images. Taking a variational approach, we show that the gradient descent for the chosen entropy-based energy leads to a solution involving the mean-shift on patches.
Angelino, Cesario Vincenzo +2 more
openaire +2 more sources
Journal of Information Systems and Informatics, 2023 Indonesia's elections serve as a cornerstone of its democratic system, with the active participation of its citizens being of paramount importance. To bolster transparency and civic engagement during these elections, the SITUNG system (Election Result ...
Uci Suriani, Tri Basuki Kurniawan
doaj +1 more source
Fast k-means based on KNN Graph
, 2017 In the era of big data, k-means clustering has been widely adopted as a basic processing tool in various contexts. However, its computational cost could be prohibitively high as the data size and the cluster number are large.
Deng, Cheng-Hao, Zhao, Wan-Lei
core +1 more source
Structural insights into an engineered feruloyl esterase with improved MHET degrading properties
FEBS Letters, EarlyView.A feruloyl esterase was engineered to mimic key features of MHETase, enhancing the degradation of PET oligomers. Structural and computational analysis reveal how a point mutation stabilizes the active site and reshapes the binding cleft, expading substrate scope.
Panagiota Karampa +5 more
wiley +1 more source
Journal of Big DataThe k-Nearest Neighbors (kNN) method, established in 1951, has since evolved into a pivotal tool in data mining, recommendation systems, and Internet of Things (IoT), among other areas.
Rajib Kumar Halder +4 more
doaj +1 more source
Instance and feature weighted k-nearest-neighbors algorithm [PDF]
, 2016 We present a novel method that aims at providing a more stable selection of feature subsets when variations in the training process occur. This is accomplished by using an instance-weighting process -assigning different importances to instances as a ...
Belanche Muñoz, Luis Antonio +1 more
core