PWSC: a novel clustering method based on polynomial weight-adjusted sparse clustering for sparse biomedical data and its application in cancer subtyping

to related objects

Location: Deutsche Nationalbibliothek Frankfurt am Main

Extent: 1 Online-Ressource.

Language: Englisch

Bibliographic citation: PWSC: a novel clustering method based on polynomial weight-adjusted sparse clustering for sparse biomedical data and its application in cancer subtyping ; volume:24 ; number:1 ; day:21 ; month:12 ; year:2023 ; pages:1-17 ; date:12.2023
BMC bioinformatics ; 24, Heft 1 (21.12.2023), 1-17, 12.2023

Creator: Zhang, Xiaomeng
Zhang, Hongtao
Wang, Zhihao
Ma, Xiaofei
Luo, Jiancheng
Zhu, Yingying

Contributor: SpringerLink (Online service)

DOI: 10.1186/s12859-023-05595-4

URN: urn:nbn:de:101:1-2024030614030653498731

Rights: Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.

Last update: 14.08.2025, 10:50 AM CEST

Data provider

This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.

Show original at data provider

Associated

Zhang, Xiaomeng
Zhang, Hongtao
Wang, Zhihao
Ma, Xiaofei
Luo, Jiancheng
Zhu, Yingying
SpringerLink (Online service)

Other Objects (12)

Sparse and smooth functional data clustering

Sparse polynomial prediction

Hochschulschrift

Sparse signal processing : subspace clustering and system identification

Accelerating Relational Clustering Algorithms With Sparse Prototype Representation

Clustering K-SVD for sparse representation of images

Elastic Deep Sparse Self-Representation Subspace Clustering Network

Bayesian sparse convex clustering via global-local shrinkage priors

Sparse Similarity and Network Navigability for Markov Clustering Enhancement

Sparse polynomial systems in optimization

Weighted sparse simplex representation: a unified framework for subspace clustering, constrained clustering, and active learning

First-to-fire neurons induced by clustering in sparse networks

Robust and sparse k-means clustering for high-dimensional data

Sparse and smooth functional data clustering

Sparse polynomial prediction

Hochschulschrift

Sparse signal processing : subspace clustering and system identification

Accelerating Relational Clustering Algorithms With Sparse Prototype Representation

Clustering K-SVD for sparse representation of images

Elastic Deep Sparse Self-Representation Subspace Clustering Network

Bayesian sparse convex clustering via global-local shrinkage priors

Sparse Similarity and Network Navigability for Markov Clustering Enhancement

Sparse polynomial systems in optimization

Weighted sparse simplex representation: a unified framework for subspace clustering, constrained clustering, and active learning

First-to-fire neurons induced by clustering in sparse networks

Robust and sparse k-means clustering for high-dimensional data

Sparse and smooth functional data clustering

Sparse polynomial prediction

Hochschulschrift

Sparse signal processing : subspace clustering and system identification

Accelerating Relational Clustering Algorithms With Sparse Prototype Representation

Clustering K-SVD for sparse representation of images

Elastic Deep Sparse Self-Representation Subspace Clustering Network

Bayesian sparse convex clustering via global-local shrinkage priors

Sparse Similarity and Network Navigability for Markov Clustering Enhancement

Sparse polynomial systems in optimization

Weighted sparse simplex representation: a unified framework for subspace clustering, constrained clustering, and active learning

First-to-fire neurons induced by clustering in sparse networks

Robust and sparse k-means clustering for high-dimensional data

Cultural heritage institutions wishing to register will find more information here.

Fields marked * need to be filled in.

Username*

Please enter your username

Email*

Please enter your email address

Please do not fill this field

First name

Last name

Password*

Please enter your password

Confirm password*

Please enter the same password

I have read the terms of use and the privacy policy for the collection of personal data and accept them. *

This field is required.

I would like to subscribe to the newsletter of the Deutsche Digitale Bibliothek. See newsletter subscription info.

Account created

Your "My DDB" account has been successfully created. Before you can log in to your account, you must click the confirmation link in the message we just sent to the email address you provided.

PWSC: a novel clustering method based on polynomial weight-adjusted sparse clustering for sparse biomedical data and its application in cancer subtyping

Object Details

References and Relationships

Contributors, Places and Time

Further information

Data provider

Associated

Other Objects (12)

Sparse and smooth functional data clustering

Sparse polynomial prediction

Sparse signal processing : subspace clustering and system identification

Accelerating Relational Clustering Algorithms With Sparse Prototype Representation

Clustering K-SVD for sparse representation of images

Elastic Deep Sparse Self-Representation Subspace Clustering Network

Bayesian sparse convex clustering via global-local shrinkage priors

Sparse Similarity and Network Navigability for Markov Clustering Enhancement

Sparse polynomial systems in optimization

Weighted sparse simplex representation: a unified framework for subspace clustering, constrained clustering, and active learning

First-to-fire neurons induced by clustering in sparse networks

Robust and sparse k-means clustering for high-dimensional data

Sparse and smooth functional data clustering

Sparse polynomial prediction

Sparse signal processing : subspace clustering and system identification

Accelerating Relational Clustering Algorithms With Sparse Prototype Representation

Clustering K-SVD for sparse representation of images

Elastic Deep Sparse Self-Representation Subspace Clustering Network

Bayesian sparse convex clustering via global-local shrinkage priors

Sparse Similarity and Network Navigability for Markov Clustering Enhancement

Sparse polynomial systems in optimization

Weighted sparse simplex representation: a unified framework for subspace clustering, constrained clustering, and active learning

First-to-fire neurons induced by clustering in sparse networks

Robust and sparse k-means clustering for high-dimensional data

Sparse and smooth functional data clustering

Sparse polynomial prediction

Sparse signal processing : subspace clustering and system identification

Accelerating Relational Clustering Algorithms With Sparse Prototype Representation

Clustering K-SVD for sparse representation of images

Elastic Deep Sparse Self-Representation Subspace Clustering Network

Bayesian sparse convex clustering via global-local shrinkage priors

Sparse Similarity and Network Navigability for Markov Clustering Enhancement

Sparse polynomial systems in optimization

Weighted sparse simplex representation: a unified framework for subspace clustering, constrained clustering, and active learning

First-to-fire neurons induced by clustering in sparse networks

Robust and sparse k-means clustering for high-dimensional data

Related objects

Reset password