Application Analysis of Nursing Students'Grades in Course Relevance Based on Association Rule Mining Algorithm Apriori

By analyzing the correlation between courses in students’grades,we can provide a decision-making basis for the revision of courses and syllabi,rationally optimize courses,and further improve teaching effects.With the help of IBM SPSS Modeler data mining software,this paper uses Apriori algorithm for association rule mining to conduct an in-depth analysis of the grades of nursing students in Shandong College of Traditional Chinese Medicine,and to explore the correlation between professional basic courses and professional core courses.Lastly,according to the detailed analysis of the mining results,valuable curriculum information will be found from the actual teaching data.

Plant Leaf Diseases Classification Using Improved K-Means Clustering and SVM Algorithm for Segmentation

Several pests feed on leaves,stems,bases,and the entire plant,causing plant illnesses.As a result,it is vital to identify and eliminate the disease before causing any damage to plants.Manually detecting plant disease and treating it is pretty challenging in this period.Image processing is employed to detect plant disease since it requires much effort and an extended processing period.The main goal of this study is to discover the disease that affects the plants by creating an image processing system that can recognize and classify four different forms of plant diseases,including Phytophthora infestans,Fusarium graminearum,Puccinia graminis,tomato yellow leaf curl.Therefore,this work uses the Support vector machine(SVM)classifier to detect and classify the plant disease using various steps like image acquisition,Pre-processing,Segmentation,feature extraction,and classification.The gray level co-occurrence matrix(GLCM)and the local binary pattern features(LBP)are used to identify the disease-affected portion of the plant leaf.According to experimental data,the proposed technology can correctly detect and diagnose plant sickness with a 97.2 percent accuracy.

Genetic Algorithm Combined with the K-Means Algorithm:A Hybrid Technique for Unsupervised Feature Selection

The dimensionality of data is increasing very rapidly,which creates challenges for most of the current mining and learning algorithms,such as large memory requirements and high computational costs.The literature includes much research on feature selection for supervised learning.However,feature selection for unsupervised learning has only recently been studied.Finding the subset of features in unsupervised learning that enhances the performance is challenging since the clusters are indeterminate.This work proposes a hybrid technique for unsupervised feature selection called GAk-MEANS,which combines the genetic algorithm(GA)approach with the classical k-Means algorithm.In the proposed algorithm,a new fitness func-tion is designed in addition to new smart crossover and mutation operators.The effectiveness of this algorithm is demonstrated on various datasets.Fur-thermore,the performance of GAk-MEANS has been compared with other genetic algorithms,such as the genetic algorithm using the Sammon Error Function and the genetic algorithm using the Sum of Squared Error Function.Additionally,the performance of GAk-MEANS is compared with the state-of-the-art statistical unsupervised feature selection techniques.Experimental results show that GAk-MEANS consistently selects subsets of features that result in better classification accuracy compared to others.In particular,GAk-MEANS is able to significantly reduce the size of the subset of selected features by an average of 86.35%(72%–96.14%),which leads to an increase of the accuracy by an average of 3.78%(1.05%–6.32%)compared to using all features.When compared with the genetic algorithm using the Sammon Error Function,GAk-MEANS is able to reduce the size of the subset of selected features by 41.29%on average,improve the accuracy by 5.37%,and reduce the time by 70.71%.When compared with the genetic algorithm using the Sum of Squared Error Function,GAk-MEANS on average is able to reduce the size of the subset of selected features by 15.91%,and improve the accuracy by 9.81%,but the time is increased by a factor of 3.When compared with the machine-learning based methods,we observed that GAk-MEANS is able to increase the accuracy by 13.67%on average with an 88.76%average increase in time.

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.

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.

Estimating wheat fractional vegetation cover using a density peak k-means algorithm based on hyperspectral image data

