期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
A Health State Prediction Model Based on Belief Rule Base and LSTM for Complex Systems
1
作者 Yu Zhao Zhijie Zhou +3 位作者 Hongdong Fan Xiaoxia Han JieWang Manlin Chen 《Intelligent Automation & Soft Computing》 2024年第1期73-91,共19页
In industrial production and engineering operations,the health state of complex systems is critical,and predicting it can ensure normal operation.Complex systems have many monitoring indicators,complex coupling struct... In industrial production and engineering operations,the health state of complex systems is critical,and predicting it can ensure normal operation.Complex systems have many monitoring indicators,complex coupling structures,non-linear and time-varying characteristics,so it is a challenge to establish a reliable prediction model.The belief rule base(BRB)can fuse observed data and expert knowledge to establish a nonlinear relationship between input and output and has well modeling capabilities.Since each indicator of the complex system can reflect the health state to some extent,the BRB is built based on the causal relationship between system indicators and the health state to achieve the prediction.A health state prediction model based on BRB and long short term memory for complex systems is proposed in this paper.Firstly,the LSTMis introduced to predict the trend of the indicators in the system.Secondly,the Density Peak Clustering(DPC)algorithmis used todetermine referential values of indicators for BRB,which effectively offset the lack of expert knowledge.Then,the predicted values and expert knowledge are fused to construct BRB to predict the health state of the systems by inference.Finally,the effectiveness of the model is verified by a case study of a certain vehicle hydraulic pump. 展开更多
关键词 Health state predicftion complex systems belief rule base expert knowledge LSTM density peak clustering
下载PDF
Density Clustering Algorithm Based on KD-Tree and Voting Rules
2
作者 Hui Du Zhiyuan Hu +1 位作者 Depeng Lu Jingrui Liu 《Computers, Materials & Continua》 SCIE EI 2024年第5期3239-3259,共21页
Traditional clustering algorithms often struggle to produce satisfactory results when dealing with datasets withuneven density. Additionally, they incur substantial computational costs when applied to high-dimensional... Traditional clustering algorithms often struggle to produce satisfactory results when dealing with datasets withuneven density. Additionally, they incur substantial computational costs when applied to high-dimensional datadue to calculating similarity matrices. To alleviate these issues, we employ the KD-Tree to partition the dataset andcompute the K-nearest neighbors (KNN) density for each point, thereby avoiding the computation of similaritymatrices. Moreover, we apply the rules of voting elections, treating each data point as a voter and casting a votefor the point with the highest density among its KNN. By utilizing the vote counts of each point, we develop thestrategy for classifying noise points and potential cluster centers, allowing the algorithm to identify clusters withuneven density and complex shapes. Additionally, we define the concept of “adhesive points” between two clustersto merge adjacent clusters that have similar densities. This process helps us identify the optimal number of clustersautomatically. Experimental results indicate that our algorithm not only improves the efficiency of clustering butalso increases its accuracy. 展开更多
关键词 density peaks clustering KD-Tree K-nearest neighbors voting rules
下载PDF
几种经典聚类算法的比较研究
3
作者 吕晓丹 《电子技术与软件工程》 2023年第6期226-229,共4页
本文选取K-means、FCM、Spectral Cluster、Density Peak Cluster四种经典聚类算法作为研究对象,从理论和实验两个角度对它们进行比较研究。首先,本文介绍了聚类的含义、准则及应用;其次,本文分别阐述了四种算法的原理,并从理论角度分... 本文选取K-means、FCM、Spectral Cluster、Density Peak Cluster四种经典聚类算法作为研究对象,从理论和实验两个角度对它们进行比较研究。首先,本文介绍了聚类的含义、准则及应用;其次,本文分别阐述了四种算法的原理,并从理论角度分析它们的异同;再次,本文在UCI数据集上对四种算法执行了对比实验,比较它们的聚类准确率;最后,根据理论分析和对比实验的结果,得出四种算法适应不同类型数据集的结论。 展开更多
关键词 K-MEANS FCM Spectral Cluster density peak Cluster 比较研究
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部