从相异空间聚类主题的聚类结果比较中发现知识

给出了空间聚类知识发现的一些基本概念，包括空间聚类维、空间聚类主题及主题相关性度量(相关度和包容度)等。按不同的空间聚类主题进行聚类分析，并以聚类结果的空间样本为纽带，以计算的主题相关性度量为评价标准，对相异空间聚类主题问可能的关联关系进行知识挖掘发现，获得了良好的结果。     

基于空间实体约束的空间聚类算法研究

空间实体的存在对空间聚类分析产生重要的影响,传统的空间聚类分析中没有考虑空间实体的约束作用,从而影响了聚类结果。本文在总结了以往的空间聚类算法的基础上,提出了一种改进的基于空间邻接关系的空间聚类算法,该算法将空间邻接关系和空间实体作为约束条件嵌入到整个聚类过程中,使得数据对象的归类受到"就近原则"和"约束条件"的双重限制。     

DBSCAN空间聚类算法及其在城市规划中的应用

空间聚类是空间数据挖掘和知识发现的主要方法之一。DBSCAN算法可以从带有“噪声”的空间数据库中发现任意形状的聚类,是一种较好的聚类算法。本文介绍了DBSCAN算法的基本概念和原理,并应用GIS二次开发组件MapObjects予以了实现。然后,本文将该算法应用于城市规划中,对某城市中小学和商业网点等公共设施的分布进行了聚类分析,并根据聚类结果对城市规划设计规范中的某些条款进行了讨论。     

面向多维时空位置数据的动态加权聚类模型

针对传统聚类算法在处理时空位置数据挖掘时面临的多维聚类问题,提出了动态加权聚类模型。该模型叠加利用经典k-均值和基于密度的DBSCAN聚类算法,通过计算最大轮廓系数确定合适的簇数目,按照划分初始簇类、识别和剔除噪声点、修正聚类簇中心点位置坐标3个步骤实现对大体量多维时空位置数据的聚类分析,提出了动态权重系数计算公式,优化了基于密度的DBSCAN聚类算法中相似度函数,并在Python3.7环境下以网络签到数据集实例仿真验算了该模型算法。实验结果表明,相较单一的传统聚类算法,该模型能综合利用多维非位置属性对时空位置数据点聚类,更合理界定聚类簇的归属数据点,对提升时空位置数据集聚类簇中数据点的聚类效果明显。     

一种基于属性值变化程度定权的聚类算法

针对经典K-means聚类算法以欧氏距离作为相似度判断法则进行聚类划分,而未考虑聚类对象的各属性值对聚类划分的影响程度存在差异的问题,该文提出了一种基于属性值变化程度定权的聚类算法。通过采用Iris dataset数据进行实验,该算法相对于其他聚类算法获得了更好的聚类效果,且该算法适用于生物物种分类、遥感影像识别等工作领域,能提高聚类运算的精准度。     

顾及属性空间分布不均的空间聚类方法——以城市商业中心的提取为例

针对Delaunay三角网空间聚类存在的不足,提出一种顾及属性空间分布不均的空间聚类方法。首先将Delaunay三角网空间位置聚类作为约束条件,采用广度优先搜索方法,以局部参数"属性变化率"作为阈值识别非空间属性相似簇的聚类过程。以城市商业中心为例,验证了该方法能够更客观地识别非空间属性相似的簇,且自适应属性阈值可以满足不同聚类需求,为城市商业中心等空间实体的提取提供了一种有效方法。     

一种基于网格的空间聚类方法在区域划分中的应用

区域划分是依据人口和社会经济指标将行政统计单元或其他地理实体划分成若干个不同水平或类别的集合。由于大多数的人口和社会经济指标来源于面状数据-行政统计单元,常用的区域划分的空间聚类方法是基于面状数据的,本文通过分析现有面状数据的聚类算法特点和不足,进而提出一种新的算法,该方法提出将面状统计单元进行网格划分,引入基于网格密度聚类算法的思想,克服现有面状聚类的诸多缺点,打破行政区划的限制,更好地发现潜在信息。     

一种面要素的层次四叉树聚类方法

确定重点监测区域是地灾应急响应中的一个重要环节。为了快速圈定监测范围,可以使用数据挖掘中的聚类方法。以粗略的监测区域作为工作区域,利用基于层次四叉树的面要素聚类方法缩小救灾范围。结合层次划分与四叉树剖分方法,将工作区域划分为包含面要素和相交面要素的单元格集合,在单元格集合中遍历搜索四方向邻近单元格,并将其聚合成多边形,从而实现面要素聚类。阐述了算法的可用性,通过实验分析了算法的复杂度,并对比分析了算法性能,进而利用面积差指标分析了层高对聚类多边形形状特征的影响。     

