Stress-assisted corrosion mechanism of 3Ni steel by using gradient boosting decision tree machining learning method

Traditional 3Ni weathering steel cannot completely meet the requirements for offshore engineering development,resulting in the design of novel 3Ni steel with the addition of microalloy elements such as Mn or Nb for strength enhancement becoming a trend.The stress-assisted corrosion behavior of a novel designed high-strength 3Ni steel was investigated in the current study using the corrosion big data method.The information on the corrosion process was recorded using the galvanic corrosion current monitoring method.The gradi-ent boosting decision tree(GBDT)machine learning method was used to mine the corrosion mechanism,and the importance of the struc-ture factor was investigated.Field exposure tests were conducted to verify the calculated results using the GBDT method.Results indic-ated that the GBDT method can be effectively used to study the influence of structural factors on the corrosion process of 3Ni steel.Dif-ferent mechanisms for the addition of Mn and Cu to the stress-assisted corrosion of 3Ni steel suggested that Mn and Cu have no obvious effect on the corrosion rate of non-stressed 3Ni steel during the early stage of corrosion.When the corrosion reached a stable state,the in-crease in Mn element content increased the corrosion rate of 3Ni steel,while Cu reduced this rate.In the presence of stress,the increase in Mn element content and Cu addition can inhibit the corrosion process.The corrosion law of outdoor-exposed 3Ni steel is consistent with the law based on corrosion big data technology,verifying the reliability of the big data evaluation method and data prediction model selection.

Impact Damage Testing Study of Shanxi-Beijing Natural Gas Pipeline Based on Decision Tree Rotary Tiller Operation

The North China Plain and the agricultural region are crossed by the Shanxi-Beijing natural gas pipeline.Resi-dents in the area use rototillers for planting and harvesting;however,the depth of the rototillers into the ground is greater than the depth of the pipeline,posing a significant threat to the safe operation of the pipeline.Therefore,it is of great significance to study the dynamic response of rotary tillers impacting pipelines to ensure the safe opera-tion of pipelines.This article focuses on the Shanxi-Beijing natural gas pipeline,utilizingfinite element simulation software to establish afinite element model for the interaction among the machinery,pipeline,and soil,and ana-lyzing the dynamic response of the pipeline.At the same time,a decision tree model is introduced to classify the damage of pipelines under different working conditions,and the boundary value and importance of each influen-cing factor on pipeline damage are derived.Considering the actual conditions in the hemp yam planting area,targeted management measures have been proposed to ensure the operational safety of the Shanxi-Beijing natural gas pipeline in this region.

基于Decision Trees的配电网中性点不接地系统选线

针对配电网中性点不接地系统,使用录波数据解决单相接地选线不准的难题,提出了基于Decision Trees算法进行单相接地选线的方法.使用PSCAD仿真10kV配电网单相接地故障得到录波数据,转换成通用格式,提取稳态数据并进行预处理,通过对比多个机器学习分类算法,选择基于Decision Trees算法进行单相接地选线.选择的Decision Trees算法训练准确度高达99.99%,且模型小,训练速度快.将训练后的模型导出,使用实际的故障录波数据进行验证,选线准确度高达95%以上.结果表明该方法易于实现,准确度高,适合在实际中应用.

A Data-Driven Oil Production Prediction Method Based on the Gradient Boosting Decision Tree Regression

Accurate prediction ofmonthly oil and gas production is essential for oil enterprises tomake reasonable production plans,avoid blind investment and realize sustainable development.Traditional oil well production trend prediction methods are based on years of oil field production experience and expertise,and the application conditions are very demanding.With the rapid development of artificial intelligence technology,big data analysis methods are gradually applied in various sub-fields of the oil and gas reservoir development.Based on the data-driven artificial intelligence algorithmGradient BoostingDecision Tree(GBDT),this paper predicts the initial single-layer production by considering geological data,fluid PVT data and well data.The results show that the GBDT algorithm prediction model has great accuracy,significantly improving efficiency and strong universal applicability.The GBDTmethod trained in this paper can predict production,which is helpful for well site optimization,perforation layer optimization and engineering parameter optimization and has guiding significance for oilfield development.

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.

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.

Recognition of Hybrid PQ Disturbances Based on Multi-Resolution S-Transform and Decision Tree

