arXiv (All)
open access
Minimum Description Length based Granular-Ball Tree Regularization for Spectral Clustering
This paper proposes Minimum Description Length based Granular-Ball Tree Regularized Spectral Clustering (MDL-GBTRSC), a fixed-K method that uses granular balls as regional descriptors for sample-level affinity construction rather than as reduced graph nodes. A reciprocal-neighborhood continuity term
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
- RaG-Tree: Combining R-Tree and HNSW for Multi-Attribute Range Filtered Approximate Nearest Neighbor Search#424079
- Unified Dominance Graph for Interval-Predicate Approximate Nearest Neighbor Search#303305
- When One Point Is Not Enough: Addressing Ambiguous Instances in Dimensionality Reduction by Splitting#222617
- Default-Distance Entropy and Metric Dimension in Finite Geometries#781079
- Default-Distance Entropy and Metric Dimension in Finite Geometries#779704
Record · ID 1131542
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