Search

One of the most widely used measures of scientific impact is the number of citations. However, due to its heavy-tailed distribution, citations are fundamentally difficult to predict but can be improved. This study was aimed at investigating the factors and parts influencing the citation number of a scientific paper in the otology field. Therefore, this work proposes a new solution that utilizes machine learning and natural language processing to process English text and provides a paper citation as the predicted results. Different algorithms are implemented in this solution, such as linear regression, boosted decision tree, decision forest, and neural networks. The application of neural network regression revealed that papers' abstracts have more influence on the citation numbers of otological articles. This new solution has been developed in visual programming using Microsoft Azure machine learning at the back end and Programming Without Coding Technology at the front end. We recommend using machine learning models to improve the abstracts of research articles to get more citations. [ABSTRACT FROM AUTHOR]

Many real-world optimization problems can be solved by using the data-driven approach only, simply because no analytic objective functions are available for evaluating candidate solutions. In this paper, we address a class of expensive data-driven constrained multiobjective combinatorial optimization problems, where the objectives and constraints can be calculated only on the basis of a large amount of data. To solve this class of problems, we propose using random forests (RFs) and radial basis function networks as surrogates to approximate both objective and constraint functions. In addition, logistic regression models are introduced to rectify the surrogate-assisted fitness evaluations and a stochastic ranking selection is adopted to further reduce the influences of the approximated constraint functions. Three variants of the proposed algorithm are empirically evaluated on multiobjective knapsack benchmark problems and two real-world trauma system design problems. Experimental results demonstrate that the variant using RF models as the surrogates is effective and efficient in solving data-driven constrained multiobjective combinatorial optimization problems.

The expansion of machine learning to high-stakes application domains such as medicine, finance, and criminal justice, where making informed decisions requires clear understanding of the model, has increased the interest in interpretable machine learning. The widely used Classification and Regression Trees (CART) have played a major role in health sciences, due to their simple and intuitive explanation of predictions. Ensemble methods like gradient boosting can improve the accuracy of decision trees, but at the expense of the interpretability of the generated model. Additive models, such as those produced by gradient boosting, and full interaction models, such as CART, have been investigated largely in isolation. We show that these models exist along a spectrum, revealing previously unseen connections between these approaches. This paper introduces a rigorous formalization for the additive tree, an empirically validated learning technique for creating a single decision tree, and shows that this method can produce models equivalent to CART or gradient boosted stumps at the extremes by varying a single parameter. Although the additive tree is designed primarily to provide both the model interpretability and predictive performance needed for high-stakes applications like medicine, it also can produce decision trees represented by hybrid models between CART and boosted stumps that can outperform either of these approaches., Competing Interests: Conflict of interest statement: J.M.L., E.E., L.H.U., C.B.S., T.D.S., and G.V. have a patent titled “Systems and methods for generating improved decision trees,” pending status., (Copyright © 2019 the Author(s). Published by PNAS.)

The governance of cross-border data flows around the digital economy, data security, and data sovereignty has become a crucial global governance issue. This paper evaluates the legitimacy of data exit rules of CPTPP countries based on machine learning algorithm models under the perspective of cross-border data flow governance. In this study, four machine learning algorithms, namely, logistic regression, decision tree, random forest, and GBDT, are used to build an outbound data assessment and evaluation model. The confusion matrix is used to classify the outbound data legitimacy dichotomously. The recall, precision, and F1 scores are evaluated to compare the empirical results of each model. Based on this, a logistic regression-based outbound data risk scoring model is introduced to quantify the outbound data risk at a deeper level and to classify the outbound data risk level for the reference of regulators to make more scientific and reasonable decisions. The experimental results show that the machine learning models can meet the needs and applications of practical work and make accurate predictions of outbound data risks. [ABSTRACT FROM AUTHOR]

Exploring the improvement of classroom teaching effect under the background of sports education integration in China has important practical significance and theoretical value. Integration of yard sports education and classroom course education in the school is a novel concept put forward by China's sports and education circles to deepen the combination of sports and education. Although it is only a word different from the combination of sports and education to integrating sports and course education in the school, it is a groundbreaking theoretical and practical innovation for China in terms of changing the competitive sports development model and cultivating exceptional athletes. It is a new way to promote the sustainable development of sports and education according to the scientific outlook on development. Its fundamental significance is to change the closed state of sports and education departments, put sports and education in the background of economic and social development in a certain region, and fundamentally reform the content and mode of education. Therefore, this paper proposes a comprehensive rating model of classroom teaching effects based on deep learning (DL) and machine learning (ML) techniques. In this paper, the Jaffe expression dataset is used to train and test the utilized ML and DL models such as ResNet50, random forest (RF), logistic regression (LR), K-nearest neighbor (k-NN), and decision tree (DT). Further, with the help of artificial intelligence (AI) techniques, the algorithms can objectively evaluate the classroom teaching effect after the integration of physical education with classroom education and provide important guidance for the modernization and intellectualization of China's educational methods in the future. [ABSTRACT FROM AUTHOR]

In practical data mining, a wide range of classification algorithms is employed for prediction tasks. However, selecting the best algorithm poses a challenging task for machine learning practitioners and experts, primarily due to the inherent variability in the characteristics of classification problems, referred to as datasets, and the unpredictable performance of these algorithms. Dataset characteristics are quantified in terms of meta-features, while classifier performance is evaluated using various performance metrics. The assessment of classifiers through empirical methods across multiple classification datasets, while considering multiple performance metrics, presents a computationally expensive and time-consuming obstacle in the pursuit of selecting the optimal algorithm. Furthermore, the scarcity of sufficient training data, denoted by dimensions representing the number of datasets and the feature space described by meta-feature perspectives, adds further complexity to the process of algorithm selection using classical machine learning methods. This research paper presents an integrated framework called eML-CBR that combines edge edge-ML and case-based reasoning methodologies to accurately address the algorithm selection problem. It adapts a multi-level, multi-view case-based reasoning methodology, considering data from diverse feature dimensions and the algorithms from multiple performance aspects, that distributes computations to both cloud edges and centralized nodes. On the edge, the first-level reasoning employs machine learning methods to recommend a family of classification algorithms, while at the second level, it recommends a list of the top-k algorithms within that family. This list is further refined by an algorithm conflict resolver module. The eML-CBR framework offers a suite of contributions, including integrated algorithm selection, multi-view meta-feature extraction, innovative performance criteria, improved algorithm recommendation, data scarcity mitigation through incremental learning, and an open-source CBR module, reshaping research paradigms. The CBR module, trained on 100 datasets and tested with 52 datasets using 9 decision tree algorithms, achieved an accuracy of 94% for correct classifier recommendations within the top k=3 algorithms, making it highly suitable for practical classification applications. [ABSTRACT FROM AUTHOR]

