介绍了规划识别的基本概念和入侵检测对规划识别的需求;接着给出了加权规划知识图的定义,并研究了加权规划知识图中各种关系节点之间支持程度的计算方法;在此基础上,提出了基于加权规划知识图的入侵规划识别算法,并以简化的网络入侵规划库为例验证了基于加权规划知识图的入侵规划识别算法的有效性;最后给出了实验结果,实验结果表明本文提出的算法能够满足入侵检测对规划识别的需求,并且具有很高的求解速度和良好的可扩展性。
The fundamental conception of plan recognition and the requirements on plan recognition in IDS are introduced firstly. And then the definition of weighted planning knowledge graph and the calculating supporting degree method of various relations in weighted planning knowledge graph are presented. Subsequently, the intrusion plan recognition arithmetic is put forward. The validity of this arithmetic is shown by a simplified intrusion plan. The experimental result shows that the new arithmetic can meet the requirements of IDS and has better performance and excellent scalability.