低速率拒绝服务攻击(low-ratedenial-of-service,简称LDoS)比传统的DDoS(distributed DoS)攻击更具隐蔽性和欺骗性,依据其周期性脉冲突发特点,设计实现了一种基于小波特征提取的LDoS检测系统DSBWA(detection system based on wavelet an...低速率拒绝服务攻击(low-ratedenial-of-service,简称LDoS)比传统的DDoS(distributed DoS)攻击更具隐蔽性和欺骗性,依据其周期性脉冲突发特点,设计实现了一种基于小波特征提取的LDoS检测系统DSBWA(detection system based on wavelet analysis).该系统以到达检测节点的数据包数目为研究对象,通过小波多尺度分析,结合LDoS的攻击规律提取5个特征指标,在此基础上采用BP神经网络进行综合诊断.一旦检测出LDoS攻击,系统定位攻击脉冲数据的到达时刻以获得攻击者的相关信息.NS-2模拟实验结果表明,DSBWA具有高检测率和低误警率,并且能够检测出LDoS变种攻击,消耗计算资源少,具有良好的实用价值.展开更多
Frequent Pattern mining plays an essential role in data mining. Most of the previous studies adopt an Apriori-like candidate set generation-and-test approach. However, candidate set generation is still costly, especia...Frequent Pattern mining plays an essential role in data mining. Most of the previous studies adopt an Apriori-like candidate set generation-and-test approach. However, candidate set generation is still costly, especially when there exist prolific patterns and/or long patterns.In this study, we introduce a novel frequent pattern growth (FP-growth)method, which is efficient and scalable for mining both long and short frequent patterns without candidate generation. And build a new project frequent pattern growth (PFP-tree)algorithm on this study, which not only heirs all the advantages in the FP-growth method, but also avoids it's bottleneck in database size dependence. So increase algorithm's scalability efficiently.展开更多
文摘低速率拒绝服务攻击(low-ratedenial-of-service,简称LDoS)比传统的DDoS(distributed DoS)攻击更具隐蔽性和欺骗性,依据其周期性脉冲突发特点,设计实现了一种基于小波特征提取的LDoS检测系统DSBWA(detection system based on wavelet analysis).该系统以到达检测节点的数据包数目为研究对象,通过小波多尺度分析,结合LDoS的攻击规律提取5个特征指标,在此基础上采用BP神经网络进行综合诊断.一旦检测出LDoS攻击,系统定位攻击脉冲数据的到达时刻以获得攻击者的相关信息.NS-2模拟实验结果表明,DSBWA具有高检测率和低误警率,并且能够检测出LDoS变种攻击,消耗计算资源少,具有良好的实用价值.
文摘Frequent Pattern mining plays an essential role in data mining. Most of the previous studies adopt an Apriori-like candidate set generation-and-test approach. However, candidate set generation is still costly, especially when there exist prolific patterns and/or long patterns.In this study, we introduce a novel frequent pattern growth (FP-growth)method, which is efficient and scalable for mining both long and short frequent patterns without candidate generation. And build a new project frequent pattern growth (PFP-tree)algorithm on this study, which not only heirs all the advantages in the FP-growth method, but also avoids it's bottleneck in database size dependence. So increase algorithm's scalability efficiently.
