Location:
Search - kennard
Search list
Description: kennard-stone选样本算法。。。PLS的迭代算法程序
Platform: |
Size: 5023 |
Author: 吴雪文 |
Hits:
Description: kennard-stone选样本算法。。。PLS的迭代算法程序-kennard-stone election sample algorithm. . . PLS procedure of iterative algorithm
Platform: |
Size: 5120 |
Author: 吴雪文 |
Hits:
Description: Kennard and stones algorithm的简单叙述-a simple description of Kennard and stones algorithm
Platform: |
Size: 60416 |
Author: lujin |
Hits:
Description: 近红外光谱分析中要从复杂的信息中有效地提取相关信息建立可靠的模型，选择的训练集要具有较好的代表性。目前．样本的选择方法主要包括random sampling(RS)，Kennard—Stone(KS)．sample set partitioning based on joint x-y distance(SPXY)等方法 。-selecting a representative subset in NIR data using SPXY， the random sampling，and Kennard—Stone methods
Platform: |
Size: 297984 |
Author: Libra Chow |
Hits:
Description: 经典的KS算法，用于近红外光谱分析选样本。-Classic KS algorithm, the sample selected for the near-infrared spectroscopy.
Platform: |
Size: 1024 |
Author: 郑可慧 |
Hits:
Description: MATLAB实现kennard-stone选样本算法
-MATLAB kennard- stone selected sample algorithm
Platform: |
Size: 1024 |
Author: 翁累 |
Hits:
Description: Estimates the power spectral densities (PSDs) using both the generalized Ridge Regression (GRR) method [Hoerl, Kennard] and the ordinary RR method with loading level decided by the harmonic mean (HKB) and a Bayesian estimator (LW) for deciding the diagonal loading level.-Estimates the power spectral densities (PSDs) using both the generalized Ridge Regression (GRR) method [Hoerl, Kennard] and the ordinary RR method with loading level decided by the harmonic mean (HKB) and a Bayesian estimator (LW) for deciding the diagonal loading level.
Platform: |
Size: 2048 |
Author: Shital |
Hits:
Description: (1) 首先计算两两样本之间距离，选择距离最大的两个样品。(2) 然后分别计算剩余的样本与已选择的两个样本之间的距离。(3) 对于每个剩余样本而言, 其与已选样品之间的最短距离被选择, 然后选择这些最短距离中相对最长的距离所对应的样本, 作为第三个样品。(4) 重复步骤(3) , 直至所选的样品的个数等于事先确定的数目为止，比如10个，或者20个。-(A) calculating a distance between the first two samples, select the maximum distance of the two samples. (2) and then calculate the distance and the remaining two samples between the selected sample. (3) For each of the remaining samples, the shortest distance between it and the selected sample is selected, and then select the shortest distance longest distance corresponding to the relative sample, as a third sample. (4) Repeat step (3) until the selected number of samples equal to the number of pre-determined so far, such as 10 or 20.
Platform: |
Size: 1024 |
Author: 许杰 |
Hits:
Description: Uniform subset selection with Kennard and Stone algorithm in Matlab
Platform: |
Size: 2048 |
Author: Andr茅 |
Hits:
Description: Kennard Stone 算法
用于数据集的划分（训练集 和 测试集）
算法同时输出训练集、测试集，以及训练集或测试集中样品在原数据集中的编号信息，方便样本的查找。
原始代码来源于本网，自行重新编译，如有需要，欢迎下载。
-Kennard Stone agorithm
for the partition of data set (training set and test set)
the outputs of the agorithm not only includes the training set and test set also the index of
samples of training set or test set in the original data set,which make the search more convenient.
Platform: |
Size: 1024 |
Author: 苏子移 |
Hits:
Description: 在matlab中应用很广的kennard stone法编程(The Kennard stone method is widely used in MATLAB programming)
Platform: |
Size: 1024 |
Author: 冬青大人
|
Hits:
Description: Kennard–Stone (KS) algorithm，select samples
Platform: |
Size: 6949 |
Author: hins_clover |
Hits: