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.

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.

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.

基于改进K-means聚类和皮尔逊相关系数户变关系异常诊断

用电信息采集系统易出现台区户变关系错误问题,传统诊断技术主要针对少用户台区出现异常用户情况,但对于多达数百用户台区,存在多相邻台区异常用户特征提取难题。文中首先通过主成分分析对GIS系统获取台区总表和用户电表电压数据实现降维,建立改进K-means聚类提取电压数据特征,提出改进皮尔逊相关系数算法分析待检测用户,据此建立基于改进K-means聚类和改进皮尔逊相关系数的户变关系异常诊断方法,实现多异常用户所属正确台区诊断。实际算例分析结果表明,文中提出算法在识别同一台区一个及多个异常用户、不同台区多个异常用户情况下均能有效实现异常用户的准确检测与分析,相比传统检测方法,实现简单且准确性更高。

基于K-means算法的病种成本聚类分析及精细化管理探究

目的:探索构建基于“投入-产出-频次”三个维度的病种成本分析模型,完善以病种为基础、以价值为导向的医院运营管理体系,助力精细化管理水平提升。方法:以某三甲医院为样本,基于某年度病案首页数据,运用K-means算法对病种进行聚类分析。结果:将病种聚类为六类,从整体来看样本医院病种结构较好,但基层病种占比仍较大。结论:医院可以对病种进行精细化分类管理,对“重要价值病种”给予资源倾斜,对“一般价值病种”优化诊疗流程和模式,同时开展病种成本监测及分析,控制成本。

Composition Analysis and Identification of Ancient Glass Products Based on L1 Regularization Logistic Regression

In view of the composition analysis and identification of ancient glass products, L1 regularization, K-Means cluster analysis, elbow rule and other methods were comprehensively used to build logical regression, cluster analysis, hyper-parameter test and other models, and SPSS, Python and other tools were used to obtain the classification rules of glass products under different fluxes, sub classification under different chemical compositions, hyper-parameter K value test and rationality analysis. Research can provide theoretical support for the protection and restoration of ancient glass relics.

Study Progress Analysis of Effluent Quality Prediction in Activated Sludge Process Based on CiteSpace

In this paper, CiteSpace, a bibliometrics software, was adopted to collect research papers published on the Web of Science, which are relevant to biological model and effluent quality prediction in activated sludge process in the wastewater treatment. By the way of trend map, keyword knowledge map, and co-cited knowledge map, specific visualization analysis and identification of the authors, institutions and regions were concluded. Furthermore, the topics and hotspots of water quality prediction in activated sludge process through the literature-co-citation-based cluster analysis and literature citation burst analysis were also determined, which not only reflected the historical evolution progress to a certain extent, but also provided the direction and insight of the knowledge structure of water quality prediction and activated sludge process for future research.

Investigation of the J-TEXT plasma events by k-means clustering algorithm

Various types of plasma events emerge in specific parameter ranges and exhibit similar characteristics in diagnostic signals,which can be applied to identify these events.A semisupervised machine learning algorithm,the k-means clustering algorithm,is utilized to investigate and identify plasma events in the J-TEXT plasma.This method can cluster diverse plasma events with homogeneous features,and then these events can be identified if given few manually labeled examples based on physical understanding.A survey of clustered events reveals that the k-means algorithm can make plasma events(rotating tearing mode,sawtooth oscillations,and locked mode)gathering in Euclidean space composed of multi-dimensional diagnostic data,like soft x-ray emission intensity,edge toroidal rotation velocity,the Mirnov signal amplitude and so on.Based on the cluster analysis results,an approximate analytical model is proposed to rapidly identify plasma events in the J-TEXT plasma.The cluster analysis method is conducive to data markers of massive diagnostic data.

Exploring Motor Imagery EEG: Enhanced EEG Microstate Analysis with GMD-Driven Density Canopy Method