Fractional vegetation cover(FVC)is an important parameter to measure crop growth.In studies of crop growth monitoring,it is very important to extract FVC quickly and accurately.As the most widely used FVC extraction method,the photographic method has the advantages of simple operation and high extraction accuracy.However,when soil moisture and acquisition times vary,the extraction results are less accurate.To accommodate various conditions of FVC extraction,this study proposes a new FVC extraction method that extracts FVC from a normalized difference vegetation index(NDVI)greyscale image of wheat by using a density peak k-means(DPK-means)algorithm.In this study,Yangfumai 4(YF4)planted in pots and Yangmai 16(Y16)planted in the field were used as the research materials.With a hyperspectral imaging camera mounted on a tripod,ground hyperspectral images of winter wheat under different soil conditions(dry and wet)were collected at 1 m above the potted wheat canopy.Unmanned aerial vehicle(UAV)hyperspectral images of winter wheat at various stages were collected at 50 m above the field wheat canopy by a UAV equipped with a hyperspectral camera.The pixel dichotomy method and DPK-means algorithm were used to classify vegetation pixels and non-vegetation pixels in NDVI greyscale images of wheat,and the extraction effects of the two methods were compared and analysed.The results showed that extraction by pixel dichotomy was influenced by the acquisition conditions and its error distribution was relatively scattered,while the extraction effect of the DPK-means algorithm was less affected by the acquisition conditions and its error distribution was concentrated.The absolute values of error were 0.042 and 0.044,the root mean square errors(RMSE)were 0.028 and 0.030,and the fitting accuracy R2 of the FVC was 0.87 and 0.93,under dry and wet soil conditions and under various time conditions,respectively.This study found that the DPK-means algorithm was capable of achieving more accurate results than the pixel dichotomy method in various soil and time conditions and was an accurate and robust method for FVC extraction.

Polarimetric Meteorological Satellite Data Processing Software Classification Based on Principal Component Analysis and Improved K-Means Algorithm

With the increasing variety of application software of meteorological satellite ground system, how to provide reasonable hardware resources and improve the efficiency of software is paid more and more attention. In this paper, a set of software classification method based on software operating characteristics is proposed. The method uses software run-time resource consumption to describe the software running characteristics. Firstly, principal component analysis (PCA) is used to reduce the dimension of software running feature data and to interpret software characteristic information. Then the modified K-means algorithm was used to classify the meteorological data processing software. Finally, it combined with the results of principal component analysis to explain the significance of various types of integrated software operating characteristics. And it is used as the basis for optimizing the allocation of software hardware resources and improving the efficiency of software operation.

Development of slope mass rating system using K-means and fuzzy c-means clustering algorithms

Classification systems such as Slope Mass Rating(SMR) are currently being used to undertake slope stability analysis. In SMR classification system, data is allocated to certain classes based on linguistic and experience-based criteria. In order to eliminate linguistic criteria resulted from experience-based judgments and account for uncertainties in determining class boundaries developed by SMR system,the system classification results were corrected using two clustering algorithms, namely K-means and fuzzy c-means(FCM), for the ratings obtained via continuous and discrete functions. By applying clustering algorithms in SMR classification system, no in-advance experience-based judgment was made on the number of extracted classes in this system, and it was only after all steps of the clustering algorithms were accomplished that new classification scheme was proposed for SMR system under different failure modes based on the ratings obtained via continuous and discrete functions. The results of this study showed that, engineers can achieve more reliable and objective evaluations over slope stability by using SMR system based on the ratings calculated via continuous and discrete functions.

Hybrid Genetic Algorithm with K-Means for Clustering Problems

The K-means method is one of the most widely used clustering methods and has been implemented in many fields of science and technology. One of the major problems of the k-means algorithm is that it may produce empty clusters depending on initial center vectors. Genetic Algorithms (GAs) are adaptive heuristic search algorithm based on the evolutionary principles of natural selection and genetics. This paper presents a hybrid version of the k-means algorithm with GAs that efficiently eliminates this empty cluster problem. Results of simulation experiments using several data sets prove our claim.

A Hybrid Method Combining Improved K-means Algorithm with BADA Model for Generating Nominal Flight Profiles

