Research on the Intelligent Distribution System of College Dormitory Based on the Decision Tree Classification Algorithm

The trend toward designing an intelligent distribution system based on students’individual differences and individual needs has taken precedence in view of the traditional dormitory distribution system,which neglects the students’personality traits,causes dormitory disputes,and affects the students’quality of life and academic quality.This paper collects freshmen's data according to college students’personal preferences,conducts a classification comparison,uses the decision tree classification algorithm based on the information gain principle as the core algorithm of dormitory allocation,determines the description rules of students’personal preferences and decision tree classification preferences,completes the conceptual design of the database of entity relations and data dictionaries,meets students’personality classification requirements for the dormitory,and lays the foundation for the intelligent dormitory allocation system.

Decision tree support vector machine based on genetic algorithm for multi-class classification

To solve the multi-class fault diagnosis tasks, decision tree support vector machine （DTSVM）, which combines SVM and decision tree using the concept of dichotomy, is proposed. Since the classification performance of DTSVM highly depends on its structure, to cluster the multi-classes with maximum distance between the clustering centers of the two sub-classes, genetic algorithm is introduced into the formation of decision tree, so that the most separable classes would be separated at each node of decisions tree. Numerical simulations conducted on three datasets compared with ＂one-against-all＂ and ＂one-against-one＂ demonstrate the proposed method has better performance and higher generalization ability than the two conventional methods.

Remote Sensing Image Classification Based on Decision Tree in the Karst Rocky Desertification Areas: A Case Study of Kaizuo Township

Karst rocky desertification is a phenomenon of land degradation as a result of affection by the interaction of natural and human factors.In the past,in the rocky desertification areas,supervised classification and unsupervised classification are often used to classify the remote sensing image.But they only use pixel brightness characteristics to classify it.So the classification accuracy is low and can not meet the needs of practical application.Decision tree classification is a new technology for remote sensing image classification.In this study,we select the rocky desertification areas Kaizuo Township as a case study,use the ASTER image data,DEM and lithology data,by extracting the normalized difference vegetation index,ratio vegetation index,terrain slope and other data to establish classification rules to build decision trees.In the ENVI software support,we access the classification images.By calculating the classification accuracy and kappa coefficient,we find that better classification results can be obtained,desertification information can be extracted automatically and if more remote sensing image bands used,higher resolution DEM employed and less errors data reduced during processing,classification accuracy can be improve further.

Self-Tuning Parameters for Decision Tree Algorithm Based on Big Data Analytics

Big data is usually unstructured, and many applications require theanalysis in real-time. Decision tree (DT) algorithm is widely used to analyzebig data. Selecting the optimal depth of DT is time-consuming process as itrequires many iterations. In this paper, we have designed a modified versionof a (DT). The tree aims to achieve optimal depth by self-tuning runningparameters and improving the accuracy. The efficiency of the modified (DT)was verified using two datasets (airport and fire datasets). The airport datasethas 500000 instances and the fire dataset has 600000 instances. A comparisonhas been made between the modified (DT) and standard (DT) with resultsshowing that the modified performs better. This comparison was conductedon multi-node on Apache Spark tool using Amazon web services. Resultingin accuracy with an increase of 6.85% for the first dataset and 8.85% for theairport dataset. In conclusion, the modified DT showed better accuracy inhandling different-sized datasets compared to standard DT algorithm.

A Decision Tree Classifier for Intrusion Detection Priority Tagging

Snort rule-checking is one of the most popular forms of Network Intrusion Detection Systems (NIDS). In this article, we show that Snort priorities of true positive traffic (real attacks) can be approximated in real-time, in the context of high speed networks, by a decision tree classifier, using the information of only three easily extracted features (protocol, source port, and destination port), with an accuracy of 99%. Snort issues alert priorities based on its own default set of attack classes (34 classes) that are used by the default set of rules it provides. But the decision tree model is able to predict the priorities without using this default classification. The obtained tagger can provide a useful complement to an anomaly detection intrusion detection system.

