Urban function classification at road segment level using taxi trajectory data: A graph convolutional neural network approach

Extracting hidden information from human mobility patterns is one of the long-standing challenges of urban studies. In addition, exploring the relationship between urban functional structure and traffic spatial interaction pattern has long been of interest. Recently, vehicle GPS trajectory data emerged as a popular data source for revealing human mobility patterns and urban functions. However, few studies have fully leveraged traffic interaction information that is hidden in human mobility patterns to identify urban functions at the road segment level. To address this issue, a geo-semantic analysis framework was introduced in this study to model the relationship between traffic interaction and urban functions at the road segment level. First, a Road-Trajectory corpus was built and trained to obtain the semantic embedding representation of road segments. Then, considering topological connections between road segments, we used a graph convolutional neural network model to process the contextual and topological information to classify social functions along streets. A case study in Beijing, China, using a large volume of real-world taxi trajectories data, was conducted. The results show that our proposed methods, with relative less loss and high accuracy, outperform other comparative methods for classifying urban functions at the road segment level. This work contributes to the assessment of urban functional structure, and further aiding urban planners in designing better urbanization strategies with regard to traffic interaction and urban space structure.     

道路网中基于RRN-Tree的CKNN查询

现有针对基于道路网络的CKNN查询研究,主要是将道路网络以路段和节点的形式进行建模,转化成基于内存的有向/无向图,该模型存在2个问题:一个是道路网络中路段数据量大,导致索引结构分支过多、移动对象更新频繁;另一个是图表示方法不能很好地处理十字路口转向、U型转弯等交通规则。针对此问题,提出道路网中基于RRN-Tree的移动对象CKNN查询算法,包括索引结构设计和移动对象查询算法设计,采用路线对道路网建模,基于网络边扩展方式,实现复杂条件下的道路网络CKNN查询。实验结果表明,在各种网络密度和兴趣点对象分布密度下,与经典的IMA/GMA算法相比,基于RRN-Tree索引方法的查询性能提高1.5倍~2.13倍。     

CCAM: a connectivity-clustered access method for networks andnetwork computations

Current spatial database management systems (SDBMS) provide efficient access methods and operators for point and range queries over collections of spatial points, line segments, and polygons. However, it is not clear if existing spatial access methods can efficiently support network computations which traverse line segments in a spatial network based on connectivity rather than geographic proximity. The expected I/O cost for many network operations can be reduced by maximizing the Weighted Connectivity Residue Ratio (WCRR), i.e., the chance that a pair of connected nodes that are more likely to be accessed together are allocated to a common page of the file. CCAM is an access method for general networks that uses connectivity clustering. CCAM supports the operations of insert, delete, create, and find as well as the new operations, get-A-successor and get-successors, which retrieve one or all successors of a node to facilitate aggregate computations on networks. The nodes of the network are assigned to disk pages via a graph partitioning approach to maximize the WCRR. CCAM includes methods for static clustering, as well as dynamic incremental reclustering, to maintain high WCRR in the face of updates, without incurring high overheads. We also describe possible modifications to improve the WCRR that can be achieved by existing spatial access methods. Experiments with network computations on the Minneapolis road map show that CCAM outperforms existing access methods, even though the proposed modifications also substantially improve the performance of existing spatial access methods     

微博客蕴含交通信息的提取

微博客消息中可能蕴含大量描述城市道路的交通信息,如交通状况、交通事件、交通管制等,提取这些交通信息能够为传统的固定式传感器和浮动车采集交通信息手段提供有效补充.然而,微博客消息描述的模糊性、差异性及非结构化特征,使得从海量微博客消息中快速准确地提取和甄别交通信息成为难题.提出一种从微博客消息中快速提取和融合交通信息的技术方法,首先对采集到的微博客消息进行分词解析和路网匹配,然后采用基于神经网络的模糊C聚类方法对描述路段交通状态的微博客消息定量化结果进行分析,获取各路段置信度最高的交通状态描述,最后得到各路段的交通畅通度水平.基于新浪微博客和北京路网的实验过程验证了本文技术方法的有效性.     

基于有向含权复杂网络的城市交通路网关键路段识别

针对目前基于复杂网络识别城市交通路网关键路段缺乏考虑现实影响因素和路段方向性问题,提出了一种基于有向含权复杂网络的关键路段识别方法。第一阶段利用复杂网络理论将城市交通路网构建成有向含权复杂网络模型;第二阶段利用LinkRank算法对复杂网络中边进行重要度排序,以此识别关键边,即城市交通路网关键路段;第三阶段利用变异的易感—感染（susceptible-infective,SI）模型对关键路段进行影响评估。通过对浙江省海宁市城区的城市交通路网分析,验证了方法的实用性和有效性。     