基于逻辑回归模型的城市边缘区界定方法研究

以广州市为例,在总结和分析前人研究的基础上提出基于栅格的城市化特征属性概念及其评价指标体系,构建了基于多准则判读的城市边缘区界定方法,利用 K-means空间聚类法对广州市城市边缘区进行划分,得到城市特征属性回归模型.试验结果表明,城市边缘区主要分布于主城区和若干中心镇周围,并随城市交通轴线发散分布,与广州城市总体规划发展布局相一致.城市特征属性受到城市开发强度的重要影响,两者具有显著相关性.     

基于空间相邻关系的GML点对象聚类算法研究

目前的聚类算法针对关系数据库而没有考虑空间相邻关系的相似度问题,因而提出对GML点对象离群检测算法进行改进,从而应用于GML聚类。改进的算法以空间相邻关系为度量准则得到相似性矩阵,从而对GML中的点对象聚类。试验结果表明：改进的算法能实现GML点对象基于空间相邻关系的聚类,具有较高的效率。     

Analysis of spatial clustering optimization

Spatial clustering is widely used in many fields such as WSN (Wireless Sensor Networks), web clustering, remote sensing and so on for discovery groups and to identify interesting distributions in the underlying database. By discussing the relationships between the optimal clustering and the initial seeds, a clustering validity index and the principle of seeking initial seeds were proposed, and on this principle we recommend an initial seed-seeking strategy: SSPG (Single-Shortest-Path Graph). With SSPG strategy used in clustering algorithms, we find that the result of clustering is optimized with more probability. At the end of the paper, according to the combinational theory of optimization, a method is proposed to obtain optimal reference k value of cluster number, and is proven to be efficient.     

空间聚类最优化分析(英文)

Spatial clustering is widely used in many fields such as WSN （Wireless Sensor Networks）, web clustering, remote sensing and so on for discovery groups and to identify interesting distributions in the underlying database. By discussing the relationships between the optimal clustering and the initial seeds, a clustering validity index and the principle of seeking initial seeds were proposed, and on this principle we recommend an initial seed-seeking strategy： SSPG （Single-Shortest-Path Graph）. With SSPG strategy used in clustering algorithms, we find that the result of clustering is optimized with more probability. At the end of the paper, according to the combinational theory of optimization, a method is proposed to obtain optimal reference k value of cluster number, and is proven to be efficient.     

基于中心点距离的居民地面要素聚类

空间聚类是将空间实体根据某些相似的特性聚类成为一个集合,这个集合称为簇。本文研究了一种基于中心点距离的居民地面要素聚类算法:通过获取面状要素的数据,运用基于其几何中心的距离计算方法,判断面要素之间距离的可达性,并将距离小于阈值的面要素进行聚类,最终以凸包的形式将该集合绘制出来。本文的算法是在VS2010以及ArcGIS Engine开发环境下通过编程实现,并进行多组实验,实验结果表明,该应用程序可以实现居民地面要素的自动聚类。     

DCAD: a dual clustering algorithm for distributed spatial databases

Spatial objects have two types of attributes: geometrical attributes and non-geometrical attributes, which belong to two different attribute domains (geometrical and non-geometrical domains). Although geometrically scattered in a geometrical domain, spatial objects may be similar to each other in a non-geometrical domain. Most existing clustering algorithms group spatial datasets into different compact regions in a geometrical domain without considering the aspect of a non-geometrical domain. However, many application scenarios require clustering results in which a cluster has not only high proximity in a geometrical domain, but also high similarity in a non-geometrical domain. This means constraints are imposed on the clustering goal from both geometrical and non-geometrical domains simultaneously. Such a clustering problem is called dual clustering. As distributed clustering applications become more and more popular, it is necessary to tackle the dual clustering problem in distributed databases. The DCAD algorithm is proposed to solve this problem. DCAD consists of two levels of clustering: local clustering and global clustering. First, clustering is conducted at each local site with a local clustering algorithm, and the features of local clusters are extracted. Second, local features from each site are sent to a central site where global clustering is obtained based on those features. Experiments on both artificial and real spatial datasets show that DCAD is effective and efficient.     

DCAD： a Dual Clustering Algorithm for Distributed Spatial Databases