A New Approach to Predict Financial Failure： Classification and Regression Trees （CART）

The increase of competition, economic recession and financial crises has increased business failure and depending on this the researchers have attempted to develop new approaches which can yield more correct and more reliable results. The classification and regression tree （CART） is one of the new modeling techniques which is developed for this purpose. In this study, the classification and regression trees method is explained and tested the power of the financial failure prediction. CART is applied for the data of industry companies which is trade in Istanbul Stock Exchange （ISE） between 1997-2007. As a result of this study, it has been observed that, CART has a high predicting power of financial failure one, two and three years prior to failure, and profitability ratios being the most important ratios in the prediction of failure.

A 4-Corner Codes Classifier Based on Decision Tree Inductive Learning for Handwritten Chinese Characters

The classification for handwritten Chinese character recognition can be viewed as a transformation in discrete vector space. In this paper, from the point of discrete vector space transformation, a new 4-corner codes classifier based on decision tree inductive learning algorithm ID3 for handwritten Chinese characters is presented. With a feature extraction controller, the classifier can reduce the number of extracted features and accelerate classification speed. Experimental results show that the 4-corner codes classifier performs well on both recognition accuracy and speed.

A retinal blood vessel extraction algorithm based on CART decision tree and improved AdaBoost

This paper presents a supervised learning algorithm for retinal vascular segmentation based on classification and regression tree (CART) algorithm and improved adptive bosting (AdaBoost). Local binary patterns (LBP) texture features and local features are extracted by extracting,reversing,dilating and enhancing the green components of retinal images to construct a 17-dimensional feature vector. A dataset is constructed by using the feature vector and the data manually marked by the experts. The feature is used to generate CART binary tree for nodes,where CART binary tree is as the AdaBoost weak classifier,and AdaBoost is improved by adding some re-judgment functions to form a strong classifier. The proposed algorithm is simulated on the digital retinal images for vessel extraction (DRIVE). The experimental results show that the proposed algorithm has higher segmentation accuracy for blood vessels,and the result basically contains complete blood vessel details. Moreover,the segmented blood vessel tree has good connectivity,which basically reflects the distribution trend of blood vessels. Compared with the traditional AdaBoost classification algorithm and the support vector machine (SVM) based classification algorithm,the proposed algorithm has higher average accuracy and reliability index,which is similar to the segmentation results of the state-of-the-art segmentation algorithm.

Forecasting Model of Agro-meteorological Disaster Grade Based on Decision Tree

Based on the discuss of the basic concept of data mining technology and the decision tree method,combining with the data samples of wind and hailstorm disasters in some counties of Mudanjiang region,the forecasting model of agro-meteorological disaster grade was established by adopting the C4.5 classification algorithm of decision tree,which can forecast the direct economic loss degree to provide rational data mining model and obtain effective analysis results.

Landslide susceptibility zonation method based on C5.0 decision tree and K-means cluster algorithms to improve the efficiency of risk management

Machine learning algorithms are an important measure with which to perform landslide susceptibility assessments, but most studies use GIS-based classification methods to conduct susceptibility zonation.This study presents a machine learning approach based on the C5.0 decision tree(DT) model and the K-means cluster algorithm to produce a regional landslide susceptibility map. Yanchang County, a typical landslide-prone area located in northwestern China, was taken as the area of interest to introduce the proposed application procedure. A landslide inventory containing 82 landslides was prepared and subsequently randomly partitioned into two subsets: training data(70% landslide pixels) and validation data(30% landslide pixels). Fourteen landslide influencing factors were considered in the input dataset and were used to calculate the landslide occurrence probability based on the C5.0 decision tree model.Susceptibility zonation was implemented according to the cut-off values calculated by the K-means cluster algorithm. The validation results of the model performance analysis showed that the AUC(area under the receiver operating characteristic(ROC) curve) of the proposed model was the highest, reaching 0.88,compared with traditional models(support vector machine(SVM) = 0.85, Bayesian network(BN) = 0.81,frequency ratio(FR) = 0.75, weight of evidence(WOE) = 0.76). The landslide frequency ratio and frequency density of the high susceptibility zones were 6.76/km^(2) and 0.88/km^(2), respectively, which were much higher than those of the low susceptibility zones. The top 20% interval of landslide occurrence probability contained 89% of the historical landslides but only accounted for 10.3% of the total area.Our results indicate that the distribution of high susceptibility zones was more focused without containing more " stable" pixels. Therefore, the obtained susceptibility map is suitable for application to landslide risk management practices.

