检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]School of Computer and Communication Engineering,University of Science and Technology Beijing [2]Beijing Key Laboratory of Knowledge Engineering for Materials Science
出 处:《China Communications》2013年第9期120-129,共10页中国通信(英文版)
基 金:supported by the National Natural Science Foundation of China under Grants No.61172049,No.61003251;the National High Technology Research and Development Program of China(863 Program)under Grant No.2011AA040101;the Doctoral Fund of Ministry of Education of Chinaunder Grant No.20100006110015
摘 要:The clustering of trajectories over huge volumes of streaming data has been rec- ognized as critical for many modem applica- tions. In this work, we propose a continuous clustering of trajectories of moving objects over high speed data streams, which updates online trajectory clusters on basis of incremental line- segment clustering. The proposed clustering algorithm obtains trajectory clusters efficiently and stores all closed trajectory clusters in a bi- tree index with efficient search capability. Next, we present two query processing methods by utilising three proposed pruning strategies to fast handle two continuous spatio-temporal queries, threshold-based trajectory clustering queries and threshold-based trajectory outlier detections. Finally, the comprehensive experi- mental studies demonstrate that our algorithm achieves excellent effectiveness and high effi- ciency for continuous clustering on both syn- thetic and real streaming data, and the propo- sed query processing methods utilise average 90% less time than the naive query methods.The clustering of trajectories over huge volumes of streaming data has been recognized as critical for many modern applications.In this work,we propose a continuous clustering of trajectories of moving objects over high speed data streams,which updates online trajectory clusters on basis of incremental linesegment clustering.The proposed clustering algorithm obtains trajectory clusters efficiently and stores all closed trajectory clusters in a bitree index with efficient search capability.Next,we present two query processing methods by utilising three proposed pruning strategies to fast handle two continuous spatio-temporal queries,threshold-based trajectory clustering queries and threshold-based trajectory outlier detections.Finally,the comprehensive experimental studies demonstrate that our algorithm achieves excellent effectiveness and high efficiency for continuous clustering on both synthetic and real streaming data,and the proposed query processing methods utilise average90%less time than the naive query methods.
关 键 词:trajectory clustering moving obj-ect continuous query trajectory cluster trajec-tory outlier
分 类 号:TP311.13[自动化与计算机技术—计算机软件与理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.44