Spam Filtering by Using a Compound Method of Feature Selection
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.
Bibliographic record
Abstract
Nowadays, the increase volume of Spams has been annoying for the internet users. In the recent years, the applying of machine learning techniques has attracted many researches’ attention for automatic filtering of Spams. In this article, a system of spam filtering has been presented based on Adaboost algorithm. In the proposed method, the available terms in email have been used as the basic features in classifying email issues. That is why the feature selection has an important role in effective improvement of Spam filtering In the proposed filtering system, a compound method has been used to identify related features and remove unrelated features, and the results have been tested and compared on a standard data set of Ling-Spam. Finally, to compare the obtained results, several other algorithms have been applied on the data and their results are compared with the obtained results. The results of the experiments clear the fact that this system has an acceptable efficiency about 0,983.
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 imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 it