A formula in first-order logic can be viewed as a tree, with a logical connective at each node, and a knowledge base can be viewed as a tree whose root is a conjunction. Markov l...
Despite popular belief, boosting algorithms and related coordinate descent methods are prone to overfitting. We derive modifications to AdaBoost and related gradient-based coordin...
In this paper we propose an automated approach for joint sulci detection on cortical surfaces by using graphical models and boosting techniques to incorporate shape priors of major...
Yonggang Shi, Zhuowen Tu, Allan L. Reiss, Rebecca ...
Many intelligent tutoring systems (ITSs) have been developed, deployed, assessed, and proven to facilitate learning. However, most of these systems do not generally adapt to new c...
This paper introduces a new technique for predicting latent software bugs, called change classification. Change classification uses a machine learning classifier to determine wheth...
Sunghun Kim, E. James Whitehead Jr., Yi Zhang 0001