By leveraging amplitude differences between reflected and diffracted signals in Ground Penetrating Radar (GPR) data, multiple singular spectrum analysis (MSSA) is considered an attractive approach to separate diffract...
详细信息
By leveraging amplitude differences between reflected and diffracted signals in Ground Penetrating Radar (GPR) data, multiple singular spectrum analysis (MSSA) is considered an attractive approach to separate diffraction, which has identified great potential in their detectability of small-scale geological structures. However, conventional MSSA encounters difficulties in pinpointing the singular value threshold that corresponds to reflection, diffraction, and noise within the singular spectrum, leading to a resolution loss of the extracted diffraction profile. To address this issue, this paper develops a new technique that incorporates multilevel wavelet transform (MWT) and MSSA to separate GPR diffraction. By first implementing the MWT on GPR data decompose, the strategy can obtain various approximate detailed coefficients of multiple transformation levels for the subsequent inverse MWT to construct the corresponding coefficient profile. The issue of coefficient profiles that depict reflections often contains residual diffractions is also addressed by performing multiple singular spectrum SVDs based on the Hankel matrix within the dominant frequency domain. Building upon this, the k-means clustering algorithm is introduced to perform MSSA for classifying singular values into k categories. The diffraction wavefield is rebuilt by combining these outcomes with the coefficient profiles that depict diffractions at various transformation levels. Numerical tests showcase that the biorthogonal wavelet basis function bior4.4 provides remarkably efficient GPR diffraction separation performance, and the number of clusters in the k-means clustering algorithm typically ranges from 9 to 15, accounting for the complexity of the wave components. Compared to plane wave deconstruction (PWD), the proposed MWT-MSSA approach reduces energy loss at the diffraction vertex, decreases residual diffraction energy within the reflection profile, and enhances computational efficiency by approx
An efficient Cluster Based Cab Recommender System (CBCRS) assists the cab drivers with the recommendations about passenger pickup location available at the shortest distance from him. To recommend drivers about the pa...
详细信息
In order to overcome the problems of long data collection time, high error rate of index weight calculation and low accuracy of traditional evaluation methods, a comprehensive evaluation method of innovative education...
详细信息
In order to overcome the problems of long data collection time, high error rate of index weight calculation and low accuracy of traditional evaluation methods, a comprehensive evaluation method of innovative education quality from the perspective of balanced and stable development is proposed. Firstly, the comprehensive evaluation index of innovative education quality under the background of balanced and stable development is preliminarily determined. The k-means clustering algorithm is used to collect education data, and the data are fused and reduced. Then, the comprehensive evaluation system of innovative education quality is established. Finally, the weight of evaluation index is calculated by AHP, and the comprehensive evaluation of education quality is realised by three-level fuzzy comprehensive evaluation model. The experimental results show that the average data acquisition time of this method is 0.63 s, the maximum error rate of evaluation index weight calculation is 2%, and the evaluation accuracy is above 94%.
In order to improve the performance of the feature selection algorithm, a feature selection algorithm based on k-meansclustering is designed. The algorithm makes use of the idea of k-meansclustering based on cosine ...
详细信息
ISBN:
(纸本)9781538604908
In order to improve the performance of the feature selection algorithm, a feature selection algorithm based on k-meansclustering is designed. The algorithm makes use of the idea of k-meansclustering based on cosine distance to cluster the features, so that the obtained feature subset has strong correlation and no redundancy. The experimental results show that the feature selection algorithm based on k-meansclustering has high efficiency for classification tasks and has short running time, so the algorithm has strong practicability for feature selection.
The original k-means clustering algorithm is prone to local optima and sensitive to the initial clustering center, which have a great impact on accuracy and stability of clustering results in practical applications. T...
详细信息
ISBN:
(纸本)9798350366907;9789887581581
The original k-means clustering algorithm is prone to local optima and sensitive to the initial clustering center, which have a great impact on accuracy and stability of clustering results in practical applications. To overcome this limitation, an innovative k-meansclustering method based on modified rat swarm optimization (RSO) algorithm is proposed. A nonlinear convergence factor is introduced into the RSO to adjust convergence speed of different data sets and improve the global search ability. Then, a reverse initial population strategy is adopted to increase population diversity, thus improving the robustness of the algorithm to the initial conditions. The modified RSO algorithm is used to find the initial optimal cluster centroid, and then k-meansalgorithm is used to refine the optimized initial cluster centroid to improve the clustering accuracy. The experimental results show that compared with the original k-means clustering algorithm, the improved algorithm has achieved significant improvement in each index of iris, wine and glass datasets, which proves the effectiveness and superiority of the algorithm. This paper presents a new hybrid clusteringalgorithm which combines the improved swarm intelligent optimization algorithm with k-means clustering algorithm. This method effectively solves the problem that k-means clustering algorithm is sensitive to the initial cluster center.
In clustering, in order to find a better data clustering center, make the algorithm convergence faster and clustering results more accurate, a k-means clustering algorithm based on improved quantum particle swarm opti...
详细信息
ISBN:
(纸本)9781665412544
In clustering, in order to find a better data clustering center, make the algorithm convergence faster and clustering results more accurate, a k-means clustering algorithm based on improved quantum particle swarm optimization algorithm is proposed. In this algorithm, the cluster center is simulated as a particle. Cloning and mutation operations are used to increase the diversity and improve the global search ability of QPSO. A suitable and stable cluster center is obtained. Finally, an effective clustering result is obtained. The algorithm is tested with UCI data set. The results show that the improved algorithm not only ensures the global convergence of the algorithm, but also obtains more accurate clustering results.
The improvement of enterprise competitiveness depends on the ability to match segmented customers in a competitive market. In this study, we propose a customer segmentation method based on the improved k-means algorit...
详细信息
The improvement of enterprise competitiveness depends on the ability to match segmented customers in a competitive market. In this study, we propose a customer segmentation method based on the improved k-meansalgorithm and the adaptive particle swarm optimization (PSO) algorithm. The current PSO algorithm can easily fall into a local extremum;thus, adaptive learning PSO (ALPSO) is proposed to improve the optimization accuracy. On the basis of the analysis of population-based optimization, the inertia weight, learning factors, and the position update method are redesigned. To prevent the k-means clustering algorithm from depending on initial cluster centres, the ALPSO algorithm is used to optimize the k-means cluster centres (kM-ALPSO). Aimed at the issue of clustering the actual grape-customer consumption mixed dataset, factor analysis is used to extract numerical variables. We then propose a dissimilarity measurement method to cluster the mixed data. We compare ALPSO with several parameter update methods. We also conduct comparative experiments to compare kM-ALPSO on five UCI datasets. Finally, the improved kM-ALPSO (IkM-ALPSO) clusteringalgorithm is applied in customer segmentation. All results show that the three proposed methods outperform existing models. The experimental results also demonstrate the effectiveness and practicability of IkM-ALPSO for customer segmentation. (C) 2021 Elsevier B.V. All rights reserved.
In this study, a new data-adaptive network design methodology called k-SRBF is presented for the spherical radial basis functions (SRBFs) in regional gravity field modeling. In this methodology, the cluster centers (c...
详细信息
In this study, a new data-adaptive network design methodology called k-SRBF is presented for the spherical radial basis functions (SRBFs) in regional gravity field modeling. In this methodology, the cluster centers (centroids) obtained by the k-means clustering algorithm are post-processed to construct a network of SRBFs by replacing the centroids with the SRBFs. The post-processing procedure is inspired by the heuristic method, Iterative Self-Organizing Data Analysis Technique (ISODATA), which splits clusters within the user-defined criteria to avoid over- and under-parameterization. These criteria are the minimum spherical distance between the centroids and the minimum number of samples for each cluster. The bandwidth (depth) of each SRBF is determined using the generalized cross-validation (GCV) technique in which only the observations within the radius of impact area (RIA) are used. The numerical tests are carried out with real and simulated data sets to investigate the effect of the user-defined criteria on the network design. Different bandwidth limits are also examined, and the appropriate lower and upper bandwidth limits are chosen based on the empirical signal covariance function and user-defined criteria. Also, additional tests are performed to verify the performance of the proposed methodology in combining different types of observations, such as terrestrial and airborne data available in Colorado. The results reveal that k-SRBF is an effective methodology to establish a data-adaptive network for SRBFs. Moreover, the proposed methodology improves the condition number of normal equation matrix so that the least-squares procedure can be applied without regularization considering the user-defined criteria and bandwidth limits.
The original k-means clustering algorithm is prone to local optima and sensitive to the initial clustering center,which have a great impact on accuracy and stability of clustering results in practical *** overcome thi...
详细信息
ISBN:
(数字)9789887581581
ISBN:
(纸本)9798350366907
The original k-means clustering algorithm is prone to local optima and sensitive to the initial clustering center,which have a great impact on accuracy and stability of clustering results in practical *** overcome this limitation,an innovative k-meansclustering method based on modified rat swarm optimization(RSO) algorithm is proposed.A nonlinear convergence factor is introduced into the RSO to adjust convergence speed of different data sets and improve the global search ***,a reverse initial population strategy is adopted to increase population diversity,thus improving the robustness of the algorithm to the initial *** modified RSO algorithm is used to find the initial optimal cluster centroid,and then k-meansalgorithm is used to refine the optimized initial cluster centroid to improve the clustering *** experimental results show that compared with the original k-means clustering algorithm,the improved algorithm has achieved significant improvement in each index of iris,wine and glass datasets,which proves the effectiveness and superiority of the *** paper presents a new hybrid clusteringalgorithm which combines the improved swarm intelligent optimization algorithm with k-meansclustering *** method effectively solves the problem that k-means clustering algorithm is sensitive to the initial cluster center.
k-means clustering algorithm is the most widely used algorithm in clustering. It is most popular because of its simplicity. There are a lot of issues faced by k-meansalgorithm such as, low quality of clusters formed,...
详细信息
ISBN:
(纸本)9781538644928;9781538644911
k-means clustering algorithm is the most widely used algorithm in clustering. It is most popular because of its simplicity. There are a lot of issues faced by k-meansalgorithm such as, low quality of clusters formed, inability to detect outliers and solutions that can be local optimal solution. In this paper a simple outlier detection algorithm that makes use of Mean and Standard Deviation, is applied on datasets. These datasets are then given as input to an already existing hybrid clusteringalgorithm of k-means and Artificial Bee Colony (ABC) algorithm. By applying the outlier detection algorithm, it ensures that the clusters formed are of better quality.
暂无评论