No label defined (Q5149011)

From MaRDI portal

Revision as of 12:18, 24 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

This is the item page for this Wikibase entity, intended for internal use and editing purposes.

Please use this page instead for the normal view: scientific article; zbMATH DE number 7306902

scientific article; zbMATH DE number 7306902

Language	Label	Description	Also known as
English	No label defined	scientific article; zbMATH DE number 7306902

Statements

scholarly article

0 references

0 references

Brian J. Gaines

0 references

0 references

0 references

0 references

publication date

5 February 2021

0 references

full work available at URL

https://arxiv.org/abs/1803.06518

0 references

https://jmlr.csail.mit.edu/papers/v21/18-155.html

0 references

zbMATH Keywords

clustering

0 references

fused Lasso

0 references

high-dimensional statistical learning

0 references

multiway data

0 references

non-asymptotic error

0 references

describes a project that uses

0 references

0 references

0 references

0 references

0 references

0 references

0 references

MaRDI profile type

0 references

Tensor decompositions for learning latent variable models

0 references

A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems

0 references

Multilayer tensor factorization with applications to recommender systems

0 references

Biclustering in data mining

0 references

Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young'' decomposition

0 references

Extended Bayesian information criteria for model selection with large model spaces

0 references

Extended BIC for small-n-large-P sparse GLM

0 references

Recovering Trees with Convex Clustering

0 references

Convex biclustering

0 references

Proximal Splitting Methods in Signal Processing

0 references

Signal Recovery by Proximal Forward-Backward Splitting

0 references

A Multilinear Singular Value Decomposition

0 references

0 references

A simplified form of block-iterative operator splitting and an asynchronous algorithm resembling the multi-block alternating direction method of multipliers

0 references

Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties

0 references

Sampling, denoising and compression of matrices by coherent matrix organization

0 references

The Predictive Sample Reuse Method with Applications

0 references

A Bound on Tail Probabilities for Quadratic Forms in Independent Random Variables

0 references

Approximation Algorithms for Tensor Clustering

0 references

Tensor Decompositions and Applications

0 references

0 references

Biclustering via Sparse Singular Value Decomposition

0 references

Penalized Clustering of Large-Scale Functional Data With Multiple Covariates

0 references

Solution path clustering with adaptive concave penalty

0 references

Stability Selection

0 references

Randomized Algorithms for Low-Rank Tensor Decompositions in the Tucker Format

0 references

0 references

Convex Clustering via <i>l</i> 1 Fusion Penalization

0 references

Modeling by shortest data description

0 references

Majorization-minimization algorithms for nonsmoothly penalized objective functions

0 references

Sparse regression with exact clustering

0 references

Grouping Pursuit Through a Regularization Solution Surface

0 references

Simultaneous supervised clustering and feature selection over a graph

0 references

Tensor Decomposition for Signal Processing and Machine Learning

0 references

0 references

Dynamic Tensor Clustering

0 references

Provable Sparse Tensor Decomposition

0 references

Matrix and Tensor Factorization Techniques for Recommender Systems

0 references

Statistical properties of convex clustering

0 references

0 references

Estimating the Number of Clusters in a Data Set Via the Gap Statistic

0 references

Sparsity and Smoothness Via the Fused Lasso

0 references

The solution path of the generalized lasso

0 references

Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities

0 references

Improved biclustering of microarray data demonstrated through systematic performance tests

0 references

A New Truncation Strategy for the Higher-Order Singular Value Decomposition

0 references

Random weighted projections, random quadratic forms and random eigenvectors

0 references

Sparse Convex Clustering

0 references

0 references

A penalized matrix decomposition, with applications to sparse principal components and canonical correlation analysis

0 references

Sparse Reconstruction by Separable Approximation

0 references

0 references

Reconstruction of normal forms by learning informed observation geometries from data

0 references

Robust Multilinear Tensor Rank Estimation Using Higher Order Singular Value Decomposition and Information Criteria

0 references

Model Selection and Estimation in Regression with Grouped Variables

0 references

Nearly unbiased variable selection under minimax concave penalty

0 references

Tensor Regression with Applications in Neuroimaging Data Analysis

0 references

Simultaneous Grouping Pursuit and Feature Selection Over an Undirected Graph

0 references

The Adaptive Lasso and Its Oracle Properties

0 references

Identifiers

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5149011

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