Synchronisation between two different networks with multi-weights and its application in public traffic network

The paper established a conventional bus traffic network and a subway network by using the method of space R based on the existing public traffic network model. Regarding these two networks as the sub-networks, this paper presented a new two-layer-coupled public traffic network with multi-weights through the transfer relationship between conventional bus lines and subway lines. Every edge of this model’s two sub-networks has one or several different property weights, and the coupling edges between two sub-networks have one weight. Based on the method of network split, the paper splits the complex networks with multi-weights into several different single-weighted two-layer-coupled public traffic networks and then investigates its global synchronisation. Finally, according to the synchronisation theory of coupling networks with multi-weights and taking ‘Lorenz system’ as the network node, some numerical examples are given to show the impact of congestion degree, passenger-flow density, transfer degree and capacity matching degree to the two-layer-coupled public traffic network balance.     

Weighted graph cuts without eigenvectors a multilevel approach

A variety of clustering algorithms have recently been proposed to handle data that is not linearly separable; spectral clustering and kernel k-means are two of the main methods. In this paper, we discuss an equivalence between the objective functions used in these seemingly different methods--in particular, a general weighted kernel k-means objective is mathematically equivalent to a weighted graph clustering objective. We exploit this equivalence to develop a fast, high-quality multilevel algorithm that directly optimizes various weighted graph clustering objectives, such as the popular ratio cut, normalized cut, and ratio association criteria. This eliminates the need for any eigenvector computation for graph clustering problems, which can be prohibitive for very large graphs. Previous multilevel graph partitioning methods, such as Metis, have suffered from the restriction of equal-sized clusters; our multilevel algorithm removes this restriction by using kernel k-means to optimize weighted graph cuts. Experimental results show that our multilevel algorithm outperforms a state-of-the-art spectral clustering algorithm in terms of speed, memory usage, and quality. We demonstrate that our algorithm is applicable to large-scale clustering tasks such as image segmentation, social network analysis and gene network analysis.     

基于改进密度峰值聚类的路网划分方法

城市路网的合理划分对于优化区域交通控制以及协调策略的实施具有重要意义。为提高道路通行效率,提出基于密度峰值聚类算法的城市路网划分方法,首先,综合考虑交叉口静态和动态因素的影响,构建相邻交叉口的关联度模型,为合理量化交叉口之间的关联程度提供定量描述。其次,提出改进的密度峰值聚类算法,结合相邻交叉口之间的关联度对路网区域进行划分。针对密度峰值聚类算法中局部密度在不同规模数据集上差异较大的问题,引入KNN的思想,重新对局部密度进行描述,其次为避免算法聚类中心人工选取的主观性导致的误差问题,采用肘部法则实现聚类中心的自动选取。实验结果表明,与改进的Newman算法及Ncut算法相比,提出的改进算法在优化子区平均匀质度上可分别降低12.5%和22.8%,提高了控制子区的划分效果,使区域划分效果更合理。     

图正则化非负矩阵分解的异质网社区发现

挖掘数据网络中有价值的、具有稳定性的社区,对网络信息的获取、推荐及网络的演化预测具有重要的价值。针对现有异质网络聚类方法难以在同一维度有效整合网络中异质信息的问题,提出了一种基于图正则化非负矩阵分解的异质网络聚类方法。通过加入图正则项,将中心类型子空间和属性类型子空间的内部连接关系作为约束项,引入到非负矩阵分解模型中,从而找到高维数据在低维空间的紧致嵌入,成功消除了异质节点之间的部分噪声,同时,对反映不同子网络共有潜在结构的共识矩阵进行优化,有效整合异质信息,并且在降维过程中较大限度地保留了异质信息的完整性,提高了异质网络聚类方法的精度,在真实世界数据集上的实验结果也验证了该方法的有效性。     

基于多学科设计优化的路网交通分布式协同控制

城市路网交通控制直接影响着交通运行效率,对其优化研究已成为缓解城市交通拥堵问题的热点之一.鉴于此,针对高峰交通路网将其分为过饱和区域与过饱和关联区域,在采用灰色关联分析-谱聚类方法对关联区域划分的基础上,构建路网交通分布式协同控制模型,进一步提出基于多学科设计优化的过饱和区域及其关联区域协同优化求解方法.通过搭建实例路网模型分析算法优化效果,结果表明所提出方法能够明显改善路网交通运行效率,有助于缓解城市通勤高峰时段的交通拥堵和扩散问题.     

