An improved relative integral capacity-K-means clustering method for capacity pre-sorting of decommissioned power batteries
Bibliographic record
Abstract
Abstract Capacity sorting is the primary prerequisite for the stepwise utilization of decommissioned power batteries. This study proposes an improved relative integral capacity-K-means clustering (RIC-KMC) method for preliminary sorting of decommissioned power battery capacity. Firstly, according to the electrochemical aging characteristics of decommissioned power batteries, combined with the ampere-time integration algorithm, a new lossless extraction method of the capacity characteristics of Lithium-ion batteries based on the segment voltage is proposed. Second, to minimize the interference of environmental factors and sampling errors on the charging capacity, the relative amount of charging capacity is introduced. Finally, to complete the capacity sorting before the ladder utilization, an improved RIC-KMC method is proposed, which combines the electrochemical aging feature values of decommissioned power batteries extracted from the segment voltage charging capacity with the K-means clustering algorithm. Using three sets of battery charging and discharging data to validate the sorting algorithm, the capacity sorting errors are reduced by 0.926%, 12.381%, and 10.185%, respectively, which verification the validity of the proposed RIC-KMC method. This study provides a new solution for capacity pre-sorting of decommissioned power batteries for stepwise utilization.
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.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.003 | 0.002 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.002 | 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".