On the public citation graph

Dimensionality Reduction with Adaptive K-Nearest Neighbors Joint Fuzzy C-Means

https://doi.org/10.2139/ssrn.4835463
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-319-46128-1_18openalex-extracted
Uncovering Locally Discriminative Structure for Feature Analysis
inferredcites →https://doi.org/10.1007/978-3-642-15883-4_29openalex-extracted
Improved MinMax Cut Graph Clustering with Nonnegative Relaxation
inferredcites →https://doi.org/10.1007/978-3-642-51175-2_24openalex-extracted
K-means clustering in a low-dimensional Euclidean space
inferredcites →https://doi.org/10.1007/s00357-017-9232-zopenalex-extracted
Dimension-Reduced Clustering of Functional Data via Subspace Separation
inferredcites →https://doi.org/10.1007/s10994-021-05965-0openalex-extracted
QuicK-means: accelerating inference for K-means by learning fast transforms
inferredcites →https://doi.org/10.1007/s41237-019-00092-6openalex-extracted
Special feature: dimension reduction and cluster analysis
inferredcites →https://doi.org/10.1016/0098-3004(84)90020-7openalex-extracted
FCM: The fuzzy c-means clustering algorithm
inferredcites →https://doi.org/10.1016/j.eswa.2019.113079openalex-extracted
Discriminative globality and locality preserving graph embedding for dimensionality reduction
inferredcites →https://doi.org/10.1016/j.ins.2015.01.004openalex-extracted
Regression analysis of locality preserving projections via sparse penalty
inferredcites →https://doi.org/10.1016/j.neucom.2015.07.128openalex-extracted
Dimensionality reduction on Anchorgraph with an efficient Locality Preserving Projection
inferredcites →https://doi.org/10.1016/j.patcog.2009.12.022openalex-extracted
Graph-optimized locality preserving projections
inferredcites →https://doi.org/10.1016/j.patcog.2019.03.024openalex-extracted
Joint graph optimization and projection learning for dimensionality reduction
inferredcites →https://doi.org/10.1016/j.patcog.2020.107748openalex-extracted
Projected fuzzy C-means clustering with locality preservation
inferredcites →https://doi.org/10.1023/a:1009769707641openalex-extracted
Extensions to the k-Means Algorithm for Clustering Large Data Sets with Categorical Values
inferredcites →https://doi.org/10.1037/h0070888openalex-extracted
Analysis of a complex of statistical variables into principal components.
inferredcites →https://doi.org/10.1037/h0071325openalex-extracted
Analysis of a complex of statistical variables into principal components.
inferredcites →https://doi.org/10.1109/34.927464openalex-extracted
From few to many: illumination cone models for face recognition under variable lighting and pose
inferredcites →https://doi.org/10.1109/43.159993openalex-extracted
New spectral methods for ratio cut partitioning and clustering
inferredcites →https://doi.org/10.1109/91.784206openalex-extracted
A fuzzy k-modes algorithm for clustering categorical data
inferredcites →https://doi.org/10.1109/cvpr.2014.482openalex-extracted
Robust Subspace Segmentation with Block-Diagonal Prior
inferredcites →https://doi.org/10.1109/iccv.2005.167openalex-extracted
Neighborhood preserving embedding
inferredcites →https://doi.org/10.1109/jstars.2021.3069030openalex-extracted
Supervised Dimensionality Reduction of Hyperspectral Imagery Via Local and Global Sparse Representation
inferredcites →https://doi.org/10.1109/tkde.2008.88openalex-extracted
Agglomerative Fuzzy K-Means Clustering Algorithm with Selection of Number of Clusters
inferredcites →https://doi.org/10.1109/tnnls.2015.2448637openalex-extracted
Sparse Uncorrelated Linear Discriminant Analysis for Undersampled Problems
inferredcites →https://doi.org/10.1109/tpami.2002.1017616openalex-extracted
An efficient k-means clustering algorithm: analysis and implementation
inferredcites →https://doi.org/10.1109/tpami.2005.95openalex-extracted
Automated variable weighting in k-means type clustering
inferredcites →https://doi.org/10.1109/tpami.2020.3008694openalex-extracted
A Fast Adaptive k-means with No Bounds
inferredcites →https://doi.org/10.1126/science.1127647openalex-extracted
Reducing the Dimensionality of Data with Neural Networks
inferredcites →https://doi.org/10.1126/science.1136800openalex-extracted
Clustering by Passing Messages Between Data Points
inferredcites →https://doi.org/10.1126/science.1242072openalex-extracted
Clustering by fast search and find of density peaks
inferredcites →https://doi.org/10.1126/science.290.5500.2319openalex-extracted
A Global Geometric Framework for Nonlinear Dimensionality Reduction
inferredcites →https://doi.org/10.1126/science.290.5500.2323openalex-extracted
Nonlinear Dimensionality Reduction by Locally Linear Embedding
inferredcites →https://doi.org/10.1142/1930openalex-extracted
Clustering and Classification
inferredcites →https://doi.org/10.1145/1137856.1137879openalex-extracted
A fast k-means implementation using coresets
inferredcites →https://doi.org/10.1145/1553374.1553494openalex-extracted
Structure preserving embedding
inferredcites →https://doi.org/10.1145/2939672.2939751openalex-extracted
Asymmetric Transitivity Preserving Graph Embedding
inferredcites →https://doi.org/10.1162/089976603321780317openalex-extracted
Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
inferredcites →https://doi.org/10.1371/journal.pcbi.1008625openalex-extracted
mbkmeans: Fast clustering for single cell data using mini-batch k-means
inferredcites →https://doi.org/10.1609/aaai.v30i1.10179openalex-extracted
Deep Neural Networks for Learning Graph Representations
inferredcites →https://doi.org/10.2333/bhmk.41.115openalex-extracted
A General Formulation of Cluster Analysis with Dimension Reduction and Subspace Separation
inferredcites →https://doi.org/10.48550/arxiv.1605.05273openalex-extracted
Learning Convolutional Neural Networks for Graphs
inferredcites →https://doi.org/10.48550/arxiv.1608.05560openalex-extracted
Iterative Views Agreement: An Iterative Low-Rank based Structured Optimization Method to Multi-View Spectral Clustering
inferredcites →https://doi.org/10.48550/arxiv.2002.11934openalex-extracted
Supervised Dimensionality Reduction and Visualization using Centroid-encoder
inferredcites →https://doi.org/10.5555/1283383.1283494openalex-extracted
k-means++: the advantages of careful seeding
inferredcites →https://doi.org/10.5555/964885.964886openalex-extracted
Convergence of alternating optimization
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.