On the public citation graph

Clustering by Constrained Gravitational Law Based on Multiple Sub-Centroids

https://doi.org/10.2139/ssrn.4827273
0 signed · 33 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/s10462-020-09909-3openalex-extracted
Advances in Sine Cosine Algorithm: A comprehensive survey
inferredcites →https://doi.org/10.1007/s11042-020-09831-4openalex-extracted
Gravitational search algorithm: a comprehensive analysis of recent variants
inferredcites →https://doi.org/10.1007/s12652-020-02235-0openalex-extracted
Gravitational search algorithm based optimized deep learning model with diverse set of features for facial expression recognition
inferredcites →https://doi.org/10.1016/j.apm.2020.11.013openalex-extracted
GSA for machine learning problems: A comprehensive overview
inferredcites →https://doi.org/10.1016/j.asoc.2023.110630openalex-extracted
An antigravity-based fuzzy Gravitational Search Algorithm for economic dispatch problems
inferredcites →https://doi.org/10.1016/j.engappai.2019.08.012openalex-extracted
Combining density peaks clustering and gravitational search method to enhance data clustering
inferredcites →https://doi.org/10.1016/j.engappai.2023.106021openalex-extracted
Safe semi-supervised learning for pattern classification
inferredcites →https://doi.org/10.1016/j.engappai.2023.106571openalex-extracted
Semi-supervised hierarchical ensemble clustering based on an innovative distance metric and constraint information
inferredcites →https://doi.org/10.1016/j.ins.2023.02.088openalex-extracted
A review on semi-supervised clustering
inferredcites →https://doi.org/10.1016/j.is.2023.102178openalex-extracted
Semi-supervised and un-supervised clustering: A review and experimental evaluation
inferredcites →https://doi.org/10.1016/j.jksuci.2022.07.003openalex-extracted
A novel self-directed learning framework for cluster ensemble
inferredcites →https://doi.org/10.1016/j.knosys.2017.07.010openalex-extracted
Adaptive density peak clustering based on K-nearest neighbors with aggregating strategy
inferredcites →https://doi.org/10.1016/j.neucom.2017.05.072openalex-extracted
Self-training semi-supervised classification based on density peaks of data
inferredcites →https://doi.org/10.1016/j.neucom.2023.01.043openalex-extracted
PDBI: A partitioning Davies-Bouldin index for clustering evaluation
inferredcites →https://doi.org/10.1016/j.patcog.2018.10.015openalex-extracted
Cumulative attribute space regression for head pose estimation and color constancy
inferredcites →https://doi.org/10.1016/j.patcog.2020.107250openalex-extracted
Threshold optimization for F measure of macro-averaged precision and recall
inferredcites →https://doi.org/10.1016/j.patcog.2023.110036openalex-extracted
Beyond k -Means++: Towards better cluster exploration with geometrical information
inferredcites →https://doi.org/10.1016/j.patcog.2023.110136openalex-extracted
visClust: A visual clustering algorithm based on orthogonal projections
inferredcites →https://doi.org/10.1016/j.patrec.2023.12.010openalex-extracted
Deep semi-supervised clustering based on pairwise constraints and sample similarity
inferredcites →https://doi.org/10.1016/j.patrec.2024.01.024openalex-extracted
An analytic study on clustering driven self-supervised speaker verification
inferredcites →https://doi.org/10.1016/j.swevo.2018.02.018openalex-extracted
A comprehensive survey on gravitational search algorithm
inferredcites →https://doi.org/10.1093/hesc/9780198712541.001.0001openalex-extracted
Scientific Data Analysis
inferredcites →https://doi.org/10.1109/iccwamtip47768.2019.9067665openalex-extracted
Rapid Clustering with Semi-Supervised Ensemble Density Centers
inferredcites →https://doi.org/10.1109/ieem45057.2020.9309775openalex-extracted
A Binary Linear Programming-Based K-Means Algorithm For Clustering with Must-Link and Cannot-Link Constraints
inferredcites →https://doi.org/10.1109/tkde.2013.22openalex-extracted
Active Learning of Constraints for Semi-Supervised Clustering
inferredcites →https://doi.org/10.1109/tpami.2011.177openalex-extracted
Sparse Algorithms Are Not Stable: A No-Free-Lunch Theorem
inferredcites →https://doi.org/10.1109/tpami.2020.2979699openalex-extracted
Semi-Supervised Clustering With Constraints of Different Types From Multiple Information Sources
inferredcites →https://doi.org/10.1109/tpami.2022.3188160openalex-extracted
Self-Constrained Spectral Clustering
inferredcites →https://doi.org/10.1111/1740-9713.01589openalex-extracted
The Iris Data Set: In Search of the Source ofVirginica
inferredcites →https://doi.org/10.15439/2021f28openalex-extracted
A Novel Cluster Ensemble based on a Single Clustering Algorithm
inferredcites →https://doi.org/10.48550/arxiv.1911.02490openalex-extracted
OpenML-Python: an extensible Python API for OpenML
inferredcites →https://doi.org/10.5220/0010800000003122openalex-extracted
A k-Means Algorithm for Clustering with Soft Must-link and Cannot-link Constraints
inferredcites →https://doi.org/10.5220/0011762000003467openalex-extracted
Comprehensive Differentiation of Partitional Clusterings
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.