A literature survey of matrix methods for data science (Q6068265): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 18:08, 30 December 2024

scientific article; zbMATH DE number 7778850

Language	Label	Description	Also known as
English	A literature survey of matrix methods for data science	scientific article; zbMATH DE number 7778850

Statements

scholarly article

0 references

A literature survey of matrix methods for data science (English)

0 references

0 references

GAMM-Mitteilungen

0 references

publication date

15 December 2023

0 references

full work available at URL

https://arxiv.org/abs/1912.07896

0 references

zbMATH Keywords

data science

0 references

numerical linear algebra

0 references

MaRDI profile type

MaRDI publication profile

0 references

A-Optimal Design of Experiments for Infinite-Dimensional Bayesian Linear Inverse Problems with Regularized $\ell_0$-Sparsification

0 references

The principle of minimized iterations in the solution of the matrix eigenvalue problem

0 references

A randomized algorithm for approximate string matching

0 references

Faster Kernel Ridge Regression Using Sketching and Preconditioning

0 references

Randomized algorithms for estimating the trace of an implicit symmetric positive semi-definite matrix

0 references

Augmented Implicitly Restarted Lanczos Bidiagonalization Methods

0 references

A Practical Randomized CP Tensor Decomposition

0 references

Bounding matrix functionals via partial global block Lanczos decomposition

0 references

A Survey of Projection-Based Model Reduction Methods for Parametric Dynamical Systems

0 references

Quadrature rule-based bounds for functions of adjacency matrices

0 references

Algorithms and applications for approximate nonnegative matrix factorization

0 references

Inpainting of Binary Images Using the Cahn–Hilliard Equation

0 references

Diffuse Interface Models on Graphs for Classification of High Dimensional Data

0 references

Stability of Two Direct Methods for Bidiagonalization and Partial Least Squares

0 references

Fast Matrix Computations for Pairwise and Columnwise Commute Times and Katz Scores

0 references

Generalizing Diffuse Interface Methods on Graphs: Nonsmooth Potentials and Hypergraphs

0 references

Large-Scale Machine Learning with Stochastic Gradient Descent

0 references

0 references

Optimal CUR Matrix Decompositions

0 references

Randomized Algorithms for Matrices and Data

0 references

0 references

An Efficient Implicit FEM Scheme for Fractional-in-Space Reaction-Diffusion Equations

0 references

Free Energy of a Nonuniform System. I. Interfacial Free Energy

0 references

On the Optimality of the Median Cut Spectral Bisection Graph Partitioning Method

0 references

Nonlinear Model Reduction via Discrete Empirical Interpolation

0 references

On Tensors, Sparsity, and Nonnegative Factorizations

0 references

Tensor Networks for Dimensionality Reduction and Large-scale Optimization: Part 1 Low-Rank Tensor Decompositions

0 references

Approximation of high-dimensional parametric PDEs

0 references

Approximating Matrix Multiplication for Pattern Recognition Tasks

0 references

Support-vector networks

0 references

Estimating the Estrada index

0 references

A Multilinear Singular Value Decomposition

0 references

0 references

0 references

Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication

0 references

Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix

0 references

0 references

0 references

Faster least squares approximation

0 references

Extended Krylov Subspaces: Approximation of the Matrix Square Root and Related Functions

0 references

Partial least-squares vs. Lanczos bidiagonalization. I: Analysis of a projection method for multiple regression

0 references

0 references

Importance Sampling for a Monte Carlo Matrix Multiplication Algorithm, with Application to Information Retrieval

0 references

Network Properties Revealed through Matrix Functions

0 references

Calculating the Singular Values and Pseudo-Inverse of a Matrix

0 references

0 references

Approximation of the scattering amplitude and linear systems

0 references

0 references

0 references

Calculation of Gauss Quadrature Rules

0 references

0 references

Pseudo-skeleton approximations by matrices of maximal volume

0 references

Randomized Iterative Methods for Linear Systems

0 references

A literature survey of low-rank tensor approximation techniques

0 references

Subspace Iteration Randomization and Singular Value Problems

0 references

Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization

0 references

Rational Krylov approximation of matrix functions: Numerical methods and optimal pole selection

0 references

Stable architectures for deep neural networks

0 references

Computing $A^\alpha, \log(A)$, and Related Matrix Functions by Contour Integrals

0 references

Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions

0 references

Perturbations of CUR Decompositions

0 references

The truncated SVD as a method for regularization

0 references

Algorithm AS 136: A K-Means Clustering Algorithm

0 references

0 references

A robust and efficient parallel SVD solver based on restarted Lanczos bidiagonalization

0 references

0 references

Deep Learning: An Introduction for Applied Mathematicians

0 references

Functions of Matrices

0 references