This paper addresses the problem of instrument current transformers technical state assessment based on machine learning methods. The introductory parts of the paper provide a detailed analysis of modern methods and approaches for technical state assessment of high-voltage power equipment of power plants and substations as well as a review of modern software tools and the latest trends in the given field of study. Justification of the relevance of the presented research aimed at instrument current transformers technical state assessment is provided along with the motivation for machine learning methods application for improvement of the accuracy and quality of high-voltage equipment state classification. Within the framework of the study, a comparative analysis of gradient boosting on decision trees and random forest algorithms was carried out for a given mathematical problem formulation. The main stages of processing the initial dataset are proposed as a step-by-step procedure, including feature extraction, feature transformation, feature interactions, etc. The outperforming efficiency of gradient boosting on decision trees algorithm was validated for real power equipment fleet. The resulting classification quality metrics of current transformers technical state assessment, Precision and Recall, are estimated to be 87.1% and 83.7%, correspondingly. [ABSTRACT FROM AUTHOR]

This paper proposes a novel network anomaly detection framework based on data balance and feature selection. Different from the previous binary classification of network intrusion, the network anomaly detection strategy proposed in this paper solves the problem of multiple classification of network intrusion. Regarding the common data imbalance of a network intrusion detection set, a resampling strategy generated by random sampling and Borderline SMOTE data is developed for data balance. According to the features of the intrusion detection dataset, feature selection is carried out based on information gain rate. Experiments are carried out on three basic machine learning algorithms (K-nearest neighbor algorithm (KNN), decision tree (DT), random forest (RF)), and the optimal feature selection scheme is obtained. [ABSTRACT FROM AUTHOR]

This paper presents a state-of-the-art estimation technique by cross-combining a number n of filters for high-precision, reliable and robust vehicle sideslip angle state estimation, over a full range of vehicle operations irrespective of the driving mission and disruptions that may occur in the system. A machine-learning algorithm based on decision trees connects several filters together to switch between them according to the driving context, ensuring the best possible state estimate for relatively small and large sideslip angle values. In conjunction with the above-mentioned aspects, a seamless transition between different vehicle models is attained by observing the key parameters characterizing the lateral motion of the vehicle. The tests conducted using a prototype vehicle on a snow-covered track confirm the effectiveness and reliability of the proposed approach. [ABSTRACT FROM AUTHOR]

Due to subjectivity in refereeing, the results of race walking are often questioned. To overcome this limitation, artificial-intelligence-based technologies have demonstrated their potential. The paper aims at presenting WARNING, an inertial-based wearable sensor integrated with a support vector machine algorithm to automatically identify race-walking faults. Two WARNING sensors were used to gather the 3D linear acceleration related to the shanks of ten expert race-walkers. Participants were asked to perform a race circuit following three race-walking conditions: legal, illegal with loss-of-contact and illegal with knee-bent. Thirteen machine learning algorithms, belonging to the decision tree, support vector machine and k-nearest neighbor categories, were evaluated. An inter-athlete training procedure was applied. Algorithm performance was evaluated in terms of overall accuracy, F1 score and G-index, as well as by computing the prediction speed. The quadratic support vector was confirmed to be the best-performing classifier, achieving an accuracy above 90% with a prediction speed of 29,000 observations/s when considering data from both shanks. A significant reduction of the performance was assessed when considering only one lower limb side. The outcomes allow us to affirm the potential of WARNING to be used as a referee assistant in race-walking competitions and during training sessions. [ABSTRACT FROM AUTHOR]

With the rapid development of the Internet, various forms of network attack have emerged, so how to detect abnormal behavior effectively and to recognize their attack categories accurately have become an important research subject in the field of cyberspace security. Recently, many hot machine learning-based approaches are applied in the Intrusion Detection System (IDS) to construct a data-driven model. The methods are beneficial to reduce the time and cost of manual detection. However, the real-time network data contain an ocean of redundant terms and noises, and some existing intrusion detection technologies have lower accuracy and inadequate ability of feature extraction. In order to solve the above problems, this paper proposes an intrusion detection method based on the Decision Tree-Recursive Feature Elimination (DT-RFE) feature in ensemble learning. We firstly propose a data processing method by the Decision Tree-Based Recursive Elimination Algorithm to select features and to reduce the feature dimension. This method eliminates the redundant and uncorrelated data from the dataset to achieve better resource utilization and to reduce time complexity. In this paper, we use the Stacking ensemble learning algorithm by combining Decision Tree (DT) with Recursive Feature Elimination (RFE) methods. Finally, a series of comparison experiments by cross-validation on the KDD CUP 99 and NSL-KDD datasets indicate that the DT-RFE and Stacking-based approach can better improve the performance of the IDS, and the accuracy for all kinds of features is higher than 99%, except in the case of U2R accuracy, which is 98%. [ABSTRACT FROM AUTHOR]

Machine learning algorithms often contain many hyperparameters whose values affect the predictive performance of the induced models in intricate ways. Due to the high number of possibilities for these hyperparameter configurations and their complex interactions, it is common to use optimization techniques to find settings that lead to high predictive performance. However, insights into efficiently exploring this vast space of configurations and dealing with the trade-off between predictive and runtime performance remain challenging. Furthermore, there are cases where the default hyperparameters fit the suitable configuration. Additionally, for many reasons, including model validation and attendance to new legislation, there is an increasing interest in interpretable models, such as those created by the decision tree (DT) induction algorithms. This paper provides a comprehensive approach for investigating the effects of hyperparameter tuning for the two DT induction algorithms most often used, CART and C4.5. DT induction algorithms present high predictive performance and interpretable classification models, though many hyperparameters need to be adjusted. Experiments were carried out with different tuning strategies to induce models and to evaluate hyperparameters' relevance using 94 classification datasets from OpenML. The experimental results point out that different hyperparameter profiles for the tuning of each algorithm provide statistically significant improvements in most of the datasets for CART, but only in one-third for C4.5. Although different algorithms may present different tuning scenarios, the tuning techniques generally required few evaluations to find accurate solutions. Furthermore, the best technique for all the algorithms was the Irace. Finally, we found out that tuning a specific small subset of hyperparameters is a good alternative for achieving optimal predictive performance. [ABSTRACT FROM AUTHOR]

This study illustrates the utility and effectiveness of machine learning algorithms in identifying dependencies in data transmitted in industrial networks. The analysis was performed for two different algorithms. The study was carried out for the XGBoost (Extreme Gradient Boosting) algorithm based on a set of decision tree model classifiers, and the second algorithm tested was the EBM (Explainable Boosting Machines), which belongs to the class of Generalized Additive Models (GAM). Tests were conducted for several test scenarios. Simulated data from static equations were used, as were data from a simulator described by dynamic differential equations, and the final one used data from an actual physical laboratory bench connected via Modbus TCP/IP. Experimental results of both techniques are presented, thus demonstrating the effectiveness of the algorithms. The results show the strength of the algorithms studied, especially against static data. For dynamic data, the results are worse, but still at a level that allows using the researched methods to identify dependencies. The algorithms presented in this paper were used as a passive protection layer of a commercial IDS (Intrusion Detection System). [ABSTRACT FROM AUTHOR]

