首页> 外文期刊>WSEAS Transactions on Computers >A clique-based and degree-based clustering algorithm for expressway network simplification problem
【24h】

A clique-based and degree-based clustering algorithm for expressway network simplification problem

机译:高速公路网络简化问题的基于群体和基于程度的聚类算法

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

摘要

In order to meet the complex topological structure and huge distance and site number information of the expressway network, this paper proposed a new degree-based maximal clique mining algorithm which based on the principle from top to down to reasonably simplify the expressway network information. At the same time a search tree model which containing a series of pruning strategies and dictionary ordering strategies is derived to describe the mining process directly and improve the efficiency of searching and clustering the expressway network. Finally in this paper, a simplified algorithm of the expressway network model is designed, and the new algorithm shows better results based on the example databases of expressway network in Shandong province.
机译:为了满足高速公路网复杂的拓扑结构以及巨大的距离和站点数量信息,提出了一种新的基于度的最大团挖掘算法,该算法基于自上而下的原理合理地简化了高速公路网信息。同时,推导了包含一系列修剪策略和字典排序策略的搜索树模型,直接描述了挖掘过程,提高了高速公路网络的搜索和聚类效率。最后,本文设计了一种简化的高速公路网络模型算法,并以山东省高速公路网络实例数据库为例,给出了更好的效果。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号