搜索资源列表
kNN-DST
- evidential K nearest neighbors classificator
belief_NN
- belief function nearest neighbors
bdsccode.tar
- BDS statistics: Correlation integral (from chaos theory) is used in this code. The time series is embedded in an m-dimensional space and the near neighbors are used to calculate the statistics.
Kode-Program-Algoritma-Nearest-Neighbor
- In pattern recognition, the k-nearest neighbor algorithm (k-NN) is a method for classifying objects based on closest training examples in the feature space. k-NN is a type of instance-based learning, or lazy learning whe
croftsoft_2008-09-28
- float midy = (float)(y - lastY)/2) double phi = Math.atan2(midy-center.y, midx-center.x) String s = neighbors[i-1] double sw = font.getStringBounds(s, frc).getWidth() double diag = Math.sqrt(sw*sw + sh*s
k-nearest
- FAST K-NEAREST NEIGHBORS SEARCH， Simple but very fast algorithm for nearest neighbors search in 2D space.
ixneighbors
- Find indexes neighbors-Find indexes neighbors
flooding
- 在NS仿真器中实现泛洪发送，每个节点向所有的邻居节点发送新的数据-Implemented in NS simulator sends flooding, each node sends to all neighbors of new data
improvedDWT
- 一种基于DWT的自适应数字水印算法。先将图像进行DWT分解，然后根据选定像素与其四邻域均值的关系，确定要嵌入的水印值。-DWT-based adaptive digital watermarking algorithm. DWT decomposition of the image first, then the selected pixel and its neighbors according to the relationship
Gas-dynamics
- 用来模拟粒子运动的。此元胞自动机需要 一种不同类型的元胞的邻居。此元胞的邻居时刻变化，因此某一个方向运动趋势， 将继续在同一个方向。换言之，此规则保存势头，这是基础的动力仿真。这种邻 居通常被称为 margolis邻居并且这种邻居通常由重叠的 2x2 块的元胞构成。在下 面的表格中，偶数步长时左上方 4 元胞为邻居关系，奇数步长时右下的 4 元胞为 邻居关系。某一特定元胞在每一个时间步长都有3 个邻居，但是具体的元胞
Percolation-Cluster
- 对周围相邻的 8 邻居求和（元胞只有两种状态，0 或 1 ）。元胞也有一个单独的状态参量（所谓 记录 ）记录它们之前是否有非零状态的邻居。 在 0 与 1 之间产生一个随机数 r 。 如果总和> 0 （至少一个邻居）并且 r >阈值，或者元胞从未有过一个邻居，则元胞= 1 。 如果总和> 0 则设置"记录"的标志，记录这些元胞有一个非零的邻居。 -8 adjacent neighbors on the surround
game-of-life
- Game of Life was created in Dev C++ (GUI). It is a cellular automaton , and was invented by Cambridge mathematician John Conway. THE RULES For a space that is populated : Each cell with one or no neighbors dies, as if by
A-new-clustering-method-to-prolong-the-lifetime-o
- One of the most critical issues in the wireless sensor networks is the network s nodes limited availability of energy. The network lifetime strictly depends on its energy efficiency. Clustering is a method to make the
ImageBoundaryExtraction
- 该文件夹中有六个M文件，说明如下： boundary_extraction.m : 目标区域边界抽取主函数，其中调用ostu、four_neighbor、eight_neighbor、globe_graph otsu.m : 类判别分类法（otsu全局二值化算法） four_neighbor.m : 四邻域法边界抽取 eight_neighbor.m : 八邻域法边界抽取 globe_graph.m : 全局检
ItemClusteringRecomAlg
- 针对传统推荐算法的数据稀疏性问题和推荐准确性问题，提出基于粒子群优化的项聚类推荐算法。采用粒子群优化算法产生聚类中心，在此基础上搜索目标项目的最近邻居，并产生推荐，从而提高了传统聚类算法的推荐准确性及响应速度。实验表明改进的项聚类协同过滤算法能有效提高推荐精度-Aiming at the problems that the data are sparse and the results are not accurate in tradi
OPTICS-algorithm---Wikipedia--the-free-encycloped
- OPTICS ("Ordering Points To Identify the Clustering Structure") is an algorithm for finding density-based clusters in spatial data. It was presented by Mihael Ankerst, Markus M. Breunig, Hans-Peter Kriegel and Jö r
sap
- 使用有监督的近邻传播聚类算法进行特征波段选取-Neighbors using a supervised clustering algorithm for propagation characteristics of selected bands
Image-Classification
- 对SVM多类分类算法进行了研究，总结了不同分类算法的优缺点。接下来本文提出了基于GA(遗传算法)和KNN(K近邻)的SVM多类分类算法-The SVM multi-class classification algorithms studied, summed up the advantages and disadvantages of different classification algorithms. The next paper
9_Computer-Networks
- In a ring network, every device has exactly two neighbors for communication purposes. All messages travel through a ring in the same direction (either "clockwise" or "counterclockwise").
9_DBMS
- In a ring network, every device has exactly two neighbors for communication purposes. All messages travel through a ring in the same direction (either "clockwise" or "counterclockwise").