Numerous users are experiencing unsafe communications due to the growth of big network mediums, where no node communication is detected in emergency scenarios. Many people find it difficult to communicate in emergency situations as a result of such communications. In this paper, a mobile cloud computing procedure is implemented in the suggested technique in order to prevent such circumstances, and to make the data transmission process more effective. An analytical framework that addresses five significant minimization and maximization objective functions is used to develop the projected model. Additionally, all mobile cloud computing nodes are designed with strong security, ensuring that all the resources are allocated appropriately. In order to isolate all the active functions, the analytical framework is coupled with a machine learning method known as Decision Tree. The suggested approach benefits society because all cloud nodes can extend their assistance in times of need at an affordable operating and maintenance cost. The efficacy of the proposed approach is tested in five scenarios, and the results of each scenario show that it is significantly more effective than current case studies on an average of 86%. [ABSTRACT FROM AUTHOR]

Digital twin (DT) is a key technology for realizing the interconnection and intelligent operation of the physical world and the world of information and provides a new paradigm for fault diagnosis. Traditional machine learning algorithms require a balanced dataset. Training and testing sets must have the same distribution. Training a good generalization model is difficult in an actual production line operation process. Fault diagnosis technology based on the digital twin uses its ultrarealistic, multisystem, and high-precision characteristics to simulate fault data that are difficult to obtain in an actual production line to train a reliable fault diagnosis model. In this article, we first propose an improved random forest (IRF) algorithm, which reselects decision trees with high accuracy and large differences through hierarchical clustering and gives them weights. Digital twin technology is used to simulate a large number of balanced datasets to train the model, and the trained model can be transferred to a physical production line through transfer learning for fault diagnosis. Finally, the feasibility of our proposed algorithm is verified through a case study of an automobile rear axle assembly line, for which the accuracy of the proposed algorithm reaches 97.8%. The traditional machine learning plus digital twin fault diagnosis method proposed in this paper involves some generalization, and thus has practical value when extended to other fields. [ABSTRACT FROM AUTHOR]

This paper is devoted to the problem of class imbalance in machine learning, focusing on the intrusion detection of rare classes in computer networks. The problem of class imbalance occurs when one class heavily outnumbers examples from the other classes. In this paper, we are particularly interested in classifiers, as pattern recognition and anomaly detection could be solved as a classification problem. As still a major part of data network traffic of any organization network is benign, and malignant traffic is rare, researchers therefore have to deal with a class imbalance problem. Substantial research has been undertaken in order to identify these methods or data features that allow to accurately identify these attacks. But the usual tactic to deal with the imbalance class problem is to label all malignant traffic as one class and then solve the binary classification problem. In this paper, however, we choose not to group or to drop rare classes but instead investigate what could be done in order to achieve good multi-class classification efficiency. Rare class records were up-sampled using SMOTE method (Chawla et al., 2002) to a preset ratio targets. Experiments with the 3 network traffic datasets, namely CIC-IDS2017, CSE-CIC-IDS2018 (Sharafaldin et al., 2018) and LITNET-2020 (Damasevicius et al., 2020) were performed aiming to achieve reliable recognition of rare malignant classes available in these datasets. Popular machine learning algorithms were chosen for comparison of their readiness to support rare class detection. Related algorithm hyper parameters were tuned within a wide range of values, different data feature selection methods were used and tests were executed with and without over-sampling to test the multiple class problem classification performance of rare classes. Machine learning algorithms ranking based on Precision, Balanced Accuracy Score, G ¯ , and prediction error Bias and Variance decomposition, show that decision tree ensembles (Adaboost, Random Forest Trees and Gradient Boosting Classifier) performed best on the network intrusion datasets used in this research. [ABSTRACT FROM AUTHOR]

Recent years have witnessed booming data on drugs and their associated adverse drug reactions (ADRs). It was reported that these ADRs have resulted in a high hospitalisation rate worldwide. Therefore, a tremendous amount of research has been carried out to predict ADRs in the early phases of drug development, with the goal of reducing possible future risks. The pre-clinical and clinical phases of drug research can be time-consuming and cost-ineffective, so academics are looking forward to more extensive data mining and machine learning methods to be applied in this field of study. In this paper, we try to construct a drug-to-drug network based on non-clinical data sources. The network presents underlying relationships between drug pairs according to their common ADRs. Then, multiple node-level and graph-level network features are extracted from this network, e.g., weighted degree centrality, weighted PageRanks, etc. After concatenating the network features to the original drug features, they were fed into seven machine learning models, e.g., logistic regression, random forest, support vector machine, etc., and were compared to the baseline, where there were no network-based features considered. These experiments indicate that all the tested machine-learning methods would benefit from adding these network features. Among all these models, logistic regression (LR) had the highest mean AUROC score (82.1%) across all ADRs tested. Weighted degree centrality and weighted PageRanks were identified to be the most critical network features in the LR classifier. These pieces of evidence strongly indicate that the network approach can be vital in future ADR prediction, and this network-based approach could also be applied to other health informatics datasets. [ABSTRACT FROM AUTHOR]

The exponential pace of the spread of the digital world has served as one of the assisting forces to generate an enormous amount of information flowing over the network. The data will always remain under the threat of technological suffering where intruders and hackers consistently try to breach the security systems by gaining personal information insights. In this paper, the authors proposed the HDTbNB (Hybrid Decision Tree-based Naïve Bayes) algorithm to find the essential features without data scaling to maximize the model’s performance by reducing the false alarm rate and training period to reduce zero frequency with enhanced accuracy of IDS (Intrusion Detection System) and to further analyze the performance execution of distinct machine learning algorithms as Naïve Bayes, Decision Tree, K-Nearest Neighbors and Logistic Regression over KDD 99 dataset. The performance of algorithm is evaluated by making a comparative analysis of computed parameters as accuracy, macro average, and weighted average. The findings were concluded as a percentage increase in accuracy, precision, sensitivity, specificity, and a decrease in misclassification as 9.3%, 6.4%, 12.5%, 5.2% and 81%. [ABSTRACT FROM AUTHOR]

In this article, two machine learning methods such as classification and clustering are used for decision tree (DT), artificial neural network (ANN), and K-nearest neighbors algorithms. The datasets were used to evaluate the effectiveness of the clustering method and the data mining tool. Weather data were used to compare algorithms and methods in the study. This study showed that the best model was DT according to accuracy and precision measures but the best model according to F-measure and receiver operating characteristic curve area measures was ANN. Waikato Environment for Knowledge Analysis, a data mining tool, is utilized in this paper to carry out the clustering. [ABSTRACT FROM AUTHOR]

