MétaCan
Menu
Back to cohort
Record W2084288830 · doi:10.1142/s0218194010004669

SEMI-SUPERVISED DYNAMIC CLASSIFICATION FOR INTRUSION DETECTION

2010· article· en· W2084288830 on OpenAlex

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueInternational Journal of Software Engineering and Knowledge Engineering · 2010
Typearticle
Languageen
FieldComputer Science
TopicNetwork Security and Intrusion Detection
Canadian institutionsUniversity of Calgary
Fundersnot available
KeywordsComputer scienceCluster analysisData miningSupport vector machineDBSCANClassifier (UML)Intrusion detection systemArtificial intelligenceTest dataPattern recognition (psychology)Data setTraining setMachine learningFuzzy clusteringCanopy clustering algorithm

Abstract

fetched live from OpenAlex

In this paper, a new framework to build an adaptive classifier is introduced. At first, a clustering algorithm, Density-Based Spatial Clustering of Applications with Noise (DBSCAN) is applied to a set of sample data to form initial set of clusters. The clusters are represented as classes. Using support vector machine (SVM), a classifier model is generated. In real world application, data comes in continuously. Therefore, if the model does not learn from the new data, the model may not perform as well with the new data especially when the model's training data is different from the test data. The new framework proposed in this paper rebuilds the classifier model using selected data from test data set to improve the accuracy of the model. A case study on intrusion detection data set has been performed to evaluate our methodology. The result shows that this approach lead to have more accurate classification models over time.

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 imitation

Not 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.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.001
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.949
Threshold uncertainty score0.580

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.007
GPT teacher head0.230
Teacher spread0.223 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it