On the public citation graph

Collaborative Specific and Consistent Learning for Binary Multi-View Clustering

https://doi.org/10.2139/ssrn.4770106
0 signed · 45 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/978-3-030-01258-8_44openalex-extracted
Highly-Economized Multi-view Binary Compression for Scalable Image Clustering
inferredcites →https://doi.org/10.1016/j.patcog.2020.107207openalex-extracted
Auto-weighted multi-view co-clustering via fast matrix factorization
inferredcites →https://doi.org/10.1016/j.patcog.2020.107676openalex-extracted
Discriminative subspace matrix factorization for multiview data clustering
inferredcites →https://doi.org/10.1016/j.patcog.2022.109067openalex-extracted
High-order manifold regularized multi-view subspace clustering with robust affinity matrices and weighted TNN
inferredcites →https://doi.org/10.1016/j.patcog.2022.109119openalex-extracted
Towards deeper match for multi-view oriented multiple kernel learning
inferredcites →https://doi.org/10.1016/j.patcog.2022.109152openalex-extracted
Fast subspace clustering by learning projective block diagonal representation
inferredcites →https://doi.org/10.1016/j.patcog.2023.109764openalex-extracted
Auto-attention mechanism for multi-view deep embedding clustering
inferredcites →https://doi.org/10.1109/cvpr42600.2020.01463openalex-extracted
End-to-End Adversarial-Attention Network for Multi-Modal Clustering
inferredcites →https://doi.org/10.1109/cvpr52688.2022.00929openalex-extracted
MPC: Multi-view Probabilistic Clustering
inferredcites →https://doi.org/10.1109/cvpr52729.2023.01508openalex-extracted
Highly Confident Local Structure Based Consensus Graph Learning for Incomplete Multi-view Clustering
inferredcites →https://doi.org/10.1109/cvpr52729.2023.02295openalex-extracted
Sample-level Multi-view Graph Clustering
inferredcites →https://doi.org/10.1109/icassp.2017.7952605openalex-extracted
Fast Spectral Clustering with efficient large graph construction
inferredcites →https://doi.org/10.1109/iccv48922.2021.01212openalex-extracted
One-pass Multi-view Clustering for Large-scale Data
inferredcites →https://doi.org/10.1109/iccv51070.2023.01772openalex-extracted
Anchor Structure Regularization Induced Multi-view Subspace Clustering via Enhanced Tensor Rank Minimization
inferredcites →https://doi.org/10.1109/tai.2021.3065894openalex-extracted
A Survey on Multiview Clustering
inferredcites →https://doi.org/10.1109/tcyb.2020.2984552openalex-extracted
Uniform Distribution Non-Negative Matrix Factorization for Multiview Clustering
inferredcites →https://doi.org/10.1109/tip.2016.2612883openalex-extracted
A Fast Optimization Method for General Binary Code Learning
inferredcites →https://doi.org/10.1109/tip.2020.3029883openalex-extracted
Multi-View Data Fusion Oriented Clustering via Nuclear Norm Minimization
inferredcites →https://doi.org/10.1109/tip.2021.3131941openalex-extracted
Fast Parameter-Free Multi-View Subspace Clustering With Consensus Anchor Guidance
inferredcites →https://doi.org/10.1109/tip.2022.3176223openalex-extracted
Fast Multiview Clustering With Spectral Embedding
inferredcites →https://doi.org/10.1109/tip.2023.3261746openalex-extracted
Fast Self-Guided Multi-View Subspace Clustering
inferredcites →https://doi.org/10.1109/tkde.2019.2903810openalex-extracted
GMC: Graph-Based Multi-View Clustering
inferredcites →https://doi.org/10.1109/tkde.2021.3078728openalex-extracted
Fast Multi-view Clustering via Prototype Graph
inferredcites →https://doi.org/10.1109/tkde.2021.3107489openalex-extracted
Discrete Robust Matrix Factorization Hashing for Large-Scale Cross-Media Retrieval
inferredcites →https://doi.org/10.1109/tkde.2022.3198800openalex-extracted
Rank-r Discrete Matrix Factorization for Anchor Graph Clustering
inferredcites →https://doi.org/10.1109/tkde.2023.3236698openalex-extracted
Fast Multi-View Clustering Via Ensembles: Towards Scalability, Superiority, and Simplicity
inferredcites →https://doi.org/10.1109/tkde.2023.3268215openalex-extracted
Multi-View Bipartite Graph Clustering With Coupled Noisy Feature Filter
inferredcites →https://doi.org/10.1109/tkde.2023.3270311openalex-extracted
A Comprehensive Survey on Multi-View Clustering
inferredcites →https://doi.org/10.1109/tnnls.2022.3202102openalex-extracted
Learning All-In Collaborative Multiview Binary Representation for Clustering
inferredcites →https://doi.org/10.1109/tnnls.2023.3261460openalex-extracted
Efficient Multi-View Clustering via Unified and Discrete Bipartite Graph Learning
inferredcites →https://doi.org/10.1109/tpami.2018.2847335openalex-extracted
Binary Multi-View Clustering
inferredcites →https://doi.org/10.1109/tpami.2020.3011148openalex-extracted
Multiview Clustering: A Scalable and Parameter-Free Bipartite Graph Fusion Method
inferredcites →https://doi.org/10.1109/tpami.2022.3187976openalex-extracted
Tensorized Bipartite Graph Learning for Multi-View Clustering
inferredcites →https://doi.org/10.1109/tpami.2022.3222569openalex-extracted
Differentiable Hierarchical Optimal Transport for Robust Multi-View Learning
inferredcites →https://doi.org/10.1145/3442381.3449956openalex-extracted
Scalable Auto-weighted Discrete Multi-view Clustering
inferredcites →https://doi.org/10.1145/3474085.3475471openalex-extracted
Non-Linear Fusion for Self-Paced Multi-View Clustering
inferredcites →https://doi.org/10.1145/3474085.3475516openalex-extracted
Scalable Multi-view Subspace Clustering with Unified Anchors
inferredcites →https://doi.org/10.1145/3534678.3539282openalex-extracted
Efficient Orthogonal Multi-view Subspace Clustering
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.1609/aaai.v34i04.5867openalex-extracted
Large-Scale Multi-View Subspace Clustering in Linear Time
inferredcites →https://doi.org/10.1609/aaai.v35i11.17128openalex-extracted
Fast Multi-view Discrete Clustering with Anchor Graphs
inferredcites →https://doi.org/10.1609/aaai.v36i6.20652openalex-extracted
Multi-View Clustering on Topological Manifold
inferredcites →https://doi.org/10.1609/aaai.v37i7.25960openalex-extracted
Self-Supervised Graph Attention Networks for Deep Weighted Multi-View Clustering
inferredcites →https://doi.org/10.1609/aaai.v37i8.26188openalex-extracted
Metric Multi-View Graph Clustering
inferredcites →https://doi.org/10.52202/068431-0426openalex-extracted
Align Then Fusion: Generalized Large-Scale Multi-View Clustering with Anchor Matching Correspondences
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.