The scenario is very important to smartphone-based pedestrian positioning services. The smartphone is equipped with MEMS(Micro Electro Mechanical System) sensors, which have low accuracy. Now, the methods for scenario recognition are mainly machine-learning methods. The recognition rate of a single method is not high. Multi-model fusion can improve recognition accuracy, but it needs to collect many samples, the computational cost is high, and it is heavily dependent on feature selection. Therefore, we designed the DT-BP(decision tree-Bayesian probability) scenario recognition algorithm by introducing the Bayesian state transition model based on experience design in the decision tree. The decision-tree rules and state transition probability assignment methods were respectively designed for smartphone mode and motion mode. We carried out experiments for each scenario and compared them with the methods in the references. The results showed that the method proposed in this paper has a high recognition accuracy, which is equivalent to the accuracy of multi-model machine learning, but it is simpler, easier to implement, requires less computation, and requires fewer samples. [ABSTRACT FROM AUTHOR]

The number of diabetic patients is increasing yearly worldwide, requiring the need for a quick intervention to help these people. Mortality rates are higher for diabetic patients with other serious health complications. Thus, early prediction for such diseases positively impacts healthcare quality and can prevent serious health complications later. This paper constructs an efficient prediction system for predicting diabetes in its early stage. The proposed system starts with a Local Outlier Factor (LOF)-based outlier detection technique to detect outlier data. A Balanced Bagging Classifier (BBC) technique is used to balance data distribution. Finally, integration between association rules and classification algorithms is used to develop a prediction model based on real data. Four classification algorithms were utilized in addition to an a priori algorithm that discovered relationships between various factors. The named algorithms are Artificial Neural Network (ANN), Decision Trees (DT), Support Vector Machines (SVM), and K Nearest Neighbor (KNN) for data classification. Results revealed that KNN provided the highest accuracy of 97.36% compared to the other applied algorithms. An a priori algorithm extracted association rules based on the Lift matrix. Four association rules from 12 attributes with the highest correlation and information gain scores relative to the class attribute were produced. [ABSTRACT FROM AUTHOR]

In this paper, various machine learning algorithms were used in order to predict the evolution of open-angle glaucoma (POAG). The datasets were built containing clinical observations and objective measurements made at the Countess of Chester Hospital in the UK and at the "St. Spiridon" Hospital of Iași, Romania. Using these datasets, different classification problems were proposed. The evaluation of glaucoma progression was conducted based on parameters such as VFI (Visual field index), MD (Mean Deviation), PSD (Pattern standard deviation), and RNFL (Retinal Nerve Fiber Layer). As classification tools, the following algorithms were used: Multilayer Perceptron, Random Forest, Random Tree, C4.5, k-Nearest Neighbors, Support Vector Machine, and Non-Nested Generalized Exemplars. The best results, with an accuracy of over 90%, were obtained with Multilayer Perceptron and Random Forest algorithms. The NNGE algorithm also proved very useful in creating a hierarchy of the input values according to their influence (weight) on the considered outputs. On the other hand, the decision tree algorithms gave us insight into the logic used in their classification, which is of practical importance in obtaining additional information regarding the rationale behind a certain rule or decision. [ABSTRACT FROM AUTHOR]

Multi-label learning has attracted many attentions. However, the continuous data generated in the fields of sensors, network access, etc., that is data streams, the scenario brings challenges such as real-time, limited memory, once pass. Several learning algorithms have been proposed for offline multi-label classification, but few researches develop it for dynamic multi-label incremental learning models based on cascading schemes. Deep forest can perform representation learning layer by layer, and does not rely on backpropagation, using this cascading scheme, this paper proposes a multi-label data stream deep forest (VDSDF) learning algorithm based on cascaded Very Fast Decision Tree (VFDT) forest, which can receive examples successively, perform incremental learning, and adapt to concept drift. Experimental results show that the proposed VDSDF algorithm, as an incremental classification algorithm, is more competitive than batch classification algorithms on multiple indicators. Moreover, in dynamic flow scenarios, the adaptability of VDSDF to concept drift is better than that of the contrast algorithm. [ABSTRACT FROM AUTHOR]

In this paper, some significant efforts on fuzzy oblique decision tree (FODT) have been done to improve classification accuracy and decrease tree size. Firstly, to eliminate data redundancy and improve classification efficiency, a forward greedy fast feature selection algorithm based on neighborhood rough set (NRS_FS_FAST) is introduced. Then, a new fuzzy rule generation algorithm (FRGA) is proposed to generate fuzzy rules. These fuzzy rules are used to construct leaf nodes for each class in each layer of the FODT. Different from the traditional axis-parallel decision trees and oblique decision trees, the FODT takes dynamic mining fuzzy rules as decision functions. Moreover, the parameter δ, which can control the size of the tree, is optimized by genetic algorithm. Finally, a series of comparative experiments are carried out with five traditional decision trees (C4.5, Best First Tree (BFT), amulti-class alternating decision tree (LAD), Simple Cart (SC), Naive Bayes Tree (NBT)), and recently proposed decision trees (FRDT, HHCART, and FMMDT-HB) on UCI machine learning datasets. The experimental results demonstrate that the FODT exhibits better performance on classification accuracy and tree size than the chosen benchmarks. [ABSTRACT FROM AUTHOR]

This paper addresses patient-reported outcomes (PROs) and telemonitoring in congestive heart failure (CHF), both increasingly important topics. The interest in CHF trials is shifting from hard end-points such as hospitalization and mortality, to softer end-points such health-related quality of life. However, the relation of these softer end-points to objective parameters is not well studied. Telemonitoring is suitable for collecting both patient-reported outcomes and objective parameters. Most telemonitoring studies, however, do not take full advantage of the available sensor technology and intelligent data analysis. The Chiron clinical observational study was performed among 24 CHF patients (17 men and 7 women, age 62.9 ± 9.4 years, 15 NYHA class II and 9 class III, 10 of ishaemic, aetiology, 6 dilated, 2 valvular, and 6 of multiple aetiologies or cardiomyopathy) in Italy and UK. A large number of physiological and ambient parameters were collected by wearable and other devices, together with PROs describing how well the patients felt, over 1,086 days of observation. The resulting data were mined for relations between the objective parameters and the PROs. The objective parameters (humidity, ambient temperature, blood pressure, SpO2, and sweeting intensity) could predict the PROs with accuracies up to 86% and AUC up to 0.83, making this the first report providing evidence for ambient and physiological parameters to be objectively related to PROs in CHF patients. We also analyzed the relations in the predictive models, gaining some insights into what affects the feeling of health, which was also generally not attempted in previous investigations. The paper strongly points to the possibility of using PROs as primary end-points in future trials. [ABSTRACT FROM AUTHOR]