Decision Tree算法在地质建模岩性识别中的研究

针对地质建模时,人工识别山体内部岩石的局限性、低效率且易受主观因素影响等问题,提出了基于地震波反射信号的岩石类型自动识别技术。通过处理地震波反射信号获得岩石力学参数,采用Decision Tree ID3算法,提取岩石密度、波速、弹性模量、剪切模量,构建岩性识别模型分类器。通过该分类器对某山体内部岩石类型进行判断,研究结果证明:研究区内部多为辉长岩,玄武岩最少,通过模型分类结果与研究区真实地质对比分析,玄武岩正判率达到93%,安山岩、闪长岩正判率达到100%,花岗岩正判率达到88%,决策树建立的分类器模型能够基于地震波反射信号高效、准确地识别岩石岩性。

Improving Decision Tree Performance by Exception Handling

This paper focuses on improving decision tree induction algorithms when a kind of tie appears during the rule generation procedure for specific training datasets. The tie occurs when there are equal proportions of the target class outcome in the leaf node＇s records that leads to a situation where majority voting cannot be applied. To solve the above mentioned exception, we propose to base the prediction of the result on the naive Bayes （NB） estimate, k-nearest neighbour （k-NN） and association rule mining （ARM）. The other features used for splitting the parent nodes are also taken into consideration.

Automated soil resources mapping based on decision tree and Bayesian predictive modeling

This article presents two approaches for automated building of knowledge bases of soil resources mapping. These methods used decision tree and Bayesian predictive modeling, respectively to generate knowledge from training data. With these methods, building a knowledge base for automated soil mapping is easier than using the conventional knowledge acquisition approach. The knowledge bases built by these two methods were used by the knowledge classifier for soil type classification of the Longyou area, Zhejiang Province, China using TM bi-temporal imageries and GIS data. To evaluate the performance of the resultant knowledge bases, the classification results were compared to existing soil map based on field survey. The accuracy assessment and analysis of the resultant soil maps suggested that the knowledge bases built by these two methods were of good quality for mapping distribution model of soil classes over the study area.

A New Method for Constructing Decision Tree Based on Rough Sets Theory

Decision trees induction algorithms have been used for classification in a wide range of application domains. In the process of constructing a tree, the criteria of selecting test attributes will influence the classification accuracy of the tree.In this paper,the degree of dependency of decision attribute to condition attribute,based on rough set theory,is used as a heuristic for selecting the attribute that will best separate the samples into individual classes.The result of an example shows that compared with the entropy-based approach,our approach is a better way to select nodes for constructing decision trees.

Ordinal Decision Trees

In many decision making tasks,the features and decision are ordinal.Several ordinal classification learning algorithms have been developed in recent years,it is shown that these algorithms are sensitive to noisy samples and do not work in real-world applications.In this work,we propose a new measure of feature quality, called rank mutual information.Then,we design an ordinal decision tree(REOT) construction technique based on rank mutual information.The theoretic and experimental analysis shows that the proposed algorithm is effective.

基于CART决策树的分布式数据离群点检测算法

