ROC-tree: A Novel Decision Tree Induction Algorithm Based on Receiver Operating Characteristics to Classify Gene Expression Data

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.

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.

While decision tree techniques have been widely used in classification applications, a shortcoming of many decision tree inducers is that they do not learn intermediate concepts, i.e., at each node, only one of the original features is involved in the branching decision. Combining other classification methods, which learn intermediate concepts, with decision tree inducers can produce more flexible decision boundaries that separate different classes, potentially improving classification accuracy. We propose a generic algorithm for cascade generalization of decision tree inducers with the maximum cascading depth as a parameter to constrain the degree of cascading. Cascading methods proposed in the past, i.e., loose coupling and tight coupling, are strictly special cases of this new algorithm. We have empirically evaluated the proposed algorithm using logistic regression and C4.5 as base inducers on 32 UCI data sets and found that neither loose coupling nor tight coupling is always the best cascading strategy and that the maximum cascading depth in the proposed algorithm can be tuned for better classification accuracy. We have also empirically compared the proposed algorithm and ensemble methods such as bagging and boosting and found that the proposed algorithm performs marginally better than bagging and boosting on the average.

Human resource is one of the functions of a company that is considered as an asset. Therefo re, the theory of performance qualificat ion was adopted by the company in order to get an overview of employee performance. Furthermore, the company needs an effective method to predict the performance not only for the employees but also for the new applic ants. The goals of this research are to get a decision tree model of the employee performance. By learning employee data, the performance of the new applicants could be predicted. The study would provide the characteristic of new applicants who will give better performance than other applicants . The data from a company in Indonesia will have been used for this research. The data mining technique will be applied to the data of operators (such as admins, clerks, cashiers, machine operators, and security offi cers). The data mining technique was use d is decision tree. The decision tree technique was commonly used for a supervised learning data. The decision tree technique also has advantages compared others, because of its ability to produce information that is easy to understand. The result of this research shown the high dependency of employee performance with employment type (work contract). It also means that employees are encouraged to provide good performance to the company if those employees have become p ermanent employees. This research also showed that there is no relationship between employee performances with gender or position grade.

Background. Precisely predicting cancer is crucial for cancer treatment. Gene expression profiles make it possible to analyze patterns between genes and cancers on the genome-wide scale. Gene expression data analysis, however, is confronted with enormous challenges for its characteristics, such as high dimensionality, small sample size, and low Signal-to-Noise Ratio. Results. This paper proposes a method, termed RS_SVM, to predict gene expression profiles via aggregating SVM trained on random subspaces. After choosing gene features through statistical analysis, RS_SVM randomly selects feature subsets to yield random subspaces and training SVM classifiers accordingly and then aggregates SVM classifiers to capture the advantage of ensemble learning. Experiments on eight real gene expression datasets are performed to validate the RS_SVM method. Experimental results show that RS_SVM achieved better classification accuracy and generalization performance in contrast with single SVM, K-nearest neighbor, decision tree, Bagging, AdaBoost, and the state-of-the-art methods. Experiments also explored the effect of subspace size on prediction performance. Conclusions. The proposed RS_SVM method yielded superior performance in analyzing gene expression profiles, which demonstrates that RS_SVM provides a good channel for such biological data.

A loss‐of‐field (LOF) detection scheme is proposed based on the decision tree (DT) technique. The proposed method is a response‐based scheme. Instead of direct detection of LOF the proposed scheme provide the LOF protection based on simple measurements at generator terminal. The trajectories of generator terminal voltage and generated active and reactive powers are used as new features in LOF detection. The proposed DT‐based technique is robust and adaptive and keeps its performance under different fault scenarios. This scheme automatically adapts to favourable conditions near decision boundary and detects relevant features by the concept of information gain. The proposed method is simulated for a dynamic system under various fault conditions and the results are compared with a multilayer perceptron network classifier for various classification features.

The purpose of this paper is to introduce transductive inference with support vector machines (TSVM) as a powerful methodology for classification of gene expression data, using training and prediction data sets. The following classification problems will be considered: determination of cancer diagnosis categories and classification of genes from the budding yeast Saccharomyces cerevisiae in functional groups. In the case of training samples, experts have already classified the samples in their respective classes. So, given each prediction sample, the purpose is to determine its corresponding class. The main aspect of TSVM is that the classification task will be implemented in just one step, improving the generalization capability of the classifier. The TSVM will be compared with the traditional inductive method (SVM) in a series of experiments concerning the two classification problems, with promising results.

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.

Slope failure prediction using a decision tree: A case of engineered slopes in South Korea

