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 616 for “"Matrix Factorization"”.

  1. Matrix Factorization Under Contamination

    In the nonnegative matrix factorization problem, the user inputs a nonnegative matrix V and wants to factor V to WH, with both W and H nonnegative. Standard factorization techniques make unrealistic assumptions about the noise present in the data: that the noise is generated from independent and …

    penn Repository record for Matrix Factorization Under Contamination (opens in a new tab)

  2. Advanced polynomial matrix factorization techniques

    The advancements in polynomial matrix algebra have significantly bolstered the formulationof broadband array problems, enabling more effective solutions. This is particularlyevident through the utilization of polynomial matrix factorization techniquessuch as the polynomial eigenvalue decomposition …

    strathclyde Repository record for Advanced polynomial matrix factorization techniques (opens in a new tab)

  3. Nonnegative matrix factorization for clustering

    This dissertation shows that nonnegative matrix factorization (NMF) can be extended to a general and efficient clustering method. Clustering is one of the fundamental tasks in machine learning. It is useful for unsupervised knowledge discovery in a variety of applications such as text mining and …

    gatech Repository record for Nonnegative matrix factorization for clustering (opens in a new tab)

  4. Bayesian Matrix Factorization and Applications

    Nonnegative matrix factorization (NMF) reduces the observed nonnegative matrix into a product of two nonnegative matrices. Nonnegativity entails two major implications: non-negative components and purely additive combination. These characteristics made this method useful in a wide range of …

    concordia Download PDF for Bayesian Matrix Factorization and Applications (opens in a new tab)

  5. ROBUST SYMMETRIC NONNEGATIVE MATRIX FACTORIZATION (RSNMF)

    Symmetric nonnegative matrix factorization (SNMF) has proven to be a powerful tool for clustering tasks. However, traditional SNMF methods usually rely on the Frobenius norm. This makes them very sensitive to noise and outliers, which affects their robustness and practical applicability. In this …

    nus Repository record for ROBUST SYMMETRIC NONNEGATIVE MATRIX FACTORIZATION (RSNMF) (opens in a new tab) Download file for ROBUST SYMMETRIC NONNEGATIVE MATRIX FACTORIZATION (RSNMF) (opens in a new tab)

  6. Nonnegative Matrix Factorization and Document Classification

    Applications of Non-negative Matrix Factorization are ubiquitous, and there are several well known algorithms available. This paper is concerned with the preprocessing of the documents and how the preprocessing effects document classification. The preprocessing discussed in this paper will run the …

    calpoly Repository record for Nonnegative Matrix Factorization and Document Classification (opens in a new tab)

  7. Deviance matrix factorization and its applications

    Matrix factorization aims at summarizing the data matrix information with lower dimensional vectors. With reduced dimensions, those vectors can be leveraged to provide efficient data storage, to facilitate representative visualization, and to make more robust predictions. Recent research has found …

    bu Repository record for Deviance matrix factorization and its applications (opens in a new tab)

  8. Modeling speedup in parallel sparse matrix factorization

    … to explain the observed performance of sparse matrix factorization algorithms on parallel computers. In particular, we examine whether the disappointing performance of these algorithms is due to insufficient parallelism in the problem or to the architectural characteristics of existing parallel …

    ut-knoxville Repository record for Modeling speedup in parallel sparse matrix factorization (opens in a new tab)

  9. Learning via automaton minimization and matrix factorization

    … on weighted-automaton learning and minimization, matrix factorization, and the relationships between these areas.</p> <p>The first part of the thesis studies minimization and learning of weighted automata with weights in a field, focusing on tree automata as representations of distributions over …

    oxford Repository record for Learning via automaton minimization and matrix factorization (opens in a new tab)

  10. Data Clustering And Visualization Through Matrix Factorization

    … is two-fold: Semi-Supervised Non-negative Matrix Factorization (SS-NMF) for data clustering/co-clustering and Exemplar-based data Visualization (EV) through matrix factorization. Compared to traditional data mining models,</p> <p>matrix-based methods are fast, easy to understand and …

    wayne-thes Repository record for Data Clustering And Visualization Through Matrix Factorization (opens in a new tab)

  11. Augmenting Probabilistic Matrix Factorization Models for Rare Users

    … friend suggestion, and even online dating. Matrix Factorization is a common model employed for several reasons. Among them, they scale well, are easily learned, and can be adapted to different contexts. Many extensions of the baseline Probabilistic Matrix Factorization model have been …

    toronto-retro Repository record for Augmenting Probabilistic Matrix Factorization Models for Rare Users (opens in a new tab)

  12. Recommendation Approaches Using Context-Aware Coupled Matrix Factorization

    … techniques and present our context-aware coupled matrix factorization methods that use matrix factorization for estimating user preference and features in a specific contextual condition. We develop two methods: the first method attaches user preference across multiple contextual conditions, …

    ottawa-retro Repository record for Recommendation Approaches Using Context-Aware Coupled Matrix Factorization (opens in a new tab)

  13. THEORETICAL ADVANCES IN CLUSTERING WITH APPLICATIONS TO MATRIX FACTORIZATION

    … the learning of mixture models and nonnegative matrix factorization (NMF). The thesis mainly consists of two parts. The first part considers the informativeness of the k-means algorithm, which is perhaps the most popular clustering algorithm, for learning mixture models. In the second part, we …

    nus Repository record for THEORETICAL ADVANCES IN CLUSTERING WITH APPLICATIONS TO MATRIX FACTORIZATION (opens in a new tab) Download file for THEORETICAL ADVANCES IN CLUSTERING WITH APPLICATIONS TO MATRIX FACTORIZATION (opens in a new tab)

  14. Applications of Stochastic Gradient Descent to Nonnegative Matrix Factorization

    … gradient descent (SGD) to the nonnegative matrix factorization (NMF) problem and the unconstrained low-rank matrix factorization problem. While the literature on the SGD algorithm is rich, the application of this specific algorithm to the field of matrix factorization problems is an …

    waterloo Repository record for Applications of Stochastic Gradient Descent to Nonnegative Matrix Factorization (opens in a new tab)

  15. Constrained Nonnegative Matrix Factorization with Applications to Music Transcription

    In this work we explore using nonnegative matrix factorization (NMF) for music transcription, as well as several other applications. NMF is an unsupervised learning method capable of finding a parts-based additive model of data. Since music has an additive property (each time point in a musical …

    waterloo Repository record for Constrained Nonnegative Matrix Factorization with Applications to Music Transcription (opens in a new tab)

  16. Multi-style explainable matrix factorization techniques for recommender systems.

    … user satisfaction. One such black-box model is Matrix Factorization, a State of the Art recommendation technique that is widely used due to its ability to deal with sparse data sets and to produce accurate recommendations. Recent work has proposed new Matrix Factorization models that are …

    louisville Repository record for Multi-style explainable matrix factorization techniques for recommender systems. (opens in a new tab)

Page 1 of 31