在分布式计算环境中,离群点通常表示数据中的异常情况,例如故障、欺诈、攻击等。通过检测分布式数据的离群点,可以对这些异常数据进行集中处理,保护系统和数据的安全。而进行离群点检测时,不仅要考虑数据的规模和复杂性,还要在分布式环境下高效地发现离群点。因此,提出一种基于CART决策树的分布式数据离群点检测算法。在构建CART决策树时,使用类间中心距离作为分裂准则,根据分离类别对训练数据进行分类,从而确定数据的类型。在上述基础上,考虑到离群点的分布模式与其周围数据对象不同,使用空间局部偏离因子(SLDF)对空间内各个数据对象之间的离群程度展开度量,同时在高维空间内展开网格划分,引入SLDF算法检测剩余离群点集,最终实现分布式数据离群点检测。实验结果表明,所提方法的离散点检测错误率在0.010以内,可以更加精准地实现分布式数据离群点检测,具有良好的检测性能。

基于CART决策树的调度算法研究

以往的作业车间存在大量的离线加工数据。基于数据挖掘、调度规则和算法优化相关知识,提出基于贝叶斯优化的改进CART算法来对车间数据挖掘利用,根据车间数据的属性逐步划分节点,生成树状结构,剪枝,最后生成加工规则。通过不同数据算例的实验结果表明,经过贝叶斯优化后的CART算法相较于传统CART算法提高了对数据划分的能力并提升了生成的决策树的准确度。

基于CART决策树的FPSO单点系泊系统电滑环故障诊断

为了保障FPSO单点系泊系统电滑环运行安全,有必要开展电滑环故障诊断方法的研究,为单点系泊系统电滑环故障预警与排查提供依据。本文针对FPSO单点电滑环故障的诊断问题,采用了一种基于CART决策树算法的故障诊断模型;进一步利用有限元制作样本数据集,并通过该数据集训练得到了电滑环故障诊断模型;最后,通过后剪枝法完成了诊断模型的简化,实现了对电滑环的故障诊断。分析结果可以得到,该模型具有较高的准确率和较快的诊断速度,能够对电滑环进行有效的诊断,以便工作人员及时采取措施修复或更换电滑环,保证FPSO的安全运行。

基于Morlet小波与CART决策树的滚动轴承故障诊断方法

针对滚动轴承故障诊断过程中样本处理、故障识别等技术问题,提出一种基于Morlet小波和分类回归树(Classification and Regression Tree,CART)的滚动轴承故障诊断方法。首先,利用Morlet小波分析方法和移动窗方法对轴承振动信号进行样本处理。其次,对提取的短样本进行变分模态分解与特征提取,完成训练集和测试集的构建。然后,使用训练集训练CART决策树分类模型,同时引入随机搜索和K折交叉验证用于模型关键参数优化,以获取理想的轴承故障分类模型。测试集验证结果表明,该方法不但能实现多种轴承故障的有效诊断、在含噪测试集中表现良好,而且单个样本的数据长度和采样时长的缩短效果明显。

基于CART算法的纳木措湖泊面积精确提取

为了能够更精确地提取到湖泊水体的范围,对比MLC、SVM和基于多特征的全新遥感影像CART决策树分类方法,对西藏自治区的纳木措湖泊进行自动提取研究.选择Landsat 8OLI卫星遥感影像数据作为数据源.将得到的不同特征的影像进行组合,组合成全新的多特征遥感影像.决策树方法具有结构清晰、快速、简单、有效的优点,而CART算法可以根据选取的训练样本获取节点和阈值,不需要反复试验来确定阈值,避免了基于传统专家知识方法的主观性,因此采用CART算法构建决策树模型对研究区域进行湖泊水体的提取.结果表明CART决策树方法总体精度为99.82%,Kappa系数为0.996,MLC总体精度为96.814%,Kappa系数值为0.929,SVM总体精度为98.045%,Kappa系数值为0.956,总体精度相较于SVM和MLC分别提高了3%、1.775%,Kappa系数提高了0.067、0.04.CART决策树、MLC、SVM所得到的湖泊面积分别为2009.43、2014.93、2026.9 km^(2),MLC和SVM得到的结果比CART决策树分类法存在更多的错分和漏分现象,主要是将山地中的阴影信息错认为是水体,CART决策树方法识别到的细小水体更加连续,对于湖泊边界识别的效果也更好.