Research on evidence theory decision tree adaptive website

Decision trees are considered as one of the efficient classification techniques in data mining fields. But the standard decision trees are unfit to cope with data pervaded with uncertainty both at the construction and classification phase. Dempster-Shafer theory offers an alternative to traditional probabilistic theory for the mathematical representation of uncertainty. This paper added new aggregation combination operator and uncertainty measure operator into general framework for data mining based on evidence theory. Combining these two operators with decision tree and multidimensional cube, decision tree technique can be extended to uncertain environment. In the phase of node splitting, this algorithm can pre-prune the decision tree and generate a decision tree with fewer branches. Simulations have shown the effectiveness of this method.

World Wide Web is a massive repository of web pages and links. It provides information about vast area for the Internet users. There is tremendous growth and development in internet. Users' accesses are documented in web logs. Web usage mining is application of mining techniques in logs. Since due to tremendous usage, the log files are growing at a faster rate and the size is becoming huge. Preprocessing plays a vital role in efficient mining process as Log data is normally noisy and indistinct. Reconstruction of sessions and paths are completed by appending missing pages in preprocessing. Additionally, the transactions which illustrate the behavior of users are constructed exactly in preprocessing by calculating the Reference Lengths of user access by means of byte rate. Using Web clustering several types of objects can be clustered into different groups for various purposes. By using the theory of distribution in Dempster-Shafer's theory, the belief function similarity measure in this algorithm adds to the clustering task the ability to capture the uncertainty among Web user's navigation performance. This paper experiments about the accomplishment of preprocessing and clustering of web log. The experimental result shows the considerable performance of the proposed algorithm.

Sensing task allocation is one of the most challenging issues in the field of mobile sensor networks (MSNs). Many existing studies have focused on various aspects of sensing task allocation, such as the relationship between sensing task allocation and the number of participants, the sensing task completion time, and the reward required to complete the task. However, few studies have focused on the relationship between sensing tasks and agent attributes. To address this issue, we first analyze the relationship between the structural characteristics of the mobile perceptron network and the agents. Further, we model the relationship between agents using multi-attribute fusion. Then, according to this model and its preference for sensing tasks, we proposed the sensing task allocation algorithm based on Dempster-Shafer (D-S) theory and multi-attribute fusion(STADMF). Finally, STADMF is compared with three algorithms on large-scale real data sets and a synthetic mobile crowdsensing (MCS) trace. The results show that the proposed algorithm achieves good performance in terms of the similarity and accuracy of task sensing.

The role of decision trees in software development effort estimation (SDEE) has received increased attention across several disciplines in recent years thanks to their power of predicting, their ease of use, and understanding. Furthermore, there are a large number of published studies that investigated the use of a decision tree (DT) techniques in SDEE. Nevertheless, in reviewing the literature, a systematic literature review (SLR) that assesses the evidence stated on DT techniques is still lacking. The main issues addressed in this paper have been divided into five parts: prediction accuracy, performance comparison, suitable conditions of prediction, the effect of the methods employed in association with DT techniques, and DT tools. To carry out this SLR, we performed an automatic search over five digital libraries for studies published between 1985 and 2019. In general, the results of this SLR revealed that most DT methods outperform many techniques and show an improvement in accuracy when combined with association rules (AR), fuzzy logic (FL), and bagging. Additionally, it has been observed a limited use of DT tools: it is therefore suggested for researchers to develop more DT tools to promote the industrial utilization of DT amongst professionals.

ABSTRACTA detailed and up-to-date land use of the urban environment is essentially required in many applications. Very high-resolution (VHR), Multispectral Scanner System (MSS) Worldview-3 (WV-3) satellite imagery provides detailed information on urban characteristics, which should be professionally mined. In this research, WV-3 was processed by machine learning (ML) methods to extract the most accurate urban features. Fuze-Go panchromatic sharpening in conjunction with atmospheric and topographic correction was initially utilized to increase the image quality and colour contrast. Three image analysis approaches including, current pixel-based image analysis (PBIA), object-based image analysis (OBIA) and new feature-based image analysis (FBIA) were implemented on WV-3 image. The k-nearest neighbour (k-NN), Naive Bayes (NB), support vector machine (SVM) classifiers were represented by PBIA, the Decision Tree (DT) classifier was examined as OBIA and the Dempster–Shafer (DS) fusion classifier was manifested for the first time as FBIA. In order to engage DS as FBIA, four types of Belief Masses, namely, Precision, Recall, Overall Accuracy, and kappa coefficient (ĸ) were implemented and compared to assign the most likelihood urban features. All the applied classifiers were also trained on the first site and then tested on another site to examine the transferability. The accuracy, reliability, and computational time of all classifiers were examined by confusion matrix and McNemar assessment. Results show improvements on the detailed urban extraction obtained using the proposed FBIA with 92.2% overall accuracy in compared with PBIA and OBIA. The FBIA result of urban extraction is more consistent when transferred to another study area and consumes much lesser time than OBIA. Also, the precision mass belief measurement achieved highest efficiency regarding receiver operating characteristic (ROC) curve rate.

