Data Mining-Based Cyber-Physical Attack Detection Tool for Attack-Resilient Adaptive Protective Relays
Bibliographic record
Abstract
Maintaining proper operation of adaptive protection schemes is one of the main challenges that must be considered for smart grid deployment. The use of reliable cyber detection and protection systems boosts the preparedness potential of the network as required by National Infrastructure Protection Plans (NIPPS). In an effort to enhance grid cyber-physical resilience, this paper proposes a tool to enable attack detection in protective relays to tackle the problem of compromising their online settings by cyber attackers. Implementing the tool first involves an offline phase in which Monte Carlo simulation is used to generate a training dataset. Using rough set classification, a set of If-Then rules is obtained for each relay and loaded to the relays at the initialization stage. The second phase occurs during online operation, with each updated setting checked by the corresponding relay’s built-in tool to determine whether the settings received are genuine or compromised. A test dataset was generated to assess tool performance using the modified IEEE 34-bus test feeder. Several assessment measures have been used for performance evaluation and their results demonstrate the tool’s superior ability to classify settings efficiently using physical properties only.
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.005 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.005 | 0.002 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| 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".