MétaCan
Menu
Back to cohort
Record W1520425575 · doi:10.1007/978-3-540-73451-2_37

Rough Set Approach to Spam Filter Learning

2007· book-chapter· en· W1520425575 on OpenAlexaff
Mawuena Glymin, Wojciech Ziarko

Bibliographic record

VenueLecture notes in computer science · 2007
Typebook-chapter
Languageen
FieldComputer Science
TopicRough Sets and Fuzzy Logic
Canadian institutionsUniversity of Regina
Fundersnot available
KeywordsComputer scienceHeuristicsRough setFocus (optics)Filter (signal processing)Set (abstract data type)Construct (python library)Decision tableProbabilistic logicArtificial intelligenceSimple (philosophy)Data miningMachine learning

Abstract

fetched live from OpenAlex

This article presents an elementary overview of techniques employed for spam detection via probabilistic decision table-based predictive data modelling. The focus here is to present a solution that combines simple algorithms together with some heuristics to construct generalized rough approximations of spam and legitimate e-mails using the variable precision rough set (VPRSM) approach. Experiments were conducted to explore the application of VPRSM for designing an intelligent agent for spam filtering.

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 imitation

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

metaresearch head score (Codex)0.003
metaresearch head score (Gemma)0.007
Version: metacan-v3-hybrid-931329e0061cValidation 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.003
Threshold uncertainty score0.015

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0030.007
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0030.001
Bibliometrics0.0020.002
Science and technology studies0.0010.001
Scholarly communication0.0030.002
Open science0.0020.001
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0020.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.045
GPT teacher head0.265
Teacher spread0.220 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

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

Quick stats

Citations9
Published2007
Admission routes1
Has abstractno

Explore more

Same venueLecture notes in computer scienceSame topicRough Sets and Fuzzy LogicFrench-language works237,207