深度卷积记忆网络时空数据模型

时空数据是包含时间和空间属性的数据类型.研究时空数据需要设计时空数据模型,用以处理数据与时间和空间的关系,得到信息对象由于时间和空间改变而产生的行为状态变化的趋势.交通信息数据是一类典型的时空数据.由于交通网络的复杂性和多变性,以及与时间和空间的强耦合性,使得传统的系统仿真和数据分析方法不能有效地得到数据之间的关系.本文通过对交通数据中临近空间属性信息的处理,解决了由于传统时空数据模型只关注时间属性导致模型对短时间间隔数据预测能力不足的问题,进而提高模型预测未来信息的能力.本文提出一个全新的时空数据模型—深度卷积记忆网络.深度卷积记忆网络是一个包含卷积神经网络和长短时间记忆网络的多元网络结构,可以提取数据的时间和空间属性信息,通过加入周期和镜像特征提取模块对网络进行修正.通过对两类典型时空数据集的验证,表明深度卷积记忆网络在预测短时间间隔的数据信息时,相较于传统的时空数据模型,不仅预测误差有了很大程度的降低,而且模型的训练速度也得到提升.     

时空数据表达研究

描述了目前时态数据模型和时空数据模型的发展,现已共识时态是任何信息的一个重要属性,但是时态数据库中时态关系代数的基本思路是通过在关系模式上显式化时变语义来进行简单结构的时态数据建模,而时空数据建模中时态对象代数是在对象结构上显式化时变语义来进行复杂结构的时态数据建模,并深入探讨了时空数据模型中地理信息的时间维表达方式,指出了各种时空数据模型存在的主要问题。     

特征-版本时空数据模型的研究

讨论传统时空数据模型的特点,设计了Geodatabase支持下的基于特征-版本的时空数据模型,并详细介绍该模型的时态逻辑关系和存储结构.该模型节约了数据存储空间,有效保持地理现象的完整性,并具有较高的时空查询效率.针对扎龙湿地,构建了湿地时空数据库,并设计扎龙湿地时态地理信息系统,实现历史重构、地理对象发展与回溯、时空复合查询等功能,有效完成湿地时空数据的管理任务.     

基于GIS林权变更信息管理系统的设计

现有林权变更信息管理系统仅支持空间信息和属性信息的查询、管理和分析。运用地理信息系统对林地林木空间位置、属性信息、时闻信息进行组织管理,构建面向对象的时空数据模型,在此基础上建立时空数据组织,建立林权变更数据库,支持历史信息的管理、查询等操作。以广西梧州林权改革数据为数据源,通过时态GIS对林权变更信息进行分析．实现图形信息和属性信息一体化存储与管理分析．便于时间和空间信息的查询．有利于林权改革的进一步深入开展。     

基于事件对象的时空数据模型的扩展与实现

文章通过对几种具有代表性的时空数据模型的比较,深入探讨事件的时空语义,进一步扩展基于事件的时空数据模型,使其适用于高层时态查询、时空一体化的对象标识、数据更新等操作,以实现动态空间数据的追踪和分析,并给出了时空一体化城建系统的实例。     

时空数据库中数据建模的研究

研究了时空数据库中的时空建模技术。早期表示时空信息的数据模型通常用基于几何学的空间对象来表示实体，重要的特性都用空间对象的属性来表示。时态信息可以与基于时间戳的独立层次相关联，也可以与独立的空间对象相关联。随着时空建模的进一步发展，出现了面向对象的数据模型和基于事件的数据模型。综合研究了这些典型的时空数据模型，讨论了它们的应用及时空分析建模的作用。此外介绍了针对移动对象的数据类型的建模方法，以及在时空分析数据库管理系统STADBS中，基于Realms的二级平衡二叉树的时空数据模型。     

基于事件的土地利用时空数据模型研究

先分析了 Peuquet(1995 )提出的基于事件的栅格时态数据模型 ESTDM,对该模型采用栅格结构所致的多属性描述局限进行了讨论 ,并提出了解决方案 :通过模型的属性索引访问“外部”的属性数据 .据此 ,结合土地利用的时空特点 ,设计了基于事件的土地利用时空数据模型 EL STDM及相应的时空数据库方案 ,并对土地利用变化的时空分析进行了探讨 .在此基础上 ,设计实现了土地利用变化时态 GIS原型系统 .试验结果表明 ,该时空数据模型满足了土地变化调查成果的管理和查询需求 ,对进一步的土地分析给予了较好的尝试 .     

基于时空模型的地籍信息数据库设计方法探讨

介绍了基态修正时空数据模型和改进基态修正时空数据模型,把改进基态时空数据模型引入到地籍信息系统中;分析了时空数据模型下地籍信息中宗地的组织原则,而后从概念设计、逻辑设计和图层设计以及数据库管理设计等方面探讨了利用改进基态修正模型进行地籍信息系统数据库的设计方法.利用该方法,可很大程度上节约地籍数据的存储空间和存取时间,更有利于地籍信息的时空查询.     

