代码搜索:Nearest

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

代码结果 1,596
www.eeworm.com/read/441173/7675133

m nnresample.m

function [x_nn Tres] = nnresample(ti, xi, Tres_ratio) % % Author P.M.T. Broersen, November 2008 % % NN or nearest neighbor resampling of irregularly sampled data. % Replaces irregularly sampled
www.eeworm.com/read/399996/7816951

m store_grabbag.m

function test_targets = Store_Grabbag(train_patterns, train_targets, test_patterns, Knn) % Classify using the store-grabbag algorithm (an improvement on the nearest neighbor) % Inputs: % train_p
www.eeworm.com/read/397115/8066850

m knn.m

function [C,P]=knn(d, Cp, K) %KNN K-Nearest Neighbor classifier using an arbitrary distance matrix % % [C,P]=knn(d, Cp, [K]) % % Input and output arguments ([]'s are optional): % d (matrix)
www.eeworm.com/read/397099/8068975

m store_grabbag.m

function test_targets = Store_Grabbag(train_patterns, train_targets, test_patterns, Knn) % Classify using the store-grabbag algorithm (an improvement on the nearest neighbor) % Inputs: % train_p
www.eeworm.com/read/245941/12771063

m store_grabbag.m

function test_targets = Store_Grabbag(train_patterns, train_targets, test_patterns, Knn) % Classify using the store-grabbag algorithm (an improvement on the nearest neighbor) % Inputs: % train_p
www.eeworm.com/read/331448/12827565

m knn.m

function [C,P]=knn(d, Cp, K) %KNN K-Nearest Neighbor classifier using an arbitrary distance matrix % % [C,P]=knn(d, Cp, [K]) % % Input and output arguments ([]'s are optional): % d (matrix)
www.eeworm.com/read/244790/12843801

m knn.m

function [C,P]=knn(d, Cp, K) %KNN K-Nearest Neighbor classifier using an arbitrary distance matrix % % [C,P]=knn(d, Cp, [K]) % % Input and output arguments ([]'s are optional): % d (matrix)
www.eeworm.com/read/330850/12865057

m store_grabbag.m

function test_targets = Store_Grabbag(train_patterns, train_targets, test_patterns, Knn) % Classify using the store-grabbag algorithm (an improvement on the nearest neighbor) % Inputs: % train_p
www.eeworm.com/read/141739/12988751

m knn.m

function [C,P]=knn(d, Cp, K) %KNN K-Nearest Neighbor classifier using an arbitrary distance matrix % % [C,P]=knn(d, Cp, [K]) % % Input and output arguments ([]'s are optional): % d (matrix)
www.eeworm.com/read/317622/13500920

m store_grabbag.m

function test_targets = Store_Grabbag(train_patterns, train_targets, test_patterns, Knn) % Classify using the store-grabbag algorithm (an improvement on the nearest neighbor) % Inputs: % train_p