Phishing Dynamic Evolving Neural Fuzzy Framework for Online Detection “Zero-day” Phishing Email
Bibliographic record
Abstract
Phishing is a kind of attack in which criminals use spoofed emails and fraudulent web sites to trick financial organization and customers. Criminals try to lure online users by convincing them to reveal the username, passwords, credit card number and updating account information or fill billing information. One of the main problems of phishing email detection is the unknown “zero-day” phishing attack, (we define zero-day attacks as attacks that phisher mount using hosts that do not appear in blacklists and not trained on the old data sample and it is a noise data), which increases the level of difficulty to detect phishing email. Nowadays, phishers are creating different representation techniques to create unknown “zero-day” phishing email to breach the defenses of those detectors. Our proposed is a novel framework called phishing dynamic evolving neural fuzzy framework (PDENF), which adapts the evolving connectionist system (ECoS) based on a hybrid (supervised/unsupervised) learning approach. PDENF adaptive online is enhanced by offline learning to detect dynamically the phishing email included unknown zero-day phishing e-mails before it get to user account. PDENF is suggested to work for high-speed “life-long” learning with low memory footprint and minimizes the complexity of the rule base and configuration with few number of rules creation for email classification. We expect to achieves high performance, including high level of true positive, true negative, sensitivity, precision, F-measure and overall accuracy compared with other approaches. Keywords: Phishing email, detection, zero-day, evolving connectionist System (Ecos).
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| 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".