Search Constraints

Start Over
Filtering by: Alternative title ssim Technical note no. 212 Remove constraint Alternative title ssim: Technical note no. 212 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:
    system requires virtually no "vocabulary engineering" to learn concepts in a new domain. Learning

  • 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:
    defining a goal clause as a Horn clause with no positive literals. Any given goal may have several

  • 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:
    with the number of distinct assumptions. The special- ized ATMS presented here produces no redundant

  • 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:
    really the case [9, 20, 24]. First of all, there is no proof that what the subject says dur- ing a

  • 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:
    the experiment selector had little or no effect. Our best situations were where: (a) only a small

  • 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:
    there exists no action by black that can simultaneously eliminate both threats. Note that in the

  • 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:
    Al-Muallim provided friendly advice and technical competency. Vijay Srinivasan was very precise in

  • 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:
    source of love and support to me. The last, and surely the most important, note of thanks belongs to my

  • Classification context in a machine learning approach to predicting protein secondary structure

    Creator:
    Langford, Bill T.
    Abstract:
    An important problem in molecular biology is to predict the secondary structure of proteins from their primary structure. The primary structure of a protein is the sequence of amino acid residues. The secondary structure is an abstract description of the shape of the folded protein, with regions identified as alpha...
    Resource Type:
    Masters Thesis
    Full Text:
    58 5.3.5 Types of Simulated Data 60 Chapter 6 Baseline Experiments 61 6.1 No Classification

  • A study of distance-based machine learning algorithms

    Creator:
    Wettschereck, Dietrich
    Abstract:
    Distance-based algorithms are machine learning algorithms that classify queries by computing distances between these queries and a number of internally stored exemplars. Exemplars that are closest to the query have the largest in uence on the classi cation assigned to the query. Two speci c distance-based algorithms, the nearest neighbor...
    Resource Type:
    Dissertation
    Full Text:
    accomplish tasks for which no known or efficient algo- rithm exists. The term "learning" indicates that