一种面向城市复杂路网最短路径提取的定向收敛算法*

为提高城市复杂路网最短路径提取的效率,针对路网数据量大、结构密集等特点,研究了路网节点之间最短路径的分布特征,通过引入收敛点方式,设计并实现了一种面向复杂路网最短路径快速提取的定向收敛算法。为检验该算法的有效性,利用某城市道路交通网络进行了实验和分析,并与Dijsktra算法、A*算法等比较,证实了该算法能够提高路径搜索效率,且随着城市路网规模的扩大定向收敛算法的高效性将愈加明显。     

基于GCN和TCN的多因素城市路网出租车需求预测

在巡游模式下,出租车与乘客间供需不易匹配,造成出租车空载和乘客打车难现象并存,准确高效地实现路网出租车需求预测有利于有效缓解这一问题.针对现有交通流预测模型对空间特征提取不充分,特别是对城市路网内路段之间的空间关系没有全面挖掘这一问题,充分考虑路网内路段间的3种空间关系,对其分别构建路段间的局部关系图、路段全局关系图和路段OD次数关系图,提出一种由图卷积网络与时间卷积网络相结合的出租车需求预测模型.其中,采用图卷积网络对城市路网内路段的空间关系特征进行挖掘,采用时间卷积网络对交通数据集中的时间序列特征进行挖掘,并且考虑外部因素的影响.实验中,首先从真实出租车GPS轨迹数据中提取城市路网中各个路段的出租车出行量,并利用道路上在多个时隙形成的出行量序列对预测模型进行验证.结果表明,相比其他交通流预测模型,所提出的预测模型具有较优的平均绝对误差、均方根误差和平均绝对百分误差.     

基于城市交通监控大数据的工作位置推理方法

基于时空数据的用户位置推理在产品推荐、精确营销、交通调度及城市规划等实际应用中有着重要的作用,然而,基于城市交通监控数据的位置推理问题尚未被探索,因此,提出了一种面向稀疏摄像头交通监控数据的工作位置推理方法。首先,收集了路网、兴趣点（POI）等城市交通外围数据,并通过路网匹配的预处理方式获取到了一个含有摄像头、POI等丰富语义信息的真实路网;其次,通过聚类车辆轨迹中所提取的起点-终点（O-D）对来获得车辆重要的停留区域,即候选工作区域;之后,利用所提的in/out访问时间模式的约束,从多个候选区域中匹配出最大可能的工作区域;最后,利用所获取的路网信息和路网周中POI的分布信息提取出车辆的可达POI集合,从而进一步缩小车主的工作位置范围。在一个省会城市真实的交通监控数据集上的综合实验评估和案例分析验证了所提方法的有效性。     

Exploiting small world property for network clustering

Graph partitioning is a traditional problem with many applications and a number of high-quality algorithms have been developed. Recently, demand for social network analysis arouses the new research interest on graph partitioning/clustering. Social networks differ from conventional graphs in that they exhibit some key properties like power-law and small-world property. Currently, these features are largely neglected in popular partitioning algorithms. In this paper, we present a novel framework which leverages the small-world property for finding clusters in social networks. The framework consists of several key features. Firstly, we define a total order, which combines the edge weight, the small-world weight, and the hub value, to better reflect the connection strength between two vertices. Secondly, we design a strategy using this ordered list, to greedily, yet effectively, refine existing partitioning algorithms for common objective functions. Thirdly, the proposed method is independent of the original approach, such that it could be integrated with any types of existing graph clustering algorithms. We conduct an extensive performance study on both real-life and synthetic datasets. The empirical results clearly demonstrate that our framework significantly improves the output of the state-of-the-art methods. Furthermore, we show that the proposed method returns clusters with both internal and external higher qualities.     

城市路网交通分散协调控制

针对城市路网交通系统规模大和非线性、不确定性强等特点，利用模糊神经网络设计了一种新的实时分散协调控制算法．把城市区域和市内快速公路作为一个路网大系统，子系统为路网中的各个交叉口；每个子系统都有一个模糊神经网络控制器，该控制器根据它自己和相邻子系统的交通流信息来动态管理相序及绿灯时间．控制器由3个模块组成：相序选择模块、绿灯判断模块和相位切换模块．控制器的控制目标是保持快速公路主线密度均衡和区域内各车辆平均延误时间最短．仿真研究表明，该算法能有效处理各种路网交通环境．     

