Multi cluster parallel spectral clustering algorithm for distribution area power network loss rate evaluation
Bibliographic record
Abstract
Rapid and accurate assessment of power network loss in the power system has become a key research topic for the vast and diverse dataset of power grid operation.This study integrates data mining techniques with typical scenario modeling concepts and innovatively designs a distribution area power network loss rate multi population parallel spectral clustering evaluation strategy that incorporates distribution characteristics.Firstly, clustering attributes are determined for power network loss evaluation, and a power network loss evaluation framework based on clustering algorithms is proposed.Based on power flow calculation, the distribution characteristics and indicator system of each node's output are analyzed; Secondly, in order to improve the clustering accuracy of power network loss evaluation, spectral clustering algorithm is introduced, and automatic algorithm design is carried out to address the issue of manually setting the initial number of clusters and cluster centers.Then, multi cluster partitioning and parallel computing methods are used to significantly improve the computational efficiency of spectral clustering algorithm; Finally, to verify the practicality of this method, a provincial power grid was selected as a case study.The results showed that this method not only has high accuracy in evaluating power network loss, but also has excellent computational efficiency, demonstrating good feasibility in practical engineering applications.
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.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.005 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.004 | 0.003 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".