期刊文献+

基于聚类的兴趣区域间异常轨迹并行检测算法 被引量:1

An Algorithm for Detecting Anomalous Trajectory Between Interest Regions Based on Clustering
下载PDF
导出
摘要 轨迹异常检测能够用来分析移动对象的异常运动行为,在交通运输、医疗监护等领域都有广泛应用.兴趣区域是移动对象集中活动的区域.本文提出了一种新的兴趣区域间异常轨迹检测算法(Detecting Anomalous Trajectories Between Interest Regions,DATIR).不同于已有的从局部采样点进行检测的算法,DATIR算法综合考虑了轨迹的局部特征和全局特征,利用聚类方法检测兴趣区域间的异常轨迹,并能挖掘出兴趣区域间的正常路径.为了提高海量轨迹数据的异常检测效率,在DATIR算法的基础上,提出了一种并行检测算法(Parallel Algorithm for Detecting Anomalous Trajectories Between Interest Regions,PDATIR).实验结果表明,DATIR算法能够有效地检测兴趣区域间的异常轨迹,并且能够检测出兴趣区域间的正常轨迹;PDATIR算法在大数据集上表现出了明显的性能优势,具有较好的可扩展性和较高的加速比. Trajectory anomaly detection can be used to analyze the anomalous behavior mobile objects,and it has been widely used in transportation,medical monitoring and other fields. Interest region is an active activity area. They can be railway stations,airports,schools,shopping malls and so on. A new algorithm for detecting trajectory outliers between interest regions,called DATIR(Detecting Anomalous Trajectories between Interest Regions),is proposed. Unlike the existing algorithm to detect from the local sample points,algorithm DATIR takes into account the local and global characteristics of the trajectory,and uses clustering method to detect the normal path and anomalous trajectory between interest regions. Algorithm DATIR has a wide range of application areas,such as taxi fraud monitoring,road planning,and so on. In order to improve the efficiency of mining trajectory from massive trajectory datasets,the parallel algorithm for detecting trajectory outliers based on MapReduce framework,which is called PDATIR(Parallel algorithm for Detecting Anomalous Trajectories between Interest Regions),is presented. The experimental results demonstrate that algorithm DATIR can effectively detect the anomalous trajectories between regions of interest,and can mine the normal path. Algorithm PDATIR shows obvious performance advantages over large data sets,and it has the high scalability and good speedup ratio.
作者 许振 吉根林 唐梦梦 Xu Zhen;Ji Genlin;Tang Mengmeng(School of Computer Science and Technology,Nanjing Normal University,Nanjing 210023,China)
出处 《南京师大学报(自然科学版)》 CAS CSCD 北大核心 2019年第1期59-64,共6页 Journal of Nanjing Normal University(Natural Science Edition)
基金 国家自然科学基金(41471371)
关键词 异常轨迹检测 兴趣区域 聚类 MAPREDUCE trajectory outlier detection region of interest clustering MapReduce
  • 相关文献

参考文献4

二级参考文献210

  • 1张炜,李建中,刘禹.一种基于概率模型的预测性时空区域查询处理[J].软件学报,2007,18(2):279-290. 被引量:2
  • 2Knorr EM, Ng RT, Tucakov V. Distance-Based outliers: Algorithms and applications. VLDB Journal, 2000,8(3):237-253.
  • 3Ramaswamy S, Rastogi R, Shim K. Efficient algorithms for mining outliers from large data sets. In: Chen WD, Jeffrey FN, Philip AB, eds. Proc. of the SIGMOD 2000. New York: ACM, 2000. 427-438.
  • 4Breunig MM, Kriegel HP, Ng RT, Sander J. LOF: Identifying density-based local outliers. In: Chen WD, Jeffrey FN, Philip AB, eds. Proc. of the SIGMOD 2000. New York: ACM, 2000.93-104.
  • 5Papadimitriou S, Kitagawa H, Gibbons PB, Faloutsos C. LOCI: Fast outlier detection using the local correlation integral. In: Dayal U, Ramamritham K, Vijayaraman TM, eds. Proc. of the ICDE 2003. New York: IEEE Computer Society, 2003.315-326.
  • 6Aggarwal CC, Yu PS. Outlier detection for high dimensional data. In: Aref WG, ed. Proc. of the SIGMOD 2001. New York: ACM, 2001.37-46.
  • 7Lee J, Han J, Li X. Trajectory outlier detection: A partition-and-detect framework. In: Proe. of the ICDE 2008. New York: IEEE Computer Society, 2008. 140-149.
  • 8Chen J, Maylor K. Leung, Gao Y. Noisy logo recognition using line segment hausdorff distance. Pattern Recognition, 2003,36(4): 943-955.
  • 9Huttenlocher DP, Klanderman GA, Rucklidge WA. Comparing images using the hausdorff distance. IEEE Trans. on Pattern Analysis and Machine Intelligence, 1993,15(9):850-863.
  • 10Huttenlocher DP, Kcdem K, Sharir M. The upper envelope of voronoi surfaces and its applications. Discrete and Computational Geometry, 1993,9(1):267-291,.

共引文献175

同被引文献2

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部