搜索资源列表
Coordinate
- 基于R树的K近邻查询算法及递增的k近邻查询算法实现-the implemention of R-tree K-nearest neighbor query algorithm and incremental nearest neighbor query algorithm
wine_class
- 借助于k-近邻算法,实现对酒品质的鉴定。并在算法中采用k值的调整以求结果更优。-By means of a k-nearest neighbor algorithm, identification of the quality of the wine. And k values used in the algorithm to adjust in order to better results.
kdTree
- 最近邻算法的构建,构造kd-tree。是统计学习方法中的经典方法。是其源码实现。-Nearest neighbor algorithm, constructed kd-tree. The classical method is a statistical learning method. Its source code to achieve.
littleworld
- NW小世界网络的构成原则为:从一个环状的规则网络开始,网络含有N个结点,每个结点向与它最近邻的K个结点连出K条边,并满足N>>K>>In(N)>>1。随后进行随机化加边,以概率p在随机选取的一对节点之间加上一条边。其中,任意两个不同的节点之间至多只能有一条边,并且每一个节点都不能有边与自身相连。改变p值可以实现从最近邻耦合网络(p=0)向全局耦合网络(p=1)转变。在p足够小和N足够大时,NW小世界模型本质上等同于WS小世界模型。 -NW constitu
main
- //协同过滤算法对目标用户产生推荐: //收集可以代表用户兴趣的信息;根据收集到的信息计算出用户之间的相似性,并以此为根据为目标用户或项目寻得最近邻居;根据得到的最近邻居对目标用户产生推荐-//Collaborative filtering algorithm recommended by the target user:// collect on behalf of the user interest information calculate the similarity bet
RBF-stockmarket-predict
- 数据预测,采用RBF最近邻算法预测股市趋势-Data to predict RBF nearest neighbor algorithm predict stock market trends
floaterK1
- 这是用MTTLAB编程,采用K近邻法对提取的水面漂浮物特征进行分类-This is programming MTTLAB, K-nearest neighbor method floats feature to classify the extracted water
knn
- 实现构建k-d树并且实现k-d树上的最邻近查找算法-Build a kd-tree and kd tree nearest neighbor search algorithm
KNN
- Implement the K nearest neighbor algorithm by your own instead of using available software. 2. Use K-fold cross validation to generate training and testing datasets. You should try different K values (3~8) to see how they affect your result. 3. T
Nearest_Neighbor
- KNN k s nearest neighbor algorithm-KNN k' s nearest neighbor algorithm
1
- 利用K-L变换进行人脸识别。首先求得待辨识图像相对于训练集平均脸的差值图像,然后求得该图像在特征脸空间中的坐标,最后采用最近邻法对图像进行归类。-KL transform for face recognition. Obtain the first image to be identified image with respect to the difference between the average face of the training set, and then obtain the
nearest_neighbor_2opt
- Nearest Neighbor for TSP with 2-opt MATLAB
Order-disorder
- 有序无序转变的计算机模拟——MC算法 一个样品做实验,从低温有序相,逐渐升温,到高温无序相。 模型假设: 1 模拟三维简单斜方,AB型合金,共有M*N*L个原子; 2 最邻近假设,即只考虑最邻近原子之间的相互作用,次邻近和更远的原子之间的作用忽略(误差较大), ,在简单斜方中,最邻近原子数z=6; 3 只考虑势能的作用,AA,BB,AB原子间的作用用Eaa,Ebb,Eab=Eba表示 且忽略振动能(原则上,温度很高时,不能忽略)等; 4 各原子之间的相
maxFirst.src
- ICDE论文MaxFirst代码,是双色反最近邻的重要论文-ICDE papers MaxFirst code, is an important color papers reverse nearest neighbor
maxRNN
- VLDB经典论文Maxoverlap代码,是空间数据库双色反最近邻的重要论文-VLDB classic paper Maxoverlap code, color spatial database is an important anti-nearest neighbor papers
keshe
- 利用matlab的GUI程序设计一个简单实用的图像处理程序。该程序应具备图像处理的常用功能,以满足用户的使用。现设计程序有以下基本功能: 1)图像的读取和保存。 2)设计图形用户界面,让用户能够对图像进行任意的亮度和对比度变化调整,显示和对比变换前后的图像。 3)设计图形用户界面,让用户能够用鼠标选取图像感兴趣区域,显示和保存该选择区域。 4)编写程序通过最近邻插值和双线性插值等算法将用户所选取的图像区域进行放大和缩小整数倍的操作,并保存,比较几种插值的效果。 5)图像直方图
KNN
- 是K最邻近结点算法的缩写形式,是电子信息分类器算法的一种。KNN方法对包容型数据的特征变量筛选尤其有效。-The K nearest neighbor node algorithm abbreviated form of electronic information is a classification algorithm. KNN method based on the inclusion of data characteristic variable filter is particula
knnsearch
- 一个小而有效的程序来执行的K近邻搜索算法, 非常适合对K -近邻搜索算法的入学者。-A small but effective procedures to implement the K-nearest neighbor search algorithm is very suitable for K- nearest neighbor search algorithm admission
pca
- pca算法实现人脸识别,包括数据图片,特征提取算法,最近邻分类器算法-pca algorithm for face recognition, including data pictures, feature extraction algorithm, nearest neighbor classifier algorithms, etc.
knn
- 使用java实现数据分类算法最近邻分算法knn,没有使用数据库,直接将数据存储在arraylist中-Using java nearest neighbor classification algorithm for data points algorithms knn, do not use a database, the data is stored directly in the arraylist