On the public citation graph

CNNDPEG: A Novel Clustering Method Basedon Natural Neighbors, High-Density Points, andElliptical Neighborhood Geometry

0 signed · 26 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/s40745-015-0040-1openalex-snapshot
A Comprehensive Survey of Clustering Algorithms
inferredcites →https://doi.org/10.1016/j.comgeo.2008.09.003openalex-snapshot
Empty region graphs
inferredcites →https://doi.org/10.1016/j.engappai.2014.03.007openalex-snapshot
An unsupervised feature selection algorithm based on ant colony optimization
inferredcites →https://doi.org/10.1016/j.engappai.2022.104743openalex-snapshot
A comprehensive survey of clustering algorithms: State-of-the-art machine learning applications, taxonomy, challenges, and future research prospects
inferredcites →https://doi.org/10.1016/j.eswa.2014.08.027openalex-snapshot
A density and connectivity based decision rule for pattern classification
inferredcites →https://doi.org/10.1016/j.eswa.2018.07.066openalex-snapshot
A novel and efficient data point neighborhood construction algorithm based on Apollonius circle
inferredcites →https://doi.org/10.1016/j.ins.2016.08.086openalex-snapshot
DenPEHC: Density peak based efficient hierarchical clustering
inferredcites →https://doi.org/10.1016/j.is.2013.11.002openalex-snapshot
DBCURE-MR: An efficient density-based clustering algorithm for large data using MapReduce
inferredcites →https://doi.org/10.1016/j.knosys.2016.02.001openalex-snapshot
Study on density peaks clustering based on k-nearest neighbors and principal component analysis
inferredcites →https://doi.org/10.1016/j.knosys.2017.07.010openalex-snapshot
Adaptive density peak clustering based on K-nearest neighbors with aggregating strategy
inferredcites →https://doi.org/10.1016/j.neucom.2012.12.074openalex-snapshot
Robust local feature weighting hard c-means clustering algorithm
inferredcites →https://doi.org/10.1016/j.patcog.2023.110136openalex-snapshot
visClust: A visual clustering algorithm based on orthogonal projections
inferredcites →https://doi.org/10.1016/j.patcog.2024.110366openalex-snapshot
Survey of spectral clustering based on graph theory
inferredcites →https://doi.org/10.1016/j.patcog.2024.110635openalex-snapshot
Efficient and robust clustering based on backbone identification
inferredcites →https://doi.org/10.1016/j.patrec.2015.11.027openalex-snapshot
An angle-based neighborhood graph classifier with evidential reasoning
inferredcites →https://doi.org/10.1016/j.patrec.2016.01.009openalex-snapshot
Delta-density based clustering with a divide-and-conquer strategy: 3DC clustering
inferredcites →https://doi.org/10.1016/j.patrec.2017.07.001openalex-snapshot
A novel density peaks clustering algorithm for mixed data
inferredcites →https://doi.org/10.1109/cbd.2015.57openalex-snapshot
Manifold Density Peaks Clustering Algorithm
inferredcites →https://doi.org/10.1109/t-c.1971.223083openalex-snapshot
Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
inferredcites →https://doi.org/10.1109/tgrs.2015.2450759openalex-snapshot
A Novel Ranking-Based Clustering Approach for Hyperspectral Band Selection
inferredcites →https://doi.org/10.1109/tii.2016.2628747openalex-snapshot
A Fast Density and Grid Based Clustering Method for Data With Arbitrary Shapes and Noise
inferredcites →https://doi.org/10.1109/tii.2017.2684807openalex-snapshot
An Incremental CFS Algorithm for Clustering Large Data in Industrial Internet of Things
inferredcites →https://doi.org/10.1109/tkde.2006.148openalex-snapshot
Reverse Nearest Neighbor Search in Metric Spaces
inferredcites →https://doi.org/10.1109/tkde.2016.2535209openalex-snapshot
Automatic Clustering via Outward Statistical Testing on Density Metrics
inferredcites →https://doi.org/10.1109/tkde.2016.2609423openalex-snapshot
Efficient Distributed Density Peaks for Clustering Large Data Sets in MapReduce
inferredcites →https://doi.org/10.1126/science.1242072openalex-snapshot
Clustering by fast search and find of density peaks
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.