Search Constraints

Start Over
Filtering by: Creator Curtis, Morgan A. Remove constraint Creator: Curtis, Morgan A. Advisor Dietterich, Thomas G. Remove constraint Advisor: Dietterich, Thomas G.

Search Results

  • Shrunken learning rates do not improve AdaBoost on benchmark datasets

    Creator:
    Forrest, Daniel L. K.
    Abstract:
    Recent work has shown that AdaBoost can be viewed as an algorithm that maximizes the margin on the training data via functional gradient descent. Under this interpretation, the weight computed by AdaBoost, for each hypothesis generated, can be viewed as a step size parameter in a gradient descent search. Friedman...
    Resource Type:
    Masters Thesis
    Full Text:
    , for each hypothesis gener- ated, can be viewed as a step size parameter in a gradient descent search

  • Reinforcement learning for job-shop scheduling

    Creator:
    Zhang, Wei, 1960-
    Resource Type:
    Dissertation
    Full Text:
    involves schedul- ing a set of tasks to satisfy a set of temporal and resource constraints while also

  • A probabilistic model for anomaly detection in remote sensor streams

    Creator:
    Dereszynski, Ethan W.
    Abstract:
    Remote sensors are becoming the standard for observing and recording ecological data in the field. Such sensors can record data at fine temporal resolutions, and they can operate under extreme conditions prohibitive to human access. Unfortunately, sensor data streams exhibit many kinds of errors ranging from corrupt communications to partial...
    Resource Type:
    Masters Thesis
    Full Text:
    Computer Science presented on October 25th, 2007. Title: A Probabilistic Model for Anomaly Detection in

  • 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:
    the degree of Doctor of Philosophy in Computer Science presented on June 7, 1994. Title: A Study of

  • 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:
    Correct abstraction in counter-planning : a knowledge

  • 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:
    Classification context in a machine learning approach to

  • A study of methods for fine-grained object classification of arthropod specimens

    Creator:
    Lin, Junyuan
    Abstract:
    Object categorization is one of the fundamental topics in computer vision research. Most current work in object categorization aims to discriminate among generic object classes with gross differences. However, many applications require much finer distinctions. This thesis focuses on the design, evaluation and analysis of learning algorithms for fine- grained...
    Resource Type:
    Masters Thesis
    Full Text:
    Master of Science in Computer Science presented on February 18, 2013. Title: A Study of Methods for

  • Methods for cost-sensitive learning

    Creator:
    Margineantu, Dragos D.
    Abstract:
    Many approaches for achieving intelligent behavior of automated (computer) systems involve components that learn from past experience. This dissertation studies computational methods for learning from examples, for classification and for decision making, when the decisions have different non-zero costs associated with them. Many practical applications of learning algorithms, including transaction...
    Resource Type:
    Dissertation
    Full Text:
    there is a great need for new methods that can handle them. This dissertation discusses two approaches

  • 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:
    . However, these batch training methods are not a good �t for many applications, especially in the cases

  • 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:
    value–function approximation for reinforcement learning. The first one is the BFBP algorithm, a batch