On the public citation graph

Clustering algorithm based on mutual K‐nearest neighbor relationships

0 signed · 31 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/11563952_67openalex-snapshot
A Clustering Algorithm Based Absorbing Nearest Neighbors
inferredcites →https://doi.org/10.1016/b978-012088469-8.50066-8openalex-snapshot
kReverse NN Search in Arbitrary Dimensionality
inferredcites →https://doi.org/10.1038/75556openalex-snapshot
Gene Ontology: tool for the unification of biology
inferredcites →https://doi.org/10.1109/2.781637openalex-snapshot
Chameleon: hierarchical clustering using dynamic modeling
inferredcites →https://doi.org/10.1109/icdm.2006.9openalex-snapshot
A Simple Yet Effective Data Clustering Algorithm
inferredcites →https://doi.org/10.1109/t-c.1973.223640openalex-snapshot
Clustering Using a Similarity Measure Based on Shared Near Neighbors
inferredcites →https://doi.org/10.1126/science.1136800openalex-snapshot
Clustering by Passing Messages Between Data Points
inferredcites →https://doi.org/10.1126/science.1139678openalex-snapshot
Where Are the Exemplars?
inferredcites →https://doi.org/10.1137/1.9781611972733.5openalex-snapshot
Finding Clusters of Different Sizes, Shapes, and Densities in Noisy, High Dimensional Data
inferredcites →https://doi.org/10.1145/1142473.1142531openalex-snapshot
Efficient reverse k-nearest neighbor search in arbitrary metric spaces
inferredcites →https://doi.org/10.1145/1516360.1516462openalex-snapshot
Reverse k-nearest neighbor search in dynamic and general metric databases
inferredcites →https://doi.org/10.1145/304181.304187openalex-snapshot
OPTICS
inferredcites →https://doi.org/10.1145/335191.335415openalex-snapshot
Influence sets based on reverse nearest neighbor queries
inferredcites →https://doi.org/10.1145/342009.335415openalex-snapshot
Influence sets based on reverse nearest neighbor queries
inferredcites →https://doi.org/10.1145/956863.956882openalex-snapshot
High dimensional reverse nearest neighbor queries

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-031-46994-7_3openalex-snapshot
Mutual k-Nearest Neighbor Graph for Data Analysis: Application to Metric Space Clustering
inferred← citeshttps://doi.org/10.1007/978-3-319-09912-5_4openalex-snapshot
Graph Clustering Using Mutual K-Nearest Neighbors
inferred← citeshttps://doi.org/10.1007/978-3-319-98370-7_12openalex-snapshot
Reciprocating Link Hierarchical Clustering
inferred← citeshttps://doi.org/10.1016/j.cosrev.2020.100315openalex-snapshot
A survey of neighborhood construction algorithms for clustering and classifying data points
inferred← citeshttps://doi.org/10.1016/j.ins.2019.02.051openalex-snapshot
Munec: a mutual neighbor-based clustering algorithm
inferred← citeshttps://doi.org/10.1016/j.ins.2020.02.049openalex-snapshot
Improving neighborhood construction with Apollonius region algorithm based on density for clustering
inferred← citeshttps://doi.org/10.1016/j.patcog.2017.09.008openalex-snapshot
A Novel clustering method based on hybrid K-nearest-neighbor graph
inferred← citeshttps://doi.org/10.1049/ipr2.12521openalex-snapshot
DS‐SRI: Diversity similarity measure against scaling, rotation, and illumination change for robust template matching
inferred← citeshttps://doi.org/10.1080/14685248.2022.2159421openalex-snapshot
An improved method for coherent structure identification based on mutual K-nearest neighbors
inferred← citeshttps://doi.org/10.1109/access.2019.2912332openalex-snapshot
Efficient Clustering Method Based on Density Peaks With Symmetric Neighborhood Relationship
inferred← citeshttps://doi.org/10.1109/access.2019.2962394openalex-snapshot
Local Peaks-Based Clustering Algorithm in Symmetric Neighborhood Graph
inferred← citeshttps://doi.org/10.1109/tkde.2020.2993193openalex-snapshot
SACCOS: A Semi-Supervised Framework for Emerging Class Detection and Concept Drift Adaption Over Data Streams
inferred← citeshttps://doi.org/10.1109/tpami.2017.2737424openalex-snapshot
Best-Buddies Similarity—Robust Template Matching Using Mutual Nearest Neighbors
inferred← citeshttps://doi.org/10.1109/tsp.2018.8441226openalex-snapshot
Data Clustering Based on Community Structure in Mutual k-Nearest Neighbor Graph
inferred← citeshttps://doi.org/10.36227/techrxiv.174857939.92624967/v1openalex-snapshot
Effective clustering algorithm for large data sets using density based clustering via message passing
inferred← citeshttps://doi.org/10.5121/ijaia.2021.12101openalex-snapshot
Graph Algorithm to Find Core Periphery Structures using Mutual K-nearest Neighbors
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.