Rolling Lookahead Learning for Optimal Classification Trees

Classification trees continue to be widely adopted in machine learning applications due to their inherently interpretable nature and scalability. We propose a rolling subtree lookahead algorithm that combines the relative scalability of the myopic approaches with the foresight of the optimal approaches in constructing trees. The limited foresight embedded in our algorithm mitigates the learning pathology observed in optimal approaches. At the heart of our algorithm lies a novel two-depth optimal binary classification tree formulation flexible to handle any loss function. We show that the feasible region of this formulation is an integral polyhedron, yielding the LP relaxation solution optimal. Through extensive computational analyses, we demonstrate that our approach outperforms optimal and myopic approaches in 808 out of 1330 problem instances, improving the out-of-sample accuracy by up to 23.6% and 14.4%, respectively.Comment: 41 pages, 19 tables, 10 figure

A survey of cost-sensitive decision tree induction algorithms

The past decade has seen a significant interest on the problem of inducing decision trees that take account of costs of misclassification and costs of acquiring the features used for decision making. This survey identifies over 50 algorithms including approaches that are direct adaptations of accuracy based methods, use genetic algorithms, use anytime methods and utilize boosting and bagging. The survey brings together these different studies and novel approaches to cost-sensitive decision tree learning, provides a useful taxonomy, a historical timeline of how the field has developed and should provide a useful reference point for future research in this field

Spartan Daily, April 12, 1978

Volume 70, Issue 44https://scholarworks.sjsu.edu/spartandaily/6335/thumbnail.jp

Annual Report: 2013

I submit herewith the annual reports from the Agricultural and Forestry Experiment Station, School of Natural Resources and Agricultural Sciences, University of Alaska Fairbanks, for the period ending December 31, 2013. This is done in accordance with an act of Congress, approved March 2, 1887, entitled, “An act to establish agricultural experiment stations, in connection with the agricultural college established in the several states under the provisions of an act approved July 2, 1862, and under the acts supplementary thereto,” and also of the act of the Alaska Territorial Legislature, approved March 12, 1935, accepting the provisions of the act of Congress. The research reports are organized according to our strategic plan and by broad subject, focusing on geography, high-latitude agriculture, forest sciences, and the interaction of humans and the environment. Research conducted by our graduate and undergraduate students plays an important role in these grants and the impact they make on Alaska.Financial Statement -- Funding & Grants -- Students -- Research at SNRAS & AFES -- Publications -- Facult

Solving the detour problem in navigation: a model of prefrontal and hippocampal interactions.

Adapting behavior to accommodate changes in the environment is an important function of the nervous system. A universal problem for motile animals is the discovery that a learned route is blocked and a detour is required. Given the substantial neuroscience research on spatial navigation and decision-making it is surprising that so little is known about how the brain solves the detour problem. Here we review the limited number of relevant functional neuroimaging, single unit recording and lesion studies. We find that while the prefrontal cortex (PFC) consistently responds to detours, the hippocampus does not. Recent evidence suggests the hippocampus tracks information about the future path distance to the goal. Based on this evidence we postulate a conceptual model in which: Lateral PFC provides a prediction error signal about the change in the path, frontopolar and superior PFC support the re-formulation of the route plan as a novel subgoal and the hippocampus simulates the new path. More data will be required to validate this model and understand (1) how the system processes the different options; and (2) deals with situations where a new path becomes available (i.e., shortcuts)