说明:双击或选中下面任意单词,将显示该词的音标、读音、翻译等;选中中文或多个词,将显示翻译。
您的位置:首页 -> 词典 -> 二阶段近似最近邻离群挖掘算法
1)  Two-Phase Approximate KNN Outliers Mining(TPOM)
二阶段近似最近邻离群挖掘算法
1.
In this paper,we targeted at high-dimensional datasets and presented Two-Phase Approximate KNN Outliers Mining(TPOM),an algorithm of two-phase based approximate KNN outliers mining.
针对高维大数据集,提出了二阶段近似最近邻离群挖掘算法(TPOM),在聚类的基础上,通过加速最近邻查询和改善剪枝效率,提高了循环嵌套KNN算法的离群检测效率。
2)  approximately mining
近似挖掘
3)  approximate proximal algorithm
近似邻近点算法
1.
This paper presents a approximate proximal algorithm finding the zero of a maximal monotone operator in Hilbert space,whose error criterion is weaker than that in the literatures.
在Hilbert空间中给出求极大单调算子零点的近似邻近点算法,给出的误差准则比现有的算法弱,并证明该算法生成的序列{xk}弱收敛到算子的零点。
4)  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的选择特点。
5)  nearest neighbor algorithm
最近邻算法
1.
It is a deterministic algorithm, with its time complexity the same as the nearest neighbor algorithm, that is, O(n2), where n is the number of cities.
提出了一种求解平面旅行商问题的新算法——绕中心周游法,它是一种确定型算法,时间复杂性与最近邻算法相同,为O(n2),其中n为城市数。
2.
The decline of recommending quantity resulted in the extreme sparsity of user data was dealt with,based on nearest neighbor algorithm and the combination of selective sampling and lookahead framework for recommendation system,with the purpose of improving the accuracy of recommendation.
着眼于由用户数据的极端稀疏性所导致的推荐质量下降问题,基于最近邻算法,将随机抽样算法结合前瞻框架,应用于推荐系统,旨在提高推荐精度。
6)  Nearest-neighbor algorithm
最近邻算法
1.
This algorithm is improved on the basis of the nearest-neighbor algorithm, and is turned from the partial optimization into the overall optimization, that is turning minimum distance issue into minimum coefficient of average distance issue.
提出了一种基于最小距离均衡系数的TSP求解算法,该算法在最近邻算法(NearestneighborAlgorithm)的基础上进行了改进,引入了距离均衡系数的概念,把优化方法从局部最优转化为全局最优,即将最短路径问题转化为最小距离均衡系数问题。
2.
A nearest-neighbor algorithm was used to determine the water usage network including regeneration units.
以固定再生出口浓度为基准,提出确定合理再生流股的方法,基于累积流量一累积污染质量负荷组合曲线图得出最小再生水流量,并运用最近邻算法确定包含再生单元的用水网络。
3.
The relation of vector and point in space could show the relation of the fuzzy image and the original image,contacting nearest-neighbor algorithm to use the method in computational optical section microscopy(COSM).
依据同源连续性原理,通过分析高维空间中向量的方向和点的位置关系来研究模糊图像与原图像的空间关系,并且结合最近邻算法,将该算法应用于去除最近邻算法所得图像的本层模糊。
补充资料:离群
1.离开众人。 2.超群。
说明:补充资料仅用于学习参考,请勿用于其它任何用途。
参考词条