This study focuses on predicting which firms will increase capital by issuing new stocks in the near future. Many stakeholders, including banks, credit rating agencies and investors, performs a variety of analyses for firms' growth, profitability, stability, activity, productivity, etc., and regularly report the firms' financial analysis indices. In the paper, we develop predictive models for rights issues using these financial analysis indices and data mining techniques. This study approaches to building the predictive models from the perspective of two different analyses. The first is the analysis period. We divide the analysis period into before and after the IMF financial crisis, and examine whether there is the difference between the two periods. The second is the prediction time. In order to predict when firms increase capital by issuing new stocks, the prediction time is categorized as one year, two years and three years later. Therefore Total six prediction models are developed and analyzed. In this paper, we employ the decision tree technique to build the prediction models for rights issues. The decision tree is the most widely used prediction method which builds decision trees to label or categorize cases into a set of known classes. In contrast to neural networks, logistic regression and SVM, decision tree techniques are well suited for high-dimensional applications and have strong explanation capabilities. There are well-known decision tree induction algorithms such as CHAID, CART, QUEST, C5.0, etc. Among them, we use C5.0 algorithm which is the most recently developed algorithm and yields performance better than other algorithms. We obtained data for the rights issue and financial analysis from TS2000 of Korea Listed Companies Association. A record of financial analysis data is consisted of 89 variables which include 9 growth indices, 30 profitability indices, 23 stability indices, 6 activity indices and 8 productivity indices. For the model building and test, we used 10,925 financial analysis data of total 658 listed firms. PASW Modeler 13 was used to build C5.0 decision trees for the six prediction models. Total 84 variables among financial analysis data are selected as the input variables of each model, and the rights issue status (issued or not issued) is defined as the output variable. To develop prediction models using C5.0 node (Node Options: Output type = Rule set, Use boosting = false, Cross-validate = false, Mode = Simple, Favor = Generality), we used 60% of data for model building and 40% of data for model test. The results of experimental analysis show that the prediction accuracies of data after the IMF financial crisis (59.04% to 60.43%) are about 10 percent higher than ones before IMF financial crisis (68.78% to 71.41%). These results indicate that since the IMF financial crisis, the reliability of financial analysis indices has increased and the firm intention of rights issue has been more obvious. The experiment results also show that the stability-related indices have a major impact on conducting rights issue in the case of short-term prediction. On the other hand, the long-term prediction of conducting rights issue is affected by financial analysis indices on profitability, stability, activity and productivity. All the prediction models include the industry code as one of significant variables. This means that companies in different types of industries show their different types of patterns for rights issue. We conclude that it is desirable for stakeholders to take into account stability-related indices and more various financial analysis indices for short-term prediction and long-term prediction, respectively. The current study has several limitations. First, we need to compare the differences in accuracy by using different data mining techniques such as neural networks, logistic regression and SVM. Second, we are required to develop and to evaluate new prediction models including variables which research in the theory of capital structure has mentioned about the relevance to rights issue.

In traditional decision (classification) tree algorithms, the label is assumed to be a categorical (class) variable. When the label is a continuous variable in the data, two possible approaches based on existing decision tree algorithms can be used to handle the situations. The first uses a data discretization method in the preprocessing stage to convert the continuous label into a class label defined by a finite set of nonoverlapping intervals and then applies a decision tree algorithm. The second simply applies a regression tree algorithm, using the continuous label directly. These approaches have their own drawbacks. We propose an algorithm that dynamically discretizes the continuous label at each node during the tree induction process. Extensive experiments show that the proposed method outperforms the preprocessing approach, the regression tree approach, and several nontree-based algorithms.

