Integrative generalized convex clustering optimization and feature selection for mixed multi-view data (Q4998948)

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

Integrative generalized convex clustering optimization and feature selection for mixed multi-view data

scientific article; zbMATH DE number 7370572

Language	Label	Description	Also known as
default for all languages	No label defined
English	Integrative generalized convex clustering optimization and feature selection for mixed multi-view data	scientific article; zbMATH DE number 7370572

Statements

0 references

0 references

0 references

9 July 2021

0 references

full work available at URL

https://arxiv.org/abs/1912.05449

0 references

https://jmlr.csail.mit.edu/papers/v22/19-1012.html

0 references

zbMATH Keywords

integrative clustering

0 references

convex clustering

0 references

feature selection

0 references

convex optimization

0 references

sparse clustering

0 references

GLM deviance

0 references

Bregman divergences

0 references

describes a project that uses

0 references

0 references

0 references

0 references

0 references

MaRDI publication profile

0 references

cites work

Clustering the mixed panel dataset using Gower's distance and k-prototypes algorithms

0 references

Q2934696

0 references

Clustering with Bregman divergences.

0 references

Fixing and extending some recent results on the ADMM algorithm

0 references

Model-Based Gaussian and Non-Gaussian Clustering

0 references

Gradient-based algorithms with applications to signal-recovery problems

0 references

Sparse $k$-Means with $\ell_{\infty}/\ell_0$ Penalty for High-Dimensional Data Clustering

0 references

The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent

0 references

Recovering Trees with Convex Clustering

0 references

Convex biclustering

0 references

Q5149011

0 references

Regularized boxplot via convex clustering

0 references

On the global and linear convergence of the generalized alternating direction method of multipliers

0 references

Parallel multi-block ADMM with $o(1/k)$ convergence

0 references

Network exploration via the adaptive LASSO and SCAD penalties

0 references

Selection of the number of clusters via the bootstrap method

0 references

A Method for Comparing Two Hierarchical Clusterings

0 references

When and Why are Principal Component Scores a Good Tool for Visualizing High‐dimensional Data?

0 references

Q3713407

0 references

On the Global Linear Convergence of the ADMM with MultiBlock Variables

0 references

Learning Markov random walks for robust subspace clustering and estimation

0 references

Joint and individual variation explained (JIVE) for integrated analysis of multiple data types

0 references

Visualizing data using t-SNE

0 references

Penalized model-based clustering with application to variable selection

0 references

Convex clustering via $l_1$ fusion penalization

0 references

Variable Selection for Model-Based Clustering

0 references

Rate of Convergence Analysis of Decomposition Methods Based on the Proximal Method of Multipliers for Convex Minimization

0 references

Sparse integrative clustering of multiple omics data sets

0 references

Q4998873

0 references

Regularized $k$-means clustering of high-dimensional data and its asymptotic consistency

0 references

Statistical properties of convex clustering

0 references

The adaptive and the thresholded Lasso for potentially misspecified models (and a lower bound for the Lasso)

0 references

Sparse Convex Clustering

0 references

Consistent selection of the number of clusters via crossvalidation

0 references

Variable Selection for Model-Based High-Dimensional Clustering and Its Application to Microarray Data

0 references

Dynamic Visualization and Fast Computation for Convex Clustering via Algorithmic Regularization

0 references

A framework for feature selection in clustering

0 references

A new algorithm and theory for penalized regression-based clustering

0 references

Optimal sparse linear prediction for block-missing multi-modality data without imputation

0 references

The Adaptive Lasso and Its Oracle Properties

0 references

Identifiers

Mathematics Subject Classification ID

68T05

0 references

zbMATH DE Number

7370572

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:4998948