Criteria for Weighted Moving-Mean Method

The moving-mean method is one of the conventional approaches for trend-extraction from a data set. It is usually applied in an empirical way. The smoothing degree of the trend depends on the selections of window length and weighted coefficients, which are associated with the change pattern of the data. Are there any uniform criteria for determining them? The present article is a reaction to this fundamental problem. By investigating many kinds of data, the results show that: 1) Within a certain range, the more points which participate in moving-mean, the better the trend function. However, in case the window length is too long, the trend function may tend to the ordinary global mean. 2) For a given window length, what matters is the choice of weighted coefficients. As the five-point case concerned, the local-midpoint, local-mean and global-mean criteria hold. Among these three criteria, the local-mean one has the strongest adaptability, which is suggested for your usage.

改进k-means的多域光纤通信非线性失真补偿方法

为了解决光纤通信信号在传输过程中受到非线性影响而产生的失真问题,提高光纤通信系统的稳定性,提出了改进k-means的多域光纤通信非线性失真补偿方法。构建多域光纤通信传输模型,在传输端利用波长转换器将输入信号传输到光纤,结合干扰原理线性化脉冲恢复光信号。以信噪比描述光纤通信的色散特性,明确信号交互出现非线性失真变化。通过Dijkstra方法改进k-means方法,解调失真星座,避免聚类陷入局部最优,使全部簇信号尽可能接近原始调制中心,实现失真补偿。实验结果表明:利用所提方法对光纤通信非线性失真进行补偿后,聚类效果较佳,信息误码率可降至10^(-7),有效减少了网络传输消耗,提高光纤通信信号质量。

基于改进K-means算法的物流配送中心选址研究

针对传统K-means算法需要主观设定K值及无法处理类别型数据问题,文章运用肘部法及轮廓系数法确定合理K值,对类别型数据采取独热编码(One-Hot Encoding)转换为可以处理的连续型数据,并将其运用到在物流配送中心选址中;并综合考虑多种类别的影响因素,构建了相应的影响因素指标体系,提出的模型能够识别输入数据的数值型及类别型数据,实现样本的有效聚类。相关的案例分析结果表明,相比传统K-means聚类,文章的改进K-means算法选址结果可使物流总成本降低8.76%,运营成本降低14.85%,固定成本降低8.09%,效果显著。

基于改进K-means的局部离群点检测方法

离群点检测任务是指检测与正常数据在特征属性上存在显著差异的异常数据。大多数基于聚类的离群点检测方法主要从全局角度对数据集中的离群点进行检测,而对局部离群点的检测性能较弱。基于此,本文通过引入快速搜索和发现密度峰值方法改进K-means聚类算法,提出了一种名为KLOD(local outlier detection based on improved K-means and least-squares methods)的局部离群点检测方法,以实现对局部离群点的精确检测。首先,利用快速搜索和发现密度峰值方法计算数据点的局部密度和相对距离,并将二者相乘得到γ值。其次,将γ值降序排序,利用肘部法则选择γ值最大的k个数据点作为K-means聚类算法的初始聚类中心。然后,通过K-means聚类算法将数据集聚类成k个簇,计算数据点在每个维度上的目标函数值并进行升序排列。接着,确定数据点的每个维度的离散程度并选择适当的拟合函数和拟合点,通过最小二乘法对升序排列的每个簇的每1维目标函数值进行函数拟合并求导,以获取变化率。最后,结合信息熵,将每个数据点的每个维度目标函数值乘以相应的变化率进行加权,得到最终的异常得分,并将异常值得分较高的top-n个数据点视为离群点。通过人工数据集和UCI数据集,对KLOD、LOF和KNN方法在准确度上进行仿真实验对比。结果表明KLOD方法相较于KNN和LOF方法具有更高的准确度。本文提出的KLOD方法能够有效改善K-means聚类算法的聚类效果,并且在局部离群点检测方面具有较好的精度和性能。

一种基于K-means聚类算法的沙尘天气客观识别方法

