Optimization of constitutive parameters of foundation soils k-means clustering analysis

The goal of this study was to optimize the constitutive parameters of foundation soils using a k-means algorithm with clustering analysis. A database was collected from unconfined compression tests, Proctor tests and grain distribution tests of soils taken from three different types of foundation pits： raft foundations, partial raft foundations and strip foundations. k-means algorithm with clustering analysis was applied to determine the most appropriate foundation type given the un- confined compression strengths and other parameters of the different soils.

A State of Art Analysis of Telecommunication Data by k-Means and k-Medoids Clustering Algorithms

Cluster analysis is one of the major data analysis methods widely used for many practical applications in emerging areas of data mining. A good clustering method will produce high quality clusters with high intra-cluster similarity and low inter-cluster similarity. Clustering techniques are applied in different domains to predict future trends of available data and its uses for the real world. This research work is carried out to find the performance of two of the most delegated, partition based clustering algorithms namely k-Means and k-Medoids. A state of art analysis of these two algorithms is implemented and performance is analyzed based on their clustering result quality by means of its execution time and other components. Telecommunication data is the source data for this analysis. The connection oriented broadband data is given as input to find the clustering quality of the algorithms. Distance between the server locations and their connection is considered for clustering. Execution time for each algorithm is analyzed and the results are compared with one another. Results found in comparison study are satisfactory for the chosen application.

Campus Economic Analysis Based on K-Means Clustering and Hotspot Mining

With the advent of the era of big data and the development and construction of smart campuses,the campus is gradually moving towards digitalization,networking and informationization.The campus card is an important part of the construction of a smart campus,and the massive data it generates can indirectly reflect the living conditions of students at school.In the face of the campus card,how to quickly and accurately obtain the information required by users from the massive data sets has become an urgent problem that needs to be solved.This paper proposes a data mining algorithm based on K-Means clustering and time series.It analyzes the consumption data of a college student’s card to deeply mine and analyze the daily life consumer behavior habits of students,and to make an accurate judgment on the specific life consumer behavior.The algorithm proposed in this paper provides a practical reference for the construction of smart campuses in universities,and has important theoretical and application values.

New density clustering-based approach for failure mode and effect analysis considering opinion evolution and bounded confidence

Failure mode and effect analysis(FMEA)is a preven-tative risk evaluation method used to evaluate and eliminate fail-ure modes within a system.However,the traditional FMEA method exhibits many deficiencies that pose challenges in prac-tical applications.To improve the conventional FMEA,many modified FMEA models have been suggested.However,the majority of them inadequately address consensus issues and focus on achieving a complete ranking of failure modes.In this research,we propose a new FMEA approach that integrates a two-stage consensus reaching model and a density peak clus-tering algorithm for the assessment and clustering of failure modes.Firstly,we employ the interval 2-tuple linguistic vari-ables(I2TLVs)to express the uncertain risk evaluations provided by FMEA experts.Then,a two-stage consensus reaching model is adopted to enable FMEA experts to reach a consensus.Next,failure modes are categorized into several risk clusters using a density peak clustering algorithm.Finally,the proposed FMEA is illustrated by a case study of load-bearing guidance devices of subway systems.The results show that the proposed FMEA model can more easily to describe the uncertain risk information of failure modes by using the I2TLVs;the introduction of an endogenous feedback mechanism and an exogenous feedback mechanism can accelerate the process of consensus reaching;and the density peak clustering of failure modes successfully improves the practical applicability of FMEA.

Analysis of Patents Related to COVID-19-Based on Patent Clustering Model in Specific Fields

Objective To improve the efficiency of patent clustering related to COVID-19 through the topic extraction algorithm and BERT model,and to help researchers understand the patent applications for novel corona virus.Methods The weights of topic vector and BERT model vector were adjusted by cross-entropy loss algorithm to obtain joint vector.Then,k-means++algorithm was used for patent clustering after dimension reduction.Results and Conclusion The model was applied to patents for corona virus drugs,and five clustering topics were generated.Through comparison,it is proved that the clustering results of this model are more centralized and the differentiation between clusters is significant.The five clusters generated are visually analyzed to reveal the development status of patents for corona virus drugs.

Comprehensive K-Means Clustering

