378 research outputs found

    Bagging ensemble selection for regression

    Get PDF
    Bagging ensemble selection (BES) is a relatively new ensemble learning strategy. The strategy can be seen as an ensemble of the ensemble selection from libraries of models (ES) strategy. Previous experimental results on binary classification problems have shown that using random trees as base classifiers, BES-OOB (the most successful variant of BES) is competitive with (and in many cases, superior to) other ensemble learning strategies, for instance, the original ES algorithm, stacking with linear regression, random forests or boosting. Motivated by the promising results in classification, this paper examines the predictive performance of the BES-OOB strategy for regression problems. Our results show that the BES-OOB strategy outperforms Stochastic Gradient Boosting and Bagging when using regression trees as the base learners. Our results also suggest that the advantage of using a diverse model library becomes clear when the model library size is relatively large. We also present encouraging results indicating that the non negative least squares algorithm is a viable approach for pruning an ensemble of ensembles

    Visual, Motor and Attentional Influences on Proprioceptive Contributions to Perception of Hand Path Rectilinearity during Reaching

    Get PDF
    We examined how proprioceptive contributions to perception of hand path straightness are influenced by visual, motor and attentional sources of performance variability during horizontal planar reaching. Subjects held the handle of a robot that constrained goal-directed movements of the hand to the paths of controlled curvature. Subjects attempted to detect the presence of hand path curvature during both active (subject driven) and passive (robot driven) movements that either required active muscle force production or not. Subjects were less able to discriminate curved from straight paths when actively reaching for a target versus when the robot moved their hand through the same curved paths. This effect was especially evident during robot-driven movements requiring concurrent activation of lengthening but not shortening muscles. Subjects were less likely to report curvature and were more variable in reporting when movements appeared straight in a novel “visual channel” condition previously shown to block adaptive updating of motor commands in response to deviations from a straight-line hand path. Similarly, compromised performance was obtained when subjects simultaneously performed a distracting secondary task (key pressing with the contralateral hand). The effects compounded when these last two treatments were combined. It is concluded that environmental, intrinsic and attentional factors all impact the ability to detect deviations from a rectilinear hand path during goal-directed movement by decreasing proprioceptive contributions to limb state estimation. In contrast, response variability increased only in experimental conditions thought to impose additional attentional demands on the observer. Implications of these results for perception and other sensorimotor behaviors are discussed

    Software defect prediction: do different classifiers find the same defects?

    Get PDF
    Open Access: This article is distributed under the terms of the Creative Commons Attribution 4.0 International License CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.During the last 10 years, hundreds of different defect prediction models have been published. The performance of the classifiers used in these models is reported to be similar with models rarely performing above the predictive performance ceiling of about 80% recall. We investigate the individual defects that four classifiers predict and analyse the level of prediction uncertainty produced by these classifiers. We perform a sensitivity analysis to compare the performance of Random Forest, Naïve Bayes, RPart and SVM classifiers when predicting defects in NASA, open source and commercial datasets. The defect predictions that each classifier makes is captured in a confusion matrix and the prediction uncertainty of each classifier is compared. Despite similar predictive performance values for these four classifiers, each detects different sets of defects. Some classifiers are more consistent in predicting defects than others. Our results confirm that a unique subset of defects can be detected by specific classifiers. However, while some classifiers are consistent in the predictions they make, other classifiers vary in their predictions. Given our results, we conclude that classifier ensembles with decision-making strategies not based on majority voting are likely to perform best in defect prediction.Peer reviewedFinal Published versio

    Multi-Target Prediction: A Unifying View on Problems and Methods

    Full text link
    Multi-target prediction (MTP) is concerned with the simultaneous prediction of multiple target variables of diverse type. Due to its enormous application potential, it has developed into an active and rapidly expanding research field that combines several subfields of machine learning, including multivariate regression, multi-label classification, multi-task learning, dyadic prediction, zero-shot learning, network inference, and matrix completion. In this paper, we present a unifying view on MTP problems and methods. First, we formally discuss commonalities and differences between existing MTP problems. To this end, we introduce a general framework that covers the above subfields as special cases. As a second contribution, we provide a structured overview of MTP methods. This is accomplished by identifying a number of key properties, which distinguish such methods and determine their suitability for different types of problems. Finally, we also discuss a few challenges for future research

    State Transition Algorithm

    Full text link
    In terms of the concepts of state and state transition, a new heuristic random search algorithm named state transition algorithm is proposed. For continuous function optimization problems, four special transformation operators called rotation, translation, expansion and axesion are designed. Adjusting measures of the transformations are mainly studied to keep the balance of exploration and exploitation. Convergence analysis is also discussed about the algorithm based on random search theory. In the meanwhile, to strengthen the search ability in high dimensional space, communication strategy is introduced into the basic algorithm and intermittent exchange is presented to prevent premature convergence. Finally, experiments are carried out for the algorithms. With 10 common benchmark unconstrained continuous functions used to test the performance, the results show that state transition algorithms are promising algorithms due to their good global search capability and convergence property when compared with some popular algorithms.Comment: 18 pages, 28 figure

    A Dynamic Island-Based Genetic Algorithms Framework

    Get PDF
    This work presents a dynamic island model framework for helping the resolution of combinatorial optimization problems with evolutionary algorithms. In this framework, the possible migrations among islands are represented by a complete graph. The migrations probabilities associated to each edge are dynamically updated with respect to the last migrations impact. This new framework is tested on the well-known 0/1 Knapsack problem and MAX-SAT problem. Good results are obtained and several properties of this framework are studied

    Dynamic Interpretation of Hedgehog Signaling in the Drosophila Wing Disc

    Get PDF
    Morphogens are classically defined as molecules that control patterning by acting at a distance to regulate gene expression in a concentration-dependent manner. In the Drosophila wing imaginal disc, secreted Hedgehog (Hh) forms an extracellular gradient that organizes patterning along the anterior–posterior axis and specifies at least three different domains of gene expression. Although the prevailing view is that Hh functions in the Drosophila wing disc as a classical morphogen, a direct correspondence between the borders of these patterns and Hh concentration thresholds has not been demonstrated. Here, we provide evidence that the interpretation of Hh signaling depends on the history of exposure to Hh and propose that a single concentration threshold is sufficient to support multiple outputs. Using mathematical modeling, we predict that at steady state, only two domains can be defined in response to Hh, suggesting that the boundaries of two or more gene expression patterns cannot be specified by a static Hh gradient. Computer simulations suggest that a spatial “overshoot” of the Hh gradient occurs, i.e., a transient state in which the Hh profile is expanded compared to the Hh steady-state gradient. Through a temporal examination of Hh target gene expression, we observe that the patterns initially expand anteriorly and then refine, providing in vivo evidence for the overshoot. The Hh gene network architecture suggests this overshoot results from the Hh-dependent up-regulation of the receptor, Patched (Ptc). In fact, when the network structure was altered such that the ptc gene is no longer up-regulated in response to Hh-signaling activation, we found that the patterns of gene expression, which have distinct borders in wild-type discs, now overlap. Our results support a model in which Hh gradient dynamics, resulting from Ptc up-regulation, play an instructional role in the establishment of patterns of gene expression
    corecore