基于查询对象的路网Skyline查询中Why-not问题的研究

随着信息技术的高度发展,数据成为了重要的战略资源,如何利用大数据进行查询是众多学者的研究内容。与此同时,被查询对象在未被选择时,如何利用大数据使自己能够满足用户的查询要求也成为了重要的研究方向。在分析现有算法存在的不足的基础上,根据实际生活中查询的特点,对基于查询对象的路网Skyline查询中的why-not问题进行了研究,并针对此问题提出了属性优化算法。该算法包括修改why-not点的空间属性和非空间属性,以及修改查询中心的位置。考虑到实际情况,将时间属性单列而不是简单地将其作为非空间属性的一维。算法采用剪枝策略以提高效率。最后在真实路网数据和生成的兴趣点数据集上进行对比实验,结果表明在特定时间段同时修改空间、非时空属性的方法可以有效地解决此问题。     

一种平面移动对象的时空数据模型

提出了一种平面移动对象的时空数据模型--OPH模型.在该模型中,平面移动对象由3种几何表示,即平面对象的观测几何O,目前存在的几何P以及平面移动对象的历史几何H.通过几何点集的差、并、交,研究并得出OPH的递归计算和更新策略.通过分析对象之间的空间拓扑关系和时间关系,得出两个平面移动对象在重叠时间区间上的时空拓扑关系.利用OPH模型,定义了平面移动对象的速度、方向、影响范围等空间方法;利用时空拓扑关系和空间方法,确定时空查询和空间触发事件.     

Towards fusing uncertain location data from heterogeneous sources

Properly incorporating location-uncertainties – which is, fully considering their impact when processing queries of interest – is a paramount in any application dealing with spatio-temporal data. Typically, the location-uncertainty is a consequence of the fact that objects cannot be tracked continuously and the inherent imprecision of localization devices. Although there is a large body of works tackling various aspects of efficient management of uncertainty in spatio-temporal data – the settings consider homogeneous localization devices, e.g., either a Global Positioning System (GPS), or different sensors (roadside, indoor, etc.).In this work, we take a first step towards combining the uncertain location data – i.e., fusing the uncertainty of moving objects location – obtained from both GPS devices and roadside sensors. We develop a formal model for capturing the whereabouts in time in this setting and propose the Fused Bead (FB) model, extending the bead model based solely on GPS locations. We also present algorithms for answering traditional spatio-temporal range queries, as well as a special variant pertaining to objects locations with respect to lanes on road segments – augmenting the conventional graph based road network with the width attribute. In addition, pruning techniques are proposed in order to expedite the query processing. We evaluated the benefits of the proposed approach on both real (Beijing taxi) and synthetic (generated from a customized trajectory generator) data. Our experiments demonstrate that the proposed method of fusing the uncertainties may eliminate up to 26 % of the false positives in the Beijing taxi data, and up to 40 % of the false positives in the larger synthetic dataset, when compared to using the traditional bead uncertainty models.     

Permutation-test-based clustering method for detection of dynamic patterns in Spatio-temporal datasets

Massive spatio-temporal data have been collected from the earth observation systems for monitoring the changes of natural resources and environment. To find the interesting dynamic patterns embedded in spatio-temporal data, there is an urgent need for detecting spatio-temporal clusters formed by objects with similar attribute values occurring together across space and time. Among different clustering methods, the density-based methods are widely used to detect such spatio-temporal clusters because they are effective for finding arbitrarily shaped clusters and rely on less priori knowledge (e.g. the cluster number). However, a series of user-specified parameters is required to identify high-density objects and to determine cluster significance. In practice, it is difficult for users to determine the optimal clustering parameters; therefore, existing density-based clustering methods typically exhibit unstable performance. To overcome these limitations, a novel density-based spatio-temporal clustering method based on permutation tests is developed in this paper. High-density objects and cluster significance are determined based on statistical information on the dataset. First, the density of each object is defined based on the local variance and a fast permutation test is conducted to identify high-density objects. Then, a proposed two-stage grouping strategy is implemented to group high-density objects and their neighbors; hence, spatio-temporal clusters are formed by minimizing the inhomogeneity increase. Finally, another newly developed permutation test is conducted to evaluate the cluster significance based on the cluster member permutation. Experiments on both simulated and meteorological datasets show that the proposed method exhibits superior performance to two state-of-the-art clustering methods, i.e., ST-DBSCAN and ST-OPTICS. The proposed method can not only identify inherent cluster patterns in spatio-temporal datasets, but also greatly alleviates the difficulty in selecting appropriate clustering parameters.     

Detecting anomalies in spatio-temporal flow data by constructing dynamic neighbourhoods

