基于优化经验模态分解和聚类分析的滑坡位移智能预测研究

针对三峡库区"阶跃式"滑坡的变形特征,提出了一种新的滑坡位移预测方法。以白水河滑坡ZG118和XD-01监测点位移数据为例,采用基于软筛分停止准则的经验模态分解(SSSC-EMD)将累计位移-时间曲线和影响因子时间序列自适应地分解为多个固有模态函数(IMF),并采用K均值(K-Means)聚类法对其进行聚类累加,得到有物理含义的位移分量(趋势性位移、周期性位移以及随机性位移)和影响因子分量(高频影响因子和低频影响因子)。使用最小二乘法对趋势性位移进行拟合预测;采用果蝇优化-最小二乘支持向量机(FOA-LSSVM)模型对周期性位移和随机性位移进行预测。将各位移分量预测值进行叠加处理,实现滑坡累计位移的预测。研究结果表明,所提出的(SSSC-EMD)-K-Means-(FOA-LSSVM)模型能够预测"阶跃式"滑坡的位移变化规律,且预测精度高于传统的支持向量机回归(SVR)、最小二乘支持向量机(LSSVM)模型;并通过改变训练集长度,进行单因素分析,发现其与预测精度之间呈正相关关系。     

基于谱聚类算法的海底滑坡危险性评价

海底滑坡的危险性评价与分区,对海洋工程设施的选址和危险预防具有指导作用.本文基于无监督机器学习的谱聚类算法对黄河口埕岛海域展开了海底滑坡危险性评价,构建了输入参数为9、输出类别为4、核函数参数为0.08的海底滑坡危险性评价模型.使用该模型进行评价,将研究区分为了海底滑坡危险性高、较高、较低和低的区域.评价结果与地质环境...     

基于时空聚类的出租车载客热点区域挖掘研究

针对出租车运营过程缺少路径优化指导造成运营能力分布不均、空载率高的问题,本文以成都市安装有GPS设备的出租车所采集的轨迹数据为研究对象,以提高出租车效益为目标,采用了一种基于网格的出租车载客热点聚类算法,通过对出租车GPS轨迹数据进行处理和聚类分析,充分挖掘出租车载客热点区域,从而为出租车的运营者和管理者提供信息决策服务。     

一种高光谱遥感图像快速谱聚类算法

为获得分类效果更优良的遥感图像分类方式并解决高光谱遥感图像分类运算速度缓慢的问题,集成Lanczos算法与谱聚类算法,探讨了高光谱遥感图像谱聚类算法应用于遥感图像分类的可行性,提出了一种面向高光谱遥感图像的快速谱聚类算法;通过对比美国圣地亚哥机场高光谱遥感图像K-均值算法与谱聚类算法的分类结果,发现面向高光谱遥感图像的谱聚类算法易于识别线性地物,且分类的速度能得到较大提升。     

模糊聚类定权法对SLR定轨精度的影响

针对卫星激光测距(satellite laser ranging,SLR)精密定轨过程中存在的测站观测数据合理定权问题,将一种改进的模糊聚类算法引入到SLR观测数据定权中。基于国际激光测距服务(International Laser Ranging Service,ILRS)提供的全球SLR测站性能报告,对测站进行近实时滑动分类定权,改变SLR数据处理中权重的经验或者随意性选取模式。经过LAGEOS1卫星2014年1月至2016年12月3年全球SLR实测数据处理的测试。结果表明,当考虑LAGEOS标准点总数、LAGEOS标准点RMS值以及LAGEOS标准点合格率这3项测站质量控制因素确定的测站权值能最大限度地提高卫星定轨精度和观测数据的使用效率,对参与计算的365个3d弧段数据,91.46%弧段精度得到提高,平均提高约3.7mm,且每个测站的定轨残差RMS也得到了降低。这对于正在迈向毫米级测量精度的SLR技术至关重要。     

A natural language processing and geospatial clustering framework for harvesting local place names from geotagged housing advertisements

Local place names are frequently used by residents living in a geographic region. Such place names may not be recorded in existing gazetteers, due to their vernacular nature, relative insignificance to a gazetteer covering a large area (e.g. the entire world), recent establishment (e.g. the name of a newly-opened shopping center) or other reasons. While not always recorded, local place names play important roles in many applications, from supporting public participation in urban planning to locating victims in disaster response. In this paper, we propose a computational framework for harvesting local place names from geotagged housing advertisements. We make use of those advertisements posted on local-oriented websites, such as Craigslist, where local place names are often mentioned. The proposed framework consists of two stages: natural language processing (NLP) and geospatial clustering. The NLP stage examines the textual content of housing advertisements and extracts place name candidates. The geospatial stage focuses on the coordinates associated with the extracted place name candidates and performs multiscale geospatial clustering to filter out the non-place names. We evaluate our framework by comparing its performance with those of six baselines. We also compare our result with four existing gazetteers to demonstrate the not-yet-recorded local place names discovered by our framework.     

A density-based approach for detecting network-constrained clusters in spatial point events

Existing spatial clustering methods primarily focus on points distributed in planar space. However, occurrence locations and background processes of most human mobility events within cities are constrained by the road network space. Here we describe a density-based clustering approach for objectively detecting clusters in network-constrained point events. First, the network-constrained Delaunay triangulation is constructed to facilitate the measurement of network distances between points. Then, a combination of network kernel density estimation and potential entropy is executed to determine the optimal neighbourhood size. Furthermore, all network-constrained events are tested under a null hypothesis to statistically identify core points with significantly high densities. Finally, spatial clusters can be formed by expanding from the identified core points. Experimental comparisons performed on the origin and destination points of taxis in Beijing demonstrate that the proposed method can ascertain network-constrained clusters precisely and significantly. The resulting time-dependent patterns of clusters will be informative for taxi route selections in the future.     

Two-stage permutation tests for determining homogeneity within a spatial cluster

The discovery of spatial clusters formed by proximal spatial units with similar non-spatial attribute values plays an important role in spatial data analysis. Although several spatial contiguity-constrained clustering methods are currently available, almost all of them discover clusters in a geographical dataset, even though the dataset has no natural clustering structure. Statistically evaluating the significance of the degree of homogeneity within a single spatial cluster is difficult. To overcome this limitation, this study develops a permutation test approach Specifically, the homogeneity of a spatial cluster is measured based on the local variance and cluster member permutation, and two-stage permutation tests are developed to determine the significance of the degree of homogeneity within each spatial cluster. The proposed permutation tests can be integrated into the existing spatial clustering algorithms to detect homogeneous spatial clusters. The proposed tests are compared with four existing tests (i.e., Park’s test, the contiguity-constrained nonparametric analysis of variance (COCOPAN) method, spatial scan statistic, and q-statistic) using two simulated and two meteorological datasets. The comparison shows that the proposed two-stage permutation tests are more effective to identify homogeneous spatial clusters and to determine homogeneous clustering structures in practical applications.     

基于自发地理信息的人行道路信息提取

人类的行为轨迹可快速提取到车辆难以通行的人行道路以及人行道路设施等信息,这些信息是行人LBS的关键性元素,它的完备性程度决定了行人LBS服务质量的高低。本文使用志愿者数据集与百度地图,研究了一整套基于VGI数据的人行道路信息提取方法。通过轨迹数据清洗、道路几何路网提取、人行道路设施的检测与识别3个主要板块实现了人行道路信息的提取。算法在完成道路几何路网信息提取的同时,实现了人行横道、过街天桥、地下通道等道路设施信息的获取。