Search Constraints

Start Over
Filtering by: Creator Hilliard, Richard F. Remove constraint Creator: Hilliard, Richard F. Degree Name Doctor of Philosophy (Ph.D.) Remove constraint Degree Name: Doctor of Philosophy (Ph.D.) Subject Machine learning Remove constraint Subject: Machine learning

Search Results

  • Theoretical and implementation improvements for difference evaluation functions

    Creator:
    Colby, Mitchell Kataichi
    Abstract:
    Multiagent learning with cooperative coevolutionary algorithms is a critical area of research, and is relevant to many real-world applications including air traffic control, distributed sensor network control, and game-theoretic applications such as border patrol. A key difficulty in multiagent learning is the credit assignment problem, where the impact of each...
    Resource Type:
    Dissertation

  • Pixel- and Frame-level Video Labeling using Spatial and Temporal Convolutional Networks

    Creator:
    Lei, Peng
    Abstract:
    This dissertation addresses the problem of video labeling at both the frame and pixel levels using deep learning. For pixel-level video labeling, we have studied two problems: i) Spatiotemporal video segmentation and ii) Boundary detection and boundary flow estimation. For the problem of spatiotemporal video segmentation, we have developed recurrent...
    Resource Type:
    Dissertation
    Full Text:
    inputs and two outputs. The input represents feature sequences fL−11:T/2n and f L−1 1:T with temporal

  • Parsing with Recurrent Neural Networks

    Creator:
    Cross, James Henry, III
    Abstract:
    Machine learning models for natural language processing have traditionally relied on large numbers of discrete features, built up from atomic categories such as word forms and part-of-speech labels, which are considered completely distinct from each other. Recently however, the advent of dense feature representations coupled with deep learning techniques has...
    Resource Type:
    Dissertation
    Full Text:
    (trained and tested with gold POS tags). . . . . . . . . . . . . . . . . . 47 3.5 Test F-scores for

  • Learning ranking functions for efficient search

    Creator:
    Xu, Yuehua
    Abstract:
    This dissertation explores algorithms for learning ranking functions to efficiently solve search problems, with application to automated planning. Specifically, we consider the frameworks of beam search, greedy search, and randomized search, which all aim to maintain tractability at the cost of not guaranteeing completeness nor optimality. Our learning objective for...
    Resource Type:
    Dissertation
    Full Text:
    with a feature vector f(v) and nodes are ranked according to w · f(v) where w is a weight vector. Each

  • 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

  • Robust and Efficient Classification of Videos in the Wild

    Creator:
    Mahasseni, Behrooz
    Abstract:
    Recognizing human actions in videos is a long-standing problem in computer vision with a wide range of applications including video surveillance, content retrieval, and sports analysis. This thesis focuses on addressing efficiency and robustness of video classification in unconstrained real-world settings. The thesis work can be broadly divided into four...
    Resource Type:
    Dissertation
    Full Text:
    . . . . . . . . . . . . . 50 4.3 The four loss functions used in training our video summarization model. . . . . 51 4.4 F

  • Active learning with committees : an approach to efficient learning in text categorization using linear threshold algorithms

    Creator:
    Liere, Ray
    Abstract:
    We developed and investigated machine learning methods that require minimal preprocessing of the input data, use few training examples, run fast, and still obtain high levels of accuracy. Most approaches to designing machine learning programs are based on the supervised learning paradigm – training examples are chosen randomly and given...
    Resource Type:
    Dissertation

  • Representationally Robust and Scalable Learning over Relational Databases

    Creator:
    Picado Leiva, Jose Manuel
    Abstract:
    Learning novel concepts from relational databases is an important problem with applications in several disciplines, such as data management, natural language processing, and bioinformatics. For a learning algorithm to be effective, the input data should be clean and in some desired representation. However, real-world data is usually heterogeneous – the...
    Resource Type:
    Dissertation

  • Machine Learning Methods for Computational Sustainability

    Creator:
    Liu, Liping
    Abstract:
    Maintaining the sustainability of the earth’s ecosystems has attracted much attention as these ecosystems are facing more and more pressure from human activities. Machine learning can play an important role in promoting sustainability as a large amount of data is being collected from ecosystems. There are at least three important...
    Resource Type:
    Dissertation
    Full Text:
    Advances in Neural Information Processing Systems 25 Edited by F. Pereira and C. J. C. Burges and L

  • 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:
    approximates f for any examples drawn according to the same probability distribution P. We will call h a