Heart failure is a complex condition with a significant impact on patients' lives. A few studies have identified risk factors associated with rehospitalization among telehomecare patients with heart failure using logistic regression or survival analysis models. To date, there are no published studies that have used data mining techniques to detect associations with rehospitalizations among telehomecare patients with heart failure. This study is a secondary analysis of the home healthcare electronic medical record called the Outcome and Assessment Information Set-C for 552 telemonitored heart failure patients. Bivariate analyses using SAS and a decision tree technique using Waikato Environment for Knowledge Analysis were used. From the decision tree technique, the presence of skin issues was identified as the top predictor of rehospitalization that could be identified during the start of care assessment, followed by patient's living situation, patient's overall health status, severe pain experiences, frequency of activity-limiting pain, and total number of anticipated therapy visits combined. Examining risk factors for rehospitalization from the Outcome and Assessment Information Set-C database using a decision tree approach among a cohort of telehomecare patients provided a broad understanding of the characteristics of patients who are appropriate for the use of telehomecare or who need additional supports.

Microarray experiments generate data sets containing valuable information on the gene expression levels of millions of genes in the form of a set of biological samples. Inference of gene regulatory networks from microarray data has become an important research area in bioinformatics. Several computational methods have been proposed to infer important relationships between transcription factors with target genes from gene expression and transcription factor data sets. The inferences from these methods are consistent with the biological literature and can help researchers design reasonable and efficient drugs to resist different diseases. This paper is a survey of different methods used for preprocessing and inferring the gene regulatory networks from a data set of gene expression.

Expression profiling: Opportunities and pitfalls and impact on the study and management of allergic diseases

Decision trees are versatile machine learning algorithms that are frequently used in classification and regression tasks. In this work, decision trees are employed as tools for sediment classification using sound waves propagating in the ocean and their behavior and features. We first analyze the structure of received time series at deployed hydrophones, extracting characteristic features (kurtosis and skewness, for example). Feature values then form vectors that are used as input patterns to the trees. A training step is the first stage of the machine learning approach with the trees trained to recognize sediment types based on feature values. The method is subsequently tested on feature vectors obtained from noise-corrupted time series. The performance depends on Signal-to-Noise Ratio values as expected and the method is found to be superior to conventional machine learning approaches. The addition of tools such as principal component analysis as well as spectrogram processing and time-frequency curve fitting further enhances the method. The decision tree technique provides an effective and efficient solution to the problem of sediment classification using acoustic data. [Work supported by ONR.]

The use of credit cards for electronic commerce purposes has been on the increase in recent time. Credit card being the most acceptable and popular mode of payment, the number of fraud cases associated with it is also on the rise. As a result of the extensive nature of credit card transaction details, it is challenging to identify fraud in a credit card system in recent years, which implies that the identification of credit cards' fraud accurately, quickly, and effectively is a gray area of research. In this article, an automated template-based credit cards' fraud prediction (CCFP) model is developed using dynamic time warping (DTW) technique. This proposed CCFP technique is novel, as it has not been previously used to predict fraud in credit cards' systems. The performance of this proposed DTW-CCFP model is verified using the dataset that contains the credit card transactions of European cardholders. In addition, the performance of this proposed DTW-CCFP model is compared with three different machine learning (ML) prediction models: logistic regression (LR), decision tree (DT) and random forest (RF). The results were documented using two different performance metrics: sensitivity and false discovery rate (FDR). The proposed DTW-CCFP model outperforms the LR, DT and RF techniques. Of interest, the proposed DTW-CCFP model achieves this feat using a small portion (less than 5%) of the dataset to build the template in comparison to the LR, DT and RF techniques, which uses between 20%-30% of the dataset for training to achieve a fairly reasonable result

A quantum machine is a human-made device whose collective motion follows the laws of quantum mechanics. Quantum machine learning (QML) is machine learning for quantum computers. The availability of quantum processors has led to practical applications of QML algorithms in the remote sensing field. Quantum machines can learn from fewer data than non-quantum machines, but because of their low processing speed, quantum machines cannot be applied to an image that has hundreds of thousands of pixels. Researchers around the world are exploring applications for QML and in this work, it is applied for pseudo-labelling of samples. Here, a PRISMA (PRecursore IperSpettrale della Missione Applicativa) hyperspectral dataset is prepared by quantum-based pseudo-labelling and 11 different machine learning algorithms viz., support vector machine (SVM), K-nearest neighbour (KNN), random forest (RF), light gradient boosting machine (LGBM), XGBoost, support vector classifier (SVC) + decision tree (DT), RF + SVC, RF + DT, XGBoost + SVC, XGBoost + DT, and XGBoost + RF with this dataset are evaluated. An accuracy of 86% was obtained for the classification of pine trees using the hybrid XGBoost + decision tree technique.