In massive spatio-temporal datasets, anomalies that deviate from the global or local distributions are not just useless noise but possibly imply significant changes, surprising patterns, and meaningful insights, and because of this, detection of spatio-temporal anomalies has become an important research hotspot in spatio-temporal data mining. For spatio-temporal flow data (e.g., traffic flow data), the existing anomaly detection methods cannot handle the embedded dynamic characteristic. Therefore, this paper proposes the approach of constructing dynamic neighbourhoods to detect the anomalies in spatio-temporal flow data (called spatio-temporal flow anomalies). In this approach, the dynamic spatio-temporal flow is first modelled based on the real-time attribute values of the flow data, e.g., the velocity of vehicles. The dynamic neighbourhoods are then constructed by considering attribute similarity in the spatio-temporal flow. On this basis, global and local anomalies are detected by employing the idea of the G^⁎ statistic and the problem of multiple hypothesis testing is further addressed to control the false discovery rate. The effectiveness and practicality of our proposed approach are demonstrated through comparative experiments on traffic flow data from the central road network of central London for both weekdays and weekends.     

Classes of Spatio-Temporal Objects and their Closure Properties

We present a data model for spatio-temporal databases. In this model spatio-temporal data is represented as a finite union of objects described by means of a spatial reference object, a temporal object and a geometric transformation function that determines the change or movement of the reference object in time.We define a number of practically relevant classes of spatio-temporal objects, and give complete results concerning closure under Boolean set operators for these classes. Since only few classes are closed under all set operators, we suggest an extension of the model, which leads to better closure properties, and therefore increased practical applicability. We also discuss a normal form for this extended data model.     

基于改进时空残差卷积神经网络的城市路网短时交通流预测

城市路网交通流预测受到历史交通流和相邻路口交通流的影响,具有复杂的时空关联性.针对传统时空残差模型缺乏对交通流数据进行相关性分析、捕获微小变化而容易忽略长期时间特征等问题,提出一种基于改进时空残差卷积神经网络(CNN)的城市路网短时交通流预测模型.该模型将原始交通流数据转化成交通栅格数据,利用皮尔逊相关系数(PCC)对...     

基于HBase的路网移动对象时空索引方法

在处理路网移动对象时,由于HBase只能采用key查询,不适用于移动对象的多维查询,导致HBase存在存储索引与查询效率不高的问题。针对此问题,在HBase存储结构的基础上设计并实现了一种高效的路网移动对象HBase索引框架（RM-HBase）。首先,对原生HBase索引框架的上层HMaster和下层HRegionServer进行改进,解决分布式集群数据的热点分布问题,提高空间数据的查询效率;其次,提出路网移动索引——RN-tree,解决空间划分中的"死空间"问题,同时提高空间中路段的查询效率;然后,基于上述对HBase的索引改进,分别设计了时空范围查询、时空K最近邻（KNN）查询和移动对象轨迹查询的查询算法;最后,实验选用了同样是基于HBase分布式数据库而提出的时空HBase索引（STEHIX）框架作为对比对象,分别从索引框架的性能和算法的查询效率两个方面对RM-HBase的性能进行分析。实验结果表明,所提的RM-HBase在数据的均衡分布性能和时空查询算法的查询性能方面都优于STEHIX框架,有助于提升海量路网移动对象数据的时空索引效率。     

移动对象XML数据库的存储与索引

如何对移动对象的XML数据记录进行快速的查找,关键在于合理地存储模型与索引结构。为了减少时空条件索引时的文件I/O操作,提出一个移动对象XML数据存储模型（时空XML存储模型）,基于这个模型给出了通过一定时空条件对XML数据记录进行聚集的ATS（Append Track node to Spatial node）算法。针对3DR树的缺点与时态条件在移动对象索引中的重要性,提出了HSTR（Hashing-Spatio-Temporal-Rtree）与HC3DR（Hashing-Changing-3DRtree）两种复合索引结构,能够有效地支持涉及时空条件的查询。实验结果表明,时空XML存储模型与两种索引提高了查询效率。     

Spatio-temporal querying in video databases

A video data model that supports spatio-temporal querying in videos is presented. The data model is focused on the semantic content of video streams. Objects, events, activities, and spatial properties of objects are main interests of the model. The data model enables the user to query fuzzy spatio-temporal relationships between video objects and also trajectories of moving objects. A prototype of the proposed model has been implemented.     

A cost model for spatio-temporal queries using the TPR-tree

A query optimizer requires cost models to calculate the costs of various access plans for a query. An effective method to estimate the number of disk (or page) accesses for spatio-temporal queries has not yet been proposed. The TPR-tree is an efficient index that supports spatio-temporal queries for moving objects. Existing cost models for the spatial index such as the R-tree do not accurately estimate the number of disk accesses for spatio-temporal queries using the TPR-tree, because they do not consider the future locations of moving objects, which change continuously as time passes.In this paper, we propose an efficient cost model for spatio-temporal queries to solve this problem. We present analytical formulas which accurately calculate the number of disk accesses for spatio-temporal queries. Extensive experimental results show that our proposed method accurately estimates the number of disk accesses over various queries to spatio-temporal data combining real-life spatial data and synthetic temporal data. To evaluate the effectiveness of our method, we compared our spatio-temporal cost model (STCM) with an existing spatial cost model (SCM). The application of the existing SCM has the average error ratio from 52% to 93%, whereas our STCM has the average error ratio from 11% to 32%.