1) Affinity propagation algorithm
近邻传播算法
1.
BBS post is a major form of short text Aiming to overcome the lack of information in short text,this paper proposes a modified K-means clustering algorithm, which introduces the idea of reconstruction to solve the feature sparseness problem and takes advantage of affinity propagation algorithm to select the initial cluster centers to overcome the sensitive issues of K-means algorithm.
该算法通过引入重构长文本的思想解决了短文本的稀疏性问题,并利用近邻传播算法对初始类别中心进行了优化选择,从而克服了K-means算法对初始点的敏感问题。
2) nearest neighbor algorithm
近邻算法
1.
Aiming at this problem and based on the true data of a certain company,the time series prediction by periods-model and case-based nearest neighbor algorithm was proposed,then their results are compared.
针对这个问题,以某电信公司一年的实际话务数据为基础,分别采用周期模型和基于实例的近邻算法进行话务量时间序列预测,并对比分析了两种预测方法的效果。
3) linear neighborhood propagation
线性近邻传递算法
4) propagation algorithm
传播算法
1.
Analyzing Rules of Active Database Based on Propagation Algorithm;
基于传播算法的主动数据库规则特性分析
5) nearest neighbor algorithm
最邻近算法
1.
Based on the K nearest neighbor algorithm,an improved method was proposed for selecting genes-related documents from biology literature,and then automatically annotating and classifying.
在K最邻近算法的基础上,采用了Chi-Square特征选择方案,并且在加权算法中突出了Chi-Square的选择特点。
6) proximal point algorithm
邻近点算法
1.
The convergence analysis of an approximate proximal point algorithm for monotone variational inequalities
求解单调变分不等式的近似邻近点算法的收敛性分析
2.
Proximal point algorithms(PPA) arc attractive methods solving monotone variational inequalities(VI).
邻近点算法(PPA)是求解单调变分不等式的一种常用的有效方法。
3.
An approximate proximal point algorithm for solving monotone variational inequalities is constructed,and the convergence of the algorithm is proved under the condition that any indirect step is not required.
给出求解单调变分不等式问题的一个近似邻近点算法,在不需要任何中间步骤的条件下证明算法的收敛性。
补充资料：近邻
挨得较近的邻居：远亲不如～。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条