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 1679 for “"subspace"”.
-
Subspace estimation for subspace-based magnetic resonance spectroscopic imaging
This Thesis was approved for publication on 2016-04-15 at 14:08.
-
Hierarchical Subspace Clustering
… feature space, although clusters exist in subspaces of the feature space. To overcome these limitations of traditional clustering methods, several methods for subspace clustering have been proposed recently. Subspace clustering algorithms aim at automatically identifying lower dimensional …
-
OVERCOMPLETE DEEP SUBSPACE CLUSTERING
Deep Subspace Clustering Networks (DSC) provide an efficient solution to the problem of unsupervised subspace clustering by using an undercomplete deep auto-encoder with a fully-connected layer to exploit the self expressiveness property. This method uses undercomplete representations of the input …
-
Krylov Subspace Methods with Fixed Memory Requirements: Nearly Hermitian Linear Systems and Subspace Recycling
Krylov subspace iterative methods provide an effective tool for reducing the solution of large linear systems to a size for which a direct solver may be applied. However, the problems of limited storage and speed are still a concern. Therefore, in this dissertation work, we present iterative Krylov …
-
Subspace optimization for machine learning
… classes, however, it is possible to perform subspace optimization (SO) and search along additional directions nearly "for free". This can lead to finding a better next iterate and result in fewer iterations to reach a solution. In theory and in practice, however, SO is rarely used and …
-
Subspace methods for portfolio design
… performance metric for financial investments. Subspace methods have been one of the pillars of functional analysis and signal processing. They are used for portfolio design, regression analysis and noise filtering in finance applications. Each subspace has its unique characteristics that may …
-
Subspace approximation on the continuum
… theorem works on bandlimited signals obeying{\em subspace model}. As an another example, the power of sparse signal processing often relies on the assumption that the signals live in some union of subspaces. In many cases, signals have concise representations which are often obtained by ($i$) …
-
Subspace Clustering: A Possibilistic Approach
… αλγορίθμου, του sparse adaptive possibilistic K-subspaces (SAP K-subspaces). Ο αλγόριθμος αυτός αποτελεί γενίκευση του αλγορίθμου sparse possibilistic c-means algorithm (SPCM) [2], πράγμα που σημαίνει ότι μπορεί να διαχειριστεί με αξιοπιστία δεδομένα τόσο με θόρυβο και ακραίες τιμές όσο και …
-
Subspace learning by randomized sketching
… form of inherent low dimensionality in data: subspace models. In many applications, data is known to lie close to a low dimensional subspace. The underlying subspace itself may or may not be known a priori. Incorporating this structure into data acquisition systems and algorithms can aid in …
-
MOMENT KERNELS FOR T-CENTRAL SUBSPACE
The T-central subspace allows one to perform sufficient dimension reduction for any statistical functional of interest. We propose a general estimator using a third moment kernel to estimate the T-central subspace. In particular, in this dissertation we develop sufficient dimension reduction …
-
Singular Value Computation and Subspace Clustering
… proposes an inverse-free preconditioned Krylov subspace method, which uses preconditioning instead of shift-and-invert to accelerate the convergence. To compute several eigenvalues, Wielandt is used in a straightforward manner. However, the Wielandt deflation alters the structure of the problem …
-
Analysis and Constructions of Subspace Codes
… In 2008, Kotter and Kschischang introduced subspace codes as an algebraic approach to error correcting in random network coding. Since this paper, there has been much work in constructing large subspace codes, as well as exploring the properties of such codes. This dissertation explores …
-
Minimal Weinstein Discs in a Subspace
<p>The basic features of Clanton's algorithm are reviewed and it is shown that the analysis of ρ(A; Sx) leads to a refinement of the algorithm. A new algorithm to solve Ay = λy is the concluding item in this investigation</p>
-
Robust motion segmentation with subspace constraints
… given, motion segmentation can be addressed as a subspace clustering problem under an affine camera model. In the first two parts of this thesis, we target the general subspace clustering problem and propose two novel methods, namely Efficient Dense Subspace Clustering (EDSC) and the Robust Shape …
-
Robust statistical subspace-based damage assessment
… with a theoretical background is the statistical subspace damage identification method (SSDI). The overarching goal in this thesis is to close the gap between theory and practice, in order to have a method with a strong theoretical background and a credible applicability at the same time. In order …
-
Evolutionary Weights for Random Subspace Learning
… aggregation, one of them is known as Random Subspace Learning, which consists of building subspace of the feature space where we want to create our models. The task of selecting good subspaces and in turn produce good models for better prediction can be a daunting one, so we want to propose a …
-
Subspace Decomposition for Spatial Parameter Estimation
… characteristics. This thesis investigates subspace-decomposition-based spatial parameter estimation as an alternative approach in which directional information is extracted from coherent antenna-array measurements. This work develops the theoretical foundation and signal-processing …
-
Subspace portfolios: design and performance comparison
… of investment portfolios. Among the techniques, subspace framework and methods are fundamental, and they have been successfully employed in widely used technologies and real-time applications spanning from Internet multimedia to electronic trading of financial products. In this dissertation, the …
-
Subspace Decomposition of Linear Secrecy Codes
… new method for the study of linear codes, termed subspace decomposition, which provides new insights into code structure and performance. Briefly, subspace decomposition comprises the evaluation of complex properties of a linear code by evaluating simple properties of its constituent subspaces. We …
Page 1 of 84