首页> 外文期刊>Stochastic environmental research and risk assessment >A Canberra distance-based complex network classification framework using lumped catchment characteristics
【24h】

A Canberra distance-based complex network classification framework using lumped catchment characteristics

机译:基于堪培拉距离的复杂网络分类框架,使用集总影特性

获取原文
获取原文并翻译 | 示例
           

摘要

Hydrological prediction in ungauged catchments remains a challenge despite numerous attempts in the past. The well-known solution to this challenge is transfer of information from gauged catchments to 'hydrologically-similar' ungauged catchments, an approach known as 'regionalization.' The basis of regionalization is, thus, classification of catchments into hydrologically-similar groups. A major limitation of the traditional classification methods, such as the K-means clustering algorithm, is that they are not very suitable when the classes are not well separated from each other. Additionally, they cannot determine the number of classes in a dataset automatically. To overcome these limitations, some recent studies have used complex networks-based classification algorithms, widely known as community structure algorithms, for catchment classification. However, such studies have applied the community structure algorithms only to time series of hydrological variables (e.g. streamflow) and have not so far used lumped information (e.g. mean rainfall and mean slope). In this short communication, we propose a Canberra distance-based metric that can enable a community structure algorithm to exploit lumped information. For demonstration, the proposed metric is used to compute link weights for the multilevel modularity optimization algorithm. The proposed classification method is applied to lumped data from 494 basins situated in the CONtiguous United States (CONUS) for their classification, and its performance is compared with that of the K-means clustering algorithm. By and large, the proposed classification framework opens up an alternative avenue towards prediction in ungauged catchments.
机译:尽管过去众多尝试,但在未凝固的流域中的水文预测仍然是挑战。该挑战的众所周知的解决方案是将信息从测量的集水区传递到“水文相似的”未凝固的集水区,这是一种称为“区域化”的方法。因此,区域化的基础是分类集水区分为水文 - 类似的群体。传统分类方法的一个主要限制,例如K-Means聚类算法,即当类别彼此不良好分离时它们不是很合适。此外,它们无法自动确定数据集中的类别数。为了克服这些限制,最近的一些研究已经使用了基于网络的基于网络的分类算法,广泛称为社区结构算法,用于集水区分类。然而,这种研究已经应用于群落结构算法仅适用于水文变量的时间序列(例如流流程),并且没有迄今为止使用的集总信息(例如降雨和平均斜坡)。在这短暂的通信中,我们提出了一种基于堪培拉的距离基度量,可以使社区结构算法能够利用集总信息。为了演示,所提出的度量标准用于计算多级模块化优化算法的链路权重。该拟议的分类方法应用于位于连续的美国(Conus)中的494个盆地的集成数据,以进行分类,其性能与K-Means聚类算法的性能进行了比较。通过和大,所提出的分类框架开辟了朝向未凝固的集水区内预测的替代途径。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号