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 7 of 7 for “"Matrix completion algorithms"”.

  1. Matrix completion algorithms with applications in biomedicine, e-commerce and social science

    This thesis investigates matrix completion algorithms with applications in biomedicine, e-commerce and social science. In general, matrix completion algorithms work well for low rank matrices. Such matrices find many applications in recommender systems and social network analysis. On the other …

    njit Repository record for Matrix completion algorithms with applications in biomedicine, e-commerce and social science (opens in a new tab)

  2. Recent Developments on Matrix Completion

    The problem of Matrix Completion has been widely studied over the past decade. However, the vast majority of the solutions have proposed computationally feasible estimators with strong statistical guarantees for the case where the underlying distribution of data in the matrix is continuous. A few …

    cornell Repository record for Recent Developments on Matrix Completion (opens in a new tab)

  3. Flexible And Robust Iterative Methods For The Partial Singular Value Decomposition

    … (SVD) is one of the most fundamental matrix factorizations in linear algebra. As a generalization of the eigenvalue decomposition, the SVD is essential for a wide variety of fields including statistics, signal and image processing, chemistry, quantum physics and even weather …

    wm-mary Repository record for Flexible And Robust Iterative Methods For The Partial Singular Value Decomposition (opens in a new tab)

  4. Efficient algorithms for compressed sensing and matrix completion

    <p>Compressed sensing and matrix completion are two new data acquisition techniques whose efficiency is achieved by exploring low dimensional structures in high dimensional data. Despite the combinatorial nature of compressed sensing and matrix completion, there has been significant development of …

    oxford Repository record for Efficient algorithms for compressed sensing and matrix completion (opens in a new tab)

  5. Matrix completion with structure

    Often, data organized in matrix form contains missing entries. Further, such data has been observed to exhibit effective low-rank, and has led to interest in the particular problem of low-rank matrix-completion: Given a partially-observed matrix, estimate the missing entries such that the output …

    bu Repository record for Matrix completion with structure (opens in a new tab)

  6. Some Problems in Conic, Nonsmooth, and Online Optimization

    In this thesis, we study algorithms with provable guarantees for structured optimization problemsarising in machine learning and theoretical computer science. One of the threads of this thesis is semidefinite programs (SDPs), a problem class with a variety of uses in engineering, computational …

    washington Repository record for Some Problems in Conic, Nonsmooth, and Online Optimization (opens in a new tab)

  7. Causal Inference and Matrix Completion with Correlated Incomplete Data

    … methods, and bayesian approaches. The so-called matrix completion algorithm is one of the imputation approaches that has been widely discussed in the missing data literature. However, in a longitudinal setting, limited efforts have been devoted to using covariate information to recover the …

    waterloo Repository record for Causal Inference and Matrix Completion with Correlated Incomplete Data (opens in a new tab)