鉴于以往基于污染物浓度时间序列进行分析的沙尘天气识别方法在判断标准上存在一定的主观性,本文提出一种基于K-means聚类算法的沙尘天气客观识别方法。本方法利用环境监测总站的PM2.5和PM10小时浓度资料进行聚类,首先选取最优的分类数目K进行聚类,其次对聚类结果中离散程度较高的类别进行再次聚类,直到无需分类。将本方法应用于西安市2018年2~4月沙尘天气的识别中,结果表明,本方法可有效识别主要沙尘天气。此外,利用本方法可得到沙尘天气典型特征:PM2.5占PM10浓度的比例小于43.5%、PM10浓度高于228μg/m^(3,)符合沙尘天气期间PM10浓度较高且以粗颗粒物为主的物理特征。总体上看,本方法物理基础清晰,可操行性强,适用于大规模数据处理,具有较好的实用价值和应用前景。

基于K-means聚类的相控阵任意形状波束子阵综合方法

传统相控阵由于设计复杂性和成本过高,已经不能满足日益增长的应用需求,子阵划分等技术较好地解决了这个问题。本文提出一种任意形状波束相控阵子阵综合方法,在激励匹配策略下,将子阵综合问题转化为一个子阵布局优化问题,而子阵的复激励可解析地从参考阵列激励计算得到。利用一种无监督聚类K-means方法对子阵布局优化问题进行求解,该方法能同时对子阵的激励幅相进行优化,增加了子阵综合的自由度和灵活性。在任意形状波束子阵综合数值算例中,通过与传统智能优化方法在方向图逼近、激励匹配代价函数、阵列性能参数及计算效率等方面的比较,验证了所提方法的有效性。

基于K-means的多级迭代分区坐标转换方法研究

不同于传统坐标转换,大区域坐标转换通常采用分区转换的方法来保证精度,不同的分区策略对最后的转换精度有很大的影响。因此,大区域坐标转换分区方法的研究有着重要的意义。在分析大区域坐标转换特性的基础上,重点探讨了K-means算法的适用性,提出了一种基于K-means的多级迭代分区坐标转换方法。通过实例验证了方法的可行性,既适应于不同面积、不同坐标点分布的情况,又能提高坐标转换的精度。

融合充放电曲线特征与改进K-means聚类的退役锂电池分选方法

为提高退役锂电池分选重组的一致性,提出一种融合电压曲线与能量曲线的数值特征与形态特征,并运用欧氏距离和形态距离进行K-means聚类的分选方法。通过试验获取退役锂电池充放电曲线,融合电压曲线和能量曲线作为分选依据;采用欧式距离度量融合曲线的数值差异;利用分位数方法将融合曲线转化为描述曲线形态变化的特征序列,运用最长公共子序列算法提取特征序列的形态距离用来度量融合曲线的形态差异;以融合曲线的欧式距离和特征序列的形态距离为度量判据,采用改进K-means聚类算法对退役锂电池进行聚类。结果表明:相较于电压曲线或容量曲线分选,采用融合曲线分选,容量、充电电压、放电电压一致性最大提高约23%、93%、16%。相较于欧式距离方法,采用改进K-means算法,容量、充电电压、放电电压一致性最大分别提高了约67%、40%、51%。

基于K-Means聚类算法的井下电缆双端在线局放定位方法

常规的电缆局放定位方法以反射信号识别与定位为主,时间同步偏差相对较大,影响最终的局放定位精准度,因此设计了基于K-Means聚类算法的井下电缆双端在线局放定位方法。该方法通过提取井下电缆双端行波模量特征,将井下电缆局放信号进行相模变换,分析相应电荷气隙平衡条件,获取更加准确的双端局放位置。基于K-Means算法构造电缆在线局放定位聚类中心,将空间距离相似的电缆进行局放判断,排除异常定位数据对聚类结果的影响,从而减小定位误差。采用对比实验验证了该方法的定位精准度高,能应用于实际生活中。

基于K-Means聚类的思政教育资源个性化推荐

思政教育可以体现中国特色社会主义本质要求,因此研究基于K-Means聚类的思政教育资源个性化推荐方法。首先,根据两组相邻用户之间的共同喜好,划分思政教育资源个性化推荐等级。其次,选择协同过滤算法归一化样本数据,计算相似度制定用户偏好,构建思政教育资源推荐模型。最后,基于K-Means聚类算法给定目标函数,建立个性化推荐流程,实现思政教育资源推荐,完成方法设计。实践表明,该方法既能够满足思政教育资源的匹配,又能够保证用户对思政教育资源的喜爱程度,具有实际的应用效果。

Calculation of Significant Wave Height Using the Linear Mean Square Estimation Method

