Blind separation of sparse sources （BSSS） is discussed. The BSSS method based on the conventional K-means clustering is very fast and is also easy to implement. However, the accuracy of this method is generally not ...Blind separation of sparse sources （BSSS） is discussed. The BSSS method based on the conventional K-means clustering is very fast and is also easy to implement. However, the accuracy of this method is generally not satisfactory. The contribution of the vector x（t） with different modules is theoretically proved to be unequal, and a weighted K-means clustering method is proposed on this grounds. The proposed algorithm is not only as fast as the conventional K-means clustering method, but can also achieve considerably accurate results, which is demonstrated by numerical experiments.展开更多
In this paper,a blind multiband spectrum sensing(BMSS)method requiring no knowledge of noise power,primary signal and wireless channel is proposed based on the K-means clustering(KMC).In this approach,the KMC algorith...In this paper,a blind multiband spectrum sensing(BMSS)method requiring no knowledge of noise power,primary signal and wireless channel is proposed based on the K-means clustering(KMC).In this approach,the KMC algorithm is used to identify the occupied subband set(OSS)and the idle subband set(ISS),and then the location and number information of the occupied channels are obtained according to the elements in the OSS.Compared with the classical BMSS methods based on the information theoretic criteria(ITC),the new method shows more excellent performance especially in the low signal-to-noise ratio(SNR)and the small sampling number scenarios,and more robust detection performance in noise uncertainty or unequal noise variance applications.Meanwhile,the new method performs more stablely than the ITC-based methods when the occupied subband number increases or the primary signals suffer multi-path fading.Simulation result verifies the effectiveness of the proposed method.展开更多
Most real application processes belong to a complex nonlinear system with incomplete information. It is difficult to estimate a model by assuming that the data set is governed by a global model. Moreover, in real proc...Most real application processes belong to a complex nonlinear system with incomplete information. It is difficult to estimate a model by assuming that the data set is governed by a global model. Moreover, in real processes, the available data set is usually obtained with missing values. To overcome the shortcomings of global modeling and missing data values, a new modeling method is proposed. Firstly, an incomplete data set with missing values is partitioned into several clusters by a K-means with soft constraints （KSC） algorithm, which incorporates soft constraints to enable clustering with missing values. Then a local model based on each group is developed by using SVR algorithm, which adopts a missing value insensitive （MVI） kernel to investigate the missing value estimation problem. For each local model, its valid area is gotten as well. Simulation results prove the effectiveness of the current local model and the estimation algorithm.展开更多
To realize content-hased retrieval of large image databases, it is required to develop an efficient index and retrieval scheme. This paper proposes an index algorithm of clustering called CMA, which supports fast retr...To realize content-hased retrieval of large image databases, it is required to develop an efficient index and retrieval scheme. This paper proposes an index algorithm of clustering called CMA, which supports fast retrieval of large image databases. CMA takes advantages of k-means and self-adaptive algorithms. It is simple and works without any user interactions. There are two main stages in this algorithm. In the first stage, it classifies images in a database into several clusters, and automatically gets the necessary parameters for the next stage-k-means iteration. The CMA algorithm is tested on a large database of more than ten thousand images and compare it with k-means algorithm. Experimental results show that this algorithm is effective in both precision and retrieval time.展开更多
The residual elastic energy index is a scientific evaluation index for rockburst proneness.In laboratory test,it is sometimes difficult to obtain the post-peak curve or to test the rock sample several times,which make...The residual elastic energy index is a scientific evaluation index for rockburst proneness.In laboratory test,it is sometimes difficult to obtain the post-peak curve or to test the rock sample several times,which makes it impossible to calculate the residual elastic energy index accurately.Based on 241 sets of experimental data and four input indexes of density,elastic modulus,peak intensity and peak input strain energy,this study proposed a machine learning model combining k-means clustering algorithm and random forest regression model:cluster forest(CF)model.The research employed a stratified sampling method on the dataset to ensure the representativeness and balance of the samples.Subsequently,grid search and five-fold cross-validation were utilized to optimize the model’s hyperparameters,aiming to enhance its generalization capability and prediction accuracy.Finally,the performance of the optimal model was evaluated using a test set and compared with five other commonly used models.The results indicate that the CF model outperformed the other models on the testing set,with a mean absolute error of 6.6%,and an accuracy of 93.9%.The results of sensitivity analyses reveal the degree of influence of each variable on rockburst proneness and the applicability of the CF model when the input parameters are missing.The robustness and generalization ability of the model were verified by introducing experimental data from other studies,and the results confirmed the reliability and applicability of the model.Therefore,the model not only effectively simplifies the acquisition of the residual elastic energy index,but also shows excellent performance and wide applicability.展开更多
基金the National Natural Science Foundation of China (60672061)
文摘Blind separation of sparse sources （BSSS） is discussed. The BSSS method based on the conventional K-means clustering is very fast and is also easy to implement. However, the accuracy of this method is generally not satisfactory. The contribution of the vector x（t） with different modules is theoretically proved to be unequal, and a weighted K-means clustering method is proposed on this grounds. The proposed algorithm is not only as fast as the conventional K-means clustering method, but can also achieve considerably accurate results, which is demonstrated by numerical experiments.
基金Projects(61362018,61861019)supported by the National Natural Science Foundation of ChinaProject(1402041B)supported by the Jiangsu Province Postdoctoral Scientific Research Project,China+1 种基金Project(16A174)supported by the Scientific Research Fund of Hunan Provincial Education Department,ChinaProject([2016]283)supported by the Research Study and Innovative Experiment Project of College Students,China
文摘In this paper,a blind multiband spectrum sensing(BMSS)method requiring no knowledge of noise power,primary signal and wireless channel is proposed based on the K-means clustering(KMC).In this approach,the KMC algorithm is used to identify the occupied subband set(OSS)and the idle subband set(ISS),and then the location and number information of the occupied channels are obtained according to the elements in the OSS.Compared with the classical BMSS methods based on the information theoretic criteria(ITC),the new method shows more excellent performance especially in the low signal-to-noise ratio(SNR)and the small sampling number scenarios,and more robust detection performance in noise uncertainty or unequal noise variance applications.Meanwhile,the new method performs more stablely than the ITC-based methods when the occupied subband number increases or the primary signals suffer multi-path fading.Simulation result verifies the effectiveness of the proposed method.
基金supported by Key Discipline Construction Program of Beijing Municipal Commission of Education (XK10008043)
文摘Most real application processes belong to a complex nonlinear system with incomplete information. It is difficult to estimate a model by assuming that the data set is governed by a global model. Moreover, in real processes, the available data set is usually obtained with missing values. To overcome the shortcomings of global modeling and missing data values, a new modeling method is proposed. Firstly, an incomplete data set with missing values is partitioned into several clusters by a K-means with soft constraints （KSC） algorithm, which incorporates soft constraints to enable clustering with missing values. Then a local model based on each group is developed by using SVR algorithm, which adopts a missing value insensitive （MVI） kernel to investigate the missing value estimation problem. For each local model, its valid area is gotten as well. Simulation results prove the effectiveness of the current local model and the estimation algorithm.
基金This project was supported by National High Tech Foundation of 863 (2001AA115123)
文摘To realize content-hased retrieval of large image databases, it is required to develop an efficient index and retrieval scheme. This paper proposes an index algorithm of clustering called CMA, which supports fast retrieval of large image databases. CMA takes advantages of k-means and self-adaptive algorithms. It is simple and works without any user interactions. There are two main stages in this algorithm. In the first stage, it classifies images in a database into several clusters, and automatically gets the necessary parameters for the next stage-k-means iteration. The CMA algorithm is tested on a large database of more than ten thousand images and compare it with k-means algorithm. Experimental results show that this algorithm is effective in both precision and retrieval time.
基金Project(42077244)supported by the National Natural Science Foundation of ChinaProject(SDGZK2431)supported by the State Key Laboratory of Intelligent Construction and Healthy Operation and Maintenance of Deep Underground Engineering,Sichuan University,China。
文摘The residual elastic energy index is a scientific evaluation index for rockburst proneness.In laboratory test,it is sometimes difficult to obtain the post-peak curve or to test the rock sample several times,which makes it impossible to calculate the residual elastic energy index accurately.Based on 241 sets of experimental data and four input indexes of density,elastic modulus,peak intensity and peak input strain energy,this study proposed a machine learning model combining k-means clustering algorithm and random forest regression model:cluster forest(CF)model.The research employed a stratified sampling method on the dataset to ensure the representativeness and balance of the samples.Subsequently,grid search and five-fold cross-validation were utilized to optimize the model’s hyperparameters,aiming to enhance its generalization capability and prediction accuracy.Finally,the performance of the optimal model was evaluated using a test set and compared with five other commonly used models.The results indicate that the CF model outperformed the other models on the testing set,with a mean absolute error of 6.6%,and an accuracy of 93.9%.The results of sensitivity analyses reveal the degree of influence of each variable on rockburst proneness and the applicability of the CF model when the input parameters are missing.The robustness and generalization ability of the model were verified by introducing experimental data from other studies,and the results confirmed the reliability and applicability of the model.Therefore,the model not only effectively simplifies the acquisition of the residual elastic energy index,but also shows excellent performance and wide applicability.