Objective. Internet of Things (IoT) integrates several technologies where devices learn from the experience of each other thereby reducing human-intervened likely errors. Modern technologies like IoT and machine learning enable the conventional to patient-specific approach transition in healthcare. In conventional approach, the biggest challenge faced by healthcare professionals is to predict a disease by observing the symptoms, monitoring the remote area patient, and also attending to the patient all the time after being hospitalised. IoT provides real-time data, makes decision-making smarter, and provides far superior analytics, and all these to help improve the quality of healthcare. The main objective of the work was to create an IoT-based automated system using machine learning models for symptom-based COVID-19 prognosis. Methods. Comparative analysis of predictive microbiology of COVID-19 from case symptoms using various machine learning classifiers like logistics regression, k-nearest neighbor, support vector machine, random forest, decision trees, Naïve Bayes, and gradient booster is reported here. For the sake of the validation and verification of the models, performance of each model based on the retrieved cloud-stored data was measured for accuracy. Results. From the accuracy plot, it was concluded that k-NN was more accurate (97.97%) followed by decision tree (97.79), support vector machine (97.42), logistics regression (96.50), random forest (90.66), gradient boosting classifier (87.77), and Naïve Bayes (73.50) in COVID-19 prognosis. Conclusion. The paper presents a health monitoring IoT framework having high clinical significance in real-time and remote healthcare monitoring. The findings reported here and the lessons learnt shall enable the healthcare system worldwide to counter not only this ongoing COVID but many other such global pandemics the humanity may suffer from time to come. [ABSTRACT FROM AUTHOR]

There are many thyroid diseases affecting people all over the world. Many diseases affect the thyroid gland, like hypothyroidism, hyperthyroidism, and thyroid cancer. Thyroid inefficiency can cause severe symptoms in patients. Effective classification and machine learning play a significant role in the timely detection of thyroid diseases. This timely classification will indeed affect the timely treatment of the patients. Automatic and precise thyroid nodule detection in ultrasound pictures is critical for reducing effort and radiologists' mistake rate. Medical images have evolved into one of the most valuable and consistent data sources for machine learning generation. In this paper, various machine learning algorithms like decision tree, random forest algorithm, KNN, and artificial neural networks on the dataset create a comparative analysis to better predict the disease based on parameters established from the dataset. Also, the dataset has been manipulated for accurate prediction for the classification. The classification was performed on both the sampled and unsampled datasets for better comparison of the dataset. After dataset manipulation, we obtained the highest accuracy for the random forest algorithm, equal to 94.8% accuracy and 91% specificity. [ABSTRACT FROM AUTHOR]

In this paper, an initial attempt to exploit the benefits of machine learning in solving relay selection for dualhop networks has been made. From data-driven perspective, we convert relay selection to multiclass-classification problem and propose a decision-tree-based selection scheme. Input features are generated by binary quantization to the equivalent channel state information of each relay, so that the dependence of relay selection on maximization algorithm is removed. To optimize quantization parameter, we derive and maximize two splitting criteria—information gain and Gini index. Experimental results show that decision-tree-based scheme achieves comparable performance to optimal selection in terms of average end-to-end rate while reducing computational complexity and feedback amount. [ABSTRACT FROM AUTHOR]

Big data classification is very slow when using traditional machine learning classifiers, particularly when using a lazy and slow-by-nature classifier such as the k-nearest neighbors algorithm (KNN). This paper proposes a new approach which is based on sorting the feature vectors of training data in a binary search tree to accelerate big data classification using the KNN approach. This is done using two methods, both of which utilize two local points to sort the examples based on their similarity to these local points. The first method chooses the local points based on their similarity to the global extreme points, while the second method chooses the local points randomly. The results of various experiments conducted on different big datasets show reasonable accuracy rates compared to state-of-the-art methods and the KNN classifier itself. More importantly, they show the high classification speed of both methods. This strong trait can be used to further improve the accuracy of the proposed methods. [ABSTRACT FROM AUTHOR]

Heart-rate variability has proved a valid tool in prognosis definition of patients with congestive heart failure (CHF). Previous research has documented Poincaré plot analysis as a valuable approach to study heart-rate variability performance among different subjects. In this paper, we explored the possibility to feed machine-learning (ML) algorithms using unconventional quantitative parameters extracted from Poincaré plots (generated from 24-h electrocardiogram recordings) to classify patients with CHF belonging to different New York Heart Association (NYHA) classes. We performed in sequence the following investigations: first, a statistical analysis was carried out on 9 morphological parameters, automatically measured from Poincaré plots. Subsequently, a feature selection through a wrapper with a 10-fold cross-validation method was performed to find the best subset of features which maximized the classification accuracy for each considered ML algorithm. Finally, patient classification was assessed through a ML analysis using AdaBoost of Decision Tree, k-Nearest Neighbors and Naive Bayes algorithms. A univariate statistical analysis proved 5 out of 9 parameters presented statistically significant differences among patients of distinct NYHA classes; similarly, a multivariate logistic regression confirmed the importance of the parameter ry in the separability between low-risk and high-risk classes. The ML analysis achieved promising results in terms of evaluation metrics (especially the Naive Bayes algorithm), with accuracies greater than 80% and Area Under the Receiver Operating Curve indices greater than 0.7 for the overall three algorithms. The study indicates the proposed features have a predictive power to discriminate the NYHA classes, to which the features seem evenly correlated. Despite the NYHA classification being subjective and easily recognized by cardiologists, the potential relevance in the clinical cardiology of the proposed features and the promising ML results implies the methodology could be a valuable approach to automatically classify CHF. Future investigations on enriched datasets may further confirm the presented evidence. [ABSTRACT FROM AUTHOR]

Traffic safety is affected by many complex factors. Mind wandering (MW) is a fatal cause affecting driving safety and is hard to be detected and prevented due to its uncertain and complex occurrence mechanism. The aim of this study was to propose a framework for analyzing and predicting MW based on readily available driving status data. The data used in this study are the single-trip information collected by the questionnaire, which includes drivers' personal characteristics, contextual information in which MW occurs, and in-vehicle environmental factors. After investigating the extent of factors that influence MW, these chosen factors are used to forecast MW. Based on these results, we select factors reliable to be obtained in real life to forecast MW. To verify that the new factors explored are useful in improving the forecast accuracy, the compared analysis is conducted with the results found by our approach and the existing approaches. We compare results obtained by four machine-learning-enabled forecasting approaches on a real-life data set. The result shows that the factors found in this paper can significantly improve forecast accuracy. The confusion matrix, ROC curves, and AUC are conducted, and the performance of the gradient boosting decision tree algorithm is better than other forecast approaches. The importance rankings of most factors obtained by the Gradient Boosting Decision Tree and questionnaire are the same. [ABSTRACT FROM AUTHOR]

Classification and regression are the major applications of machine learning algorithms which are widely used to solve problems in numerous domains of engineering and computer science. Different classifiers based on the optimization of the decision tree have been proposed, however, it is still evolving over time. This paper presents a novel and robust classifier based on a decision tree and tabu search algorithms, respectively. In the aim of improving performance, our proposed algorithm constructs multiple decision trees while employing a tabu search algorithm to consistently monitor the leaf and decision nodes in the corresponding decision trees. Additionally, the used tabu search algorithm is responsible to balance the entropy of the corresponding decision trees. For training the model, we used the clinical data of COVID-19 patients to predict whether a patient is suffering. The experimental results were obtained using our proposed classifier based on the built-in sci-kit learn library in Python. The extensive analysis for the performance comparison was presented using Big O and statistical analysis for conventional supervised machine learning algorithms. Moreover, the performance comparison to optimized state-of-the-art classifiers is also presented. The achieved accuracy of 98%, the required execution time of 55.6 ms and the area under receiver operating characteristic (AUROC) for proposed method of 0.95 reveals that the proposed classifier algorithm is convenient for large datasets. [ABSTRACT FROM AUTHOR]

