带分类值排列算法的改进的Parallel Sets  

Improved Parallel Sets with Categories Arrangements

作　　者：孙扬[1] 周城[1] 汤大权[1] 肖卫东[1] 

机构地区：[1]国防科技大学C4ISR技术国防科技重点实验室,长沙市410073

出　　处：《武汉大学学报（信息科学版）》2011年第2期144-147,共4页Geomatics and Information Science of Wuhan University

基　　金：国家自然科学基金资助项目(60903225);国防科技大学优秀研究生创新基金资助项目(B080503)

摘　　要：针对分类型可视化工具Parallel Sets任意排列分类值产生较多交叉的不足,提出了基于中位数的启发式分类值排列算法,自动优化分类值布局顺序,减轻视图中的可视混乱,而后应用改进的Parallel Sets分析了全球恐怖主义数据库。实验结果表明,改进的Parallel Sets可清晰展现国际恐怖主义数据库中各分类值间的关联,从而辅助用户获取不同恐怖组织的行为特征等隐性信息;基于中位数的启发式分类值排列算法简单高效,适用于数据量较大、分类值较多的数据集。To alleviate the deficiency of excessive edge crossing brought by random layout of categories in categorical data visualization—parallel sets,we propose a heuristic layout algorithm based on median,which optimise the layout order of categories such that visual clutter is eased.And then we utilize the improved parallel sets to analyze the global terrorism database（GTD）.The experimental results show that the improved parallel sets can clearly express the association among the multi-categories in GTD,thereby assist users in analyzing the implicit information of various terrorist organizations,such as the behavior characteristics.Furthermore,the median-based heuristic is simple and has high efficiency,which is suitable for large data sets with many categorical attributes.

关 键 词：平行集 边交叉问题 恐怖主义 可视化分析 信息可视化 

分 类 号：P208[天文地球—地图制图学与地理信息工程]