KNN algorithm is a common and effective text categorization algorithm.
KNN算法是一种常用的效果较好的文本分类算法。
In this paper, we proposed an automatic keyword extraction method based on KNN method.
本文利用K最近邻方法的思想，提出了一种基于K最近邻的关键词自动抽取方法。
This paper presents a fast text classification algorithm based on KNN (K Nearest Neighbor).
提出了一种基于K近邻(KNN)原理的快速文本分类算法。
AIRS results in the memory cell pool after it is trained and classifies the original antigens by KNN.
AIRS通过训练产生记忆细胞池，利用最近邻原理对原始抗原分类。
It plays an instructional role in academic study and practical application of KNN text classification algorithm.
对KNN文本分类算法的理论研究和实际应用起了指导作用。
As we all know, KNN method is a classic method in machine learning field and is also well used in many other fields.
众所周知，K最近邻方法作为机器学习领域的一个经典的方法，在很多领域都有出色的表现。
In the paper, what is the typical sample of KNN is analyzed, and a method of samples selection based density is presented.
论文针对KNN这种常用的文本分类方法，分析了什么是它的典型样本，提出了一种基于密度的样本选择算法。
In basic KNN algorithm, the K is fixed for different processing texts, and the weights of similarity for neighbors are equal.
但是标准KNN算法中，近邻的数目K对所有处理文本都是一样的，而判断类别时加权的仅仅是文本之间的相似度。
Improved KNN algorithm by using the combination technology, and applied it to the forecast of non-mining fracture of shaft-lining of mine.
利用组合技术对KNN算法进行改进，并将其应用于煤矿立井井筒非采动破裂的预测。
The KNN based music source separation algorithm utilizes prior information of music source which can also achieve music source separation.
K最近邻的信号分离算法中，较多地采用了乐音信号的先验信息，一定程度上可实现信号分离。
The experiment result has proved that the method can improve the class's categorization effect with fewer training samples of KNN algorithm.
实验结果表明此方法有效改善了KNN算法对少数类分类效果。
So, the traditional KNN arithmetic, clusters training document with highly overlapping word is improved, central vector of cluster is gained.
为此，改进了传统KNN算法，将训练文本中相似度大的文本合并，称为一簇，并计算簇的中心向量。
In this paper, a flexible KNN algorithm is developed with varying-K algorithm and weighting algorithm, which improves the effect of text categorization.
基于近邻序列的排序，提出了变k算法，并且结合效果较好权重算法，形成了柔性的KNN算法，提高了分类的效果。
KNN query is one of the most representative queries in multimedia database management system. It shows the result of k objects nearest to the query point.
KNN查询是多媒体数据库管理系统中最具代表性的查询方式之一，它将k个与查询点最接近的对象作为查询结果返回。
The conceptual approach for the KNN Media Center is to design a building that embodies the virtue and youthful energy depicted in KNN's vast experience of reporting.
为最近邻媒体中心的概念方法是设计一个建筑，体现了美德和青春活力，在最近邻的报告描绘的丰富经验。
Most of the content-based filtering algorithms are based on vector space model, of which Naive Bayes algorithm and K-Nearest Neighbor (KNN) algorithm are widely used.
基于内容的过滤算法大多数是基于向量空间模型的算法，其中广泛使用的是朴素贝叶斯算法和K最近邻（KNN）算法。
In fall 2009, the entry by Californian firm DRDS Architecture won the first prize in the architectural design competition for the new KNN Media Center in Busan, Korea.
2009年秋，由加利福尼亚公司DRDS建筑项目赢得了新KNN网络媒体中心在釜山，韩国建筑设计竞赛一等奖。
Experimental results show that B-KNN method remarkably outperforms KNN method, and it is more suitable for classification tasks with deep hierarchy categorization space.
实验结果表明，与KNN相比，B - KNN的性能有较大提升，更适用于具有较深层次类型空间的文本分类应用。
Feature weighting is one of the important problems for feature weighting based KNN algorithm, and many heuristic methods have been employed to solve the problem traditionally.
特征权重学习是基于特征赋权的K近邻算法需要解决的重要问题之一，传统上提出了许多启发式的学习方法。
At last put the difference into KNN to judge the video embedded message whether or not. The experimental result shows this method has better performance then collusion method.
最后与线性共谋攻击检测算法进行对比，实验结果表明该隐写检测算法性能得到了进一步提高。
The kernel based weighted KNN algorithm solves the multi peak distribution problem and the overlap boundary problem of the sample set, as well as the classifier's precise decision problem.
基于核的距离加权KNN算法解决了样本的多峰分布、边界重叠问题和分类器的精确分类决策问题。
Then, this paper eliminates ambiguity of word meanings in text by WordNet. A representation of text based on concept is proposed later, and has been also applied to classification in SVM and KNN.
然后，介绍了传统的基于关键字的向量空间模型的文本分类的几个重要阶段，并着重介绍了其中的文本表示的相关技术和两种经典分类算法。
The traditional KNN has a fatal defect that time of similarity computing is huge. The practicality will be lost when the KNN is applied to WEB text categorization with high dimension and huge samples.
传统KNN方法的明显缺陷是样本相似度的计算量很大，使其在具有大量高维样本的Web文本分类中缺乏实用性。
The traditional KNN has a fatal defect that time of similarity computing is huge. The practicality will be lost when the KNN is applied to WEB text categorization with high dimension and huge samples.
传统KNN方法的明显缺陷是样本相似度的计算量很大，使其在具有大量高维样本的Web文本分类中缺乏实用性。
应用推荐