Efficient detection of emergency event from moving object data streams
文献类型：会议论文
| 作者 | Guo, Limin (1) ; Huang, Guangyan (2) ; Ding, Zhiming (1) |
| 出版日期 | 2014 |
| 会议名称 | 19th International Conference on Database Systems for Advanced Applications, DASFAA 2014 |
| 会议日期 | April 21, 2014 - April 24, 2014 |
| 会议地点 | Bali, Indonesia |
| 页码 | 422-437 |
| 中文摘要 | The advance of positioning technology enables us to online collect moving object data streams for many applications. One of the most significant applications is to detect emergency event through observed abnormal behavior of objects for disaster prediction. However, the continuously generated moving object data streams are often accumulated to a massive dataset in a few seconds and thus challenge existing data analysis techniques. In this paper, we model a process of emergency event forming as a process of rolling a snowball, that is, we compare a size-rapidly-changed (e.g., increased or decreased) group of moving objects to a snowball. Thus, the problem of emergency event detection can be resolved by snowball discovery. Then, we provide two algorithms to find snowballs: a clustering-and-scanning algorithm with the time complexity of O(n 2) and an efficient adjacency-list-based algorithm with the time complexity of O(nlogn). The second method adopts adjacency lists to optimize efficiency. Experiments on both real-world dataset and large synthetic datasets demonstrate the effectiveness, precision and efficiency of our algorithms © 2014 Springer International Publishing Switzerland. |
| 英文摘要 | The advance of positioning technology enables us to online collect moving object data streams for many applications. One of the most significant applications is to detect emergency event through observed abnormal behavior of objects for disaster prediction. However, the continuously generated moving object data streams are often accumulated to a massive dataset in a few seconds and thus challenge existing data analysis techniques. In this paper, we model a process of emergency event forming as a process of rolling a snowball, that is, we compare a size-rapidly-changed (e.g., increased or decreased) group of moving objects to a snowball. Thus, the problem of emergency event detection can be resolved by snowball discovery. Then, we provide two algorithms to find snowballs: a clustering-and-scanning algorithm with the time complexity of O(n 2) and an efficient adjacency-list-based algorithm with the time complexity of O(nlogn). The second method adopts adjacency lists to optimize efficiency. Experiments on both real-world dataset and large synthetic datasets demonstrate the effectiveness, precision and efficiency of our algorithms © 2014 Springer International Publishing Switzerland. |
| 收录类别 | CPCI ; EI |
| 会议录出版地 | Springer Verlag |
| 语种 | 英语 |
| ISSN号 | 3029743 |
| ISBN号 | 978-3-319-05813-9; 978-3-319-05812-2 |
| 源URL | [http://ir.iscas.ac.cn/handle/311060/16513]  |
| 专题 | 软件研究所_软件所图书馆_会议论文 |
| 推荐引用方式 GB/T 7714 | Guo, Limin ,Huang, Guangyan ,Ding, Zhiming . Efficient detection of emergency event from moving object data streams[C]. 见:19th International Conference on Database Systems for Advanced Applications, DASFAA 2014. Bali, Indonesia. April 21, 2014 - April 24, 2014. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。