Algorithms and Coresets for Large-Scale Kernel Smoothing

Update item information
Publication Type dissertation
School or College School of Computing
Department Computing
Author Zheng, Yan
Title Algorithms and Coresets for Large-Scale Kernel Smoothing
Date 2017
Description Kernel smoothing provides a simple way of finding structures in data sets without the imposition of a parametric model, for example, nonparametric regression and density estimates. However, in many data-intensive applications, the data set could be large. Thus, evaluating a kernel density estimate or kernel regression over the data set directly can be prohibitively expensive in big data. This dissertation is working on how to efficiently find a smaller data set that can approximate the original data set with a theoretical guarantee in the kernel smoothing setting and how to extend it to more general smooth range spaces. For kernel density estimates, we propose randomized and deterministic algorithms with quality guarantees that are orders of magnitude more efficient than previous algorithms, which do not require knowledge of the kernel or its bandwidth parameter and are easily parallelizable. Our algorithms are applicable to any large-scale data processing framework. We then further investigate how to measure the error between two kernel density estimates, which is usually measured either in L1 or L2 error. In this dissertation, we investigate the challenges in using a stronger error, L ∞ (or worst case) error. We present efficient solutions for how to estimate the L∞ error and how to choose the bandwidth parameter for a kernel density estimate built on a subsample of a large data set. We next extend smoothed versions of geometric range spaces from kernel range spaces to more general types of ranges, so that an element of the ground set can be contained in a range with a non-binary value in [0,1]. We investigate the approximation of these range spaces through ϵ-nets and ϵ-samples. Finally, we study coresets algorithms for kernel regression. The size of the coresets are independent of the size of the data set, rather they only depend on the error guarantee, and in some cases the size of domain and amount of smoothing. We evaluate our methods on very large time series and spatial data, demonstrate that they can be constructed extremely efficiently, and allow for great computational gains.
Type Text
Publisher University of Utah
Subject Computer science
Dissertation Name Doctor of Philosophy
Language eng
Rights Management (c) Yan Zheng
Format Medium application/pdf
ARK ark:/87278/s6n05pch
Setname ir_etd
Date Created 2019-05-21
Date Modified 2019-05-29
ID 1426684
Reference URL https://collections.lib.utah.edu/ark:/87278/s6n05pch
Back to Search Results