Search Constraints

Start Over
Filtering by: Creator Quinn, Thomas P. Remove constraint Creator: Quinn, Thomas P. Advisor Dietterich, Thomas G. Remove constraint Advisor: Dietterich, Thomas G.

Search Results

  • Learning functional descriptions from examples

    Creator:
    Flann, Nicholas S.
    Abstract:
    The task of inductive learning from examples places constraints on the representation of training instances and concepts. These constraints are different from, and often incompatible with, the constraints placed on the representation by the performance task. This incompatibility is severe when learning functional concepts and explains why previous researchers have...
    Resource Type:
    Masters Thesis
    Full Text:
    Abstract approve Thomas G. Dietterich. The task of inductive learning from examples places constraints on

  • 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:
    approved: Redacted for Privacy Thomas G. Dietterich A forward-chaining logic programming system (FORLOG

  • 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

  • A specialized ATMS for equivalence relations

    Creator:
    Koff, Caroline Nan
    Abstract:
    A specialized ATMS for efficiently computing equivalence relations in multiple contexts is introduced. This specialized ATMS overcomes the problems with existing solutions to reasoning with equivalence relations. The most direct implementation of an equivalence relation in the ATMS-encoding the reflexive, transitive, and symmetric rules in the consumer architecture-produces redundant equality...
    Resource Type:
    Masters Thesis
    Full Text:
    for privacy Thomas G. Dietterich. A specialized ATMS for efficiently computing equivalence relations

  • Relationship of pauses to problem solving events in mechanical design protocols

    Creator:
    Chamberlin, Martha J.
    Abstract:
    This thesis compares two methods for studying the problem-solving processes of mechanical design engineers. The first method, verbal protocol analysis, was applied by L. Stauffer to construct a problem-solving model of mechanical design. The second method, timing analysis, measures the time intervals separating drawing or speaking actions during the design...
    Resource Type:
    Masters Thesis
    Full Text:
    Events in Mechanical Design Protocols Abstract approved: Redacted for Privacy Thomas G. Dietterich

  • An implementation and initial test of generalized radial basis functions

    Creator:
    Wettschereck, Dietrich
    Abstract:
    Generalized Radial Basis Functions were used to construct networks that learn input-output mappings from given data. They are developed out of a theoretical framework for approximation based on regularization techniques and represent a class of three-layer networks similar to backpropagation networks with one hidden layer. A network using Gaussian base...
    Resource Type:
    Masters Thesis
    Full Text:
    Generalized Radial Basis Functions A,/ Redacted for Privacy Abstract approved: _ Thomas G. Dietterich

  • An empirical study into learning through experimentation

    Creator:
    Ruff, Ritchey Alvin
    Abstract:
    A key aspect of how we understand the world revolves around an ability to manipulate our surroundings to experiment. From the scientific method through theories of child development, the ability to experiment is deemed critical; however, few studies have been performed to understand the strengths and weaknesses of different experimental...
    Resource Type:
    Dissertation
    Full Text:
    Redacted for privacy Abstract approved. Thomas G. Dietterich A key aspect of how we understand the world

  • Correct abstraction in counter-planning : a knowledge compilation approach

    Creator:
    Flann, Nicholas S.
    Abstract:
    Knowledge compilation improves search-intensive problem-solvers that are easily specified but inefficient. One promising approach improves efficiency by constructing a database of problem-instance/best-action pairs that replace problem-solving search with efficient lookup. The database is constructed by reverse enumeration- expanding the complete search space backwards, from the terminal problem instances. This approach...
    Resource Type:
    Dissertation
    Full Text:
    1992. Approved: Redacted for Privacy Thomas G. Dietterich Redacted for Privacy Head of

  • Machine learning in engineering : techniques to speed up numerical optimization

    Creator:
    Cerbone, G. (Giuseppe)
    Abstract:
    Many important application problems in engineering can be formalized as nonlinear optimization tasks. However, numerical methods for solving such problems are brittle and do not scale well. For example, these methods depend critically on choosing a good starting point from which to perform the optimization search. In high-dimensional spaces, numerical...
    Resource Type:
    Dissertation
    Full Text:
    : Techniques to Speed Up Numerical Optimization Redacted for Privacy Abstract approved. Thomas G. Dietterich

  • Concept coverage and its application to two learning tasks

    Creator:
    Almuallim, Hussein Saleh
    Abstract:
    The coverage of a learning algorithm is the number of concepts that can be learned by that algorithm from samples of a given size for given accuracy and confidence parameters. This thesis begins by asking whether good learning algorithms can be designed by maximizing their coverage. There are three questions...
    Resource Type:
    Dissertation
    Full Text:
    Tasks Abstract approved Thomas G. Dietterich The coverage of a learning algorithm is the number of