期刊文献+
共找到135,853篇文章
< 1 2 250 >
每页显示 20 50 100
基于改进k-medoids聚类和碳约束的变压器状态异常大数据诊断方法研究
1
作者 宋金伟 李俊妮 +1 位作者 宣东海 吴海涵 《电测与仪表》 北大核心 2026年第5期20-29,共10页
为了进一步提升碳约束型变压器运行状态的诊断准确率和诊断效率,基于改进k-medoids聚类理论提出了变压器状态异常诊断方法,将变压器运行状态划分为正常、预警、异常、故障四种状态作为k-medoids聚类目标。模型获得变压器运行状态大数据... 为了进一步提升碳约束型变压器运行状态的诊断准确率和诊断效率,基于改进k-medoids聚类理论提出了变压器状态异常诊断方法,将变压器运行状态划分为正常、预警、异常、故障四种状态作为k-medoids聚类目标。模型获得变压器运行状态大数据,其中声纹特征指标采用梅尔倒谱特征作为衡量变压器异常振动声响的标准,对变压器运行大数据基于其物理特性进行归一化和标准化,便于聚类模型输入,针对传统k-medoids聚类过程引入三项措施进行改进,分别为基于局部密度评估的初始聚类中心生成、自适应替代方向调整以及聚类更新的混沌搜索,通过改进措施优化初始聚类中心生成并提升寻优效率,避免寻优过早陷入局部最优聚类点,将某地区碳约束型电网变压器历史运行大数据划分为训练组和测试组,基于训练组来进行k-medoids聚类网络的优化,并将训练完成的k-medoids聚类用于测试组的变压器运行状态聚类和诊断,验证了所提出模型的正确性和有效性。 展开更多
关键词 k-medoids聚类 变压器状态诊断 声纹特征 局部密度评估 自适应替代 混沌搜索
在线阅读 下载PDF
基于改进MPE和K-medoids的变压器绕组松动故障诊断 被引量:2
2
作者 马宏忠 薛健侗 +2 位作者 倪一铭 万可力 迮恒鹏 《高压电器》 北大核心 2025年第9期73-80,共8页
为了更加有效地对变压器绕组松动故障进行诊断,针对变压器有载运行时的振动信号,提出了一种基于改进多尺度排列熵(MPE)和K-medoids的变压器绕组松动故障诊断方法。首先采用粒子群优化(PSO)的MPE算法对绕组不同状态下的变压器振动信号进... 为了更加有效地对变压器绕组松动故障进行诊断,针对变压器有载运行时的振动信号,提出了一种基于改进多尺度排列熵(MPE)和K-medoids的变压器绕组松动故障诊断方法。首先采用粒子群优化(PSO)的MPE算法对绕组不同状态下的变压器振动信号进行特征提取,以减少MPE算法中参数设置对故障类型识别精度的影响,然后通过K-medoids聚类算法诊断变压器绕组松动故障,以完成故障的分类识别。对某10 kV变压器的绕组松动故障模拟实验结果表明,绕组不同状态下变压器振动信号的MPE值经PSO参数优化后存在明显差异,诊断效果优于传统经验设置参数的MPE算法,且稳定性得到提高。 展开更多
关键词 变压器 绕组松动诊断 粒子群优化的MPE算法 特征提取 k-medoids算法
在线阅读 下载PDF
基于K-Medoids提取信道状态特征的无人机探测方法 被引量:1
3
作者 宋玲玉 潘鹏 刘天乐 《电信科学》 北大核心 2025年第1期75-87,共13页
对低空目标的有效管控是推动低空经济发展的关键。城市环境中强杂波和建筑物遮挡等因素使得传统雷达探测手段难以实现对低速无人机的有效监测。基于此,提出了一种无人机探测的新思路,即通过识别信道状态特征的变化来判断无人机是否出现... 对低空目标的有效管控是推动低空经济发展的关键。城市环境中强杂波和建筑物遮挡等因素使得传统雷达探测手段难以实现对低速无人机的有效监测。基于此,提出了一种无人机探测的新思路,即通过识别信道状态特征的变化来判断无人机是否出现在指定区域。该方法的核心在于利用城市中已广泛部署的移动基站等外辐射源,基于K-Medoids聚类算法捕捉无人机出现后对原有多径信道路径数量的影响,从而实现对无人机的感知。该方法不需要构建精确的参考信号,也不需要利用多普勒体制抑制强杂波。仿真结果表明,所提方法在1 km~2范围内能实现80%以上的检测概率,且随着范围缩小,检测概率能达到90%左右,因此能够在城市场景下有效探测低空慢速无人机。 展开更多
关键词 无人机 信道状态信息 外辐射源 k-medoids算法
在线阅读 下载PDF
基于K-medoids-GBDT-PSO-LSTM组合模型的短期光伏功率预测 被引量:11
4
作者 戴朝辉 陈昊 +3 位作者 刘莘轶 夏长青 郭嘉毅 于立军 《太阳能学报》 北大核心 2025年第1期654-661,共8页
为保障电网供需平衡和安全稳定运行,提高大型光伏电站功率预测的精度,提出一种基于K中心点聚类算法(K-medoids)、梯度提升树(GBDT)和粒子群优化算法(PSO)组合优化的长短期记忆神经网络(LSTM)的光伏功率短期预测模型。首先,采用K-medoid... 为保障电网供需平衡和安全稳定运行,提高大型光伏电站功率预测的精度,提出一种基于K中心点聚类算法(K-medoids)、梯度提升树(GBDT)和粒子群优化算法(PSO)组合优化的长短期记忆神经网络(LSTM)的光伏功率短期预测模型。首先,采用K-medoids聚类算法对大规模光伏发电数据样本中的天气数据进行不同类别聚类,分为晴天、阴天和雨/雪天3种天气类型;然后,在已有数据基础上构造特征工程,使用GBDT算法分别进行特征重要性分析,筛选出对光伏功率预测具有显著影响的特征,并构建合适大小结构的优化数据集;最后,将重构后的数据集代入PSO算法优化的LSTM模型进行训练,以建立短期预测模型。实验结果表明,该模型拥有更高预测精度,相比单一LSTM模型,在雨/雪天下的RMSE指标降低了12.19%。 展开更多
关键词 光伏发电 功率预测 机器学习 长短期记忆网络 优化算法 粒子群算法
在线阅读 下载PDF
PID Steering Control Method of Agricultural Robot Based on Fusion of Particle Swarm Optimization and Genetic Algorithm 被引量:1
5
作者 ZHAO Longlian ZHANG Jiachuang +2 位作者 LI Mei DONG Zhicheng LI Junhui 《农业机械学报》 北大核心 2026年第1期358-367,共10页
Aiming to solve the steering instability and hysteresis of agricultural robots in the process of movement,a fusion PID control method of particle swarm optimization(PSO)and genetic algorithm(GA)was proposed.The fusion... Aiming to solve the steering instability and hysteresis of agricultural robots in the process of movement,a fusion PID control method of particle swarm optimization(PSO)and genetic algorithm(GA)was proposed.The fusion algorithm took advantage of the fast optimization ability of PSO to optimize the population screening link of GA.The Simulink simulation results showed that the convergence of the fitness function of the fusion algorithm was accelerated,the system response adjustment time was reduced,and the overshoot was almost zero.Then the algorithm was applied to the steering test of agricultural robot in various scenes.After modeling the steering system of agricultural robot,the steering test results in the unloaded suspended state showed that the PID control based on fusion algorithm reduced the rise time,response adjustment time and overshoot of the system,and improved the response speed and stability of the system,compared with the artificial trial and error PID control and the PID control based on GA.The actual road steering test results showed that the PID control response rise time based on the fusion algorithm was the shortest,about 4.43 s.When the target pulse number was set to 100,the actual mean value in the steady-state regulation stage was about 102.9,which was the closest to the target value among the three control methods,and the overshoot was reduced at the same time.The steering test results under various scene states showed that the PID control based on the proposed fusion algorithm had good anti-interference ability,it can adapt to the changes of environment and load and improve the performance of the control system.It was effective in the steering control of agricultural robot.This method can provide a reference for the precise steering control of other robots. 展开更多
关键词 agricultural robot steering PID control particle swarm optimization algorithm genetic algorithm
在线阅读 下载PDF
RRT^(*)-GSQ:A hybrid sampling path planning algorithm for complex orchard scenarios
6
作者 ZHU Qingzhen ZHAO Jiamuyang +1 位作者 DAI Xu YU Yang 《农业工程学报》 北大核心 2026年第3期13-25,共13页
Traditional sampling-based path planning algorithms,such as the rapidly-exploring random tree star(RRT^(*)),encounter critical limitations in unstructured orchard environments,including low sampling efficiency in narr... Traditional sampling-based path planning algorithms,such as the rapidly-exploring random tree star(RRT^(*)),encounter critical limitations in unstructured orchard environments,including low sampling efficiency in narrow passages,slow convergence,and high computational costs.To address these challenges,this paper proposes a novel hybrid global path planning algorithm integrating Gaussian sampling and quadtree optimization(RRT^(*)-GSQ).This methodology aims to enhance path planning by synergistically combining a Gaussian mixture sampling strategy to improve node generation in critical regions,an adaptive step-size and direction optimization mechanism for enhanced obstacle avoidance,a Quadtree-AABB collision detection framework to lower computational complexity,and a dynamic iteration control strategy for more efficient convergence.In obstacle-free and obstructed scenarios,compared with the conventional RRT^(*),the proposed algorithm reduced the number of node evaluations by 67.57%and 62.72%,and decreased the search time by 79.72%and 78.52%,respectively.In path tracking tests,the proposed algorithm achieved substantial reductions in RMSE of the final path compared to the conventional RRT^(*).Specifically,the lateral RMSE was reduced by 41.5%in obstacle-free environments and 59.3%in obstructed environments,while the longitudinal RMSE was reduced by 57.2%and 58.5%,respectively.Furthermore,the maximum absolute errors in both lateral and longitudinal directions were constrained within 0.75 m.Field validation experiments in an operational orchard confirmed the algorithm's practical effectiveness,showing reductions in the mean tracking error of 47.6%(obstacle-free)and 58.3%(with obstructed),alongside a 5.1%and 7.2%shortening of the path length compared to the baseline method.The proposed algorithm effectively enhances path planning efficiency and navigation accuracy for robots,presenting a superior solution for high-precision autonomous navigation of agricultural robots in orchard environments and holding significant value for engineering applications. 展开更多
关键词 ROBOT path planning ORCHARD improved RRT^(*)algorithm Gaussian sampling autonomous navigation
在线阅读 下载PDF
Path planning of unmanned surface vehicles based on improved particle swarm optimization algorithm with consideration of particle sight distance
7
作者 WANG Cheng YANG Junnan +3 位作者 ZHANG Xinyang QIAN Zhong ZHU Ye LIU Hong 《上海海事大学学报》 北大核心 2026年第1期9-19,共11页
To enhance the accuracy of path planning of unmanned surface vehicles(USVs),the particle swarm optimization algorithm(PSO)is improved based on species migration strategies observed in ecology.By incorporating the conc... To enhance the accuracy of path planning of unmanned surface vehicles(USVs),the particle swarm optimization algorithm(PSO)is improved based on species migration strategies observed in ecology.By incorporating the concept of particle sight distance,an improved algorithm,called SD-IPSO,is proposed for the real-time autonomous navigation of USVs in marine environments.The algorithm refines the individual behavior pattern of particles in the population,effectively improving both local and global search capabilities while avoiding premature convergence.The effectiveness of the algorithm is validated using standard test functions from CEC-2017 function library,assessing it from multiple dimensions.Sensitivity analysis is conducted on key parameters in the algorithm,including particle sight distance and population size.Results indicate that compared with PSO,SD-IPSO demonstrates significant advantages in optimization accuracy and convergence speed.The application of SD-IPSO in path planning is further investigated through a 14-point traveling salesman problem(TSP)example and navigation autonomous tests of USVs in marine environments.Findings demonstrate that the proposed algorithm exhibits superior optimization capabilities and can effectively address the path planning challenges of USVs. 展开更多
关键词 particle swarm optimization algorithm(PSO) sight distance unmanned surface vehicle(USV)
在线阅读 下载PDF
Millimeter wave imaging of Range Migration Algorithm with adaptive background filtering
8
作者 CHENG Zhi-Hua ZHOU Ran +3 位作者 WANG Meng YU Tao WANG Yu-Lan YAO Jian-Quan 《红外与毫米波学报》 北大核心 2026年第2期279-284,共6页
This paper proposes a novel Range Migration Algorithm(RMA)integrated with an adaptive background filtering method specifically designed for near-field millimeter-wave imaging scenarios where targets are in close proxi... This paper proposes a novel Range Migration Algorithm(RMA)integrated with an adaptive background filtering method specifically designed for near-field millimeter-wave imaging scenarios where targets are in close proximity to background structures.This method simulates the attention distribution mode of the human visual system which is used in Artificial Intelligence(AI)and called the Attention Mechanism.Based on the concept of static clutter filtering,the frequency-domain signals of the scanning aperture are divided into grid cells.Background scattering functions are established by analyzing the motion processes within each cell,and the background interference is linearly filtered out.An analysis of the manifestation of background scattering interference within the algorithm is carried out,and the impact of the grid cell dimension on the imaging quality is investigated.Experimental results show that the proposed method exhibits the capability to enhance the signal-to-noise ratio of both the target and the background.It effectively suppresses the background interference,leading to a more prominent image,meanwhile without imposing the excessive computational load.The method offers a novel solution for improving the performance of millimeter-wave imaging technology in practical applications. 展开更多
关键词 information processing technology millimeter-wave imaging Range Migration algorithm(RMA) attention mechanism adaptive background filtering
在线阅读 下载PDF
A game theoretic model and a double oracle algorithm for the heterogeneous weapon target assignment problem
9
作者 MA Yingying LUO He +2 位作者 WANG Guoqiang ZHU Waiming HU Xiaoxuan 《Journal of Systems Engineering and Electronics》 2026年第2期548-566,共19页
Weapon target assignment(WTA)problem is a critical problem in multiplatform confrontation.This paper studies a static WTA problem with heterogeneous weapons in multi-platform air combat scenarios,called heterogeneous ... Weapon target assignment(WTA)problem is a critical problem in multiplatform confrontation.This paper studies a static WTA problem with heterogeneous weapons in multi-platform air combat scenarios,called heterogeneous WTA(HWTA)problem.Heterogeneous indicates that the engagement platforms carry multiple kinds of weapons for different tactical purposes.The targets assigned and the weapons used by one side’s platforms will affect the survival probability and capability of the other side’s platforms.The goal of each side in HWTA is to find a solution to determine the kind of weapon used and the target assigned for each platform,so as to maximize their combat effectiveness.The problem is formulated as a two-player noncooperative game model with considering the conflicts between the engaged sides.The Nash equilibrium is an effective solution to the game in which no player has an incentive to deviate.However,the number of pure strategies in HWTA increases exponentially with the engagement platforms.To improve computing efficiency,a double oracle algorithm with constructive heuristic(DOCH)is developed,within which the constructive heuristic is embedded to solve the oracle subproblems efficiently.Numerical experiments are conducted to verify the effectiveness of the DOCH.The results show that the DOCH can find effective strategies for platforms to improve combat effectiveness.Moreover,the DOCH can find high-quality solutions in seconds,significantly outperforming the state-of-the-art algorithms in terms of computational efficiency,especially for large-scale problems. 展开更多
关键词 weapon target assignment noncooperative game double oracle algorithm constructive heuristic
在线阅读 下载PDF
Optimization of the frequency offset increment of FDA-MIMO based on cuckoo search algorithm
10
作者 WANG Bo ZHAO Yu +2 位作者 LI Yonglin YANG Rennong XUE Junjie 《Journal of Systems Engineering and Electronics》 2026年第1期157-170,共14页
Frequency diverse array multiple-input multiple-output(FDA-MIMO)radar has gained considerable research attention due to its ability to effectively counter active repeater deception jamming in complex electromagnetic e... Frequency diverse array multiple-input multiple-output(FDA-MIMO)radar has gained considerable research attention due to its ability to effectively counter active repeater deception jamming in complex electromagnetic environments.The effectiveness of interference suppression by FDA-MIMO is limited by the inherent range-angle coupling issue in the FDA beampattern.Existing literature primarily focuses on control methods for FDA-MIMO radar beam direction under the assumption of static beampatterns,with insufficient exploration of techniques for managing nonstationary beam directions.To address this gap,this paper initially introduces the FDA-MIMO signal model and the calculation formula for the FDA-MIMO array output using the minimum variance distortionless response(MVDR)beamformer.Building on this,the problem of determining the optimal frequency offset for the FDA is rephrased as a convex optimization problem,which is then resolved using the cuckoo search(CS)algorithm.Simulations confirm the effectiveness of the proposed approach,showing that the frequency offsets obtained through the CS algorithm can create a dot-shaped beam direction at the target location while effectively suppressing interference signals within the mainlobe. 展开更多
关键词 frequency diverse array multiple-input multiple-output(FDA-MIMO) convex optimization cuckoo search algorithm beampattern
在线阅读 下载PDF
Study on the destabilizing damage precursors of cemented tailings backfill based on critical slowing down theory combined with multiple denoising algorithms under consideration of initial defect conditions
11
作者 ZHAO Kang ZHONG Jun-cheng +3 位作者 YAN Ya-jing LIU Yang WEN Dao-tan XIAO Wei-ling 《Journal of Central South University》 2026年第1期375-399,共25页
The cemented tailings backfill(CTB)with initial defects is more prone to destabilization damage under the influence of various unfavorable factors during the mining process.In order to investigate its influence on the... The cemented tailings backfill(CTB)with initial defects is more prone to destabilization damage under the influence of various unfavorable factors during the mining process.In order to investigate its influence on the stability of underground mining engineering,this paper simulates the generation of different degrees of initial defects inside the CTB by adding different contents of air-entraining agent(AEA),investigates the acoustic emission RA/AF eigenvalues of CTB with different contents of AEA under uniaxial compression,and adopts various denoising algorithms(e.g.,moving average smoothing,median filtering,and outlier detection)to improve the accuracy of the data.The variance and autocorrelation coefficients of RA/AF parameters were analyzed in conjunction with the critical slowing down(CSD)theory.The results show that the acoustic emission RA/AF values can be used to characterize the progressive damage evolution of CTB.The denoising algorithm processed the AE signals to reduce the effects of extraneous noise and anomalous spikes.Changes in the variance curves provide clear precursor information,while abrupt changes in the autocorrelation coefficient can be used as an auxiliary localization warning signal.The phenomenon of dramatic increase in the variance and autocorrelation coefficient curves during the compression-tightening stage,which is influenced by the initial defects,can lead to false warnings.As the initial defects of the CTB increase,its instability precursor time and instability time are prolonged,the peak stress decreases,and the time difference between the CTB and the instability damage is smaller.The results provide a new method for real-time monitoring and early warning of CTB instability damage. 展开更多
关键词 initial defects cemented tailings backfill critical slowing down acoustic emission RA/AF values denoising algorithms
在线阅读 下载PDF
一种高效的K-medoids聚类算法 被引量:49
12
作者 夏宁霞 苏一丹 覃希 《计算机应用研究》 CSCD 北大核心 2010年第12期4517-4519,共3页
针对K-medoids算法初始中心点选择敏感、大数据集聚类应用中性能低下等缺点,提出一个基于初始中心微调与增量中心候选集的改进K-medoids算法。新算法以微调方式优化初始中心,以中心候选集逐步扩展的方式来降低中心轮换的计算复杂性。实... 针对K-medoids算法初始中心点选择敏感、大数据集聚类应用中性能低下等缺点,提出一个基于初始中心微调与增量中心候选集的改进K-medoids算法。新算法以微调方式优化初始中心,以中心候选集逐步扩展的方式来降低中心轮换的计算复杂性。实验结果表明,相对于传统的K-medoids算法,新算法可以提高聚类质量,有效缩短计算时间。 展开更多
关键词 聚类 k-medoids算法 中心微调 增量候选
在线阅读 下载PDF
基于距离不等式的K-medoids聚类算法 被引量:16
13
作者 余冬华 郭茂祖 +3 位作者 刘扬 任世军 刘晓燕 刘国军 《软件学报》 EI CSCD 北大核心 2017年第12期3115-3128,共14页
研究加速K-medoids聚类算法,首先以PAM(partitioning around medoids)、TPAM(triangular inequality elimination criteria PAM)算法为基础给出两个加速引理,并基于中心点之间距离不等式提出两个新加速定理.同时,以O(n+K^2)额外内存空... 研究加速K-medoids聚类算法,首先以PAM(partitioning around medoids)、TPAM(triangular inequality elimination criteria PAM)算法为基础给出两个加速引理,并基于中心点之间距离不等式提出两个新加速定理.同时,以O(n+K^2)额外内存空间开销辅助引理、定理的结合而提出加速SPAM(speed up PAM)聚类算法,使得K-medoids聚类算法复杂度由O(K(n-K)~2)降低至O((n-K)~2).在实际及人工模拟数据集上的实验结果表明:相对于PAM,TPAM,FKMEDOIDS(fast K-medoids)等参考算法均有改进,运行时间比PAM至少提升0.828倍. 展开更多
关键词 数据挖掘 聚类算法 k-medoids 距离不等式
在线阅读 下载PDF
基于粒计算的K-medoids聚类算法 被引量:39
14
作者 马箐 谢娟英 《计算机应用》 CSCD 北大核心 2012年第7期1973-1977,共5页
传统K-medoids聚类算法的聚类结果随初始中心点不同而波动,且计算复杂度较高不适于处理大规模数据集;快速K-medoids聚类算法通过选择合适的初始聚类中心改进了传统K-medoids聚类算法,但是快速K-medoids聚类算法的初始聚类中心有可能位... 传统K-medoids聚类算法的聚类结果随初始中心点不同而波动,且计算复杂度较高不适于处理大规模数据集;快速K-medoids聚类算法通过选择合适的初始聚类中心改进了传统K-medoids聚类算法,但是快速K-medoids聚类算法的初始聚类中心有可能位于同一类簇。为克服传统K-medoids聚类算法和快速K-medoids聚类算法的缺陷,提出一种基于粒计算的K-medoids聚类算法。算法引入粒度概念,定义新的样本相似度函数,基于等价关系产生粒子,根据粒子包含样本多少定义粒子密度,选择密度较大的前K个粒子的中心样本点作为K-medoids聚类算法的初始聚类中心,实现K-medoids聚类。UCI机器学习数据库数据集以及随机生成的人工模拟数据集实验测试,证明了基于粒计算的K-medoids聚类算法能得到更好的初始聚类中心,聚类准确率和聚类误差平方和优于传统K-medoids和快速K-medoids聚类算法,具有更稳定的聚类结果,且适用于大规模数据集。 展开更多
关键词 传统k-medoids聚类算法 快速k-medoids聚类算法 粒计算 等价关系 聚类
在线阅读 下载PDF
基于多核平台并行K-Medoids算法研究 被引量:9
15
作者 李静滨 杨柳 华蓓 《计算机应用研究》 CSCD 北大核心 2011年第2期498-500,共3页
分析K-Medoids算法的内在并行性,设计一个适合多核平台的并行算法,并利用OpenMP进行实验。实验结果表明,并行算法对多核环境有很好的适应性,在双核及四核计算机上均获得了较好的加速比与运行效率。
关键词 多核 k-medoids算法 并行算法 OPENMP
在线阅读 下载PDF
一种新的k-medoids聚类算法 被引量:19
16
作者 姚丽娟 罗可 孟颖 《计算机工程与应用》 CSCD 2013年第19期153-157,共5页
针对k-medoids算法对初始聚类中心敏感,聚类精度较低及收敛速度缓慢的缺点,提出一种基于密度初始化、密度迭代的搜索策略和准则函数优化的方法。该算法初始化是在高密度区域内选择k个相对距离较远的样本作为聚类初始中心,有效定位聚类... 针对k-medoids算法对初始聚类中心敏感,聚类精度较低及收敛速度缓慢的缺点,提出一种基于密度初始化、密度迭代的搜索策略和准则函数优化的方法。该算法初始化是在高密度区域内选择k个相对距离较远的样本作为聚类初始中心,有效定位聚类的最终中心点;在k个与初始中心点密度相近的区域内进行中心点替换,以减少候选点的搜索范围;采用类间距和类内距加权的均衡化准则函数,提高聚类精度。实验结果表明,相对于传统的k-mediods算法及某些改进算法,该算法可以提高聚类质量,有效缩短聚类时间。 展开更多
关键词 聚类 k-medoids算法 密度初始化 目标函数
在线阅读 下载PDF
一种基于ACO的K-medoids聚类算法 被引量:9
17
作者 孟颖 罗可 +1 位作者 姚丽娟 王琳 《计算机工程与应用》 CSCD 2012年第16期136-139,152,共5页
K-medoids算法作为聚类算法的一种,不易受极端数据的影响,适应性广泛,但是K-medoids聚类算法的精确度不稳定,平均准确率较低,用于实际的聚类分析时效果较差。ACO是一种仿生优化算法,其具有很强的健壮性,容易与其他方法相结合,求解效率... K-medoids算法作为聚类算法的一种,不易受极端数据的影响,适应性广泛,但是K-medoids聚类算法的精确度不稳定,平均准确率较低,用于实际的聚类分析时效果较差。ACO是一种仿生优化算法,其具有很强的健壮性,容易与其他方法相结合,求解效率高等特点。在K-medoids聚类算法的基础上,借鉴ACO算法的优点,提出了一种新的聚类算法,它提高了聚类的准确率,算法的稳定性也比较高。通过仿真实验,验证了算法的可行性和先进性。 展开更多
关键词 蚁群优化算法(ACO) 聚类分析 k-medoids算法
在线阅读 下载PDF
基于MapReduce的K-Medoids并行算法 被引量:33
18
作者 张雪萍 龚康莉 赵广才 《计算机应用》 CSCD 北大核心 2013年第4期1023-1025,1035,共4页
为了解决传统K-Medoids聚类算法在处理海量数据信息时所面临的内存容量和CPU处理速度的瓶颈问题,在深入研究K-Medoids算法的基础之上,提出了基于MapReduce编程模型的K-Medoids并行化算法思想。Map函数部分的主要任务是计算每个数据对象... 为了解决传统K-Medoids聚类算法在处理海量数据信息时所面临的内存容量和CPU处理速度的瓶颈问题,在深入研究K-Medoids算法的基础之上,提出了基于MapReduce编程模型的K-Medoids并行化算法思想。Map函数部分的主要任务是计算每个数据对象到簇类中心点的距离并(重新)分配其所属的聚类簇;Reduce函数部分的主要任务是根据Map部分得到的中间结果,计算出新簇类的中心点,然后作为中心点集给下一次MapReduce过程使用。实验结果表明:运行在Hadoop集群上的基于MapReduce的K-Medoids并行化算法具有较好的聚类结果和可扩展性,对于较大的数据集,该算法得到的加速比更接近于线性。 展开更多
关键词 k-medoids 云计算 MAPREDUCE 并行计算 HADOOP
在线阅读 下载PDF
粒子群K-Medoids带障碍约束空间聚类分析研究 被引量:6
19
作者 张雪萍 王家耀 +1 位作者 范中山 邓高峰 《小型微型计算机系统》 CSCD 北大核心 2009年第10期2025-2029,共5页
空间聚类分析是空间数据挖掘研究领域中的一个重要研究课题.传统聚类算法忽略了真实世界中许多约束条件的存在,而约束条件的存在会影响聚类结果的合理性.本文在分析粒子群优化算法和划分算法的基础上,研究一种基于粒子群和划分相结合的... 空间聚类分析是空间数据挖掘研究领域中的一个重要研究课题.传统聚类算法忽略了真实世界中许多约束条件的存在,而约束条件的存在会影响聚类结果的合理性.本文在分析粒子群优化算法和划分算法的基础上,研究一种基于粒子群和划分相结合的带障碍约束空间聚类分析方法,设计了一个粒子群K-Medoids带障碍约束空间聚类分析算法.对比实验表明,该方法不仅兼顾了局部收敛和全局收敛性能,又充分考虑到了现实障碍物对聚类结果的影响,使得聚类结果更具实际意义.与遗传K-Medoids带障碍约束空间聚类分析相比,该方法具有更好的可伸缩性,且所需输入的参数相对较少,更适合于对聚类速度要求较高的动态约束条件场合. 展开更多
关键词 空间聚类 k-medoids算法 粒子群优化算法 障碍约束
在线阅读 下载PDF
基于K-Medoids聚类的改进KNN文本分类算法 被引量:25
20
作者 罗贤锋 祝胜林 +1 位作者 陈泽健 袁玉强 《计算机工程与设计》 CSCD 北大核心 2014年第11期3864-3867,3937,共5页
为有效提高传统KNN算法(K最近邻算法)在海量数据的分类效率,分析传统KNN算法的分类过程,提出基于K-Medoids聚类的改进KNN算法。利用K-Medoids算法对文本训练集进行聚类,把文本训练集分成相似度较高的簇;根据待分类文本与簇的相对位置,... 为有效提高传统KNN算法(K最近邻算法)在海量数据的分类效率,分析传统KNN算法的分类过程,提出基于K-Medoids聚类的改进KNN算法。利用K-Medoids算法对文本训练集进行聚类,把文本训练集分成相似度较高的簇;根据待分类文本与簇的相对位置,对文本训练集进行裁剪,解决传统KNN算法在文本训练集过大时速度慢的问题。分析与实验结果表明,该裁剪方法能够合理有效地裁剪文本训练集,提高了KNN算法的运行效率和分类能力。 展开更多
关键词 文本分类 隶属度 K最近邻 样本裁剪 k-medoids聚类
在线阅读 下载PDF
上一页 1 2 250 下一页 到第
使用帮助 返回顶部