A Multicriterion Fuzzy Classification Method with Greedy Attribute Selection for Anomaly-based Intrusion Detection
Bibliographic record
Abstract
Intrusion is widely recognized as a chronic and recurring problem of computer systems’ security with the continual changes and increasing volume of hacking techniques. This paper explores a new countermeasure approach for anomaly-based intrusion detection using a multicriterion fuzzy classification method combined with a greedy attribute selection. The proposed approach has the advantage of dealing with various types of attributes including network traffic basic TCP/IP packet headers, as well as content-based, time-based and host-based attributes. At the same time, to reduce the dimensionality and increase the computational efficiency, the greedy attribute selection algorithm enables it to choose an optimal subset of attributes that is most relevant for detecting intrusive events. The simplicity of the constructed model allows it to be replicated at various network components in emerging open system infrastructures such as sensor networks, wireless ad hoc networks, cloud computing, and smart grids. The proposed approach is evaluated and compared on a commonly-used intrusion detection benchmark dataset. The results show more than 99.9% overall accuracy with high detection rates for various types of intrusions can be achieved with about 26% only of the available attributes.
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.003 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.002 | 0.002 |
| Bibliometrics | 0.003 | 0.003 |
| Science and technology studies | 0.001 | 0.001 |
| 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.001 | 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 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".