The project aims to generate a model to predict the likelihood of an individual being affected by heart disease in the next 10 years. Many hospitals generate data about patients that can identify early symptoms by identifying the patterns and facts present in them. This huge data makes it difficult for the Doctors to identify patterns. As the old saying goes "Prevention is better than Cure", early detection and continuous management by clinicians will bring down the mortality rate. All that said, it's impractical to observe patients daily to accurately predict and provide 24x7 consultations, since it requires heaps of knowledge and time. During this paper we have developed and researched models to predict heart disease through multifarious heart attributes of patients and identified machine learning techniques just round the corner to effectively predict heart diseases. Data Science, with its vast applied capabilities, has a key role in processing mammoth amounts of data to extract meaningful insights from it in every walk of life, with specific mention of healthcare services. In this paper the Naive Bayes Algorithm is used and it is built on the Framingham dataset. And this data is divided as training of data and testing of data in ratio of 80:20. The training set is used to train the classifier and test data is used to generate a confusion matrix to calculate accuracy. Several techniques can be used to solve this problem. The proposed Naive Bayes algorithm has achieved an accuracy of approximately 81.5% on the testing data, which is greater than Decision Tree accuracy. [ABSTRACT FROM AUTHOR]

Sentiment analysis is widely studied to extract opinions from user generated content (UGC), and various methods have been proposed in recent literature. However, these methods are likely to introduce sentiment bias, and the classification results tend to be positive or negative, especially for the lexicon-based sentiment classification methods. The existence of sentiment bias leads to poor performance of sentiment analysis. To deal with this problem, we propose a novel sentiment bias processing strategy which can be applied to the lexicon-based sentiment analysis method. Weight and threshold parameters learned from a small training set are introduced into the lexicon-based sentiment scoring formula, and then the formula is used to classify the reviews. In this paper, a completed sentiment classification framework is proposed. SentiWordNet (SWN) is used as the experimental sentiment lexicon, and review data of four products collected from Amazon are used as the experimental datasets. Experimental results show that the bias processing strategy reduces polarity bias rate (PBR) and improves performance of the lexicon-based sentiment analysis method. [ABSTRACT FROM AUTHOR]

In this paper, we seek to improve deep neural networks by generalizing the pooling operations that play a central role in the current architectures. We pursue a careful exploration of approaches to allow pooling to learn and to adapt to complex and variable patterns. The two primary directions lie in: (1) learning a pooling function via (two strategies of) combining of max and average pooling, and (2) learning a pooling function in the form of a tree-structured fusion of pooling filters that are themselves learned. In our experiments every generalized pooling operation we explore improves performance when used in place of average or max pooling. We experimentally demonstrate that the proposed pooling operations provide a boost in invariance properties relative to conventional pooling and set the state of the art on several widely adopted benchmark datasets. These benefits come with only a light increase in computational overhead during training (ranging from additional 5 to 15 percent in time complexity) and a very modest increase in the number of model parameters (e.g., additional 1, 9, and 27 parameters for mixed, gated, and 2-level tree pooling operators, respectively). To gain more insights about our proposed pooling methods, we also visualize the learned pooling masks and the embeddings of the internal feature responses for different pooling operations. Our proposed pooling operations are easy to implement and can be applied within various deep neural network architectures. [ABSTRACT FROM PUBLISHER]

Glaucoma is a serious eye disease characterized by dysfunction and loss of retinal ganglion cells (RGCs) which can eventually lead to loss of vision. Robust mass screening may help to extend the symptom-free life for the affected patients. The retinal optic nerve fiber layer can be assessed using optical coherence tomography, scanning laser polarimetry (SLP), and Heidelberg Retina Tomography (HRT) scanning methods which, unfortunately, are expensive methods and hence, a novel automated glaucoma diagnosis system is needed. This paper proposes a new model for mass screening that aims to decrease the false negative rate (FNR). The model is based on applying nine different machine learning techniques in a majority voting model. The top five techniques that provide the highest accuracy will be used to build a consensus ensemble to make the final decision. The results from applying both models on a dataset with 499 records show a decrease in the accuracy rate from 90% to 83% and a decrease in false negative rate (FNR) from 8% to 0% for majority voting and consensus model, respectively. These results indicate that the proposed model can reduce FNR dramatically while maintaining a reasonable overall accuracy which makes it suitable for mass screening. [ABSTRACT FROM AUTHOR]

k nearest neighbor (k NN) is a simple and widely used classifier; it can achieve comparable performance with more complex classifiers including decision tree and artificial neural network. Therefore, k NN has been listed as one of the top 10 algorithms in machine learning and data mining. On the other hand, in many classification problems, such as medical diagnosis and intrusion detection, the collected training sets are usually class imbalanced. In class imbalanced data, although positive examples are heavily outnumbered by negative ones, positive examples usually carry more meaningful information and are more important than negative examples. Similar to other classical classifiers, k NN is also proposed under the assumption that the training set has approximately balanced class distribution, leading to its unsatisfactory performance on imbalanced data. In addition, under a class imbalanced scenario, the global resampling strategies that are suitable to decision tree and artificial neural network often do not work well for k NN, which is a local information-oriented classifier. To solve this problem, researchers have conducted many works for k NN over the past decade. This paper presents a comprehensive survey of these works according to their different perspectives and analyzes and compares their characteristics. At last, several future directions are pointed out. [ABSTRACT FROM AUTHOR]

Traffic safety has always been an important issue in sustainable transportation development, and the prediction of traffic accident severity remains a crucial challenging issue in the domain of traffic safety. A huge variety of forecasting models have been proposed to meet this challenge. These models gradually evolved from linear to nonlinear forms and from traditional statistical regression models to current popular machine learning models. Recently, a machine learning algorithm called Deep Forests based on the decision tree ensemble has aroused widespread concern, which was proposed for the first time by a research team of Nanjing University. This algorithm was proved to be more accurate and robust in comparison with other machine learning algorithms. Motivated by this benefit, this study employs the UK road safety dataset to propose a novel method for predicting the severity of traffic accidents based on the Deep Forests algorithm. To verify the superiority of our proposed method, several other machine learning algorithm-based perdition models were implemented to predict traffic accident severity with the same dataset, and the prediction results show that the Deep Forests algorithm present good stability, fewer hyper-parameters, and the highest accuracy under different level of training data volume. It is expected that the findings from this study would be helpful for the establishment or improvement of effective traffic safety system within a sustainable transportation system, which is of great significance for helping government managers to establish timely proactive strategies in traffic accident prevention and effectively improve road traffic safety. [ABSTRACT FROM AUTHOR]