多视角融合的时空动态图卷积网络城市交通流量预测

城市交通流量预测是构建绿色低碳、安全高效的智能交通系统的重要组成部分.时空图神经网络由于具有强大的时空数据表征能力,被广泛应用于城市交通流量预测.当前时空图神经网络在城市交通流量预测中仍存在以下两方面局限性:1)直接构建静态路网拓扑图对城市空间相关性进行表示,忽略了节点的动态交通模式,难以表达节点流量之间的时序相似性,无法捕获路网节点之间在时序上的动态关联.2)只考虑路网节点的局部空间相关性,忽略节点的全局空间相关性,无法建模交通路网中局部区域和全局空间之间的依赖关系.为打破上述局限性,本文提出了一种多视角融合的时空动态图卷积模型用于预测交通流量.首先,从静态空间拓扑和动态流量模式视角出发,构建路网空间结构图和动态流量关联图,并使用动态图卷积学习节点在两种视角下的特征,全面捕获城市路网中多元的空间相关性.其次,从局部视角和全局视角出发,计算路网的全局表示,将全局特征与局部特征融合,增强路网节点特征的表现力,发掘城市交通流量的整体结构特征.接下来,设计了局部卷积多头自注意力机制来获取交通数据的动态时间相关性,实现在多种时间窗口下的准确流量预测.最后,在四种真实交通数据上的实验结果证明了本文模型的有效性和准确性.     

Efficient fastest-path computations for road maps

Computational Visual Media - In the age of real-time online traffic information and GPS-enabled devices, fastest-path computations between two points in a road network modeled as a directed graph,...     

A framework for joint community detection across multiple related networks

Community detection in networks is an active area of research with many practical applications. However, most of the early work in this area has focused on partitioning a single network or a bipartite graph into clusters/communities. With the rapid proliferation of online social media, it has become increasingly common for web users to have noticeable presence across multiple web sites. This raises the question whether it is possible to combine information from several networks to improve community detection. In this paper, we present a framework that identifies communities simultaneously across different networks and learns the correspondences between them. The framework is applicable to networks generated from multiple web sites as well as to those derived from heterogeneous nodes of the same web site. It also allows the incorporation of prior information about the potential relationships between the communities in different networks. Extensive experiments have been performed on both synthetic and real-life data sets to evaluate the effectiveness of our framework. Our results show superior performance of simultaneous community detection over three alternative methods, including normalized cut and matrix factorization on a single network or a bipartite graph.     

基于自适应门控图神经网络的交通流预测

交通流预测是智能交通系统中的重要组成部分,由于交通数据的复杂性,长期而又准确的交通流预测一直是时间序列预测中最具挑战性的任务之一。近年来,研究人员将基于图神经网络的时空图建模方法应用于交通流预测任务,并取得了良好的预测性能。然而,现有的图建模方法仅通过预定义的邻接结构反映道路网络中的空间依赖关系,忽略了各节点之间的序列关联关系对预测的重要性。针对这一局限性,提出了一种自适应门控图神经网络（Ada-GGNN）,其核心为通过空间传递模块同时捕获道路网络的空间结构及自适应的时序相关性,并通过门控机制学习节点上的时间序列特征。在两个真实交通网络数据集PeMSD7和Los-loop上的实验结果证明了该模型具有更优越的性能。     

Flow Mapping and Multivariate Visualization of Large Spatial Interaction Data

Spatial interactions (or flows), such as population migration and disease spread, naturally form a weighted location-to-location network (graph). Such geographically embedded networks (graphs) are usually very large. For example, the county-to-county migration data in the U.S. has thousands of counties and about a million migration paths. Moreover, many variables are associated with each flow, such as the number of migrants for different age groups, income levels, and occupations. It is a challenging task to visualize such data and discover network structures, multivariate relations, and their geographic patterns simultaneously. This paper addresses these challenges by developing an integrated interactive visualization framework that consists three coupled components: (1) a spatially constrained graph partitioning method that can construct a hierarchy of geographical regions (communities), where there are more flows or connections within regions than across regions; (2) a multivariate clustering and visualization method to detect and present multivariate patterns in the aggregated region-to-region flows; and (3) a highly interactive flow mapping component to map both flow and multivariate patterns in the geographic space, at different hierarchical levels. The proposed approach can process relatively large data sets and effectively discover and visualize major flow structures and multivariate relations at the same time. User interactions are supported to facilitate the understanding of both an overview and detailed patterns.