摘要
提出了一种基于连通树的热区检测算法,可检测任意形状的热区,目的是通过检测兵棋推演过程中军事行动频繁的区域,为受训人员了解整个战场态势提供辅助参考.算法在明确了热区定义的基础上,首先构建连通树将数据集按连通区域进行最小划分,再根据设定的密度阈值对连通树进行剪枝.剪枝处理后的每棵连通子树是最终的热区.理论和实验结果均验证了该算法的有效性.
A hotspot detection algorithm based on connected tree is proposed, which is capable ofdetecting arbitrarily shaped hotspots during the wargaming process. By detecting the areas with high concentrations of martial events, this algorithm could assist trainees understanding the whole wargaming battlefield situation. After making the definition of a hotspot, a connected tree is built in order to least divide the whole dataset into connected regions, and a pruning procedure is carried out according to the provided density threshold value, Each pruned connected subtree is a hotspot which we would like to acquire. Both the theoretical analysis and experimental results verify the effectiveness of the algorithm.
出处
《系统工程理论与实践》
EI
CSSCI
CSCD
北大核心
2012年第2期323-329,共7页
Systems Engineering-Theory & Practice
基金
国防预研基金(9140A04040109KG)
中国博士后科学基金(201003746)
关键词
兵棋推演
连通区域
热区检测
连通树
wargaming
connected area
hotspot detection
connected tree