Aiming at the problems of multiple types of power quality composite disturbances,strong feature correlation and high recognition error rate,a method of power quality composite disturbances identification based on multiresolution S-transform and decision tree was proposed.Firstly,according to IEEE standard,the signal models of seven single power quality disturbances and 17 combined power quality disturbances are given,and the disturbance waveform samples are generated in batches.Then,in order to improve the recognition accuracy,the adjustment factor is introduced to obtain the controllable time-frequency resolution through multi-resolution S-transform time-frequency domain analysis.On this basis,five disturbance time-frequency domain features are extracted,which quantitatively reflect the characteristics of the analyzed power quality disturbance signal,which is less than the traditional method based on S-transform.Finally,three classifiers such as K-nearest neighbor,support vector machine and decision tree algorithm are used to effectively complete the identification of power quality composite disturbances.Simulation results showthat the classification accuracy of decision tree algorithmis higher than that of K-nearest neighbor and support vector machine.Finally,the proposed method is compared with other commonly used recognition algorithms.Experimental results show that the proposedmethod is effective in terms of detection accuracy,especially for combined PQ interference.

Study on Crops Classification Based on Multi-spectral Image and Decision Tree Method

[Objective] The aim was to explore the feasibility of using single spectrum image to classify crops based on multi-spectral image and Decision Tree Method. [Method] Taking the typical agriculture plantation area in Hulunbeier area, according to field measured spectrum data, the optimum time of main crops, barley, wheat, rapeseed, based on crops spectrum characteristics, by dint of decision-making tree method, and considering spectral matching method, classification of crops was studied such as SAM. [Result] By dint of Landsat TM image gained in the first half of August, based on geographic and atmospheric proof-reading, decision-making tree was constructed. Plantation information about wheat, barley, and rapeseed and plantation grassland was extracted successfully. The general classification accuracy reached 86.90%. Kappa coefficient was 0.831 1. [Conclusion] Taking typical spectrum image as data source, and applying Decision Tree Method to get crops type＇s information had fine application future.

Study on Extracting Information about Settlements Distribution in Western Jilin Province Based on Decision Tree Model

With western Jilin Province as the study region, spectral characteristics and texture features of remote sensing images were taken as the classification basis to construct a Decision Tree Model and extract information about settlements in western Jilin Province, and the manually-extracted information about settlements in western Jilin Province was evaluated by confusion matrix. The results showed that Decision Tree Model was convenient for extracting settlements information by integrating spectral and texture features, and the accuracy of such a method was higher than that of the traditional Maximum Liklihood Method, in addition, calculation methods of extracting settlements information by this mean were concluded.

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.

Application of Clustering-based Decision Tree in the Screening of Maize Germplasm

[Objective] This paper aims to construct an improved fuzzy decision tree which is based on clustering,and researches into its application in the screening of maize germplasm.[Method] A new decision tree algorithm based upon clustering is adopted in this paper,which is improved against the defect that traditional decision tree algorithm fails to handle samples of no classes.Meanwhile,the improved algorithm is also applied to the screening of maize varieties.Through the indices as leaf area,plant height,dry weight,potassium（K） utilization and others,maize seeds with strong tolerance of hypokalemic are filtered out.[Result] The algorithm in the screening of maize germplasm has great applicability and good performance.[Conclusion] In the future more efforts should be made to compare improved the performance of fuzzy decision tree based upon clustering with the performance of traditional fuzzy one,and it should be applied into more realistic problems.

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 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.

Nitrogen removal influence factors in A/O process and decision trees for nitrification/denitrification system

In order to improve nitrogen removal in anoxic/oxic(A/O) process effectively for treating domestic wastewaters, the influence factors, DO(dissolved oxygen), nitrate recirculation, sludge recycle, SRT(solids residence time), influent COD/TN and HRT(hydraulic retention time) were studied. Results indicated that it was possible to increase nitrogen removal by using corresponding control strategies, such as, adjusting the DO set point according to effluent ammonia concentration; manipulating nitrate recirculation flow according to nitrate concentration at the end of anoxic zone. Based on the experiments results, a knowledge-based approach for supervision of the nitrogen removal problems was considered, and decision trees for diagnosing nitrification and denitrification problems were built and successfully applied to A/O process.

Soil Organic Matter Mapping by Decision Tree Modeling

Based on a case study of Longyou County, Zhejiang Province, the decision tree, a data mining method, was used to analyze the relationships between soil organic matter (SOM) and other environmental and satellite sensing spatial data. The decision tree associated SOM content with some extensive easily observable landscape attributes, such as landform, geology, land use, and remote sensing images, thus transforming the SOM-related information into a clear, quantitative, landscape factor-associated regular syst…

Travel time prediction model of freeway based on gradient boosting decision tree

