Efficient spectral embedding representation approximation for large-scale data clustering
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Spectral clustering is a prevalent clustering method in which an affinity matrix is constructed based on all samples (the number is n ), leading to high computational complexity and making it infeasible for dealing with large-scale data directly. In this study, we introduce an Approximate Spectral Embedding Representation method (ASER). By employing an anchor-based strategy, the spectral embedding representation of the selected anchors (the number is m , m ≪ n ) is used to approximate the spectral embedding representation of the original samples. Unlike available methods that approximate the similarity matrix based on an anchor graph, we directly implement the approximation in the spectral embedding space. Moreover, the properties of the formed anchor graph are inherited from the original space to the spectral embedding space. The time complexity of conducting spectral clustering is significantly reduced from O ( n 3 ) to be linear with respect to n , without relying on any acceleration operations for eigenvalue decomposition. Experimental results on toy examples and benchmark datasets with large sizes demonstrate the effectiveness and efficiency of the proposed model.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it