On the public citation graph

Adaptive Weighted Structure-Respecting Subspace Clustering

0 signed · 36 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-642-33786-4_26openalex-extracted
Robust and Efficient Subspace Segmentation via Least Squares Regression
inferredcites →https://doi.org/10.1016/j.cviu.2015.04.003openalex-extracted
Reweighted sparse subspace clustering
inferredcites →https://doi.org/10.1016/j.neucom.2019.07.102openalex-extracted
Robust optimal graph clustering
inferredcites →https://doi.org/10.1016/j.neunet.2018.08.007openalex-extracted
Low-rank representation with adaptive graph regularization
inferredcites →https://doi.org/10.1016/j.neunet.2022.06.016openalex-extracted
Graph regularized spatial–spectral subspace clustering for hyperspectral band selection
inferredcites →https://doi.org/10.1016/j.patcog.2011.03.021openalex-extracted
Image representation using Laplacian regularized nonnegative tensor factorization
inferredcites →https://doi.org/10.1016/j.patcog.2018.04.004openalex-extracted
Adaptive weighted nonnegative low-rank representation
inferredcites →https://doi.org/10.1016/j.patcog.2023.109388openalex-extracted
Global and local structure preserving nonnegative subspace clustering
inferredcites →https://doi.org/10.1016/j.patcog.2023.109438openalex-extracted
Attention reweighted sparse subspace clustering
inferredcites →https://doi.org/10.1109/cvpr.2014.484openalex-extracted
Smooth Representation Clustering
inferredcites →https://doi.org/10.1109/cvpr.2016.426openalex-extracted
Oracle Based Active Set Algorithm for Scalable Elastic Net Subspace Clustering
inferredcites →https://doi.org/10.1109/icassp.2013.6638272openalex-extracted
Bi-alternating direction method of multipliers
inferredcites →https://doi.org/10.1109/iccv.2003.1238370openalex-extracted
Learning a locality preserving subspace for visual recognition
inferredcites →https://doi.org/10.1109/iccv.2011.6126422openalex-extracted
Latent Low-Rank Representation for subspace segmentation and feature extraction
inferredcites →https://doi.org/10.1109/iccv.2011.6126506openalex-extracted
Unsupervised and semi-supervised learning via ℓ1-norm graph
inferredcites →https://doi.org/10.1109/tcyb.2018.2799862openalex-extracted
Low-Rank Preserving Projection Via Graph Regularized Reconstruction
inferredcites →https://doi.org/10.1109/tcyb.2018.2883566openalex-extracted
$\ell_0$ -Motivated Low-Rank Sparse Subspace Clustering
inferredcites →https://doi.org/10.1109/tcyb.2019.2943691openalex-extracted
Scaled Simplex Representation for Subspace Clustering
inferredcites →https://doi.org/10.1109/tcyb.2020.3004220openalex-extracted
Multiview Spectral Clustering via Robust Subspace Segmentation
inferredcites →https://doi.org/10.1109/tcyb.2022.3166545openalex-extracted
Latent Low-Rank Representation With Weighted Distance Penalty for Clustering
inferredcites →https://doi.org/10.1109/tip.2014.2343458openalex-extracted
Enhancing Low-Rank Subspace Clustering by Manifold Regularization
inferredcites →https://doi.org/10.1109/tip.2015.2472277openalex-extracted
Dual Graph Regularized Latent Low-Rank Representation for Subspace Clustering
inferredcites →https://doi.org/10.1109/tip.2016.2601260openalex-extracted
Optimized Graph Learning Using Partial Tags and Multiple Features for Image and Video Annotation
inferredcites →https://doi.org/10.1109/tkde.2019.2939524openalex-extracted
Unsupervised Linear Discriminant Analysis for Jointly Clustering and Subspace Learning
inferredcites →https://doi.org/10.1109/tkde.2023.3249765openalex-extracted
Structure-Aware Subspace Clustering
inferredcites →https://doi.org/10.1109/tnnls.2018.2851077openalex-extracted
From Deterministic to Generative: Multimodal Stochastic RNNs for Video Captioning
inferredcites →https://doi.org/10.1109/tnnls.2018.2861209openalex-extracted
Spectral Embedded Adaptive Neighbors Clustering
inferredcites →https://doi.org/10.1109/tpami.2015.2462360openalex-extracted
Laplacian Regularized Low-Rank Representation and Its Applications
inferredcites →https://doi.org/10.1137/080716542openalex-extracted
A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
inferredcites →https://doi.org/10.1145/2623330.2623726openalex-extracted
Clustering and projected clustering with adaptive neighbors
inferredcites →https://doi.org/10.1561/2200000016openalex-extracted
Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
inferredcites →https://doi.org/10.1561/9781601984616openalex-extracted
Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
inferredcites →https://doi.org/10.1609/aaai.v30i1.10302openalex-extracted
The Constrained Laplacian Rank Algorithm for Graph-Based Clustering
inferredcites →https://doi.org/10.1609/aaai.v31i1.11208openalex-extracted
A Multiview-Based Parameter Free Framework for Group Detection
inferredcites →https://doi.org/10.1609/aaai.v36i8.20857openalex-extracted
Linearity-Aware Subspace Clustering
inferredcites →https://doi.org/10.7551/mitpress/1120.001.0001openalex-extracted
Advances in Neural Information Processing Systems 14
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.