一个基于歧视性TF-IDF信念规则基础的垃圾邮件检测模型
Xiting Yang1, Wenkai Zhou1, Xiping Duan2
1School of Computer Science and Information Engineering, Harbin Normal University, Harbin, 150025, China.
Scientific reports
|March 4, 2026
概括
本研究介绍了一种新的垃圾邮件检测模型,使用带有信念规则基础 (BRB) 的歧视性TF-IDF. 它有效地处理有限的数据,为早期威胁检测提供准确和可解释的垃圾邮件识别.
科学领域:
- 计算机科学 计算机科学
- 人工智能的人工智能
- 机器学习 机器学习
背景情况:
- 新型垃圾邮件迅速发展,为早期检测而缺乏标记数据.
- 目前的垃圾邮件检测模型由于依赖于大型数据集和高维特征,因此难以概括和解释.
- 当前模型中的不透明性阻碍了错误追踪,并限制了早期威胁响应.
研究的目的:
- 提出一种新的信念规则基础 (BRB) 垃圾邮件检测模型,利用歧视性TF-IDF (DTI-BRB).
- 解决垃圾邮件检测中小样本条件,概括性差,决策不透明等挑战.
- 通过可解释和准确的模型,增强早期威胁检测和响应能力.
主要方法:
- 开发了一种歧视性TF-IDF (TF-IDF) 方法,将原始文本转换为低维特征,识别标志着垃圾邮件或垃圾邮件的术语.
- 将歧视性TF-IDF功能集成到信念规则基础 (BRB) 专家系统中,以减轻组合爆炸问题.
- 在小样本条件下通过两个案例研究验证了DTI-BRB模型.
主要成果:
- 在两个不同的案例研究中,DTI-BRB模型在仅200个样本中实现了91.5%和95.5%的高精度.
- 即使使用有限的标记数据,也显示出出色的预测性能,在低数据场景中表现优于传统模型.
- BRB的基于规则的推理提供了决策的解释性,促进了错误追踪.
结论:
- 拟议的DTI-BRB模型有效地解决了数据稀缺性和垃圾邮件检测特征维度的挑战.
- 该模型为早期垃圾邮件检测提供了可行的解决方案,提供了高精度和可解释的决策.
- 这种方法增强了网络安全专家系统对不断变化的威胁的实际应用.
相关概念视频
Quantifying and Rejecting Outliers: The Grubbs Test
4.3K
Sometimes, a data set can have a recorded numerical observation that greatly deviates from the rest of the data. Assuming that the data is normally distributed, a statistical method called the Grubbs test can be used to determine whether the observation is truly an outlier. To perform a two-tailed Grubbs test, first, calculate the absolute difference between the outlier and the mean. Then, calculate the ratio between this difference and the standard deviation of the sample. This...
4.3K
Expected Frequencies in Goodness-of-Fit Tests
8.8K
A goodness-of-fit test is conducted to determine whether the observed frequency values are statistically similar to the frequencies expected for the dataset. Suppose the expected frequencies for a dataset are equal such as when predicting the frequency of any number appearing when casting a die. In that case, the expected frequency is the ratio of the total number of observations (n) to the number of categories (k).
8.8K
Classification of Signals
1.5K
In signal processing, signals are classified based on various characteristics: continuous-time versus discrete-time, periodic versus aperiodic, analog versus digital, and causal versus noncausal. Each category highlights distinct properties crucial for understanding and manipulating signals.
A continuous-time signal holds a value at every instant in time, representing information seamlessly. In contrast, a discrete-time signal holds values only at specific moments, often denoted as x(n), where...
A continuous-time signal holds a value at every instant in time, representing information seamlessly. In contrast, a discrete-time signal holds values only at specific moments, often denoted as x(n), where...
1.5K
Difference from Background: Limit of Detection
8.7K
The limit of detection (LOD) is the smallest amount of analyte that can be distinguished from the background noise. The LOD value corresponds to the concentration at which the analyte signal is three times larger than the standard deviation of the blank signal. Below this value, the analyte signal cannot be differentiated from the background noise. It is calculated by dividing the calibration slope by 3 times the standard deviation of the blank signals.
The LOD indicates the presence or absence...
The LOD indicates the presence or absence...
8.7K
Detection of Black Holes
2.6K
Although black holes were theoretically postulated in the 1920s, they remained outside the domain of observational astronomy until the 1970s.
Their closest cousins are neutron stars, which are composed almost entirely of neutrons packed against each other, making them extremely dense. A neutron star has the same mass as the Sun but its diameter is only a few kilometers. Therefore, the escape velocity from their surface is close to the speed of light.
Not until the 1960s, when the first neutron...
Their closest cousins are neutron stars, which are composed almost entirely of neutrons packed against each other, making them extremely dense. A neutron star has the same mass as the Sun but its diameter is only a few kilometers. Therefore, the escape velocity from their surface is close to the speed of light.
Not until the 1960s, when the first neutron...
2.6K
Prediction Intervals
3.5K
The interval estimate of any variable is known as the prediction interval. It helps decide if a point estimate is dependable.
However, the point estimate is most likely not the exact value of the population parameter, but close to it. After calculating point estimates, we construct interval estimates, called confidence intervals or prediction intervals. This prediction interval comprises a range of values unlike the point estimate and is a better predictor of the observed sample value, y.
However, the point estimate is most likely not the exact value of the population parameter, but close to it. After calculating point estimates, we construct interval estimates, called confidence intervals or prediction intervals. This prediction interval comprises a range of values unlike the point estimate and is a better predictor of the observed sample value, y.
3.5K