The k-means algorithm is a popular data clustering technique due to its speed and simplicity. However, it is susceptible to issues such as sensitivity to the chosen seeds, and inaccurate clusters due to poor initial seeds, particularly in complex datasets or datasets with non-spherical clusters. In this paper, a Comprehensive K-Means Clustering algorithm is presented, in which multiple trials of k-means are performed on a given dataset. The clustering results from each trial are transformed into a five-dimensional data point, containing the scope values of the x and y coordinates of the clusters along with the number of points within that cluster. A graph is then generated displaying the configuration of these points using Principal Component Analysis (PCA), from which we can observe and determine the common clustering patterns in the dataset. The robustness and strength of these patterns are then examined by observing the variance of the results of each trial, wherein a different subset of the data keeping a certain percentage of original data points is clustered. By aggregating information from multiple trials, we can distinguish clusters that consistently emerge across different runs from those that are more sensitive or unlikely, hence deriving more reliable conclusions about the underlying structure of complex datasets. Our experiments show that our algorithm is able to find the most common associations between different dimensions of data over multiple trials, often more accurately than other algorithms, as well as measure stability of these clusters, an ability that other k-means algorithms lack.

Improved k-means clustering algorithm

In allusion to the disadvantage of having to obtain the number of clusters of data sets in advance and the sensitivity to selecting initial clustering centers in the k-means algorithm, an improved k-means clustering algorithm is proposed. First, the concept of a silhouette coefficient is introduced, and the optimal clustering number Kopt of a data set with unknown class information is confirmed by calculating the silhouette coefficient of objects in clusters under different K values. Then the distribution of the data set is obtained through hierarchical clustering and the initial clustering-centers are confirmed. Finally, the clustering is completed by the traditional k-means clustering. By the theoretical analysis, it is proved that the improved k-means clustering algorithm has proper computational complexity. The experimental results of IRIS testing data set show that the algorithm can distinguish different clusters reasonably and recognize the outliers efficiently, and the entropy generated by the algorithm is lower.

Genetic Diversity and Clustering Analysis of 48Cultivars of Olea euyopaea L.

Inter-simple sequence repeat（ISSR） molecular markers were applied to analyze the genetic diversity and clustering of 48 introduced and bred cultivars of Olea euyopaea L. Totally 106 DNA bands were amplified by 11 screened primers, including 99 polymorphic bands; the percentage of polymorphic loci was 93.40%, indicating a rich genetic diversity in Olea euyopaea L. germplasm resources. Based on Nei＇s genetic distances between various cultivars, a dendrogram of 48 cultivars of Olea euyopaea L. was constructed using unweighted pair-group（UPMGA）method,which showed that 48 cultivars were clustered into four main categories; 84.6% of native cultivars were clustered into two categories; most of introduced cultivars were clustered based on their sources and main usages but not on their geographic origins. This study will provide references for the utilization and further genetic improvement of Olea euyopaea L. germplasm resources.

Clustering analysis algorithm for security supervising data based on semantic description in coal mines

In order to mine production and security information from security supervising data and to ensure security and safety involved in production and decision-making,a clustering analysis algorithm for security supervising data based on a semantic description in coal mines is studied.First,the semantic and numerical-based hybrid description method of security supervising data in coal mines is described.Secondly,the similarity measurement method of semantic and numerical data are separately given and a weight-based hybrid similarity measurement method for the security supervising data based on a semantic description in coal mines is presented.Thirdly,taking the hybrid similarity measurement method as the distance criteria and using a grid methodology for reference,an improved CURE clustering algorithm based on the grid is presented.Finally,the simulation results of a security supervising data set in coal mines validate the efficiency of the algorithm.

Clustering Analysis on Large Grained Brassica napus Materials Based on the Optimized ACGM Markers

[Objective] This study aimed to develop ACGM markers for the clustering analysis of large grained Brassica napus materials. [Method] A total of 44 pairs of ACGM primers were designed according to 18 genes related to Arabidopsis grain development and their homologous rape EST sequences. After electrophoresis, 18 pairs of ACGM primers were selected for the clustering analysis of 16 larger grained samples and four fine grained samples of rapeseed. [Result] PCR result showed that 2-6 specific bands were respectively amplified by each pair of primes, and all the bands were polymorphic and repeatable, suggesting that the optimized ACGM markers were useful for clustering analysis of B. napus species. Clustering analysis revealed that the 20 rapeseed samples were divided into three clusters A, B, and C at similarity coefficient 0.6. Then, the clusters A and B were further divided into five sub clusters A1, A2, A3, B1 and B2 at similarity coefficient 0.67. [Conclusion] This study will provide theoretical and practical values for rape breeding.

Study on Trace Elements in Rehmannia glutinosa Libosch. by Principal Component Analysis and Clustering Analysis

[Objective] This study aimed to investigate the trace elements in Rehman- nia glutinosa Libosch. by using principal component analysis and clustering analysis. [Method] Principal component analysis and clustering analysis of R. glutinosa medicinal materials from different sources were conducted with contents of six trace elements as indices. [Result] The principal component analysis could comprehen- sively evaluate the quality of R. glutinosa samples with objective results which was consistent with the results of clustering analysis. [Conclusion] Principal component analysis and clustering analysis methods can be used for the quality evaluation of Chinese medicinal materials with multiple indices.