On Krylov Subspace Approximations to the Matrix Exponential Operator

0 references

Harmonic and refined extraction methods for the singular value problem, with applications in least squares problems

0 references

Kernel methods in machine learning

0 references

A stochastic estimator of the trace of the influence matrix for laplacian smoothing splines

0 references

An Introduction to Statistical Learning

0 references

Principal component analysis.

0 references

Principal component analysis: a review and recent developments

0 references

Approximation of multivariate periodic functions by trigonometric polynomials based on rank-1 lattice sampling

0 references

A General Framework for Regularized, Similarity-Based Image Restoration

0 references

Literature survey on low rank approximation of matrices

0 references

A new investigation of the extended Krylov subspace method for matrix function evaluations

0 references

Tensor Decompositions and Applications

0 references

Spectral redemption in clustering sparse networks

0 references

Deep learning in fluid dynamics

0 references

0 references

ARPACK Users' Guide

0 references

CayleyNets: Graph Convolutional Neural Networks With Complex Rational Spectral Filters

0 references

Sparse Solutions in Optimal Control of PDEs with Uncertain Parameters: The Linear Case

0 references

Scalable $M$-Channel Critically Sampled Filter Banks for Graph Signals

0 references

Approximating Spectral Densities of Large Matrices

0 references

Progressive Image Denoising Through Hybrid Graph Laplacian Regularization: A Unified Framework

0 references

CUR matrix decompositions for improved data analysis

0 references

Tensor-CUR Decompositions for Tensor-Based Data

0 references

Randomized methods for matrix computations

0 references

Randomized numerical linear algebra: Foundations and algorithms

0 references

Estimates of the trace of the inverse of a symmetric matrix using the modified Chebyshev algorithm

0 references

Nineteen Dubious Ways to Compute the Exponential of a Matrix

0 references

Nineteen Dubious Ways to Compute the Exponential of a Matrix, Twenty-Five Years Later

0 references

The deformed consensus protocol

0 references

Stable and Efficient Spectral Divide and Conquer Algorithms for the Symmetric Eigenvalue Decomposition and the SVD

0 references

Randomized Kaczmarz solver for noisy linear systems

0 references

Higher-order principal component analysis for the approximation of tensors in tree-based low-rank formats

0 references

Tensor-Train Decomposition

0 references

Pseudo-skeleton approximations with better accuracy estimates

0 references

0 references

Laplacian centrality: A new centrality measure for weighted networks

0 references

Sparse and Non-Negative BSS for Noisy Data

0 references

NMF with Sparse Regularizations in Transformed Domains

0 references

Advanced Lectures on Machine Learning

0 references

The Little Engine that Could: Regularization by Denoising (RED)

0 references

0 references

Fast Sampling of Gaussian Markov Random Fields

0 references

Gaussian Markov Random Fields

0 references

0 references

Numerical Methods for Large Eigenvalue Problems

0 references

HOID: Higher Order Interpolatory Decomposition for Tensors Based on Tucker Representation

0 references

Randomized algorithms for generalized Hermitian eigenvalue problems with application to computing Karhunen–Loève expansion

0 references

Kernel techniques: From machine learning to meshless methods

0 references

Column subset selection is NP-complete

0 references

A DEIM Induced CUR Factorization

0 references

Four algorithms for the the efficient computation of truncated pivoted QR approximations to a sparse matrix

0 references

0 references

Matrix Algorithms

0 references

A Krylov-Schur approach to the truncated SVD

0 references

On Efficient Numerical Approximation of the Bilinear Form $c^*A^{-1}b$

0 references

0 references

A High Performance QDWH-SVD Solver Using Hardware Accelerators

0 references

Eigenvector-Based Centrality Measures for Temporal Networks

0 references

Greedy approximation

0 references

0 references

Mosaic-skeleton approximations

0 references

Fast Estimation of $tr(f(A))$ via Stochastic Lanczos Quadrature

0 references

Nodal decompositions of graphs

0 references

Estimation of dependences based on empirical data. Transl. from the Russian by Samuel Kotz

0 references

On the Complexity of Nonnegative Matrix Factorization

0 references

Iterative Methods for Total Variation Denoising

0 references

Efficient algorithms for CUR and interpolative matrix decompositions

0 references

0 references

Clustering of time series data -- a survey

0 references

Computational Advertising: Techniques for Targeting Relevant Ads

0 references

Regularization with randomized SVD for large-scale discrete inverse problems

0 references

Randomized algorithms for large-scale inverse problems with general Tikhonov regularizations

0 references

Joint sparse principal component analysis

0 references

Adaptive Hypergraph Learning and its Application in Image Classification

0 references

Identifiers

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

10.1002/GAMM.202000013

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6068265

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q6068265&oldid=39680610"