2023
DOI: 10.1080/23742917.2022.2162195
|View full text |Cite
|
Sign up to set email alerts
|

The WSN intrusion detection method based on deep data mining

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(4 citation statements)
references
References 21 publications
0
4
0
Order By: Relevance
“…Input: Imbalanced train set S, scaling factor K, instance hardness threshold IH′, and sample threshold UB Output: New train set S N (1) Step1: Distinguish between easy sets and difcult sets for each sample∈ S do (2) Compute its K nearest neighbors and IH if IH > IH′ then (3) Put the samples into the difcult set (4) end (5) end (6) Difcult set S D and easy set S E � S − S D (7) Step2: Compress the majority samples in the difcult set by the cluster centroid (8) Take all the majority samples from S D and set it as S Maj (9) Use the K-means algorithm with K cluster (10) Use the coordinates of K cluster centroids and replace the majority samples in S Maj (11) Compressed the majority sample set S Maj (12) Step3: Sample the minority samples in the difcult set using the SMOTE algorithm (13) Take all the majority samples from S D and set it as S Min (14) for each sample ∈ S Min do (15) Using SMOTE sampling, the sampling threshold is set to UB (16) Putting new samples into S Z (17) end (18) Step : Merge sample sets (19) Precision is the ratio of the number of samples with positive real values to the number of samples predicted to be positive, which can represent the ability of the model to predict positive samples as follows:…”
Section: Evaluation Metrics and Baseline Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…Input: Imbalanced train set S, scaling factor K, instance hardness threshold IH′, and sample threshold UB Output: New train set S N (1) Step1: Distinguish between easy sets and difcult sets for each sample∈ S do (2) Compute its K nearest neighbors and IH if IH > IH′ then (3) Put the samples into the difcult set (4) end (5) end (6) Difcult set S D and easy set S E � S − S D (7) Step2: Compress the majority samples in the difcult set by the cluster centroid (8) Take all the majority samples from S D and set it as S Maj (9) Use the K-means algorithm with K cluster (10) Use the coordinates of K cluster centroids and replace the majority samples in S Maj (11) Compressed the majority sample set S Maj (12) Step3: Sample the minority samples in the difcult set using the SMOTE algorithm (13) Take all the majority samples from S D and set it as S Min (14) for each sample ∈ S Min do (15) Using SMOTE sampling, the sampling threshold is set to UB (16) Putting new samples into S Z (17) end (18) Step : Merge sample sets (19) Precision is the ratio of the number of samples with positive real values to the number of samples predicted to be positive, which can represent the ability of the model to predict positive samples as follows:…”
Section: Evaluation Metrics and Baseline Methodsmentioning
confidence: 99%
“…Te experimental results show that the accuracy of the model has improved signifcantly. Ling et al [16] proposed a multiclassifer ensemble algorithm based on probability weighted voting to improve model accuracy. Xu et al [17] proposed a weighted majority algorithm based on the random forest to improve the performance of the random forest, and the model is trained on nontrafc datasets, so it has the ability to detect unknown trafc types.…”
Section: Improved Machine Learning Algorithms For Networkmentioning
confidence: 99%
“…Additionally, it employs a dynamic tree growth strategy to reduce model complexity, thereby accelerating the training speed of the model. Dong and colleagues [32] presented a distributed intrusion detection model that utilizes both DF and Random Forest classifiers. The designed model exhibits a lightweight Random Forest classifier deployment on sensors and cluster head nodes, while the DF model is deployed at the base station.…”
Section: Df-based Intrusion Detection Algorithmsmentioning
confidence: 99%
“…Wireless Sensor Network (WSN) [1,2] is a type of large-scale ad-hoc network that has small devices, sensors, and modern computing components. This network is properly monitored and controlled with the use of sensors, many wireless nodes, and low power computing devices.…”
Section: Introductionmentioning
confidence: 99%