Integrating petrophysical data into efficient iterative cluster analysis for electrofacies identification in clastic reservoirs

Efficient iterative unsupervised machine learning involving probabilistic clustering analysis with the expectation-maximization(EM)clustering algorithm is applied to categorize reservoir facies by exploiting latent and observable well-log variables from a clastic reservoir in the Majnoon oilfield,southern Iraq.The observable well-log variables consist of conventional open-hole,well-log data and the computer-processed interpretation of gamma rays,bulk density,neutron porosity,compressional sonic,deep resistivity,shale volume,total porosity,and water saturation,from three wells located in the Nahr Umr reservoir.The latent variables include shale volume and water saturation.The EM algorithm efficiently characterizes electrofacies through iterative machine learning to identify the local maximum likelihood estimates(MLE)of the observable and latent variables in the studied dataset.The optimized EM model developed successfully predicts the core-derived facies classification in two of the studied wells.The EM model clusters the data into three distinctive reservoir electrofacies(F1,F2,and F3).F1 represents a gas-bearing electrofacies with low shale volume(Vsh)and water saturation(Sw)and high porosity and permeability values identifying it as an attractive reservoir target.The results of the EM model are validated using nuclear magnetic resonance(NMR)data from the third studied well for which no cores were recovered.The NMR results confirm the effectiveness and accuracy of the EM model in predicting electrofacies.The utilization of the EM algorithm for electrofacies classification/cluster analysis is innovative.Specifically,the clusters it establishes are less rigidly constrained than those derived from the more commonly used K-means clustering method.The EM methodology developed generates dependable electrofacies estimates in the studied reservoir intervals where core samples are not available.Therefore,once calibrated with core data in some wells,the model is suitable for application to other wells that lack core data.

ARHCS (Automatic Rainfall Half-Life Cluster System): A Landslides Early Warning System (LEWS) Using Cluster Analysis and Automatic Threshold Definition

A significant portion of Landslide Early Warning Systems (LEWS) relies on the definition of operational thresholds and the monitoring of cumulative rainfall for alert issuance. These thresholds can be obtained in various ways, but most often they are based on previous landslide data. This approach introduces several limitations. For instance, there is a requirement for the location to have been previously monitored in some way to have this type of information recorded. Another significant limitation is the need for information regarding the location and timing of incidents. Despite the current ease of obtaining location information (GPS, drone images, etc.), the timing of the event remains challenging to ascertain for a considerable portion of landslide data. Concerning rainfall monitoring, there are multiple ways to consider it, for instance, examining accumulations over various intervals (1 h, 6 h, 24 h, 72 h), as well as in the calculation of effective rainfall, which represents the precipitation that actually infiltrates the soil. However, in the vast majority of cases, both the thresholds and the rain monitoring approach are defined manually and subjectively, relying on the operators’ experience. This makes the process labor-intensive and time-consuming, hindering the establishment of a truly standardized and rapidly scalable methodology on a large scale. In this work, we propose a Landslides Early Warning System (LEWS) based on the concept of rainfall half-life and the determination of thresholds using Cluster Analysis and data inversion. The system is designed to be applied in extensive monitoring networks, such as the one utilized by Cemaden, Brazil’s National Center for Monitoring and Early Warning of Natural Disasters.

An efficient enhanced k-means clustering algorithm

In k-means clustering, we are given a set of n data points in d-dimensional space R^d and an integer k and the problem is to determine a set of k points in R^d, called centers, so as to minimize the mean squared distance from each data point to its nearest center. In this paper, we present a simple and efficient clustering algorithm based on the k-means algorithm, which we call enhanced k-means algorithm. This algorithm is easy to implement, requiring a simple data structure to keep some information in each iteration to be used in the next iteration. Our experimental results demonstrated that our scheme can improve the computational speed of the k-means algorithm by the magnitude in the total number of distance calculations and the overall time of computation.

我国公共图书馆发展水平的K-means聚类分析

文章首先基于第七次全国县级以上公共图书馆评估定级上等级馆名单数据,统计我国31个省市自治区公共图书馆进入一级图书馆、二级图书馆、三级图书馆以及未定等级数量,计算出比例;随后基于比例数据,利用K-means聚类分析算法对我国31个省市自治区进行数据分析,用来研究我国公共图书馆发展水平情况。数据分析结果显示,我国31个省市自治区公共图书馆发展水平可以分为3个档次:领先水平,包括北京等8地;中等水平,包括河北等17地;落后水平,包括辽宁等6地。最后,文章根据聚类分析结果提出了助力我国公共图书馆高质量均衡发展的相关建议与看法。