There is a consistent rise in chronic diseases worldwide. These diseases decrease immunity and the quality of daily life. The treatment of these disorders is a challenging task for medical professionals. Dimensionality reduction techniques make it possible to handle big data samples, providing decision support in relation to chronic diseases. These datasets contain a series of symptoms that are used in disease prediction. The presence of redundant and irrelevant symptoms in the datasets should be identified and removed using feature selection techniques to improve classification accuracy. Therefore, the main contribution of this paper is a comparative analysis of the impact of wrapper and filter selection methods on classification performance. The filter methods that have been considered include the Correlation Feature Selection (CFS) method, the Information Gain (IG) method and the Chi-Square (CS) method. The wrapper methods that have been considered include the Best First Search (BFS) method, the Linear Forward Selection (LFS) method and the Greedy Step Wise Search (GSS) method. A Decision Tree algorithm has been used as a classifier for this analysis and is implemented through the WEKA tool. An attribute significance analysis has been performed on the diabetes, breast cancer and heart disease datasets used in the study. It was observed that the CFS method outperformed other filter methods concerning the accuracy rate and execution time. The accuracy rate using the CFS method on the datasets for heart disease, diabetes, breast cancer was 93.8%, 89.5% and 96.8% respectively. Moreover, latency delays of 1.08 s, 1.02 s and 1.01 s were noted using the same method for the respective datasets. Among wrapper methods, BFS' performance was impressive in comparison to other methods. Maximum accuracy of 94.7%, 95.8% and 96.8% were achieved on the datasets for heart disease, diabetes and breast cancer respectively. Latency delays of 1.42 s, 1.44 s and 132 s were recorded using the same method for the respective datasets. On the basis of the obtained result, a new hybrid Attribute Evaluator method has been proposed which effectively integrates enhanced K-Means clustering with the CFS filter method and the BFS wrapper method. Furthermore, the hybrid method was evaluated with an improved decision tree classifier. The improved decision tree classifier combined clustering with classification. It was validated on 14 different chronic disease datasets and its performance was recorded. A very optimal and consistent classification performance was observed. The mean values for accuracy, specificity, sensitivity and f-score metrics were 96.7%, 96.5%, 95.6% and 96.2% respectively. [ABSTRACT FROM AUTHOR]

The actualization of the befitting sampling strategy and the application of an appropriate evaluation algorithm have been elementary issues in the coordinate metrology. The decisions regarding their choice for a given geometrical feature customarily rely upon the user's instinct or experience. As a consequence, the measurement results have to be accommodated between the accuracy and the inspection time. Certainly, a reliable and efficient sampling plan is imperative to accomplish a dependable inspection in minimal time, effort, and cost. This paper deals with the determination of an optimal sampling plan that minimizes the inspection cost, while still promising a measurement quality. A cylindrical-shaped component has been utilized in this work to achieve the desired objective. The inspection quality of the cylinder using a coordinate measuring machine (CMM) can be enhanced by controlling the three main parameters, which are used as input variables in the data file, namely, point distribution schemes, total number of points, and form evaluation algorithms. These factors affect the inspection output, in terms of cylindricity and measurement time, which are considered as target variables. The dataset, which comprises input and intended parameters, has been acquired through experimentation on the CMM machine. This work has utilized state-of-the-art machine learning algorithms to establish predictive models, which can predict the inspection output. The different algorithms have been examined and compared to seek for the most relevant machine learning regression method. The best performance has been observed using the support vector regression for cylindricity, with a mean absolute error of 0.000508 mm and a root-mean-squared error of 0.000885 mm. Likewise, the best prediction performance for measuring time has been demonstrated by the decision trees. Finally, the optimal parameters are estimated by employing the grey relational analysis (GRA) and the fuzzy technique for order performance by similarity to ideal solution (FTOPSIS). It has been approved that the values obtained from GRA are comparable with those of the FTOPSIS. Moreover, the quality of the optimal results is bettered by incorporating the measurement uncertainty in the outcome. [ABSTRACT FROM AUTHOR]

After a brief look at the smart home, we conclude that to have a smart home, and it is necessary to have an intelligent management center. In this article, We have tried to make it possible for the smart home management center to be able to detect the presence of an abnormal state in the behavior of someone who lives in the house. In the proposed method, the daily algorithm examines the rate of changes of a person and provides a number which is henceforth called NNC (Number of normal changes) based on the person's behavioral changes. We achieve the NNC number using a machine learning algorithm and performing a series of several simple statistical and mathematical calculations. NNC is a number that shows abnormal changes in residents' behaviors in a smart home, i.e., this number is a small number for a regular person with constant planning and for a person who may not have any fixed principles and regular in personal life is a big number.To increase our accuracy in calculating NNC, we review all common machine learning algorithms and after tests we choose the decision tree because of its higher accuracy and speed and finally, NNC number is obtained by combining the Decision Tree algorithm with statistical and mathematical methods. In this method, we present a set of states and information obtained from the sensors along with the activities performed by the occupant of the house over a period of several days to the proposed algorithm. and the method ahead generates the main NNC number for those days for anyone living in a smart home. To generate this main NNC, we calculate each person's daily NNC. That means we have daily NNCs for each person (based on his/her behaviors on that day) and the main NNC is the average of these daily NNC. We chose ARAS dataset (Human Activity Datasets in Multiple Homes with Multiple Residents) to implement our method and after tests and replications on the ARAS dataset, and to find anomalies in each person's behavior in a day, we compare the main (average) NNC with that person's daily NNC on that day. Finally, we can say, if the main NNC changes more than 30%, there is a possibility of an abnormality. and if the NNC changes more than 60% percent, we can say that an abnormal state or an uncommon event happened that day, and a declaration of an abnormal state will be issued to the resident of the house. [ABSTRACT FROM AUTHOR]

A shortcoming of univariate decision tree learners is that they do not learn intermediate concepts and select only one of the input features in the branching decision at each intermediate tree node. It has been empirically demonstrated that cascading other classification methods, which learn intermediate concepts, with decision tree learners can alleviate such representational bias of decision trees and potentially improve classification performance. However, a more complex model that fits training data belier may not necessarily perform better on unseen data, commonly referred to as the overfitting problem. To find the most appropriate degree of such cascade generalization, a decision forest (i.e., a set of decision trees with other classification models cascaded to different degrees) needs to be generated, from which the best decision tree can then be identified. In this paper, the authors pro- pose an efficient algorithm for generating such decision forests. The algorithm uses an extended decision tree data structure and constructs any node that is common to multiple decision trees only once. The authors have empirically evaluated the algorithm using 32 data sets for classification problems from the University of California, Irvine (UCI) machine learning repository and report on results demonstrating the efficiency of the algorithm in this paper. [ABSTRACT FROM AUTHOR]

