K-SVD
K-SVD是一种经典的字典训练算法，依据误差最小原则，对误差项进行SVD分解，选择使误差最小的分解项作为更新的字典原子和对应的原子系数，经过不断的迭代从而得到优化的解。
资源总数
500
K-SVD 热门资料
查看全部 500 份 →KNN K-nearest neighbor rule for classification
KNN K-nearest neighbor rule for classification
2016-10-30
116
K Nearest Neighbor algorithm Implementation and Overview
K Nearest Neighbor algorithm Implementation and Overview
2014-01-23
121