基于K-means的海南物流职业本科学生学习行为分析

在现代物流行业中,培养具备全面专业知识和实践能力的物流职业本科学生至关重要。为了更好地了解学生在学习过程中的行为和学习习惯,文章将采用K-means聚类模型方法,对现代物流管理(职业本科)学生的学习行为进行深入探索与分类。通过这项研究,旨在为优化物流教育、提高学生学习效果提供有益的参考建议。文章将介绍研究设计、数据收集与处理方法,并对结果进行解析与讨论。

Comparative Analysis of Differences among Northern,Jiangnan,and Lingnan Classical Private Gardens Using Principal Component Cluster Method

This paper investigates the design essence of Chinese classical private gardens,integrating their design elements and fundamental principles.It systematically analyzes the unique characteristics and differences among classical private gardens in the Northern,Jiangnan,and Lingnan regions.The study examines nine classical private gardens from Northern China,Jiangnan,and Lingnan by utilizing the advanced tool of principal component cluster analysis.Based on literature analysis and field research,273 variables were selected for principal component analysis,from which four components with higher contribution rates were chosen for further study.Subsequently,we employed clustering analysis techniques to compare the differences among the three types of gardens.The results reveal that the first principal component effectively highlights the differences between Jiangnan and Lingnan private gardens.The second principal component serves as the key to defining the types of Northern private gardens and distinguishing them from the other two types,and the third principal component indicates that Lingnan private gardens can be categorized into two distinct types as well.

Clustering Structure Analysis in Time-Series Data With Density-Based Clusterability Measure

Clustering is used to gain an intuition of the struc tures in the data.Most of the current clustering algorithms pro duce a clustering structure even on data that do not possess such structure.In these cases,the algorithms force a structure in the data instead of discovering one.To avoid false structures in the relations of data,a novel clusterability assessment method called density-based clusterability measure is proposed in this paper.I measures the prominence of clustering structure in the data to evaluate whether a cluster analysis could produce a meaningfu insight to the relationships in the data.This is especially useful in time-series data since visualizing the structure in time-series data is hard.The performance of the clusterability measure is evalu ated against several synthetic data sets and time-series data sets which illustrate that the density-based clusterability measure can successfully indicate clustering structure of time-series data.

Hierarchical hesitant fuzzy K-means clustering algorithm

Due to the limitation and hesitation in one＇s knowledge, the membership degree of an element to a given set usually has a few different values, in which the conventional fuzzy sets are invalid. Hesitant fuzzy sets are a powerful tool to treat this case. The present paper focuses on investigating the clustering technique for hesitant fuzzy sets based on the K-means clustering algorithm which takes the results of hierarchical clustering as the initial clusters. Finally, two examples demonstrate the validity of our algorithm.

Identifying a competency improvement strategy for infection prevention and control professionals:A rapid systematic review and cluster analysis

Remarkable progress has been made in infection prevention and control(IPC)in many countries,but some gaps emerged in the context of the coronavirus disease 2019(COVID-19)pandemic.Core capabilities such as standard clinical precautions and tracing the source of infection were the focus of IPC in medical institutions during the pandemic.Therefore,the core competences of IPC professionals during the pandemic,and how these contributed to successful prevention and control of the epidemic,should be studied.To investigate,using a systematic review and cluster analysis,fundamental improvements in the competences of infection control and prevention professionals that may be emphasized in light of the COVID-19 pandemic.We searched the PubMed,Embase,Cochrane Library,Web of Science,CNKI,WanFang Data,and CBM databases for original articles exploring core competencies of IPC professionals during the COVID-19 pandemic(from January 1,2020 to February 7,2023).Weiciyun software was used for data extraction and the Donohue formula was followed to distinguish high-frequency technical terms.Cluster analysis was performed using the within-group linkage method and squared Euclidean distance as the metric to determine the priority competencies for development.We identified 46 studies with 29 high-frequency technical terms.The most common term was“infection prevention and control training”(184 times,17.3%),followed by“hand hygiene”(172 times,16.2%).“Infection prevention and control in clinical practice”was the most-reported core competency(367 times,34.5%),followed by“microbiology and surveillance”(292 times,27.5%).Cluster analysis showed two key areas of competence:Category 1(program management and leadership,patient safety and occupational health,education and microbiology and surveillance)and Category 2(IPC in clinical practice).During the COVID-19 pandemic,IPC program management and leadership,microbiology and surveillance,education,patient safety,and occupational health were the most important focus of development and should be given due consideration by IPC professionals.