搜索资源列表
knn
- 朴素贝叶斯(Naive Bayes, NB)算法是机器学习领域中常用的一种基于概率的分类算法，非常简单有效。k近邻法(k-Nearest Neighbor, kNN)[30,31]又称为基于实例(Example-based, Instance-bases)的算法，其基本思想相当直观：Rocchio法来源于信息检索系统，后来最早由Hull在1994年应用于分类[74]，从那以后，Rocchio方法就在文本分类中广泛应用起来。
EnrichedNaturalNeighborInterpolantsforTwo-Dimensio
- sukumar N.写的报告Enriched Natural Neighbor Interpolants for Two-Dimensional Crack Modeling-sukumar N. written report Enriched Natural Neighbor Interpolants for Two-Dimensional Crack Modeling
future
- This project concentrates on the deterministic approach. This guarantees the full coverage in mobile adhoc network. This uses deterministic broadcast protocols that use neighbor set information only, which is more efficient method.
KMM
- 针对传统快速k-近邻分类算法的缺陷,提出了一种基于近邻搜索的快速k-近邻分类算法———超球搜 索法。该方法通过对特征空间的预组织,使分类在以待分样本为中心的超球内进行,有效地缩小了搜索范围。 -Rapid response to traditional k-neighbors of the defect classification algorithm, a fast search based on neighbor k-neighbor classification algorithm
DCT
- 提出了一种基于DCT提取人脸特征技术和支持向量机分类模型的人脸识别方法。利用离 散余弦变换可提取人脸可识别的大部分信息,而支持向量机作为分类器,在处理小样本、高维数等 方面具有独特的优势,且泛化能力很强,无需先验知识。从ORL 人脸库上的实验结果可以看出, DCT特征提取是很有效的,且SVM的分类性能优于最近邻分类器,同时提高了整个系统的运算速 度。-A face recognition method based on DCT for face feature extractio
Routing-algorithm
- 链路状态算法（也称最短路径算法）发送路由信息到互联网上所有的结点，然而对于每个路由器，仅发送它的路由表中描述了其自身链路状态的那一部分,其算法思想是每一个路由算法必须完成以下的工作，发现它的邻居节点，并知道其网络地址，测量到各邻居节点的延迟或者开销，构造一个分组，分组中包含所有它刚刚知道的信息，将这个分组发送给所有其他的路由器，计算出到每一个其他路由器的最短路径-Link state algorithm (also known as the shortest path algorithm) to
Super-resolution-through-
- 超分辨率放大基于邻域嵌入论文pdf包含简介 算法 和 超分结果-Super-Resolution Through Neighbor Embedding
hejulei
- 核聚类近邻算法，更多论文www.bysjaid.com-Nuclear neighbor clustering algorithm, more papers www.bysjaid.com
K-nearest-neighbor-algorithm
- 从K近邻算法、距离度量谈到KD树、SIFT+BBF算法,讲解详细，非常有用-From K neighbor algorithm and distance measurement when it comes to KD tree, SIFT+ BBF algorithm, explain in detail, very useful
Neighbor-discovery
- 最近通信研究的热门领域，D2D方向的discovery经典文献之一-One of the most popular areas of the recent discovery of classic literature communication studies, D2D direction
new_NE
- 自己编写的领域嵌入代码 已经运行过了 效果还不错-neighbor embedding
LSH
- 用LSH算法实现近似最近邻检索，并提高了效率-With LSH algorithm approximate nearest neighbor search, and improves efficiency
dynamic-region-merging
- In the proposed algorithm, these two issues are solved by a novel predicate, which is defined by the sequential probability ratio test (SPRT) and the minimal cost criterion. Starting from an over-segmented image, neighboring regions are progressivel
getmswpfeat
- matlab vide the examined window into cells (e.g. 16x16 pixels for each cell). For each pixel in a cell, compare the pixel to each of its 8 neighbors (on its left-top, left-middle, left-bottom, right-top, etc.). Follow the pixels along a circle, i.e
Classification-1
- Nearest Neighbor Classification
data-asso--introduction
- 详细介绍数据关联的相关知识，包含最近邻，JPDA的算法的详细推导。-Detailed data related knowledge, including the nearest neighbor, detailed derivation JPDA algorithm.
25292626
- 为了实现复杂环境下的人脸特征有效表达，提出一种改进的梯度方向直方图（ＨＯＧ）人脸识别方法．首先以人脸图像网格作为采样窗口并在其上提取 ＨＯＧ特征；然后将所有网格 ＨＯＧ特征向量进行组合，实现整个人脸特 征表达；最后采用最近邻分类器进行识别．另外，比较了该方法与Ｇａｂｏｒ小波和局部二值模式（ＬＢＰ）２种著名的人脸 局部特征表示方法的优劣．实验结果表明，在调优的 ＨＯＧ参数下，在具有光照和时间环境等复杂变化的ＦＥＲＥＴ人 脸库中，较少维数的 ＨＯＧ特征比ＬＢＰ特征有更好的表现，而且 ＨＯ
COMPLETE-DOCUMENT
- document explaning method of Neighbor Table Based Shortcut Tree Routing
0755
- 包括最小二乘法、SVM、神经网络、1_k近邻法,采用加权网络中节点强度和权重都是幂率分布的模型，ofdm系统仿真 含16qam调制 fft 加窗 加cp等模块。- Including the least squares method, the SVM, neural networks, 1 _k neighbor method, Using weighted model nodes in the network strength and weight are power law distribu
tenpai_v19
- 意信号卷积的运算,并且绘制图象，双向PCS控制仿真，包括最小二乘法、SVM、神经网络、1_k近邻法。- Convolution operation is intended to signal and image rendering, Two-way PCS control simulation, Including the least squares method, the SVM, neural networks, 1 _k neighbor method.