Spatial objects have two types of attributes: geometrical attributes and non-geometrical attributes, which belong to two different attribute domains (geometrical and non-geometrical domains). Although geometrically scattered in a geometrical domain, spatial objects may be similar to each other in a non-geometrical domain. Most existing clustering algorithms group spatial datasets into different compact regions in a geometrical domain without considering the aspect of a non-geometrical domain. However, many application scenarios require clustering results in which a cluster has not only high proximity in a geometrical domain, but also high similarity in a non-geometrical domain. This means constraints are imposed on the clustering goal from both geometrical and non-geometrical domains simultaneously. Such a clustering problem is called dual clustering. As distributed clustering applications become more and more popular, it is necessary to tackle the dual clustering problem in distributed databases. The DCAD algorithm is proposed to solve this problem. DCAD consists of two levels of clus- tering: local clustering and global clustering. First, clustering is conducted at each local site with a local clustering algorithm, and the features of local clusters are extracted. Second, local features from each site are sent to a central site where global clustering is obtained based on those features. Experiments on both artificial and real spatial datasets show that DCAD is effective and efficient.     

自适应差分进化的遥感影像自动模糊聚类方法

遥感影像模糊聚类方法可以在无需样本分布信息的情况下获取比硬聚类方法更高的分类精度,但其仍依赖先验知识来确定影像地物的类别数。本文提出了一种基于自适应差分进化的遥感影像自动模糊聚类方法,该方法利用差分进化搜索速度快、计算简单、稳定性高的优点,以Xie-Beni指数为优化的适应度函数,在无需先验类别信息的情况下自动判定图像的类别数,并结合局部搜索算子对遥感影像进行最优化聚类。通过模拟影像以及两幅真实遥感图像的分类实验表明,本文方法不仅可以正确地自动获取地物类别数,而且能够获得比K均值、ISODATA以及模糊K均值方法更高的分类精度。     

1∶5万数据库内容需求调查结果的分析

围绕国家基础地理信息 1∶5 万核心地形要素数据库内容的完善,对不同专业领域和部门,通过问卷进行调研,了解地理信息用户对于国家基础地理信息的要素内容、属性信息等的需求。针对反馈结果,进行了统计分析,并提出了3种不同的数据库内容完善方案。方案的最终确定还需要采取空间分析的手段进行修正,使之可以作为数据库内容完善的参考。     

Segmentation-based classification of hyperspectral imagery using projected and correlation clustering techniques

A partitional clustering-based segmentation is used to carry out supervised classification for hyperspectral images. The main contribution of this study lies in the use of projected and correlation partitional clustering techniques to perform image segmentation. These types of clustering techniques have the capability to concurrently perform clustering and feature/band reduction, and are also able to identify different sets of relevant features for different clusters. Using these clustering techniques segmentation map is obtained, which is combined with the pixel-level support vector machines (SVM) classification result, using majority voting. Experiments are conducted over two hyperspectral images. Combination of pixel-level classification result with the segmentation maps leads to significant improvement of accuracies in both the images. Additionally, it is also observed that, classified maps obtained using SVM combined with projected and correlation clustering techniques results in higher accuracies as compared to classified maps obtained from SVM combined with other partitional clustering techniques.     

改进的模糊聚类遥感影像分割

聚类是数据挖掘的重要分支之一,引入模糊理论的模糊聚类分析为显示数据提供了模糊处理能力,在许多领域被广泛应用。本文应用考虑邻域关系的约束模糊C均值(Fuzzy C-Means with Constrains,FCM_S)算法,将邻域像素引入到目标函数中,进而有效地利用邻域像素信息,提高分割精度。本文应用FCM_S算法对模拟彩色纹理图像进行分割,计算其混淆矩阵,定性定量地与FCM算法进行对比分析,证明了该算法的鲁棒性。     

Interpreting map usage patterns using geovisual analytics and spatio-temporal clustering

Extracting meaningful information from the growing quantity of spatial data is a challenge. The issues are particularly evident with spatio-temporal data describing movement. Such data typically corresponds to movement of humans, animals and machines in the physical environment. This article considers a special form of movement data generated through human–computer interactions with online web maps. As a user interacts with a web map using a mouse as a pointing tool, invisible trajectories are generated. By examining the spatial features on the map where the mouse cursor visits, a user's interests and experience can be detected. To analyse this valuable information, we have developed a geovisual analysis tool which provides a rich insight into such user behaviour. The focus of this paper is on a clustering technique which we apply to mouse trajectories to group trajectories with similar behavioural properties. Our experiments reveal that it is possible to identify experienced and novice users of web mapping environments using an incremental clustering approach. The results can be used to provide personalised map interfaces to users and provide appropriate interventions for completing spatial tasks.