To investigate the travel time prediction method of the freeway, a model based on the gradient boosting decision tree (GBDT) is proposed. Eleven variables (namely, travel time in current period T i , traffic flow in current period Q i , speed in current period V i , density in current period K i , the number of vehicles in current period N i , occupancy in current period R i , traffic state parameter in current period X i , travel time in previous time period T i -1 , etc.) are selected to predict the travel time for 10 min ahead in the proposed model. Data obtained from VISSIM simulation is used to train and test the model. The results demonstrate that the prediction error of the GBDT model is smaller than those of the back propagation (BP) neural network model and the support vector machine (SVM) model. Travel time in current period T i is the most important variable among all variables in the GBDT model. The GBDT model can produce more accurate prediction results and mine the hidden nonlinear relationships deeply between variables and the predicted travel time.

Canadian children’s and youth’s adherence to the 24-h movement guidelines during the COVID-19 pandemic: A decision tree analysis

Purpose:The purpose of this study was to use decision tree modeling to generate profiles of children and youth who were more and less likely to meet the Canadian 24-h movement guidelines during the coronavirus disease-2019(COVID-19)outbreak.Methods:Data for this study were from a nationally representative sample of 1472 Canadian parents(Meanage=45.12,SD=7.55)of children(511 years old)or youth(1217 years old).Data were collected in April 2020 via an online survey.Survey items assessed demographic,behavioral,social,micro-environmental,and macro-environmental characteristics.Four decision trees of adherence and non-adherence to all movement recommendations combined and each individual movement recommendation(physical activity(PA),screen time,and sleep)were generated.Results:Results revealed specific combinations of adherence and non-adherence characteristics.Characteristics associated with adherence to the recommendation(s)included high parental perceived capability to restrict screen time,annual household income ofCAD 100,000,increases in children’s and youth’s outdoor PA/sport since the COVID-19 outbreak began,being a boy,having parents younger than 43 years old,and small increases in children’s and youth’s sleep duration since the COVID-19 outbreak began.Characteristics associated with non-adherence to the recommendation(s)included low parental perceived capability to restrict screen time,youth aged 1217 years,decreases in children’s and youth’s outdoor PA/sport since the COVID-19 outbreak began,primary residences located in all provinces except Quebec,low parental perceived capability to support children’s and youth’s sleep and PA,and annual household income ofCAD 99,999.Conclusion:Our results show that specific characteristics interact to contribute to(non)adherence to the movement behavior recommendations.Results highlight the importance of targeting parents’perceived capability for the promotion of children’s and youth’s movement behaviors during challenging times of the COVID-19 pandemic,paying particular attention to enhancing parental perceived capability to restrict screen time.

Tactical intention recognition of aerial target based on XGBoost decision tree

In order to improve the accuracy of target intent recognition,a recognition method based on XGBoost(eXtreme Gradient Boosting)decision tree is proposed.This paper adopts relevant data and program of python to calculate the probability of tactical intention.Then the sequence intention probability is obtained by applying Dempster-Shafer rule of combination.To verify the accuracy of recognition results,we compare the experimental results of this paper with the results in the literatures.The experiment shows that the probability of tactical intention recognition through this method is improved,so this method is feasible.

Prediction of Web Services Reliability Based on Decision Tree Classification Method

With the development of the service-oriented computing(SOC),web service has an important and popular solution for the design of the application system to various enterprises.Nowadays,the numerous web services are provided by the service providers on the network,it becomes difficult for users to select the best reliable one from a large number of services with the same function.So it is necessary to design feasible selection strategies to provide users with the reliable services.Most existing methods attempt to select services according to accurate predictions for the quality of service(QoS)values.However,because the network and user needs are dynamic,it is almost impossible to accurately predict the QoS values.Furthermore,accurate prediction is generally time-consuming.This paper proposes a service decision tree based post-pruning prediction approach.This paper first defines the five reliability levels for measuring the reliability of services.By analyzing the quality data of service from the network,the proposed method can generate the training set and convert them into the service decision tree model.Using the generated model and the given predicted services,the proposed method classifies the service to the corresponding reliability level after discretizing the continuous attribute of service.Moreover,this paper applies the post-pruning strategy to optimize the generated model for avoiding the over-fitting.Experimental results show that the proposed method is effective in predicting the service reliability.

A new decision tree learning algorithm

In order to improve the generalization ability of binary decision trees, a new learning algorithm, the MMDT algorithm, is presented. Based on statistical learning theory the generalization performance of binary decision trees is analyzed, and the assessment rule is proposed. Under the direction of the assessment rule, the MMDT algorithm is implemented. The algorithm maps training examples from an original space to a high dimension feature space, and constructs a decision tree in it. In the feature space, a new decision node splitting criterion, the max-min rule, is used, and the margin of each decision node is maximized using a support vector machine, to improve the generalization performance. Experimental results show that the new learning algorithm is much superior to others such as C4. 5 and OCI.