A high-precision nominal flight profile,involving controllers′intentions is critical for 4Dtrajectory estimation in modern automatic air traffic control systems.We proposed a novel method to effectively improve the accuracy of the nominal flight profile,including the nominal altitude profile and the speed profile.First,considering the characteristics of trajectory data,we developed an improved K-means algorithm.The approach was to measure the similarity between different altitude profiles by integrating the space warp edit distance algorithm,thereby to acquire several fitted nominal flight altitude profiles.This approach breaks the constraints of traditional K-means algorithms.Second,to eliminate the influence of meteorological factors,we introduced historical gridded binary data to determine the en-route wind speed and temperature via inverse distance weighted interpolation.Finally,we facilitated the true airspeed determined by speed triangle relationships and the calibrated airspeed determined by aircraft data model to extract a more accurate nominal speed profile from each cluster,therefore we could describe the airspeed profiles above and below the airspeed transition altitude,respectively.Our experimental results showed that the proposed method could obtain a highly accurate nominal flight profile,which reflects the actual aircraft flight status.

Similarity matrix-based K-means algorithm for text clustering

K-means algorithm is one of the most widely used algorithms in the clustering analysis. To deal with the problem caused by the random selection of initial center points in the traditional al- gorithm, this paper proposes an improved K-means algorithm based on the similarity matrix. The im- proved algorithm can effectively avoid the random selection of initial center points, therefore it can provide effective initial points for clustering process, and reduce the fluctuation of clustering results which are resulted from initial points selections, thus a better clustering quality can be obtained. The experimental results also show that the F-measure of the improved K-means algorithm has been greatly improved and the clustering results are more stable.

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.

An Improved K-Means Algorithm Based on Initial Clustering Center Optimization

The K-means algorithm is widely known for its simplicity and fastness in text clustering.However,the selection of the initial clus?tering center with the traditional K-means algorithm is some random,and therefore,the fluctuations and instability of the clustering results are strongly affected by the initial clustering center.This paper proposed an algorithm to select the initial clustering center to eliminate the uncertainty of central point selection.The experiment results show that the improved K-means clustering algorithm is superior to the traditional algorithm.

Multiple Parameter Based Clustering (MPC): Prospective Analysis for Effective Clustering in Wireless Sensor Network (WSN) Using K-Means Algorithm

In wireless sensor network cluster architecture is useful because of its inherent suitability for data fusion. In this paper we represent a new approach called Multiple Parameter based Clustering (MPC) embedded with the traditional k-means algorithm which takes different parameters (Node energy level, Euclidian distance from the base station, RSSI, Latency of data to reach base station) into consideration to form clusters. Then the effectiveness of the clusters is evaluated based on the uniformity of the node distribution, Node range per cluster, Intra and Inter cluster distance and required energy level of each centroid. Our result shows that by varying multiple parameters we can create clusters with more uniformly distributed nodes, minimize intra and maximize inter cluster distance and elect less power consuming centroid.

基于Apriori算法的煤矿安全事故分析

为分析煤矿事故报告中的危险致因因素,统计分析了2018—2022年全国煤矿事故报告数据,采用Apriori关联规则算法,并利用Gephi进行关联规则可视化,探究各个致因之间的复杂关系。首先对数据进行预处理,计算词频-逆向文件频率(Term Frequency-Inverse Document Frequency, TF-IDF),提取了78个煤矿事故致因因素,其中人因层包括31个因素,设备层包括9个因素,管理层包括31个因素,环境层包括7个因素;然后,经过关联规则挖掘算法,得到了585条关联规则,绘制了其支持度、置信度和提升度的散点图;最后,根据Gephi生成的事故致因复杂网络图,分别分析了高支持度、高置信度和高提升度关联规则致因因素。结果表明:基于Apriori算法的煤矿事故致因分析,得到了人因层、管理层、设备层和环境层4个方面的关键致因因素;对煤矿关键致因因素进行直观、多视图的展现,有助于提高煤矿安全管理水平。

谱聚类和Apriori算法在建筑坍塌事故致因组合分析中的应用

