搜索资源列表
AP
- AP算法的简单实现，affinity propagation算法-Simple implementation of the AP algorithm, affinity propagation algorithm
OOPMCMS_Friend
- 该压缩文件用c++语言设置了一个有缘函数的学生信息登录界面，具有登录删除，修改学生信息等功能-The compressed file to set up an affinity function of student information to the login screen, c++ language, login to delete, and modify student information functions
sc
- 实现SC谱聚类算法，该算法首先根据给定的样本数据集定义一个描述成对数据点相似度的亲合矩阵,并且计算矩阵的特征值和特征向量，然后选择合适 的特征向量聚类不同的数据点-Achieve the SC spectral clustering algorithm Firstly, a descr iption of the similarity of paired data points affinity matrix based on the given sample data set definiti
WindowsApplication1
- 线程委托等待界面、、线程委托等待界面线程委托等待界面-Event wait handles do not have thread affinity
apclusterK
- 用matlab写的affinity propagation对英文文档进行聚类处理，适合短文本，且可指定cluster个数-Using affinity propagation to cluster english documents
apcluster
- AP聚类算法：Affinity Propagation (AP) 聚类是最近在Science杂志上提出的一种新的聚类算法。-Affinity Propagation (AP) 聚类是最近在Science杂志上提出的一种新的聚类算法。它根据N个数据点之间的相似度进行聚类,这些相似度可以是对称的,即两个数据点互相之间的相似度一样(如欧氏距离) 也可以是不对称的,即两个数据点互相之间的相似度不等。这些相似度组成N×N的相似度矩阵S(其中N为有N个数据点)。AP算法不需要事先指定聚类数目,相反它将所有的
apcluster
- ap算法代码简单易懂，便于操作，实现起来比较容易-affinity proparation
net_server11
- QT TCPSERVER多线程服务器本文参考了http://mobile.51cto.com/symbian-272733_1.htm和http://mobile.51cto.com/symbian-268690_1.htm两篇好文章，这个两篇文章各有不足，第一篇 解释QThread线程工作的原理，但是没有具体直观的多线程实例，第二篇则给出了多线程服务器端建立的实例，但是多线程并没有真正的在不同的线程工作，本文依据第一篇博文， 在第二篇的基础上修改，从debug的结果来看，实现了文件在新
region-match
- 图像的区域匹配，输入：两幅图像分割之后的邻接矩阵，还有两幅图像分割区域的每个块之间的相似度，就可以得出区域一对一匹配的关系-region match input：Adjacency matrix of picture A,B and Affinity matrix represent the Affinity of the every regions between pictures output:one-to-one match between regions of two pictu
testqstring
- Text Affinity Source Code for Linux.
APclustering
- Affinity propagation clustering matlab code.
AP-clustering
- Affinity Propagation(AP)聚类方法的原始版本，并附加了在Science杂志上的原文献，对于研究AP算法的人会有很多参考价值。-The original version of the AP clustering method. Attached the original documents in the journal Science,it will have a lot of reference value for studying the AP algorithm.
icml2010-code(2)
- Power Iteration Clustering projection Input: W - row-normalized affinity matrix v0 - starting vector conv - convergence threshold maxit - maximum number of iterations Output: vt - 1-d PIC embedding i - iterations ran
GG
- CPU的亲和性的详细说明，对多核编程有一定帮助，收益很大-A detailed descr iption of the CPU affinity for multicore programming have some help, a significant return
code
- 这是传统的仿射传播算法的基本代码和Sil有效评价指标的基本代码，举例说明了一下，操作简单易学、易掌握-This is the basic code of affinity propagation algorithm of traditional basic code and Sil effective evaluation index, illustrated, easy to learn, easy to master
apclusterk
- 相似性传播聚类，不需要初始化聚类中心，聚类速度优于k-maans，k-centers等聚类算法-Affinity propagation clustering, do not need to initialize the cluster center, cluster velocity than k-maans, k-centers clustering algorithm, etc.
ELSA_v0.1.tgz
- This package contains the code for the Enhanced Local Subspace Affinity (ELSA) with Enhanced Model Selection (EMS+) and number of motions estimation based on the eigenvalue spectrum of the Symmetric Normalized Laplacian matrix.-This package co
MATLAB-Files
- File 1: THIS CODE IS USED TO DRAW THE PUMP CURVES AT DIFFERENT PUMP SPEED 1: PUMP CURVE 2: EFFICIENCY CURVE 3: BREAK HORSEPOWER CURVE 4: KW-INPUT CURVE File 2: THIS CODE IS FOR APPLYING THE WAY OF CALCULATING THE EFFICIENCY, POWER
HopkinsMultiviewMultibodyCode
- 这个算法包实现了多视角下多运动目标的检测和分割算法，主要有三种算法： GPCA 谱聚类法，RANSAC, 局部子空间仿射变幻法。- This package contains the code for the following multiview-multibody motion segmentation algorithms: - GPCA with spectral clustering - RANSAC - Local Subspace Affini
AP
- 近邻传播是一种较新颖的聚类方法，运算量少，聚类速度快。-Affinity Propagation is a new clustering method, which has a low calculation and high clustering speed.