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

  1. Methods for matrix completion

    … going to provide major results for two sorts of Matrix Completion problems. One involves the recovery of a low rank matrix and the other involves the recovery of an approximately low rank matrix based on a small number of observed entries. In the end of the paper, we are going to demonstrate the …

    texas Repository record for Methods for matrix completion (opens in a new tab)

  2. 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)

  3. 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)

  4. Poisson matrix completion and change-point detection

    … above two aspects. The first topic is low-rank matrix completion. Because many survey data is capable of being represented approximately as a low-rank matrix, this model can apply to many applications such as sensor network, network traffic analysis, sensor localization, recommender systems and …

    gatech Repository record for Poisson matrix completion and change-point detection (opens in a new tab)

  5. Topics in matrix completion and genomic prediction

    … focused on low-rank modeling to deal with matrix completion problems and genomic prediction by adjusting spatial effects. One big challenge in matrix completion is that the real data arising are high-dimensional, low-rank and have many missing entries. In the first project (Chapter 2), we …

    iastate Repository record for Topics in matrix completion and genomic prediction (opens in a new tab)

  6. Topics in genomic selection and matrix completion

    … it focuses on the topics on genomic selection, matrix completion, and hybrid breeding. The first project deals with improvement of genomic selection using operations research. We developed a novel selection algorithm that performs a heuristic search for selection and mating of plant individuals …

    iastate Repository record for Topics in genomic selection and matrix completion (opens in a new tab)

  7. 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)

  8. Matrix Completion via Nonconvex Factorization: Algorithms and Theory

    Learning low-rank structure of the data matrix is a powerful method to deal with ``big data''. However, in many modern applications such as recommendation systems and sensor localization, it is impossible or too costly to obtain all data, resulting in a data matrix with most entries missing. A …

    umn Repository record for Matrix Completion via Nonconvex Factorization: Algorithms and Theory (opens in a new tab)

  9. Matrix completion with side information for effective recommendation

    … in many applications. More importantly, the matrix completion paradigm provides an appealing solution to the collaborative filtering problem in recommendation systems. However, collaborative filtering based approaches perform poorly for sparse data and specifically for the so-called cold …

    msu Repository record for Matrix completion with side information for effective recommendation (opens in a new tab)

  10. Solving correlation matrix completion problems using parallel differential evolution

    Matrix Completion problems have been receiving increased attention due to their varied applicability in different domains. Correlation matrices arise often in studying multiple streams of time series data like technical analysis of stock market data. Often some of the values in the matrix are …

    ubc Repository record for Solving correlation matrix completion problems using parallel differential evolution (opens in a new tab) Download PDF for Solving correlation matrix completion problems using parallel differential evolution (opens in a new tab)

  11. Fixed Point Iteration Algorithms for Low-rank Matrix Completion

    A lot of applications can be formulated as matrix completion problems. In order to address such problems, a common assumption is that the underlying matrix is (approximately) low-rank. Under certain conditions, the recovery of low-rank matrix can be done via nuclear norm minimization, a convex …

    waterloo Repository record for Fixed Point Iteration Algorithms for Low-rank Matrix Completion (opens in a new tab)

  12. 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)

  13. Scaled matrix completion and cell deconvolution with NanoString data

    … 1 combines pivotal penalized estimation, with matrix completion, to introduce a new matrix completion problem, where the optimal tuning parameter does not depend on the variance of the noise. We consider this new "scaled matrix completion" problem, and compare it to standard matrix completion …

    washington Repository record for Scaled matrix completion and cell deconvolution with NanoString data (opens in a new tab)

  14. Edge impact in graphs and social network matrix completion

    … using a subspace sharing method that decouples matrix completion and side information transduction is presented. This method is extended to predict ratings in user-item recommender systems where both may be cold-start.

    msu Repository record for Edge impact in graphs and social network matrix completion (opens in a new tab)

  15. Semidefinite Facial Reduction for Low-Rank Euclidean Distance Matrix Completion

    … facial reduction for the Euclidean distance matrix completion problem. Our key result shows a close connection between cliques in the graph of the partial Euclidean distance matrix and faces of the semidefinite cone containing the feasible set of the semidefinite relaxation. We show how using …

    waterloo Repository record for Semidefinite Facial Reduction for Low-Rank Euclidean Distance Matrix Completion (opens in a new tab)

  16. Quantized matrix completion through bilinear factorization and approximate message passing

    … of sub-sampled matrices, also known as matrix factorization (MF), which has different variations, such as unconstrained MF, integer MF (IMF), non-negative MF (NMF), probabilistic MF (PMF), to cite a few. In this thesis, we introduce a new Bayesian quantized MF solution based on the …

    manitoba Repository record for Quantized matrix completion through bilinear factorization and approximate message passing (opens in a new tab)

  17. The matrix completion problem regarding various classes of P0,1- matrices

    <p>A pattern of positions in an n x n real matrix is said to have pi-completion if every partial pi-matrix which specifies that pattern can be completed to a pi-matrix. An n x n partial matrix A (and the pattern describing the specified entries of A) is associated with a digraph G(V E) where the …

    iastate Repository record for The matrix completion problem regarding various classes of P0,1- matrices (opens in a new tab)

  18. Iterative matrix completion and topic modeling using matrix and tensor factorizations

    … reweighted least squares algorithm for low-rank matrix completion to take into account sparsity-based structure in the missing entries. We also propose an iterative gradient-projection-based implementation of the algorithm, and present numerical experiments showcasing the performance of the …

    colostate Repository record for Iterative matrix completion and topic modeling using matrix and tensor factorizations (opens in a new tab)

  19. Novel Matrix Completion Methods for Missing Data Recovery in Urban Systems

    … by any estimator. The performance of a standard matrix-completion based algorithm and the linear minimum mean squared error estimator are benchmarked using real data from a low voltage distribution system. The comparison with the fundamental limit highlights the drawbacks of both methods in a …

    whiterose Download PDF for Novel Matrix Completion Methods for Missing Data Recovery in Urban Systems (opens in a new tab)

  20. 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)

Page 1 of 9