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 133 for “"Matrix Decomposition"”.
-
Matrix Decomposition for Multi-view Data
… this dissertation. The first contribution is on matrix decomposition of double-matched data (matched by both samples and source features). The motivating example is the miRNA data collected from both primary tumor and normal tissues of the same subjects; the measurements from two tissues are thus …
-
Omics Module Detection via Sparse Matrix Decomposition
… previous work has identified them through sparse matrix decomposition techniques such as sparse principal components analysis. To determine how different parts of the genome work together, we present methods to extend functional modules and identify variables that influence an outcome variable …
-
Recovery of Missing Values using Matrix Decomposition Techniques
… The recovery solution we propose is based on matrix decomposition techniques. The main idea of the recovery is to represent correlated time series as columns of an input matrix where missing values have been initialized and iteratively apply matrix decomposition technique to refine the …
-
A Supervised Low-Rank Matrix Decomposition for Matching
… on techniques such as sparse coding and low-rank matrix decomposition. Those build a generative representation of the data that on the one hand, attempts capturing all the information descriptive of an identity; on the other hand, training and testing are complex to allow those algorithms to be …
-
MATRIX DECOMPOSITION FOR DATA DISCLOSURE CONTROL AND DATA MINING APPLICATIONS
… tasks. Low-rank approximations generated by matrix decompositions are a fundamental element in this dissertation for the privacy preserving data mining (PPDM) applications. Two categories of PPDM are studied: data value hiding (DVH) and data pattern hiding (DPH). A matrix-decomposition-based …
-
Advances in Nonnegative Matrix Decomposition with Application to Cluster Analysis
Nonnegative Matrix Factorization (NMF) has found a wide variety of applications in machine learning and data mining. NMF seeks to approximate a nonnegative data matrix by a product of several low-rank factorizing matrices, some of which are constrained to be nonnegative. Such additive nature often …
-
Using reconfigurable computing technology to accelerate matrix decomposition and applications
<p>Matrix decomposition plays an increasingly significant role in many scientific and engineering applications. Among numerous techniques, Singular Value Decomposition (SVD) and Eigenvalue Decomposition (EVD) are widely used as factorization tools to perform Principal Component Analysis for …
-
Matrix decomposition algorithms for modified quadratic spline collocation for Helmholtz problems
Includes bibliographical references (pages 111-112).
-
Conditioned Synthesis of Spectra using Matrix Decomposition for Spectral Library Augmentation
… We propose modeling the weights resulting from matrix decomposition as functions of material condition(s) to generate synthetic spectra at unmeasured conditions to augment spectral libraries. Matrix decompositions considered here include principal component analysis (PCA), non-negative matrix …
-
Effects of n>m Clos networks on edge coloring and matrix decomposition algorithms
… are n > m Clos networks on edge coloring and matrix decomposition algorithms. This work uses a two-fold approach to examine the effects of n > m Clos networks on edge coloring and matrix decomposition algorithms. First, edge coloring and matching on bipartite multigraphs are applied to routing …
-
Randomized techniques for matrix decomposition and estimating the approximate rank of a matrix
Finding low dimensional matrix approximations of the data is an essential task in data analysis and scientific computing. Recently, several randomization schemes have been demonstrated for performing these low-rank matrix approximations. This thesis, reviews some of the randomization techniques for …
-
Clutter Suppression in Ultrasound: Performance Evaluation of Low-Rank and Sparse Matrix Decomposition Methods
… on a state-of-art algorithm framework called Decomposition into Low-rank and Sparse Matrices (DLSM) framework for ultrasound clutter suppression. Currently, ultrasound clutter suppression is often performed by Singular Value Decomposition (SVD) of the data matrix, which is a branch of …
-
High-Dimensional Analysis On Matrix Decomposition With Application To Correlation Matrix Estimation In Factor Models
… analysis on the problem of low-rank and sparse matrix decomposition with fixed and sampled basis coefficients. This problem is strongly motivated by high-dimensional correlation matrix estimation coming from factor models used in economic and financial studies. For the noiseless version, we …
-
Matrix methods in queueing and dynamic programming
We investigate some modern matrix methods for the solution of finite state stochastic models with an infinite time horizon. Markov and semi-Markov decision processes and finite queues in tandem with exponential service times are considered. The methods are based on the Drazin generalized inverse …
-
Cubic spline finite element method for solving Poisson's equation on a square
… pivoting, and then more efficiently using a Matrix Decomposition Algorithm. Cost of the matrix decomposition algorithm is O(N[superscript 3]), where N+1 is the number of subintervals in each coordinate direction. We improve the method still by using an Alternating Direction Implicit Method …
-
Manifold Learning with Tensorial Network Laplacians
… on data sets. This data is often treated as a matrix, and a variety of mathematical methods have been developed to glean information from this data structure such as matrix decomposition. The Laplacian matrix, for example, is commonly used to reconstruct networks, and the eigenpairs of this …
-
Multivariate volatility modelling in modern finance
… gained from the more complicated multivariate matrix decomposition models can be used to better forecast the covariance matrix and produce a Value at Risk estimate which more appropriately describes fat-tailed financial time-series.
-
CANONICAL REPRESENTATION OF A CLASS OF LINEAR DISCRETE-TIME TIME-VARIANT SYSTEMS
… systems can be characterized by a (square) matrix of system coefficients [H]. The system is time-invariant if [H ] is circulant and time-variant if [In is non-circulant. It is shown that a linear discrete-time time-variant system can be decomposed into a combination of subsystems where each …
Page 1 of 7