搜索资源列表
File10
- Web文档聚类系统的设计与实现：数据挖掘；聚类分柝：文本挖掘；预处理；聚类组合；可 视化；欧氏距离-Web Document Clustering Design and Implementation: Data mining Clustering Hierarchical: text mining pretreatment cluster combinations visualization Euclidean distance
RS-decoder-circuit-reconfigurability
- 介绍了基于线性反馈位移寄存器的编码原理及可重构改进方法。通过乘法和加法的迭代运算实现了伴随多项式的并行运算。采用改进欧几里德算法求解关键方程,运用钱氏搜索算法实现了错误位置的查找,并提出以上两种算法的可重构计算结构。-Introduced based on linear displacement of the code register feedback principle and reconfigurable improvement methods. Through the multiplic
disteu
- DISTEU Function DISTEU Pairwise Euclidean distances between columns of two matrices Input: x, y: Two matrices whose each column is an a vector data. Output: d: Element d(i,j) will be the Euclidean distance between two
An-expanding-SOM
- 自组织映射（SOM）已成功处理的欧式旅行的鹅岭推销员问题（TSP）。通过将其邻域保持财产和 凸包属性数值模拟TSP，我们引入了一个新的SOM如神经网络，称为前panding的SOM（ESOM）的。在每一个学习的迭代，ESOM提请接近的兴奋神经元 输入的城市，并在此期间，推压它们向凸包ofcities合作。 ESOM可能收购邻里保护财产和凸包的属性 的TSP，因此它可以产生接近最优的解决方案。从理论上分析了其可行性 和经验。一个的系列ofexperiments进行合成和基准的T
CBR-filtering-algorithm
- 智能信息推荐系统能够通过用户偏好,利用信息过滤算法主动剔除无关信息。该文提出了一个基于案例推 理的职能信息推荐系统的架构,主要包含数据层、过滤层和结果展示层3个功能层次。设计了一个基于案例推理的 过滤算法,将用户对文本的评价定义为案例 采用归一化的Euclidean距离,计算用户之间的相似度。在一个公共数 据集上进行了不同过滤算法的recall值对比实验。结果表明,采用案例推理技术,对协同过滤的准确度有一定程度 的改善。 -CBR filtering algorithm an
ok
- Euclidean distance between two images
Road-Network-Aware-Trajectory-Clustering
- Mining trajectory data has been gaining significant interest in recent years. However, existing approaches to trajectory clustering are mainly based on density and Euclidean distance measures. We argue that when the utility of spatial clustering of
Euclidean
- 扩展的Euclidean算法不仅能够被用于计算gcd（a，b），而且能够找到满足等式ax+by=d的整数x和y。-Extended Euclidean algorithm can be used to calculate gcd (a, b), and can be found to satisfy the equation ax+ by = d integers x and y.
mining-p.zip
- Data mining is the process of extracting potentially useful information from a data set. Clustering is a popular data mining technique which is intended to help the user discover and understand the structure or grouping of the data in the set accord
hand-gesture-recognition
- Pattern recognition and Gesture recognition are the growing fields of research. Being a significant part in non verbal communication hand gestures are playing vital role in our daily life. Hand Gesture recognition system provides us an innovative,
liti--Vision
- 3篇立体视觉算法文献，适合初学者学习立体视觉编程阅读- A simple and efficient rectification method for general motion A compact algorithm for rectification of stereo pairs Quasi-Euclidean Uncalibrated Epipolar Rectification
fenxing
- 分维，又称分形维或分数维，作为分形的定量表征和基本参数，是分形理论的又一重要原则。长期以来人们习惯于将点定义为零维，直线为一维，平面为二维，空间为三维，爱因斯坦在相对论中引入时间维，就形成四维时空。对某一问题给予多方面的考虑，可建立高维空间，但都是整数维。在数学上，把欧氏空间的几何对象连续地拉伸、压缩、扭曲，维数也不变，这就是拓扑维数。然而，这种传统的维数观受到了挑战。曼德布罗特曾描述过一个绳球的维数：从很远的距离观察这个绳球，可看作一点(零维)；从较近的距离观察，它充满了一个球形空间(三维)；
965214_459665797458303_1054148210_o
- Polar is a planning application for graphical presentation of Euclidean objects. Unit continuously validate algorithms for example - arythmetischen empty
meifiu_v81
- 处理信号的时频分析，计算两个矩阵之间的欧氏距离，搭建OFDM通信系统的框架。- When processing a signal frequency analysis, Calculation of the Euclidean distance between the two matrices, Build a framework OFDM communication system.
gx841
- 计算两个矩阵之间的欧氏距离，多机电力系统仿真及其潮流计算，包括回归分析和概率统计。- Calculation of the Euclidean distance between the two matrices, Multi-machine power system simulation and flow calculation, Including regression analysis and probability and statistics.
mtxki
- MinkowskiMethod算法 ,多抽样率信号处理，基于欧几里得距离的聚类分析。- MinkowskiMethod algorithm, Multirate signal processing, Clustering analysis based on Euclidean distance.
uarqc
- 基于欧几里得距离的聚类分析，基于人工神经网络的常用数字信号调制，利用最小二乘法进行拟合多元非线性方程。- Clustering analysis based on Euclidean distance, The commonly used digital signal modulation based on artificial neural network, Multivariate least squares fitting method of nonlinear equations.
7464
- 基于欧几里得距离的聚类分析，相控阵天线的方向图（切比雪夫加权），DSmT证据推理的组合公式计算函数。- Clustering analysis based on Euclidean distance, Phased array antenna pattern (Chebyshev weights), Combination formula DSmT evidence reasoning calculation function.
ne642
- AHP层次分析法计算判断矩阵的最大特征值,matlab实现了五类灰色关联度模型的计算,计算两个矩阵之间的欧氏距离。- Calculate the maximum eigenvalue judgment matrix of AHP, matlab implements five gray correlation degree computing model, Calculation of the Euclidean distance between the two matrices.
wvrxu
- 基于欧几里得距离的聚类分析，计算多重分形非趋势波动分析，采用的是脉冲对消法。- Clustering analysis based on Euclidean distance, Calculate the multifractal trend fluctuation analysis, It uses a pulse of consumer law.