The analysis of microstates in EEG signals is a crucial technique for understanding the spatiotemporal dynamics of brain electrical activity.Traditional methods such as Atomic Agglomerative Hierarchical Clustering(AAHC),K-means clustering,Principal Component Analysis(PCA),and Independent Component Analysis(ICA)are limited by a fixed number of microstate maps and insufficient capability in cross-task feature extraction.Tackling these limitations,this study introduces a Global Map Dissimilarity(GMD)-driven density canopy K-means clustering algorithm.This innovative approach autonomously determines the optimal number of EEG microstate topographies and employs Gaussian kernel density estimation alongside the GMD index for dynamic modeling of EEG data.Utilizing this advanced algorithm,the study analyzes the Motor Imagery(MI)dataset from the GigaScience database,GigaDB.The findings reveal six distinct microstates during actual right-hand movement and five microstates across other task conditions,with microstate C showing superior performance in all task states.During imagined movement,microstate A was significantly enhanced.Comparison with existing algorithms indicates a significant improvement in clustering performance by the refined method,with an average Calinski-Harabasz Index(CHI)of 35517.29 and a Davis-Bouldin Index(DBI)average of 2.57.Furthermore,an information-theoretical analysis of the microstate sequences suggests that imagined movement exhibits higher complexity and disorder than actual movement.By utilizing the extracted microstate sequence parameters as features,the improved algorithm achieved a classification accuracy of 98.41%in EEG signal categorization for motor imagery.A performance of 78.183%accuracy was achieved in a four-class motor imagery task on the BCI-IV-2a dataset.These results demonstrate the potential of the advanced algorithm in microstate analysis,offering a more effective tool for a deeper understanding of the spatiotemporal features of EEG signals.

融合专家领域知识和K-means聚类的三支风险评级方法

金融和医疗等实际环境中的决策关键在于决策风险的权衡考虑,准确预测和分类风险级别非常必要。然而,传统的群体决策关注专家评价意见的一致性和共识,对于获得客观的专家评价意见和决策质量的考虑较少,在风险评级场景中难以量化和评估决策实际效果。因此,引入数据驱动的思想,利用数据和聚类结果辅助发现专家评估意见,在三支决策理论框架下优化群体意见,改进和计算逻辑回归的判别点,并基于UCI和Kaggle的4个信贷风险和疾病诊断公开数据集,完成风险评级分类。通过数据实验的结果可以发现:与经典的机器学习方法相比,文中提出的基于群体决策的三支分类方法更加关注风险的规避,在各个数据集上的分类表现均有稳定且较优的结果,说明通过发现专家领域知识,利用数据的客观信息辅助专家评估风险有助于解决不同背景的决策问题。

基于改进K-means聚类的轨道交通基础设施分布式光伏发电典型场景生成及出力特性分析

受限于自然条件,光伏出力具有很强的随机性。为准确评估轨道交通基础设施分布式光伏发电的光伏出力特性,提出一种基于改进K-means聚类算法的轨道交通基础设施分布式光伏发电典型场景生成方法,并基于此进行光伏出力特性分析。首先,基于分布式光伏发电设施以及气象数据,利用PVsyst软件模拟光伏发电出力数据。然后,针对基本K-means聚类算法聚类参数和初始聚类中心盲目性高的问题,结合聚类有效性指标(Density based index,DBI)和层次聚类对其进行改进并利用改进K-means聚类算法生成光伏典型日出力场景。最后,基于华中地区某地轨道交通基础设施分布式光伏系统对所提方法的有效性和优越性进行验证,并通过定性和定量分析各典型场景的出力特性揭示轨道交通基础设施分布式光伏出力的规律和特点。

Analysis of the Employment Situation of Non Private Enterprises in Various Regions of China

In the past 30 years, Chinese enterprises have been a hot topic of discussion and concern among the general public in terms of economic and social status, ownership structure, business mechanism, and management level. Solving the problem of employment for the people is an important prerequisite for their peaceful living and work, as well as a prerequisite and foundation for building a harmonious society. The employment situation of private enterprises has always been of great concern to the outside world, and these two major jobs have always occupied an important position in the employment field of China that cannot be ignored. With the establishment of the market economy system, individual and private enterprises have become important components of the socialist economy, making significant contributions to economic development and social progress. The rapid development of China’s economy, on the one hand, is the embodiment of the superiority of China’s socialist market economic system, and on the other hand, it is the role of the tertiary industry and private enterprises in promoting the national economy. Since the 1990s, China’s private enterprises have become a new economic growth point for local and even national countries, and are one of the important ways to arrange employment and achieve social stability. This paper studies the employment of private enterprises and individuals from the perspective of statistics, extracts relevant data from China statistical Yearbook, uses the relevant knowledge of statistics to process the data, obtains the conclusion and puts forward relevant constructive suggestions.

基于K-means与Word2vec的哺乳文胸评论主题挖掘研究

