Search Constraints

Start Over
Filtering by: Creator O'Halloran, Thomas L. Remove constraint Creator: O'Halloran, Thomas L. Degree Field Computer Science Remove constraint Degree Field: Computer Science Degree Name Master of Science (M.S.) Remove constraint Degree Name: Master of Science (M.S.)

Search Results

  • Evaluating online text classification algorithms for email prediction in TaskTracer

    Creator:
    Keiser, Victoria L.
    Abstract:
    This paper examines how six online multiclass text classification algorithms perform in the domain of email tagging within the TaskTracer system. TaskTracer is a project-oriented user interface for the desktop knowledge worker. TaskTracer attempts to tag all documents, web pages, and email messages with the projects to which they are...
    Resource Type:
    Masters Thesis
    Full Text:
    THESIS OF Victoria L. Keiser for the degree of Master of Science in Computer Science presented

  • 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:
    thesis.dvi AN ABSTRACT OF THE THESIS OF Diane L. Damon for the degree

  • 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:
    3L(F(x),y) grn(x) = (2.7) DF(x) F(x)=Fmi(x) N p = argmin L(Fm_i (xi) pg(xj), yj). (2.8) ir=O It

  • 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

  • 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:
    Fine-grained Object Classification of Arthropod Specimens Abstract approved: Thomas G. Dietterich

  • 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

  • Constraining Bayesian network learning with qualitative models

    Creator:
    Altendorf, Eric E.
    Abstract:
    Machine learning encompasses probabilistic and statistical techniques that can build models from large quantities of extensional information (examples) with minimal dependence on intensional information (domain knowledge). This focus of machine learning is reflected in the never-ending quest for "off-the-shelf" classifiers. To generalize to unseen data, however, we must make use...
    Resource Type:
    Masters Thesis
    Full Text:
    Network Learning with Qualitative Models. Abstract approved: Thomas G. Dietterich Machine learning

  • Sequential supervised learning and conditional random fields

    Creator:
    Ashenfelter, Adam J.
    Abstract:
    Supervised learning is concerned with discovering the relationship between example sets of features and their corresponding classes. The traditional supervised learning formulation assumes that all examples are independent from one another. The order of the examples contains no information. Nonetheless, many problems have a sequential nature. Classifiers for these problems...
    Resource Type:
    Masters Thesis
    Full Text:
    computationally efficient. Although there are KL possible classification sequences, the algorithms run in O(L ∗K2

  • A Benchmarking Study of Unsupervised Anomaly Detection Algorithms

    Creator:
    Emmott, Andrew F.
    Abstract:
    It is common practice in the unsupervised anomaly detection literature to create experimental benchmarks by sampling from existing supervised learning datasets. We seek to improve this practice by identifying four dimensions important to real-world anomaly detection applications --- point difficulty, clusteredness of anomalies, relevance of features, and relative frequency of...
    Resource Type:
    Masters Thesis
    Full Text:
    of Unsupervised Anomaly Detection Algorithms Abstract approved: Thomas Dietterich It is common

  • 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:
    <0. 4- 0 ,#, et , .c, 4 4. et, 4>o xi Nob toot, 't". $9 ,c''' b K,N° ,,,l`b ez' ts951