Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 50 for “"Kernel Matrix"”.

  1. Fast Kernel Matrix Approximations By Series Expansions

    Kernel functions are used in a variety of scientific settings to measure relationships or interactions between elements of a vector space. For example, in machine learning, kernel functions are often used to describe similarity or covariance between data points in a feature space. In physics, one …

    cornell Repository record for Fast Kernel Matrix Approximations By Series Expansions (opens in a new tab)

  2. oASIS: Adaptive Column Sampling for Kernel Matrix Approximation

    Kernel or similarity matrices are essential for many state-of-the-art approaches to classification, clustering, and dimensionality reduction. For large datasets, the cost of forming and factoring such kernel matrices becomes intractable. To address this challenge, we introduce a new adaptive …

    rice Repository record for oASIS: Adaptive Column Sampling for Kernel Matrix Approximation (opens in a new tab)

  3. Using global low-rank kernel matrix approximations in machine learning and uncertainty quantification

    Kernel methods are a broad class of algorithms that are applied in a host of scientific computing fields. In this thesis we focus on applying kernel methods to supervised learning in machine learning and uncertainty quantification of learning algorithms. Kernel methods offer an interpretable way to …

    texas Repository record for Using global low-rank kernel matrix approximations in machine learning and uncertainty quantification (opens in a new tab)

  4. An Explicit Formula for Minimal Interpolation in Hardy Spaces

    … values at given points. We consider the kernel matrix. We find an explicit determinant for a generalized version of this matrix. Then we find an inverse matrix for the kernel matrix. We will use our result about inverse matrices to give a different proof of the main interpolation theorem …

    alabama Repository record for An Explicit Formula for Minimal Interpolation in Hardy Spaces (opens in a new tab)

  5. Applications of Algebraic Geometric Codes to Polar Coding

    … complexities. In this construction, a specific kernel matrix G is considered and is used to encode a block of channels. As the number of channels grows, each channel becomes either a noiseless channel or a pure-noise channel, and the rate of this polarization is related to the kernel matrix …

    clemson Repository record for Applications of Algebraic Geometric Codes to Polar Coding (opens in a new tab)

  6. Semi-Parametric Testing of Single-Nucleotide Polymorphism Effects On Continuous Outcome

    … we explored a semi-parametric method built upon kernel machines to include multiple SNPs in a model. The information of SNPs similarity calculated based on identity-by-state (IBS) algorithm was included in a kernel matrix. We evaluated the method via various scenarios based on simulation studies. …

    south-carolina Repository record for Semi-Parametric Testing of Single-Nucleotide Polymorphism Effects On Continuous Outcome (opens in a new tab)

  7. Τεχνικές ομαδοποίησης και ταξινόμησης με εφαρμογές στην ανθρωποκεντρική ανάλυση εικόνων και εικονοσειρών

    … our contributions to the field of similarity matrix based data clustering. Our first and most important contribution in this field concerns the trimming of the kernel matrix used by the kernel k-means algorithm. The proposed trimming algorithm attempts to estimate the cardinality of the …

    greece Repository record for Τεχνικές ομαδοποίησης και ταξινόμησης με εφαρμογές στην ανθρωποκεντρική ανάλυση εικόνων και εικονοσειρών (opens in a new tab)

  8. Additive Kernel Methods with Fourier Acceleration

    Kernel matrices are crucial in many learning tasks, such as kernel ridge regression, support vector machines, or Gaussian process regression. One of the main computational bottlenecks when working with large-scale kernel-based learning is dealing with the large and typically dense kernel matrix. …

    qucosa-diss

  9. Application of wavelets in few-body problems.

    … is used to discretize the problem into a dense matrix. Wavelets are a class of functions with special properties. Daubachies wavelets are a subset of wavelets defined to have vanishing lower order moments, enabling Daubachies 2 and 3 wavelet bases to exactly represent polynomials of degree up to …

    umn Repository record for Application of wavelets in few-body problems. (opens in a new tab)

  10. Computationally Efficient Low-Rank Algorithms for Gaussian Process Regression

    … and prediction require the inversion of an N ×N kernel matrix (time complexity O(N^3)), which limits the scalability of GPR for big datasets (N > 10^4). In this research, we develop algorithms to scale GPR without sacrificing accuracy. Our training algorithm uses the thin-QR decomposition of the …

    tamu Repository record for Computationally Efficient Low-Rank Algorithms for Gaussian Process Regression (opens in a new tab)

  11. Choosing the Right Kernel A Meta-Learning Approach to Kernel Selection in Support Vector Machines

    … Such an ability is feasible thanks to the kernel trick. The kernel trick allows SVMs to perform an implicit transformation of the non-linearly separable original input space into a higher dimensional feature space where a linear separation of the dataset can be found. By creating an …

    houston Repository record for Choosing the Right Kernel A Meta-Learning Approach to Kernel Selection in Support Vector Machines (opens in a new tab)

  12. A Kernel-based Approach for Learning Causal Graphs From Mixed Data Containing Missing Values

    … graph is unknown. This research proposes using kernel functions and kernel alignment to handle mixed data. The two main steps of this approach are computing a kernel matrix for each variable and calculating a pseudo-correlation matrix using kernel alignment. The kernel alignment matrix is used …

    whiterose Download PDF for A Kernel-based Approach for Learning Causal Graphs From Mixed Data Containing Missing Values (opens in a new tab)

  13. Studies on Kernel Learning and Independent Component Analysis

    A crucial step in kernel-based learning is the selection of a proper kernel function or kernel matrix. Multiple kernel learning (MKL), in which a set of kernels are assessed during the learning time, was recently proposed to solve the kernel selection problem. The goal is to estimate a suitable …

    aalto Repository record for Studies on Kernel Learning and Independent Component Analysis (opens in a new tab)

  14. Subspace Detection Approaches for Hyperspectral Image Classification

    … at the first step by applying nonlinear kernel principal component analysis. The spatial properties of the input features are then incorporated to select a subset of features which better reveal object structures and provide good separation among the classes of interest. The third …

    unsw Repository record for Subspace Detection Approaches for Hyperspectral Image Classification (opens in a new tab)

  15. Theory-Guided Algorithm Design for Scalable Machine Learning

    … I also contribute to the scalable estimation of Kernel matrix spectral norm. Specifically, I propose to apply sketching techniques to efficiently estimate the spectral norm, theoretically derive the estimation error and empirically demonstrate the estimation efficiency in a time-constrained …

    oklahoma-thes Repository record for Theory-Guided Algorithm Design for Scalable Machine Learning (opens in a new tab)

  16. Kernel-based clustering of big data

    … data sets, which are not linearly separable. Kernel-based clustering algorithms employ non-linear similarity measures to define the inter-point similarities. As a result, they are able to identify clusters of arbitrary shapes and densities. However, kernel-based clustering techniques suffer …

    msu Repository record for Kernel-based clustering of big data (opens in a new tab)

  17. Sequence Modeling with Linear Complexity

    … attention and we introduce Time-aware Large Kernel (TaLK) Convolutions, a novel adaptive convolution operation that learns to predict the size of a summation kernel instead of using a fixed-sized kernel matrix, with a time complexity of O(n). We evaluated our method using benchmark datasets …

    carleton Repository record for Sequence Modeling with Linear Complexity (opens in a new tab)

  18. A distributed kernel summation framework for machine learning and scientific applications

    … of data points. I focus on the problem of kernel summation operations ubiquitous in many data mining and scientific algorithms. In machine learning, kernel summations appear in popular kernel methods which can model nonlinear structures in data. Kernel methods include many non-parametric …

    gatech Repository record for A distributed kernel summation framework for machine learning and scientific applications (opens in a new tab)

  19. Scalable kernel methods and their use in black-box optimization

    … uses structured linear algebra to scale kernel regression methods based on Gaussian processes (GPs) and radial basis function (RBF) interpolation to large, high-dimensional datasets. While kernel methods provide a general, principled framework for approximating functions from scattered …

    cornell Repository record for Scalable kernel methods and their use in black-box optimization (opens in a new tab)

  20. Integrating Multiple Data Views for Improved Malware Analysis

    … met is that a positive semidefinite similarity (kernel) matrix must be defined on the view, a restriction that is easily met in practice. While the classification problem can be solved with well known multiple kernel learning techniques, the clustering and phylogenetic problems required the …

    unm Repository record for Integrating Multiple Data Views for Improved Malware Analysis (opens in a new tab)

Page 1 of 3