Significant wave height is an important criterion in designing coastal and offshore structures.Based on the orthogonality principle, the linear mean square estimation method is applied to calculate significant wave height in this paper.Twenty-eight-year time series of wave data collected from three ocean buoys near San Francisco along the California coast are analyzed.It is proved theoretically that the computation error will be reduced by using as many measured data as possible for the calculation of significant wave height.Measured significant wave height at one buoy location is compared with the calculated value based on the data from two other adjacent buoys.The results indicate that the linear mean square estimation method can be well applied to the calculation and prediction of significant wave height in coastal regions.

Geochemical and Geostatistical Studies for Estimating Gold Grade in Tarq Prospect Area by K-Means Clustering Method

Tarq geochemical 1:100,000 Sheet is located in Isfahan province which is investigated by Iran’s Geological and Explorations Organization using stream sediment analyzes. This area has stratigraphy of Precambrian to Quaternary rocks and is located in the Central Iran zone. According to the presence of signs of gold mineralization in this area, it is necessary to identify important mineral areas in this area. Therefore, finding information is necessary about the relationship and monitoring the elements of gold, arsenic, and antimony relative to each other in this area to determine the extent of geochemical halos and to estimate the grade. Therefore, a well-known and useful K-means method is used for monitoring the elements in the present study, this is a clustering method based on minimizing the total Euclidean distances of each sample from the center of the classes which are assigned to them. In this research, the clustering quality function and the utility rate of the sample have been used in the desired cluster (S(i)) to determine the optimum number of clusters. Finally, with regard to the cluster centers and the results, the equations were used to predict the amount of the gold element based on four parameters of arsenic and antimony grade, length and width of sampling points.

RESEARCH ON THEORETIC EVIDENCE AND REALIZATION OF DIRECTLY-MEAN EMD METHOD

Emprical mode decomposition(EMD) is a method and principle of decomposing signal dealing with Hilbert-Huang transform (HHT) in signal analysis, while directly-mean EMD is an improved EMD method presented by N.E.Huang, the inventor of HHT, which is aimed at solving the problems of EMD principle. Although the directly-mean HMD method is very remarkable with its advantages and N. E. Huang has given a method to realize it, he did not find the theoretic evidence of the method so that the feasibility of the idea and correctness of realizing the directly-mean EMD method is still indeterminate. For this a deep research on the forming process of complex signal is made and the involved stationary point principle and asymptotic stationary point principle are demonstrated, thus some theoretic evidences and the correct realizing way of directly-mean EMD method is firstly presented. Some simulation examples for demonstrating the idea presented are given.

Fast-moving target tracking based on mean shift and frame-difference methods

The mean shift tracker has difficulty in tracking fast moving targets and suffers from tracking error accumulation problem. To overcome the limitations of the mean shift method, a new approach is proposed by integrating the mean shift algorithm and frame-difference methods. The rough position of the moving tar- get is first located by the direct frame-difference algorithm and three-frame-difference algorithm for the immobile camera scenes and mobile camera scenes, respectively. Then, the mean shift algorithm is used to achieve precise tracking of the target. Several tracking experiments show that the proposed method can effectively track first moving targets and overcome the tracking error accumulation problem.

A simplified two-dimensional boundary element method with arbitrary uniform mean flow

To reduce computational costs, an improved form of the frequency domain boundary element method（BEM） is proposed for two-dimensional radiation and propagation acoustic problems in a subsonic uniform flow with arbitrary orientation. The boundary integral equation（BIE） representation solves the two-dimensional convected Helmholtz equation（CHE） and its fundamental solution, which must satisfy a new Sommerfeld radiation condition（SRC） in the physical space. In order to facilitate conventional formulations, the variables of the advanced form are expressed only in terms of the acoustic pressure as well as its normal and tangential derivatives, and their multiplication operators are based on the convected Green＇s kernel and its modified derivative. The proposed approach significantly reduces the CPU times of classical computational codes for modeling acoustic domains with arbitrary mean flow. It is validated by a comparison with the analytical solutions for the sound radiation problems of monopole,dipole and quadrupole sources in the presence of a subsonic uniform flow with arbitrary orientation.

改进萤火虫算法与 K-means 算法结合的 配电网负荷聚类特性分析

