代码搜索：Nearest
找到约 1,596 项符合「Nearest」的源代码
代码结果 1,596
www.eeworm.com/read/175689/5343514
m knnclass.m
function y = knnclass(X,model)
% KNNCLASS k-Nearest Neighbours classifier.
%
% Synopsis:
% y = knnclass(X,model)
%
% Description:
% The input feature vectors X are classified using the K-NN
% rule
www.eeworm.com/read/430506/1929369
m~ knnclass.m~
function [class] = knnclass(tst,X,I,K)
% [class] = knnclass(tst,X,I,K)
%
% KNNCLASS is an implementation of K-Nearest Neighbours
% classifier. The Euclidean distance is used.
%
% Input:
% tst [DxNt
www.eeworm.com/read/428780/1954188
m knnclass.m
function y = knnclass(X,model)
% KNNCLASS k-Nearest Neighbours classifier.
%
% Synopsis:
% y = knnclass(X,model)
%
% Description:
% The input feature vectors X are classified using the K-NN
% rule
www.eeworm.com/read/386597/2570122
m interactive_learning.m
function test_targets = Interactive_Learning(train_patterns, train_targets, test_patterns, params)
% Classify using nearest neighbors and interactive learning
% Inputs:
% train_patterns - Train
www.eeworm.com/read/373460/2761803
m~ knnclass.m~
function [class] = knnclass(tst,X,I,K)
% [class] = knnclass(tst,X,I,K)
%
% KNNCLASS is an implementation of K-Nearest Neighbours
% classifier. The Euclidean distance is used.
%
% Input:
% tst [DxNt
www.eeworm.com/read/295595/8150992
m svmclassnpa.m
function [xsup,alpha,b,pos]=svmclassnpa(x,y,C,kernel,kerneloption,verbose);
% USAGE
% [xsup,alpha,b,pos]=svmclassnpa(x,y,C,kernel,kerneloption,verbose);
%
%
% Main ROUTINE For Nearest P
www.eeworm.com/read/393865/8257912
m svmclassnpa.m
function [xsup,alpha,b,pos]=svmclassnpa(x,y,C,kernel,kerneloption,verbose);
% USAGE
% [xsup,alpha,b,pos]=svmclassnpa(x,y,C,kernel,kerneloption,verbose);
%
%
% Main ROUTINE For Nearest P
www.eeworm.com/read/367442/9747772
m~ knnclass.m~
function [class] = knnclass(tst,X,I,K)
% [class] = knnclass(tst,X,I,K)
%
% KNNCLASS is an implementation of K-Nearest Neighbours
% classifier. The Euclidean distance is used.
%
% Input:
% tst [DxNt
www.eeworm.com/read/367152/9779985
m knn1.m
% knn1 - Find nearest k neighbours in 1 dim, sorted indices
%
% [index,n_x,maxx,piv] = knn1(x,pivot,k,wdist)
%
% _____OUTPUTS____________________________________________________________
% index indic
www.eeworm.com/read/270032/11050877
c nearestpoint.c
/*
Solving the Nearest Point-on-Curve Problem
and
A Bezier Curve-Based Root-Finder
by Philip J. Schneider
from "Graphics Gems", Academic Press, 1990
*/
/* point_on_curve.c */
#include