Zhang Chao, Zheng Yu, Ma Xiuli, Han Jiawei
Dept. of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL, USA.
Microsoft Research, Beijing, China.
KDD. 2015 Aug;2015:1415-1424. doi: 10.1145/2783258.2783394.
Recent years have witnessed the wide proliferation of geo-sensory applications wherein a bundle of sensors are deployed at different locations to cooperatively monitor the target condition. Given massive geo-sensory data, we study the problem of mining spatial co-evolving patterns (SCPs), ., groups of sensors that are spatially correlated and co-evolve frequently in their readings. SCP mining is of great importance to various real-world applications, yet it is challenging because (1) the truly interesting evolutions are often flooded by numerous trivial fluctuations in the geo-sensory time series; and (2) the pattern search space is extremely large due to the spatiotemporal combinatorial nature of SCP. In this paper, we propose a two-stage method called Assembler. In the first stage, Assembler filters trivial fluctuations using wavelet transform and detects frequent evolutions for individual sensors via a segment-and-group approach. In the second stage, Assembler generates SCPs by assembling the frequent evolutions of individual sensors. Leveraging the spatial constraint, it conceptually organizes all the SCPs into a novel structure called the SCP search tree, which facilitates the effective pruning of the search space to generate SCPs efficiently. Our experiments on both real and synthetic data sets show that Assembler is effective, efficient, and scalable.
近年来,地理传感应用广泛普及,其中一系列传感器部署在不同位置,以协同监测目标状况。针对海量的地理传感数据,我们研究挖掘空间共同演化模式(SCP)的问题,即空间相关且读数频繁共同演化的传感器组。SCP挖掘对各种实际应用至关重要,但具有挑战性,原因如下:(1)真正有趣的演化往往被地理传感时间序列中的大量琐碎波动所淹没;(2)由于SCP的时空组合性质,模式搜索空间极大。在本文中,我们提出一种名为汇编器(Assembler)的两阶段方法。在第一阶段,汇编器使用小波变换过滤琐碎波动,并通过分段分组方法检测单个传感器的频繁演化。在第二阶段,汇编器通过组合单个传感器的频繁演化来生成SCP。利用空间约束,它从概念上将所有SCP组织成一种名为SCP搜索树的新颖结构,这有助于有效修剪搜索空间,从而高效地生成SCP。我们在真实数据集和合成数据集上的实验表明,汇编器是有效、高效且可扩展的。