In this study, the decision tree (DT) technique is developed to assess the basketball strategies' training impact on physical education (PE). The recommended DT method effectively guesses the tactics of two teams based on the locations of basketball players with only a small amount of training data. Next, using data concerning ball possession, the interaction of these teams' tactics, and the distinctive features of basketball strategies, the DT approach changes the team's strategies.Therefore, effective findings from prediction could be produced because the suggested DT approach predicts the team strategies that meet these requirements. The suggested DT approach is implemented using the Python platform to analyze efficiency in terms of several metrics. Additionally, the DT method's effectiveness is contrasted with that of other approaches. Based on the results of the experiments, the suggested approach outperforms the current approaches in assessing the impact of basketball strategy instruction in physical education.

This paper reviews relatively new developed techniques for machine health prognostics system. The prognostics assessment of machines is an important consideration for determining the remaining useful life (RUL) of machine components and prediction of future state of machines. The developed system has employed several approaches of machine health prognostics strategy such as data-driven, physical-based, and probability-based methods. The method of solution implemented artificial intelligence techniques including support vector machine (SVM), relevance vector machine (RVM), Dempster-Shafer theory, decision tree, particle filter, and autoregressive moving average/ generalized autoregressive conditional heteroscedasticity (ARMA/GARCH). Case studies of machine health prognostics are also presented to show the plausibility of the developed systems. Finally, this paper summarizes the research finding and directions of machine health prognostics system.

Loan default prediction is an important aspect of risk management in financial institutions. Accurate prediction models enable banks and lending organizations to mitigate risks, allocate resources effectively, and optimize decision-making processes. This study investigates the application of decision tree algorithms in predicting loan default risk in the financial sector. Decision trees are renowned for their interpretability, adaptability to non-linear data, and ability to handle missing values, making them a valuable tool in credit risk analysis. Using a dataset consisting of borrower profiles, credit scores, income levels, and payment history, the model identifies key predictors that influence default outcomes. The study uses the C4.5 decision tree model, which will demonstrate that decision trees achieve high prediction accuracy and offer a transparent decision-making framework, enhancing their applicability in real-world scenarios. Furthermore, the paper highlights the implications of these findings for financial institutions, emphasizing the scalability and cost-effectiveness of the model. By integrating decision tree-based models into existing risk assessment systems, lenders can proactively manage loan portfolios and reduce default rates. Future research directions are proposed to explore hybrid approaches that combine decision trees with advanced combined methods to enhance predictive capabilities. The potential of decision tree algorithms in transforming credit risk assessment and supporting more accurate data-driven financial decision-making processes

Data mining and knowledge discovery aim at finding useful information from typically massive collections of data, and then extracting useful knowledge from the information. To date a large number of approaches have been proposed to find useful information and discover useful knowledge; for example, decision trees, Bayesian belief networks, evidence theory, rough set theory, fuzzy set theory, kNN (k-nearest-neighborhood) classifier, neural networks, and support vector machines. However, these approaches are based on a specific data type. In the real world, an intelligent system often encounters mixed data types, incomplete information (missing values), and imprecise information (fuzzy conditions). In the UCI (University of California – Irvine) Machine Learning Repository, it can be seen that there are many real world data sets with missing values and mixed data types. It is a challenge to enable machine learning or data mining approaches to deal with mixed data types (Ching, 1995; Coppock, 2003) because there are difficulties in finding a measure of similarity between objects with mixed data type attributes. The problem with mixed data types is a long-standing issue faced in data mining. The emerging techniques targeted at this issue can be classified into three classes as follows: (1) Symbolic data mining approaches plus different discretizers (e.g., Dougherty et al., 1995; Wu, 1996; Kurgan et al., 2004; Diday, 2004; Darmont et al., 2006; Wu et al., 2007) for transformation from continuous data to symbolic data; (2) Numerical data mining approaches plus transformation from symbolic data to numerical data (e.g.,, Kasabov, 2003; Darmont et al., 2006; Hadzic et al., 2007); (3) Hybrid of symbolic data mining approaches and numerical data mining approaches (e.g.,, Tung, 2002; Kasabov, 2003; Leng et al., 2005; Wu et al., 2006). Since hybrid approaches have the potential to exploit the advantages from both symbolic data mining and numerical data mining approaches, this chapter, after discassing the merits and shortcomings of current approaches, focuses on applying Self-Organizing Computing Network Model to construct a hybrid system to solve the problems of knowledge discovery from databases with a diversity of data types. Future trends for data mining on mixed type data are then discussed. Finally a conclusion is presented.

