nearest

K-Nearest Neighbor[KNN] Classifier Implementation

K-NearestNeighbor[KNN]ClassifierImplementation 1double squared_distance(double* source, double* target, int d) 2{ 3    double res = 0; 4    for (int i=0;i 0 && k  0 && p && c && x);1415   if (t > 0) {
NPR & Fluids World·2008-05-22 15:00

IDMaps

The distance between hosts A and B is estimated as the distance between A and its nearest Tracer T1,
tiantian911·2008-04-03 21:00

[笔记]用ets实现了把一致性哈希中的最接近项查找

先前修改gb_trees，加入了lookup_nearest(Key,Tree)函数，通过二叉查找和回朔，来查找最接近Key的项。
AvinDev·2008-04-01 23:00

[笔记]用ets实现了把一致性哈希中的最接近项查找

先前修改gb_trees，加入了lookup_nearest(Key, Tree) 函数，通过二叉查找和回朔，来查找最接近Key的项。
AvinDev·2008-04-01 23:00

数据挖掘之分类（kNN算法的描述及使用）

kNN算法简介： kNN(k Nearest Neighbors
ahuaxuan·2008-02-23 15:00

23.3 How exceptions are handled

When an exception occurs, the system searches for the nearest catch clause that can handle the exception
talin2010·2006-08-04 22:00
上一页 14 15 16 17 18 19 20 21 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他