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 21 for “"CP decomposition"”.
-
Parallel Gauss-Newton method for CP decomposition
… to Alternating least squares algorithm for CP decomposition. Alternating least squares may exhibit slow or no convergence, especially when high accuracy is required. CP decomposition problem can be formulated as a non-linear least squares problem to apply iterative Newton-like methods. …
-
Breaking the curse of dimensionality in electronic structure methods: towards optimal utilization of the canonical polyadic decomposition
… and application of higher-order tensor (HOT) decompositions, specifically the canonical polyadic (CP) decomposition, is fairly limited. The CP decomposition is an incredibly useful sparse tensor factorization that has the ability to disentangle all correlated modes of a tensor. However the …
-
Optimization and Machine Learning Techniques for Analyzing Spatiotemporal Dynamics
In a numerical context, the tensor CP decomposition challenge can be reformulated into a series of least squares subproblems, which can be addressed using the renowned Alternating Least Square algorithm (ALS). The ALS algorithm is often characterized by a 'swamp phenomenon' that slows down its …
-
Tensor Decompositions and Rank Approximation of Tensors with Applications
Tensor decompositions are higher-order analogues of matrix decompositions which have applications in data analysis, signal processing, machine learning and data mining. One of the most challenging problems in the tensor decomposition area is to approximate the rank of a given tensor. Unlike the …
-
Tensor Completion and Total Variation Denoising and Deblurring in Tensor Spaces
… process to solve the L1 regularized problem and CP decomposition to recover our tensor. To test the performance of our algorithm we tested it on colored images and compared to the original CP decomposition algorithm. Furthermore, working with colored images might sometimes give an output image …
-
Κατανεμημένη τανυστική αποδόμηση στη μηχανική μάθηση για πλήρως ή μερικώς παρατηρούμενα πολυδιάστατα δεδομένα μεγάλου όγκου
… for calculating a CANDECOMP/PARAFAC (CP) decomposition from partially observed data, which is based on the proximal operator. This algorithm deals with the decomposition’s optimization problem by solving local optimization problems, in the sense that in each iteration a proximal to the …
-
Tensor based training driven by semi-supervised graph based learning for efficient processing of high dimensional signals
… tensor-based neural networks (Rank-R FNN via CP decomposition) with graph-based semi-supervised learning for hyperspectral image classification. The Rank-R FNN preserves spatial-spectral structure while reducing trainable parameters, and its embeddings are used to build similarity graphs for …
-
Learning Context-sensitive Human Emotions in Categorical and Dimensional Domains
… emotions in images using canonical polyadic (CP) decomposition, providing theoretical proof that rank-1 CP decomposition can be used as a ranking machine, (6) finally, we provide empirical proof that our method generates a Pearson Correlation Coefficient, outperforming the state of the art by …
-
Co-clustering of Tensor Data Using Sparse Tensor Factorisation
… for co-clustering of tensor data using sparse CP decompositions are proposed. The motivation behind using a tensor factorisation with enforced sparsity is that it can enable the extraction of the most relevant data from the tensor, whilst reducing noise. The first method, called the sCP-S, …
-
Function Space Tensor Decomposition and its Application in Sports Analytics
… is to further extend the concept of tensor decomposition through the use of function spaces. In doing so, we address the limitations of PCA to vector and matrix representations and the CP-Decomposition to tensor representations. Lastly, we provide an application in the context of …
-
Time Series, Clustering, Network Models and Tensor Analysis
… look at analyzing higher-order tensor data via a decomposition which interpolates between the CP-decomposition and the Tucker decomposition. This decomposition, which we call the grouped-tucker decomposition, groups together the different dimensions of the tensor and allows for different behavior …
-
Low-Rank Matrix And Tensor Models For Data Science Applications
… by the r dominant factors of the singular value decomposition (SVD). When the model is multilinear and the data is represented as a multi-way array called a tensor, the optimal rank-r approximation may not even exist. Nonetheless, the canonical polyadic decomposition (CP) provides a useful …
-
Tensor ranks over the quaternions
… called CANDECOM, PARAFAC, or CANDECOM/PARAFAC(CP). The minimum number of rank- one tensors needed to represent a tensor is known as the rank of a tensor. It is used here to find the ranks of some quaternion tensors. Determining the tensor ranks is difficult, even for small-size tensors. Also, …
-
Scalable tensor decompositions in high performance computing environments
… data structures to help build scalable tensor decompositions on a variety of high-performance computing (HPC) platforms, including multicore CPUs, graphics co-processors (GPUs), and Intel Xeon Phi processors. A tensor may be regarded as a multiway array, generalizing matrices to more than two …
-
On the Use of Hybrid Compact Polarimetric SAR for Ship Detection
… dual-polarimetric systems. Compact polarimetric (CP) SAR has high potential of providing more information than linear dual-polarimetric SAR. Even wider swaths will be provided in many of the CP imaging modes of the upcoming Canadian Radarsat Constellation Mission (RCM) SAR to be launched in 2018. …
-
CONVERGENGE ANALYSIS ON SVD-BASED ALGORITHMS FOR TENSOR LOW RANK APPROXIMATIONS
This thesis is to study a few problems on tensor decompositions and approximations in real space. Among other things, we revisit the classical problem of finding the best rank-R CANDECOMP/PARAFAC(CP) approximation with diff erent cases R > 1 and R = 1 respectively. Unlike the rank-1 approximation …
-
Tensor decomposition for time-resolved immune cell sequencing in cancer
… analysis. This thesis applies different tensor decomposition methods to time-resolved γδ TCR sequencing data from sarcoma patients to uncover interpretable immune dynamics. After preprocessing, data from 13 of 16 patients were retained, and multiple tensors of varying temporal lengths (70, 100, …
-
Adaptive Kernel Functions and Optimization Over a Space of Rank-One Decompositions
… research community. Tensors and tensor decomposition methods are gaining popularity in the signal processing and machine learning literature, and most of the recently proposed tensor decomposition methods are based on the tensor power and alternating least-squares algorithms, which were …
-
Nonlinear Preconditioning Methods for Optimization and Parallel-In-Time Methods for 1D Scalar Hyperbolic Partial Differential Equations
… problems defining the canonical polyadic (CP) decomposition and Tucker higher order singular value decomposition (HOSVD) for tensors, which are formulated as minimizing approximation error in the Frobenius norm. Both of these decompositions have alternating least squares (ALS) type fixed …
-
Parametric model order reduction development for Navier-Stokes equations from 2D chaotic to 3D turbulent flow problems
Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2024-03-01 without embargo terms
Page 1 of 2