提出了机舱式激光雷达测风仪传动齿轮机械故障诊断方法。利用最小熵反褶积(MED)对齿轮的振动信号去噪处理,利用集成经验模态分解(EEMD)得到齿轮信号的内涵模态(IMF)分量,并根据IMF能量和齿轮峭度建立齿轮故障特征向量,将特征向量输入到...提出了机舱式激光雷达测风仪传动齿轮机械故障诊断方法。利用最小熵反褶积(MED)对齿轮的振动信号去噪处理,利用集成经验模态分解(EEMD)得到齿轮信号的内涵模态(IMF)分量,并根据IMF能量和齿轮峭度建立齿轮故障特征向量,将特征向量输入到最小二乘支持向量机(least squares support vector machine,LSSVM)中,完成传动齿轮机械故障的诊断。实验结果表明,该方法的齿轮故障诊断时间短,根据迭代次数的增加,误差率可控制在3%以下。展开更多
Support Vector Clustering (SVC) is a kernel-based unsupervised learning clustering method. The main drawback of SVC is its high computational complexity in getting the adjacency matrix describing the connectivity for ...Support Vector Clustering (SVC) is a kernel-based unsupervised learning clustering method. The main drawback of SVC is its high computational complexity in getting the adjacency matrix describing the connectivity for each pairs of points. Based on the proximity graph model [3], the Euclidean distance in Hilbert space is calculated using a Gaussian kernel, which is the right criterion to generate a minimum spanning tree using Kruskal's algorithm. Then the connectivity estimation is lowered by only checking the linkages between the edges that construct the main stem of the MST (Minimum Spanning Tree), in which the non-compatibility degree is originally defined to support the edge selection during linkage estimations. This new approach is experimentally analyzed. The results show that the revised algorithm has a better performance than the proximity graph model with faster speed, optimized clustering quality and strong ability to noise suppression, which makes SVC scalable to large data sets.展开更多
针对单一最小支持度挖掘关联规则不能反应不同数据项出现频度与性质的问题,提出了一个基于频繁模式树的多重支持度关联规则挖掘算法MSDMFIA(Multiple minimum Supports for Discover Maximum Fre-quent Item sets Algorithm),根据不同...针对单一最小支持度挖掘关联规则不能反应不同数据项出现频度与性质的问题,提出了一个基于频繁模式树的多重支持度关联规则挖掘算法MSDMFIA(Multiple minimum Supports for Discover Maximum Fre-quent Item sets Algorithm),根据不同数据项的特点定义多重支持度,通过挖掘数据库中的最大频繁项目集,计算最大频繁候选项目集在数据库中的支持度来发现关联规则.该算法可以解决关联规则挖掘中经常出现的稀少数据项问题,并解决了传统的关联规则挖掘算法中的生成频繁候选集和多次扫描数据库的性能瓶颈.实验结果表明,本文提出的算法在功能和性能方面均优于已有算法.展开更多
文摘为提升并联式混合动力汽车(parallel hybrid electric vehicle,PHEV)的燃油经济性,针对等效燃油消耗最小控制策略(equivalent fuel consumption minimum strategy,ECMS)在不同工况下适应性差的问题,以优化整车等效燃油消耗量为目标,设计基于工况识别算法的变等效因子ECMS能量管理策略。选取3类典型工况建立支持向量机分类模型,通过递归特征消除法对样本特征进行选择,采用鲸鱼算法对支持向量机进行参数优化,使用模拟退火算法分别对3类工况的ECMS等效因子进行离线全局最优求解,并分别存储于等效因子库中,通过训练好的支持向量机分类器对目标优化工况进行工况识别,不同类型的工况片段采用不同的等效因子进行转矩分配。仿真结果显示:相比于逻辑门限能量管理策略,基于工况识别算法的变等效因子ECMS能量管理策略的电池荷电状态(state of charge,SOC)变化量减少8.67%,节油率为13.11%;相比于优化前的ECMS策略电池SOC变化量减少3.47%,节油率约为6.63%。本文提出的基于工况识别算法的变等效因子ECMS能量管理策略可以有效地减少燃油消耗量,提升PHEV的整车经济性。
文摘提出了机舱式激光雷达测风仪传动齿轮机械故障诊断方法。利用最小熵反褶积(MED)对齿轮的振动信号去噪处理,利用集成经验模态分解(EEMD)得到齿轮信号的内涵模态(IMF)分量,并根据IMF能量和齿轮峭度建立齿轮故障特征向量,将特征向量输入到最小二乘支持向量机(least squares support vector machine,LSSVM)中,完成传动齿轮机械故障的诊断。实验结果表明,该方法的齿轮故障诊断时间短,根据迭代次数的增加,误差率可控制在3%以下。
基金TheNationalHighTechnologyResearchandDevelopmentProgramofChina (No .86 3 5 11 930 0 0 9)
文摘Support Vector Clustering (SVC) is a kernel-based unsupervised learning clustering method. The main drawback of SVC is its high computational complexity in getting the adjacency matrix describing the connectivity for each pairs of points. Based on the proximity graph model [3], the Euclidean distance in Hilbert space is calculated using a Gaussian kernel, which is the right criterion to generate a minimum spanning tree using Kruskal's algorithm. Then the connectivity estimation is lowered by only checking the linkages between the edges that construct the main stem of the MST (Minimum Spanning Tree), in which the non-compatibility degree is originally defined to support the edge selection during linkage estimations. This new approach is experimentally analyzed. The results show that the revised algorithm has a better performance than the proximity graph model with faster speed, optimized clustering quality and strong ability to noise suppression, which makes SVC scalable to large data sets.
文摘针对单一最小支持度挖掘关联规则不能反应不同数据项出现频度与性质的问题,提出了一个基于频繁模式树的多重支持度关联规则挖掘算法MSDMFIA(Multiple minimum Supports for Discover Maximum Fre-quent Item sets Algorithm),根据不同数据项的特点定义多重支持度,通过挖掘数据库中的最大频繁项目集,计算最大频繁候选项目集在数据库中的支持度来发现关联规则.该算法可以解决关联规则挖掘中经常出现的稀少数据项问题,并解决了传统的关联规则挖掘算法中的生成频繁候选集和多次扫描数据库的性能瓶颈.实验结果表明,本文提出的算法在功能和性能方面均优于已有算法.