负荷聚类特性分析是实现配电网的定制电力、高品质供电、高可靠性供电的重要基础.然而现有的Kmeans聚类分析方法,受限于数据样本集和聚类初始中心的选取等,会出现因初始中心不同造成聚类结果差异大的问题.为此,针对配电网负荷数据特点,提出一种基于改进萤火虫算法和K-means算法结合的配电网负荷聚类特性分析方法.利用萤火虫优化算法全局搜索能力强的优势,考虑类内相似度和类间差异度,寻优K-means算法初始中心,使聚类结果的聚类有效性指标取得最小值;进一步针对萤火虫算法在处理负荷数据时的弱点,通过密度法为萤火虫算法加入优秀初代个体,改进吸引公式以及个体间概率吸引移动的方式优化迭代过程中的个体移动方式,加快萤火虫算法前期收敛速度,并实现后期稳定收敛,算法更快地接近极值,计算速度更快.算例验证了本文所提算法的聚类有效性,并针对某配电台区电力负荷数据,寻得K-means算法最优初始中心,使得聚类结果的戴维森堡丁指标(Davies-Bouldin index,DBI)最小,负荷聚类结果类内差异小,类间差异大,最终聚类中心的特征代表性强,为负荷类型划分、聚类特性分析提供重要依据,为需求侧差异化电力服务定制奠定有力基础.

基于K-means聚类和熵值法的二次供水水质评估

针对二次供水水质评价和智慧化运维管理的需求,对2类主要的二次供水在线监测指标(余氯、浊度)进行数据质量评价工作,并对4种主要的二次供水水质影响因子作方差分析和协方差分析,提出基于K-means聚类法和熵值法的二次供水在线监测水质评价方法,并将该水质评价方法应用在L市的二次供水管理系统中。研究结果表明,在线监测水质评价方法为二次供水管理者提供重要参考,可在二次供水水质管理中推广应用。

基于K-means聚类的多智能体跟随多领导者算法

为防止多智能体集群跟随多个领导者时编队混乱,提出了3种K-means聚类算法,将集群分成与领导者数量相同的社区,社区内的智能体将跟随同一领导者。所提出的3种算法中,算法1适用于智能体分布空间广的场景,系统达到一致性所需时间最短;算法2则适用于智能体分布稀疏的场景,可有效避免智能体碰撞等危险;算法3则大大降低多智能体集群的控制成本,但将会牺牲系统的收敛速度。相较于传统预先对智能体编号,领导-跟随关系固定的方法,本文提出的分簇方法使系统收敛时间更短,且有效应对中途任务变更的情况,可快速分配给智能体新的合适任务。

基于改进K-means与组合赋权的智能变电站二次系统信息质量评价

随着变电站的智能化和信息化水平突飞猛进,变电站产生和存储的数据越来越多,数据异常和数据缺失等数据质量问题逐渐突出。作为提高数据质量的基础和前提,智能变电站二次系统数据质量评价尤为重要。文章提出一种基于改进K-means和组合赋权法的智能变电站二次系统信息质量评价方法,该方法首先通过正确性、完善性等6个指标对智能变电站二次系统的信息多层次、全方位分析,解决传统智能变电站二次系统信息质量评价指标单一、评价体系简单的问题;其次,针对智能变电站二次系统数据处理的实时性以及准确性的问题,采用改进K-means算法对数据进行预处理;再次,采用变异系数法与序关系法对评价指标进行组合赋权,使权重既带有客观因素,也包含专家的主观判断,从而使评价结果真实可靠;最后,以仿真数据为例说明该方法的有效性。

基于耿贝尔-线性矩和K-Means算法的短时强降水等级划分研究

短时强降水地域特点突出,致灾性强,是气象防灾减灾的重点和难点.本文基于1951—2021年国家气象观测站逐小时降水资料,采用耿贝尔—线性矩法拟合2215个国家气象观测站的1 h、3 h、6 h短时强降水的重现期分布,统计显示99%以上的国家气象观测站分布函数通过0.05显著性检验;同时,根据我国防洪标准、室外排水设计规范及中央气象台山洪预警等标准,将短时强降水按照重现期2 a、20 a、50 a、100 a划分为一般、较强、强、特强四个等级.然后,采用K-Means算法,应用耿贝尔函数的位置参数和尺度参数、短时降水的百分位值和极值等变量聚类,将我国划分为三个短时强降水区,量化了三个区的短时强降水等级并应用2019—2021年70490个区域自动观测站和国家气象观测站监测统计验证了合理性.研究成果可以满足气象业务应用需求,也为气象监测、预报预警和影响评估提供技术支撑.