建筑坍塌事故是人员伤亡和经济损失较大的事故类型之一。为探究建筑坍塌事故不同致因之间的关联和相互依存关系,首先,选取国内2015—2020年231份建筑坍塌事故报告作为研究对象,借助R语言平台进行文本挖掘,得到43个致因。其次,运用Python进行谱聚类,根据致因之间的关联强度对其进行聚类。最后,利用关联规则挖掘Apriori算法确定建筑坍塌事故致因之间的关键关联组合。结果表明,43个事故致因可分为5类,在每一个簇类中确定了最关键的致因组合,并提出了针对性的预防措施,为坍塌事故的预防和控制提供一种新的思路。

基于k-means与Apriori算法的食物营养成分分析

营养作为人类生活的必要前提,大量患有某种疾病患者或由于工作职业原因对不同营养成分需求各不一致,发现不同食物种类营养成分及含量间的关系具有较强的应用价值。由于各类食物类别所含食物数量不同,针对Apriori算法通过支持度和置信度来衡量关联规则的特点,为克服各类食物数量不一致容易对挖掘结果产生不良影响,设计了一种通过k-means与Apriori算法对多种食物的营养成分及含量的挖掘与分析的方法。首先根据不同食物营养成分含量采用k-means聚类算法进行聚类,将食物数据集划分出了多个互不相交的"簇",再在各"簇"内通过Apriori算法实现食物营养成分含量之间的关联规则挖掘,其结果表明使用该方法经过聚类后的同一簇内食物营养成分关联程度明显优于直接在数据集中使用Apriori算法进行挖掘,为各类人群的合理膳食及饮食健康提供了重要的参考依据。

基于K-Means与Apriori算法的盐包外敷中药处方研究

目的:探究具有舒筋活络、活血祛瘀、消炎止痛等疗效方剂的组方规律,制定盐包外敷中药处方。方法:对多部国内中成药方剂标准进行标准化处理,运用SPSSClementine12.0进行K-Means聚类及Apriori关联分析。结果:筛选方剂共281首,中药共计656味,聚类结果得到盐包处方:没药、乳香、红花、当归、川芎、川乌、草乌、冰片、樟脑、薄荷脑、麻黄、羌活、白芷,关联分析结果与此一致,较好地验证了聚类分析结果。结论:制定的盐包外敷中药处方在两种不同算法的验证下提高其可行性,为舒筋活络等疗效的外敷方剂研究和盐包外敷方剂开发提供参考信息。

基于内-外因理论和Apriori算法的动火作业事故分析

为研究动火作业事故致因及其相互作用,采用Apriori关联规则算法和内-外因理论相结合的方法,对2013-2023年100起动火作业事故致因进行深入分析。根据内-外因事故致因理论,从作业人员、设备设施、作业场所和作业管理4个方面对事故原因进行分类,分析不同事故原因的发生频数,构建动火作业事故致因因素集;采用Apriori算法挖掘事故致因间的关联关系,对强关联规则进行具体分析。研究结果表明:作业前检查不到位、安全教育培训不到位、安全主体责任落实不到位等是导致动火作业事故发生的关键致因因素,在此基础上提出针对动火作业安全的预防措施,并构建动火作业安全管控策略。研究结果可为揭示动火作业事故预防的关键点,减少动火作业事故的发生提供参考。

基于SIF模型与Apriori算法的煤矿顶板事故致因关联分析

为更科学地预防煤矿顶板事故的发生,对煤矿顶板事故致因及其关联规则进行识别十分关键。首先,通过文本挖掘并结合SIF事故致因模型,确定56个影响顶板事故发生的致因;其次,通过构建顶板事故数据库并运用Apriori算法进行顶板事故致因关联规则挖掘;最后,绘制顶板事故致因关联规则复杂网络图,并综合分析顶板事故的核心致因及各致因间的关联规则。结果表明:安全培训教育和安全监督管理、作业人员安全意识淡薄和违反作业规程、当班管理人员在现场的管理不到位和其他事故致因之间有着很高的关联度以及提升度,这些因素是造成煤矿顶板事故发生的核心因素。