代码搜索：Nearest

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

代码结果 1,596
热门代码： main.c GPIO I2C SPI UART timer interrupt ADC PWM LED
www.eeworm.com/read/344585/3207739

m knnfwd.m

function [y, l] = knnfwd(net, x) %KNNFWD Forward propagation through a K-nearest-neighbour classifier. % % Description % [Y, L] = KNNFWD(NET, X) takes a matrix X of input vectors (one vector % per ro
·
www.eeworm.com/read/396844/2406672

m knnfwd.m

function [y, l] = knnfwd(net, x) %KNNFWD Forward propagation through a K-nearest-neighbour classifier. % % Description % [Y, L] = KNNFWD(NET, X) takes a matrix X of input vectors (one vector % per ro
·
www.eeworm.com/read/160391/5571228

m mk_chmm.m

function bnet = mk_chmm(N, Q, Y, discrete_obs, coupled, CPD) % MK_CHMM Make a coupled Hidden Markov Model % % There are N hidden nodes, each connected to itself and its two nearest neighbors in the
·
www.eeworm.com/read/367675/2836479

txt 963.txt

发信人: waden (waden), 信区: DataMining 标 题: 请教有关于k-nearest neighbor的问题？？？ 发信站: 南京大学小百合站 (Mon Sep 16 22:44:39 2002), 站内信件 小弟做了个k-nearest neighbor的分类器，用的数据集是kddcup99。可是我的正确率 只有79%（k=1),当k>1时，比79%要低。这
·
www.eeworm.com/read/367675/2837143

txt 976.txt

发信人: strawman (独上江楼思渺然), 信区: DataMining 标 题: Re: 请教有关于k-nearest neighbor的问题？？？ 发信站: 南京大学小百合站 (Tue Sep 17 15:57:09 2002), 站内信件 人家做出来的结果是什么？你具体是怎么做的？ 【 在 waden (waden) 的大作中提到: 】 : 小弟做了个k-nearest
·
www.eeworm.com/read/428849/8834997

m~ gnpp.m~

function [x,fval,stat] = gnpp(H,f,y,options) % GNPP Solves Generalized Nearest Point (GNPP) problem. % % Synopsis: % [x,fval,stat] = gnpp(H,f) % [x,fval,stat] = gnpp(H,f,options) % % Description: %
·
www.eeworm.com/read/375764/9350105

h kdtree.h

/**@file Functions and structures for maintaining a k-d tree database of image features. For more information, refer to: Beis, J. S. and Lowe, D. G. Shape indexing using approximate nearest-neighbo
·
www.eeworm.com/read/375764/9350138

c kdtree.c

/* Functions and structures for maintaining a k-d tree database of image features. For more information, refer to: Beis, J. S. and Lowe, D. G. Shape indexing using approximate nearest-neighbor sear
·
www.eeworm.com/read/362246/10010511

m~ gnpp.m~

function [x,fval,stat] = gnpp(H,f,y,options) % GNPP Solves Generalized Nearest Point (GNPP) problem. % % Synopsis: % [x,fval,stat] = gnpp(H,f) % [x,fval,stat] = gnpp(H,f,options) % % Description: %
·
www.eeworm.com/read/362246/10010546

m gnpp.m

function [x,fval,stat] = gnpp(H,f,y,options) % GNPP Solves Generalized Nearest Point (GNPP) problem. % % Synopsis: % [x,fval,stat] = gnpp(H,f) % [x,fval,stat] = gnpp(H,f,options) % % Description: %
·