The issue of how to improve the usability of data publishing under differential privacy has become one of the top questions in the field of machine learning privacy protection, and the key to solving this problem is to allocate a reasonable privacy protection budget. To solve this problem, we design a privacy budget allocation algorithm based on out-of-bag estimation in random forest. The algorithm firstly calculates the decision tree weights and feature weights by the out-of-bag data under differential privacy protection. Secondly, statistical methods are introduced to classify features into best feature set, pruned feature set, and removable feature set. Then, pruning is performed using the pruned feature set to avoid decision trees over-fitting when constructing an ϵ -differential privacy random forest. Finally, the privacy budget is allocated proportionally based on the decision tree weights and feature weights in the random forest. We conducted experimental comparisons with real data sets from Adult and Mushroom to demonstrate that this algorithm not only protects data security and privacy, but also improves model classification accuracy and data availability. [ABSTRACT FROM AUTHOR]

Aim:Prediction of human activity data using Random forest algorithm against Decision tree algorithm for better accuracy using machine learning. Materials and Methods: Random forest algorithm (N=20)and Decision Tree algorithm (N=20) these two algorithms are calculated by using 2 Groups and I have taken 20 samples for both algorithm and accuracy in this work. Results: Based on the Results Accuracy obtained in terms of accuracy is identified by Random forest algorithm (90.6%) over Decision Tree algorithm algorithm(86.66%). Statistical significance difference between Random forest algorithm and Decision Tree algorithm was found to be 0.001 (p<0.05), using a=0.05 and power=0.80.conclusion: From the analysis it was observed that the human activity data using Random forest algorithm is better than Decision Tree algorithm for better accuracy using machine learning. [ABSTRACT FROM AUTHOR]

Background: Identifying conserved regions in protein sequences is a fundamental operation, occurring in numerous sequence-driven analysis pipelines. It is used as a way to decode domain-rich regions within proteins, to compute protein clusters, to annotate sequence function, and to compute evolutionary relationships among protein sequences. A number of approaches exist for identifying and characterizing protein families based on their domains, and because domains represent conserved portions of a protein sequence, the primary computation involved in protein family characterization is identification of such conserved regions. However, identifying conserved regions from large collections (millions) of protein sequences presents significant challenges. Methods: In this paper we present a new, alignment-free method for detecting conserved regions in protein sequences called NADDA (No-Alignment Domain Detection Algorithm). Our method exploits the abundance of exact matching short subsequences (k-mers) to quickly detect conserved regions, and the power of machine learning is used to improve the prediction accuracy of detection. We present a parallel implementation of NADDA using the MapReduce framework and show that our method is highly scalable. Results: We have compared NADDA with Pfam and InterPro databases. For known domains annotated by Pfam, accuracy is 83%, sensitivity 96%, and specificity 44%. For sequences with new domains not present in the training set an average accuracy of 63% is achieved when compared to Pfam. A boost in results in comparison with InterPro demonstrates the ability of NADDA to capture conserved regions beyond those present in Pfam. We have also compared NADDA with ADDA and MKDOM2, assuming Pfam as ground-truth. On average NADDA shows comparable accuracy, more balanced sensitivity and specificity, and being alignment-free, is significantly faster. Excluding the one-time cost of training, runtimes on a single processor were 49s, 10,566s, and 456s for NADDA, ADDA, and MKDOM2, respectively, for a data set comprised of approximately 2500 sequences. [ABSTRACT FROM AUTHOR]

Decision trees are among the most popular classifiers in machine learning, artificial intelligence, and pattern recognition because they are accurate and easy to interpret. During the tree construction, a node containing too few observations (weak node) could still get split, and then the resulted split is unreliable and statistically has no value. Many existing machine-learning methods can resolve this issue, such as pruning, which removes the tree's non-meaningful parts. This paper deals with the weak nodes differently; we introduce a new algorithm Enhancing Weak Nodes in Decision Tree (EWNDT), which reinforces them by increasing their data from other similar tree nodes. We called the data augmentation a virtual merging because we temporarily recalculate the best splitting attribute and the best threshold in the weak node. We have used two approaches to defining the similarity between two nodes. The experimental results are verified using benchmark datasets from the UCI machine-learning repository. The results indicate that the EWNDT algorithm gives a good performance. [ABSTRACT FROM AUTHOR]

In general, the stock prices of the same industry have a similar trend, but those of different industries do not. When investing in stocks of different industries, one should select the optimal model from lots of trading models for each industry because any model may not be suitable for capturing the stock trends of all industries. However, the study has not been carried out at present. In this paper, firstly we select 424 S&P 500 index component stocks (SPICS) and 185 CSI 300 index component stocks (CSICS) as the research objects from 2010 to 2017, divide them into 9 industries such as finance and energy respectively. Secondly, we apply 12 widely used machine learning algorithms to generate stock trading signals in different industries and execute the back-testing based on the trading signals. Thirdly, we use a non-parametric statistical test to evaluate whether there are significant differences among the trading performance evaluation indicators (PEI) of different models in the same industry. Finally, we propose a series of rules to select the optimal models for stock investment of every industry. The analytical results on SPICS and CSICS show that we can find the optimal trading models for each industry based on the statistical tests and the rules. Most importantly, the PEI of the best algorithms can be significantly better than that of the benchmark index and “Buy and Hold” strategy. Therefore, the algorithms can be used for making profits from industry stock trading. [ABSTRACT FROM AUTHOR]

Frequently, port scans are early indicators of more serious attacks. Unfortunately, the detection of slow port scans in company networks is challenging due to the massive amount of network data. This paper proposes an innovative approach for preprocessing flow-based data which is specifically tailored to the detection of slow port scans. The preprocessing chain generates new objects based on flow-based data aggregated over time windows while taking domain knowledge as well as additional knowledge about the network structure into account. The computed objects are used as input for the further analysis. Based on these objects, we propose two different approaches for detection of slow port scans. One approach is unsupervised and uses sequential hypothesis testing whereas the other approach is supervised and uses classification algorithms. We compare both approaches with existing port scan detection algorithms on the flow-based CIDDS-001 data set. Experiments indicate that the proposed approaches achieve better detection rates and exhibit less false alarms than similar algorithms. [ABSTRACT FROM AUTHOR]

This paper compares human judgment with machine learning in a check processing context. An experiment was conducted comparing teams of subjects with three commercially available machine learning algorithms: recursive partitioning, ID3, and a back-propagation neural network. Also, the statistical technique discriminant analysis was compared. The subjects were allowed to induce rules from historical data under ideal human conditions, such as adequate time and opportunity to sort the data as desired. The results on multiple holdout samples indicate that human judgment, recursive partitioning, and the ID3 algorithm were equally accurate and more accurate than a back-propagation neural network. Subjects who chose mixed strategies of judgment were more accurate than those using noncompensatory strategies, while no subjects chose compensatory strategies. Large decision trees were not more accurate than smaller ones. There appeared to be a time threshold for humans to form accurate decision rules. Holdout sample accuracy tended to increase with primary sample accuracy. ID3 built larger trees than did either humans or recursive partitioning. The conclusion of this research is that the knowledge engineer faced with available historical data concerning a classification problem should not waste his time discerning rules, since he will only take longer and be no more accurate than a good learning tool. Knowledge of these tools will be the requisite skill for the knowledge engineer of the 1990s. Implications for IS design and further research are discussed. [ABSTRACT FROM AUTHOR]