首页 | 官方网站   微博 | 高级检索  
     

点集数据不规则形状时空异常聚类模式挖掘研究
引用本文:万幼,周脚根,翁敏.点集数据不规则形状时空异常聚类模式挖掘研究[J].武汉大学学报(信息科学版),2017,42(7):924-930.
作者姓名:万幼  周脚根  翁敏
作者单位:1.武汉大学资源与环境科学学院, 湖北 武汉, 430079
基金项目:国家自然科学基金41471327国家自然科学基金41001231
摘    要:传统扫描统计方法在进行时空异常聚类模式挖掘时,受扫描窗口形状的限制,不能准确地获取聚类区域形状。提出一种改进的不规则形状时空异常聚类模式挖掘方法stAntScan。新方法基于26方位时空邻近单元格构建时空邻接矩阵,再对蚁群最优化扫描统计方法进行改进,使其能适应三维大数据量的时空区域扫描。模拟数据和真实微博签到数据的实验证明,stAntScan能有效地识别时空范围内的不规则形状异常聚类,并且准确性较经典的SaTScan方法高。

关 键 词:时空聚类    时空异常    空间点模式    空间数据挖掘    时空数据挖掘
收稿时间:2015-08-07

Research on Irregularly Shaped Spatio-Temporal Abnormal Cluster Pattern Mining for Spatial Point Data Sets
Affiliation:1.School of Resource and Environmental Sciences, Wuhan University, Wuhan 430079, China2.Institute of Subtropical Agriculture, Chinese Academy of Sciences, Changsha 410125, China
Abstract:Spatio-temporal abnormal cluster pattern is an important spatial point pattern. The pattern results can reflect the distribution and evolution of spatio-temporal events timely and accurately. Early researches has verified the scan statistic based clustering methods are very effective in detection spatial and spatio-temporal abnormal cluster pattern. However, due to the fixed shape of scan window, traditional scan statistic based clustering methods have limitation on obtaining exact shape and size of cluster. This paper proposed an improved irregularly shaped spatio-temporal abnormal cluster pattern mining algorithm stAntScan. The algorithm constructs the spatio-temporal neighborhood matrix by a newly defined 26 directions spatio-temporal neighbor cells. Then the algorithm improves the ant colony optimization based method to fit for spatio-temporal scanning on three-dimensional large data set. In the end, the Monte Carlo simulation method is used to test the significance of clusters. Experimental results on both simulated data and real Weibo check-in data have testified the efficiency and accuracy of stAntScan on irregularly shaped spatio-temporal abnormal cluster pattern mining. And compared with the classical SaTScan, it gets much better results in finding exact shape and size of clusters.
Keywords:
本文献已被 CNKI 等数据库收录!
点击此处可从《武汉大学学报(信息科学版)》浏览原始摘要信息
点击此处可从《武汉大学学报(信息科学版)》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号