Search Constraints

Start Over
Filtering by: Creator Choephel, T. K. Remove constraint Creator: Choephel, T. K. Committee Member Fern, Alan Remove constraint Committee Member: Fern, Alan Degree Level Doctoral Remove constraint Degree Level: Doctoral

Search Results

  • Bayesian optimization with empirical constraints

    Creator:
    Azimi, Javad
    Abstract:
    Bayesian Optimization (BO) methods are often used to optimize an unknown function f(•) that is costly to evaluate. They typically work in an iterative manner. In each iteration, given a set of observation points, BO algorithms select k ≥ 1 points to be evaluated. The results of those points are...
    Resource Type:
    Dissertation
    Full Text:
    select k ≥ 1 points to be evaluated. The results of those points are then added to the set of

  • Statistical Properties and Guarantees for Certain Anomaly Detection Relevant Problems

    Creator:
    Liu, Si
    Abstract:
    Anomaly detection aims at detecting the points that appear different than the majority of the data, such that they are suspected to be generated from a different distribution. Anomaly detectors have been applied in many different fields, such as detecting fraudulent behaviors in bank transaction, finding broken sensors in a...
    Resource Type:
    Dissertation
    Full Text:
    A containing the top k points with the highest anomaly scores from an iForest at t =1 including

  • Weakly Supervised Learning for Activity Recognition from Time Series Data

    Creator:
    Guan, Xinze
    Abstract:
    The thesis focuses on activity recognition from sensor data, which has spurred a great deal of interest due to its impact on health care and security. Previous work on activity recognition from multivariate time series data has mainly applied supervised learning techniques which require a high degree of annotation effort...
    Resource Type:
    Dissertation
    Full Text:
    readings as P (Xt|X(t−p):(t−1)) = K∑ k=1 ψkN (Ak0 + p∑ i=1 AkiX t−i,Σk), where ψ1 + . . .+ψK = 1 and ψk

  • Network Coding, Random Matrices, and Their Applications to Communication Systems

    Creator:
    Nguyen-Huu, Duong
    Abstract:
    In this work, we study network coding technique, its relation to random matrices, and their applications to communication systems. The dissertation consists of three main contributions. First, we propose efficient algorithms for data synchronization via a broadcast channel using random network coding. Second, we study the resiliency of network coding...
    Resource Type:
    Dissertation
    Full Text:
    performance E[T (S) i ] vs. K for algorithm SRNC 43 3.6 Theoretical and empirical performance Var[T (S) i

  • Efficient Algorithms for Robust Spatiotemporal Data Analysis

    Creator:
    Moore, Travis W.
    Abstract:
    Many large-scale data analysis applications involve data that can vary over both time and space. Often the primary goal of analyzing spatiotemporal data is identifying trends, movements, and sudden changes with respect to time, location, or both. This can include a variety of applications in economics (housing prices, unemployment, job...
    Resource Type:
    Dissertation
    Full Text:
    from location 5 to each of it’s neighbors. 53 4.2 Plate diagrams for single view and multiview CGM. K

  • Action Segmentation with Limited Supervision

    Creator:
    Li, Jun
    Abstract:
    In this dissertation, we address action segmentation in videos under limited supervision. The goal of action segmentation is to predict an action class for each frame of a video. The limited supervision means ground truth labels of video frames are not available in training. We focus on three types of...
    Resource Type:
    Dissertation
    Full Text:
    with T frames with a transcript of N ordered actions, there are (N+T )!N !T ! possible labelings for

  • Computing entropy for Z²-actions

    Creator:
    Pierce, Larry A.
    Abstract:
    For a certain class of Z²-actions, we provide a proof of a conjecture that the ratio of the Perron eigenvalues of the transfer matrices of the free boundary restrictions converge to the entropy of that action. Also, a novel method for computing the entropy of Z²-actions is conjectured.
    Resource Type:
    Dissertation
    Full Text:
    T k~v = λkT~v. Thus, n∑ j=1 [ T k ] i,j a ≤ n∑ j=1 [ T k ] i,j ~vj = λ k~vi ≤ λkT b ∀ i

  • Usable and Scalable Querying of Scientific Datasets

    Creator:
    McCamish, Benjamin J.
    Abstract:
    Scientists and engineers have to analyze and query multiple large databases. Analysis over databases created by phasor measurement units can provide insight into the health of the grid, thereby improving control over operations. Realizing this data-driven control, however, requires validating, processing and storing massive amounts of PMU data efficiently, which...
    Resource Type:
    Dissertation
    Full Text:
    value of 1 in vR correspond with the set of candidate records on disk, R = {t | (t[X] < 25) ∧ (−5 < t[Y

  • From multitarget tracking to event recognition in videos

    Creator:
    Brendel, William
    Abstract:
    This dissertation addresses two fundamental problems in computer vision—namely, multitarget tracking and event recognition in videos. These problems are challenging because uncertainty may arise from a host of sources, including motion blur, occlusions, and dynamic cluttered backgrounds. We show that these challenges can be successfully addressed by using a multiscale,...
    Resource Type:
    Dissertation
    Full Text:
    activities. These spatiotemporal subvolumes are also referred to as 2D+t tracks, or tubes. We consider real

  • Efficient training and feature induction in sequential supervised learning

    Creator:
    Hao, Guohua
    Abstract:
    Sequential supervised learning problems arise in many real applications. This dissertation focuses on two important research directions in sequential supervised learning: efficient training and feature induction. In the direction of efficient training, we study the training of conditional random fields (CRFs), which provide a flexible and powerful model for sequential...
    Resource Type:
    Dissertation
    Full Text:
    time complexity of these algo- rithms is O(T · Lk+1), where L is the number of class labels, k is the