代码搜索:Nearest

找到约 1,596 项符合「Nearest」的源代码

代码结果 1,596
www.eeworm.com/read/357874/10199051

m nearestneighborediting.m

function [patterns, targets] = NearestNeighborEditing(train_patterns, train_targets, Nmu, plot_on) %Reduce the number of data points using the nearest neighbor editing algorithm %Inputs: % train_
www.eeworm.com/read/349842/10796638

m nearestneighborediting.m

function D = NearestNeighborEditing(train_features, train_targets, params, region) % Classify points using the nearest neighbor editing algorithm % Inputs: % train_features - Train features % t
www.eeworm.com/read/399996/7816588

m nearestneighborediting.m

function [patterns, targets] = NearestNeighborEditing(train_patterns, train_targets, Nmu, plot_on) %Reduce the number of data points using the nearest neighbor editing algorithm %Inputs: % train_
www.eeworm.com/read/198970/7900216

m entropygraddist.m

function Dvect=entropyGradDist(npd) % % Compute entropy estimate using nearest neighbor estimate % % Copyright (C) 2003 Alexander Ihler; distributable under GPL -- see README.txt pts = getPoi
www.eeworm.com/read/198970/7900226

m entropydist.m

function h=entropyDist(npd) % % Compute entropy estimate using nearest neighbor estimate % % Copyright (C) 2003 Alexander Ihler; distributable under GPL -- see README.txt Ce = .57721566490153
www.eeworm.com/read/397758/8024409

m hlle.m

function [Y, mse] = HLLE(X,k,d) %HLLE Runs the standard Hessian LLE implementation of Hessian Eigenmaps % % X is the high-dimensional data to be processed % k is the number of nearest nei
www.eeworm.com/read/397099/8068735

m nearestneighborediting.m

function [patterns, targets] = NearestNeighborEditing(train_patterns, train_targets, Nmu, plot_on) %Reduce the number of data points using the nearest neighbor editing algorithm %Inputs: % train_
www.eeworm.com/read/245941/12770742

m nearestneighborediting.m

function [patterns, targets] = NearestNeighborEditing(train_patterns, train_targets, Nmu, plot_on) %Reduce the number of data points using the nearest neighbor editing algorithm %Inputs: % train_
www.eeworm.com/read/143706/12849758

m demknn1.m

%DEMKNN1 Demonstrate nearest neighbour classifier. % % Description % The problem consists of data in a two-dimensional space. The data is % drawn from three spherical Gaussian distributions with prio
www.eeworm.com/read/330850/12864710

m nearestneighborediting.m

function [patterns, targets] = NearestNeighborEditing(train_patterns, train_targets, Nmu, plot_on) %Reduce the number of data points using the nearest neighbor editing algorithm %Inputs: % train_