On the public citation graph

Type of Study:Original Papertitle:Structured Multi-View K-Means Clusteringauthor Names and Affiliations:Zitong Zhang (Email: 1810272071@Email.Szu.Edu.Cn)(College of Computer Science and Software, Shenzhen University, Shenzhen, 518060, P.R. China.) Xiaojun Chen* (Email: Xjchen@Szu.Edu.Cn)(College…

0 signed · 22 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/11564096_51openalex-extracted

Nonnegative Lagrangian Relaxation of K-Means and Spectral Clustering

inferredcites →https://doi.org/10.1016/j.ins.2023.119445openalex-extracted

Mutual structure learning for multiple kernel clustering

inferredcites →https://doi.org/10.1016/j.knosys.2023.110578openalex-extracted

Consensus cluster structure guided multi-view unsupervised feature selection

inferredcites →https://doi.org/10.1016/j.neucom.2018.05.072openalex-extracted

Robust multi-view data clustering with multi-view capped-norm K-means

inferredcites →https://doi.org/10.1016/j.patcog.2011.06.004openalex-extracted

A feature group weighting method for subspace clustering of high-dimensional data

inferredcites →https://doi.org/10.1109/cvpr.2015.7298657openalex-extracted

Diversity-induced Multi-view Subspace Clustering

inferredcites →https://doi.org/10.1109/cvpr.2016.578openalex-extracted

Discriminatively Embedded K-Means for Multi-view Clustering

inferredcites →https://doi.org/10.1109/cvpr.2017.461openalex-extracted

Latent Multi-view Subspace Clustering

inferredcites →https://doi.org/10.1109/cvpr.2017.8openalex-extracted

Exclusivity-Consistency Regularized Multi-view Subspace Clustering

inferredcites →https://doi.org/10.1109/tcyb.2014.2376938openalex-extracted

Robust Face Clustering Via Tensor Decomposition

inferredcites →https://doi.org/10.1109/tip.2017.2665976openalex-extracted

Re-Weighted Discriminatively Embedded $K$ -Means for Multi-View Clustering

inferredcites →https://doi.org/10.1109/tkde.2011.262openalex-extracted

TW-k-means: Automated two-level variable weighting clustering algorithm for multiview data

inferredcites →https://doi.org/10.1109/tpami.2015.2417578openalex-extracted

Multi-View Intact Space Learning

inferredcites →https://doi.org/10.1109/tpami.2018.2847335openalex-extracted

Binary Multi-View Clustering

inferredcites →https://doi.org/10.1137/1.9781611972832.28openalex-extracted

Multi-View Clustering via Joint Nonnegative Matrix Factorization

inferredcites →https://doi.org/10.1145/1553374.1553391openalex-extracted

Multi-view clustering via canonical correlation analysis

inferredcites →https://doi.org/10.1145/2623330.2623726openalex-extracted

Clustering and projected clustering with adaptive neighbors

inferredcites →https://doi.org/10.1609/aaai.v29i1.9598openalex-extracted

Large-Scale Multi-View Spectral Clustering via Bipartite Graph

inferredcites →https://doi.org/10.1609/aaai.v31i1.10909openalex-extracted

Multi-View Clustering and Semi-Supervised Classification with Adaptive Neighbours

inferredcites →https://doi.org/10.24963/ijcai.2017/357openalex-extracted

Self-weighted Multiview Clustering with Multiple Graphs

inferredcites →https://doi.org/10.48550/arxiv.1309.1541openalex-extracted

Projection onto the probability simplex: An efficient algorithm with a simple proof, and an application

inferredcites →https://doi.org/10.48550/arxiv.1712.06246openalex-extracted

A Survey on Multi-View Clustering

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.