目的为了了解消费者在网络平台购买哺乳文胸时的关注侧重点,文章从在线评论中抽取有效关键词构建哺乳文胸主题,并通过计算主题的重要程度协助商家了解消费者关注重点方向。方法选用TF-IDF关键词抽取算法,结合K-means和Word2vec进行语义聚类、主题识别、主题词挖掘及主题重要度计算。结果哺乳文胸评论文本聚类后的主题重要程度排名是:产品品质(45.47%)、产品外观(35.83%)、产品服务(18.79%)。结论通过该方法能够有效的识别和构建哺乳文胸主题及主题词,同时,通过主题的重要程度,能够了解消费者对于网络平台购买哺乳文胸时关注的重点方向,为哺乳内衣企业进行产品改善及生产等提供理论参考。

Incident Detection Based on Differential Analysis

Internet services and web-based applications play pivotal roles in various sensitive domains, encompassing e-commerce, e-learning, e-healthcare, and e-payment. However, safeguarding these services poses a significant challenge, as the need for robust security measures becomes increasingly imperative. This paper presented an innovative method based on differential analyses to detect abrupt changes in network traffic characteristics. The core concept revolves around identifying abrupt alterations in certain characteristics such as input/output volume, the number of TCP connections, or DNS queries—within the analyzed traffic. Initially, the traffic is segmented into distinct sequences of slices, followed by quantifying specific characteristics for each slice. Subsequently, the distance between successive values of these measured characteristics is computed and clustered to detect sudden changes. To accomplish its objectives, the approach combined several techniques, including propositional logic, distance metrics (e.g., Kullback-Leibler Divergence), and clustering algorithms (e.g., K-means). When applied to two distinct datasets, the proposed approach demonstrates exceptional performance, achieving detection rates of up to 100%.

基于狄利克雷多项式过程模型与K-means结合的菌群分析

群体分型是一种有助于更好的理解人类身心健康等复杂生物学问题的有效方法,聚类是一种为了对样本分组来降低复杂性的定义肠型的方法,而传统K-means聚类算法的K值选取无法确定,本文在传统K-means聚类算法的基础上进行了改进,并公开数据集上进行了验证,实验表明改进算法能够解决K值选取无法确定的问题,且聚类结果的稳定性、准确性和聚类质量都得到显著提高。将改进后的模型运用于肠道菌群OTUs数据,发现不仅能够有效地区分2-型糖尿病患者样本间的相似性,而且能鉴定出影响菌群结构异质性最大的OTUs菌,为临床解决2-型糖尿病问题提供了一种新的思路。

基于K-means的水下控制系统集成测试风险分析

采用危险源辨识分析(HAZID)工具对南海某水下控制系统集成测试进行风险识别,研究水下电力和通信设备的联合测试等过程存在的风险,针对HAZID技术识别的测试风险,定义风险的3个指标,包括风险发生可能性、风险后果严重程度和风险预防控制能力,将风险进行K-means聚类分析,采用SPSS软件将风险分为重大风险、高风险、中风险、低风险等4个聚类等级,识别4类共21个测试风险。在实际运用中,该方法可为水下控制系统集成测试风险制定有针对性的措施,可高效、科学和系统地指导水下控制系统集成测试工作开展。

基于改进K-means算法的排水管网监测点位优化

为切实提高工程监测成效,合理利用资源,提出基于改进K-means算法的排水管网监测点布置优化方法。以华东区域H市排水管网为案例,以23个原始监测点的监测数据为基础,通过原始数据处理,BIRCH预聚类确定优化监测点个数和初步优化监测点,再用K-means聚类确定最终优化监测点后,输出16个保留监测点位。经验证,监测点优化后对H市排水管网的数据输出无影响。

基于K-means聚类分析的在线学习行为研究——以开放大学药学专业学习者为例

随着在线教育的迅速普及,如何利用在线课程平台的海量教育数据进行信息挖掘,识别学习者行为特征,从而实现数据驱动的因材施教,是在线教育发展的重要问题。以国家开放大学药学专业学习者为研究对象,采用K-means聚类算法分析学生在国家开放大学学习平台上的学习行为。将学生细分为4个类群,分别为“持续学习者”“消极学习者”“投机学习者”“突击学习者”,其比例分别为0.96%、18.41%、76.96%和3.67%,并探讨在线教育提升学习效果的可行对策,以期为开放教育和在线教育的因材施教提供一定的借鉴和参考。