Search Constraints

Start Over
Filtering by: Creator Hanneman, Thomas R. Remove constraint Creator: Hanneman, Thomas R. Advisor Dietterich, Thomas G. Remove constraint Advisor: Dietterich, Thomas G.

Search Results

  • Disjunctions in forward chaining logic programming

    Creator:
    Corpron, Daniel R.
    Abstract:
    A forward-chaining logic programming system (FORLOG) has been developed at Oregon State University. This system coupled with an assumption-based truth maintenance system (ATMS), provides an alternative to the logic programming paradigm of backward-chaining with Horn clauses. To compare FORLOG to this paradigm, we define a subset of FORLOG, called mini-FORLOG,...
    Resource Type:
    Masters Thesis
    Full Text:
    Abstract of the Thesis of Daniel R. Corpron for the degree of Master of Science in Computer Science

  • Just enough die-level functional test : optimizing IC test via machine learning and decision theory

    Creator:
    Fountain, Tony R.
    Abstract:
    This research explores the hypothesis that methods from decision theory and machine learning can be combined to provide practical solutions to current manufacturing control problems. This hypothesis is explored by developing an integrated approach to solving one manufacturing problem - the optimization of die-level functional test. An integrated circuit (IC)...
    Resource Type:
    Dissertation
    Full Text:
    machine learning and decision theory AN ABSTRACT OF THE THESIS OF Tony R. Fountain for the degree of

  • Model-based approximation methods for reinforcement learning

    Creator:
    Wang, Xin
    Abstract:
    The thesis focuses on model-based approximation methods for reinforcement learning with large scale applications such as combinatorial optimization problems. First, the thesis proposes two new model-based methods to stablize the value–function approximation for reinforcement learning. The first one is the BFBP algorithm, a batch-like reinforcement learning process which iterates between...
    Resource Type:
    Dissertation
    Full Text:
    Methods for Reinforcement Learning. Abstract approved: Thomas G Dietterich The thesis focuses on model

  • Simulator-Defined MDP Planning with Applications in Natural Resource Management

    Creator:
    Alkaee Taleghan, Majid
    Abstract:
    This work is inspired by problems in natural resource management centered on the challenge of invasive species. Computing optimal management policies for maintaining ecosystem sustainable is challenging. Many ecosystem management problems can be formulated as MDP (Markov Decision Process) planning problems. In a simulator-defined MDP, the Markovian dynamics and rewards...
    Resource Type:
    Dissertation
    Full Text:
    : Simulator-Defined MDP Planning with Applications in Natural Resource Management Abstract approved: Thomas

  • Learning MDP action models via discrete mixture trees

    Creator:
    Wynkoop, Michael S.
    Abstract:
    This thesis addresses the problem of learning dynamic Bayesian network (DBN) models to support reinforcement learning. It focuses on learning regression tree models of the conditional probability distributions of the DBNs. Existing algorithms presume that the stochasticity in the domain can be modeled as a deterministic function with additive noise....
    Resource Type:
    Masters Thesis
    Full Text:
    , 2008. Title: Learning MDP Action Models via Discrete Mixture Trees Abstract approved: Thomas G

  • Improving automated email tagging with implicit feedback

    Creator:
    Sorower, Mohammad Shahed
    Abstract:
    Machine learning systems are generally trained offline using ground truth data that has been labeled by experts. However, these batch training methods are not a good fit for many applications, especially in the cases where complete ground truth data is not available for offline training. In addition, batch methods do...
    Resource Type:
    Dissertation
    Full Text:
    : Improving Automated Email Tagging with Implicit Feedback Abstract approved: Thomas G. Dietterich Machine

  • Three methods for estimating subpixel cover fractions in coarse resolution imagery

    Creator:
    Damon, Diane L.
    Abstract:
    Coarse resolution imagery, such as that produced by the MODIS instrument, poses the challenge of estimating sub-pixel proportions of di erent land cover types. This problem is di cult because of the variety and variability of vegetation within individual pixels. This thesis describes and compares two existing algorithms for estimating...
    Resource Type:
    Masters Thesis
    Full Text:
    Estimating Subpixel Cover Fractions in Coarse Resolution Imagery. Abstract approved: Thomas G. Dietterich

  • Anomaly Detection and Probabilistic Diagnosis for Automated Data Quality Control

    Creator:
    Zemicheal, Tadesse H.
    Abstract:
    Advances in sensor technology are greatly expanding the range of quantities that can be measured while simultaneously reducing the cost. However, deployed sensors drift out of calibration and fail, so every sensor network requires quality control procedures to promptly detect these failures. To address these problems, we propose a two-level...
    Resource Type:
    Dissertation
    Full Text:
    : Thomas G. Dietterich Advances in sensor technology are greatly expanding the range of quantities that

  • Understanding and improving error-correcting output coding

    Creator:
    Kong, Eun Bae
    Abstract:
    Error-correcting output coding (ECOC) is a method for converting a k-classsupervised learning problem into a large number L of two-class supervised learningproblems and then combining the results of these L evaluations. Previous researchhas shown that ECOC can dramatically improve the classi cation accuracy of supervisedlearning algorithms that learn to classify...
    Resource Type:
    Dissertation
    Full Text:
    and Improving Error-Correcting Output Coding Abstract approved: Thomas G. Dietterich Error

  • An investigation of the search space of Lenat's AM program

    Creator:
    Mishra, Prafulla K.
    Abstract:
    AM is a computer program written by Doug Lenat that discovers elementary mathematics starting from some initial knowledge of set theory. The success of this program is not clearly understood. This work is an attempt to explore the search space of AM in order to understand the success and eventual...
    Resource Type:
    Masters Thesis
    Full Text:
    Abstract approved:_ Redacted for Privacy Thomas G. Dietterich. AM is a computer program written by Doug