Gene expression information from microarray experiments is a primary form of data for biological analysis and can offer insights into disease processes and cellular behaviour. Such datasets are particularly challenging to build classifiers for, due to their very high dimensional nature and small sample size. Decision trees are a seemingly attractive technique for this domain, due to their easily interpretable white box nature and noise resistance. However, existing decision tree methods tend to perform rather poorly for classifying gene expression data. To address this gap, we introduce a new technique for building decision trees that is better suited to this scenario. Our method is based on consideration of the area under the Receiver Operating Characteristics (ROC) curve, to help determine decision tree characteristics, such as node selection and stopping criteria. We experimentally compare our algorithm, called ROC-tree, against other well known decision tree techniques, on a number of gene expression datasets. The experimental results clearly demonstrate that ROC-tree can deliver better classification accuracy in a range of challenging situations.

BackgroundConsidering the high morbidity and mortality of lung cancer and the high incidence of pulmonary nodules, clearly distinguishing benign from malignant lung nodules at an early stage is of great significance. However, determining the kind of lung nodule which is more prone to lung cancer remains a problem worldwide.MethodsA total of 480 patients with pulmonary nodule data were collected from Shandong, China. We assessed the clinical characteristics and computed tomography (CT) imaging features among pulmonary nodules in patients who had undergone video‐assisted thoracoscopic surgery (VATS) lobectomy from 2013 to 2018. Preliminary selection of features was based on a statistical analysis using SPSS. We used WEKA to assess the machine learning models using its multiple algorithms and selected the best decision tree model using its optimization algorithm.ResultsThe combination of decision tree and logistics regression optimized the decision tree without affecting its AUC. The decision tree structure showed that lobulation was the most important feature, followed by spiculation, vessel convergence sign, nodule type, satellite nodule, nodule size and age of patient.ConclusionsOur study shows that decision tree analyses can be applied to screen individuals for early lung cancer with CT. Our decision tree provides a new way to help clinicians establish a logical diagnosis by a stepwise progression method, but still needs to be validated for prospective trials in a larger patient population.

Aim: Chronic kidney disease (CKD) is among the main 20 reasons for death worldwide and influences around 10% of the world grown-up populace. CKD is an issue that upsets typical kidney work. The main objective of this study aims to find the best-suited algorithm that will give us the most ideal prediction. We will be comparing Novel Decision Tree with Linear Regression to find out which of these can give us the best accuracy. Material and Methods: The study used 322 samples with Novel Decision Tree and Linear Regression is executed with varying training and testing splits for predicting the accuracy for kidney disease prediction with the G-power value of 80% and the kidney datasets were collected from various web sources with recent study findings and threshold 0.05%, confidence interval 95% mean and standard deviation. The performance of the classifiers are evaluated based on their accuracy rate using the chronic kidney disease dataset. Results: The accuracy of predicting kidney disease in Novel Decision Tree (96.66%) and Linear Regression (85.25%) is obtained. There is a statistical 2-tailed significant difference in accuracy for two algorithms is 0.000 (p<0.05) by performing independent samples t-tests. Conclusion: This study concludes that the Prediction of Kidney disease using the Novel Decision Tree (DT) algorithm appears to be significantly better than the Linear Regression(LR) with improved accuracy.

Results in heart disease classification that are inaccurate and have low accuracy can endanger the patient's life. Some parameters in the algorithm model also influence classification. This study compares the Decision Tree and Random Forest algorithms for heart disease. The influence of maximum depth on heart disease classification also has significant implications. If the maximum depth is not set correctly, the classification results can be inaccurate and lead to incorrect diagnoses. This study uses five data split schemes, namely 60%: 40%, 70%: 30%, 75%: 25%, 80%: 20%, 90%: 10% and tested with different max depth parameters, namely max depth = 3, 4, 5, 6, and 7. This research produces the best accuracy using the 90%:10% scheme and max depth = 7 with the best accuracy result using the Random Forest algorithm of 99.29% while the Decision Tree algorithm is 98.05%. Then the precision and recall value of the Random Forest algorithm is 99% while the Decision Tree is 98%. The results of computation time using Decision Tree are faster than using Random Forest with a computation time for training data of 0.0075 s, while the testing data are 0.009 s. In future research, research can be conducted on the effect of other parameters by testing using several data sets.