| 1. | Algorithm for trail outliers in electronic shopping
一种对电子商店中孤立点进行跟踪的算法 |
| 2. | Outlier data optimal identifying and detection of based on chaotic
基于混沌的孤立点最优识别与探测 |
| 3. | Research result shows that incorrectness data cleaning method based on outlier detection can detect incorrectness data of data source effectively
研究表明：基于孤立点检测的错误数据清理方法能有效地检测数据源中的错误数据。 |
| 4. | Based on analyzing the common outlier detection method , an effective outlier detection method is used to detect the outliers in data source
在对常用孤立点检测方法进行比较、分析的基础上，采用一种有效的孤立点检测方法来检测数据源中的孤立点。 |
| 5. | Experiments demonstrate that neoren algorithm yields accurate results for clusters with arbitrary shapes , variable sizes , variable densities and outliers
对典型数据的测试结果表明， neoren聚类算法能够发现任意形状、大小、密度的簇，对孤立点也很健壮。 |
| 6. | The disadvantages and advantages of these algorithms are compared . third , based on the algorithm of based - cell outlier detection , an outlier - analysis algorithm to reduce the boundary influence is presented
第三，在基于单元的孤立点发现算法的基础上，提出了一种减少边缘影响的孤立点分析算法。 |
| 7. | Aiming at incorrectness data appeared in data source , the importance of outlier detection method in data cleaning is analyzed , and an incorrectness data cleaning method based on outlier detection is proposed
摘要针对数据源中出现的错误数据，分析了孤立点检测方法在数据清理中的重要性，提出了一种基于孤立点检测的错误数据清理方法。 |
| 8. | 3 . in this paper , the way of the traditional deleting fault character is improved . during the realization , we find the improved way can delete the fake port , isolated point and fake thripoint more validly
对传统的去除伪特征点的算法进行改进，在具体实现过程中发现，改进后的去伪算法能更加有效地去除伪端点、孤立点和伪三叉点。 |
| 9. | First , we must filter the image to reduce noises , this process includes two phase : one is using the nearest neighbor middle filter ( knnmf ) to reduce the isolated noises , the other is using gauss filter to remove white noises
首先对图像进行滤波去除噪声。滤波包括两个阶段：一是进行最近邻中值滤波( knnmf ) ，以去除孤立点噪声，再进行高斯平滑，去除白噪声。 |
| 10. | There are seventeen graphs and each graph has six points and seven edges . firstly kang qingde and tian zihong have completed two graphs that we can see in [ 7 ] . secondly i have completed three graphs that we can see in [ 8 ]
六点七边图(不带孤立点的简单图)共有17个图，首先在文章[ 7 ]中康庆德和田子红解决了两个图g _ 1和g _ 2 ，然后在文章[ 8 ]中我解决了三个图g _ 3 ， g _ 4和g _ 5 。 |
