arXiv CS
open access
Round-Trip KNN Clustering: multiscale hierarchical cluster detection on directed nearest-neighbour graphs
We introduce Round-Trip KNN Clustering (RTKNNC), a graph-based method for finding cluster structure at several neighbourhood scales without requiring the number of clusters in advance. Unlike approaches that first make a $k$-nearest-neighbour (KNN) graph undirected, RTKNNC keeps both directions of t
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Round-Trip KNN Clustering: multiscale hierarchical cluster detection on directed nearest-neighbour graphs#1215881
- GeoMetric: Injecting Metric Geographic Structure into Worldwide Image Geo-Localization#1084244
- Fast unsupervised ground metric learning with tree-Wasserstein distance#1156166
- NOC NOC, who's there? Clustering systems of tree-child and normal networks#1071138
- Penalized Likelihood Optimization for Adaptive Neighborhood Clustering in Time-to-Event Data with Group-Level Heterogeneity#1156253
Record · ID 1194426
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive