2020
DOI: 10.3390/e22030324
|View full text |Cite
|
Sign up to set email alerts
|

An Efficient Alert Aggregation Method Based on Conditional Rough Entropy and Knowledge Granularity

Abstract: With the emergence of network security issues, various security devices that generate a large number of logs and alerts are widely used. This paper proposes an alert aggregation scheme that is based on conditional rough entropy and knowledge granularity to solve the problem of repetitive and redundant alert information in network security devices. Firstly, we use conditional rough entropy and knowledge granularity to determine the attribute weights. This method can determine the different important attributes … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
9
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
6
1

Relationship

1
6

Authors

Journals

citations
Cited by 14 publications
(9 citation statements)
references
References 44 publications
0
9
0
Order By: Relevance
“…A threshold can be set as a fixed value of the correlation coefficient, or calculated from the average value of the feature correlation (Hostiadi et al, 2019). The security event similarity approach can also take into account event attribute weights assigned depending on the attack class (Sun et al, 2020). In addition, similarity can be defined both between event attributes of the same type, and between attributes of different types (Kotenko et al, 2018a(Kotenko et al, , 2020.…”
Section: Rule-based Modelsmentioning
confidence: 99%
“…A threshold can be set as a fixed value of the correlation coefficient, or calculated from the average value of the feature correlation (Hostiadi et al, 2019). The security event similarity approach can also take into account event attribute weights assigned depending on the attack class (Sun et al, 2020). In addition, similarity can be defined both between event attributes of the same type, and between attributes of different types (Kotenko et al, 2018a(Kotenko et al, , 2020.…”
Section: Rule-based Modelsmentioning
confidence: 99%
“…In this method, an efficient alarm clustering method based on the time distance between alarms is proposed, which is helpful to preserve adjacent alarms in a cluster. To solve the problem of a large number of redundant alarms generated by IDS, Sun and Chen [1] proposed an alarm aggregation scheme based on the combination of conditional rough entropy and knowledge granularity. Based on this scheme, the weights of different attributes in the alarms were obtained, and the similarity values of the alarms were calculated within the sliding time window to aggregate the similar alarms to reduce redundant alarms.…”
Section: Literature Reviewmentioning
confidence: 99%
“…With the continuous development of computer network technology, people are more and more dependent on the convenience brought by the internet, but at the same time, the characteristics of the network, such as openness and complexity, also lead to the complexity and diversity of network security threats. In order to avoid the damage caused by network threats, many network security technologies are widely used, such as firewall, intrusion detection system (IDS), vulnerability scanning program and so on [1]. This study mainly focuses on the IDS, especially on how to improve the efficiency and performance of the IDS when dealing with network security events.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…It simply means that there is a series of relevant actions within a contiguous time proximity and worthy of being analyzed collectively. Many alert aggregation efforts exist and shed lights on various contextually meaningful attributes, e.g., [28]- [31]. Different from many existing works, finding A here is not meant to aggregate similar alerts into a meta-alert.…”
Section: Alert Streams and Aggregation Of Attack Actionsmentioning
confidence: 99%