Currently,the top-rank-k has been widely applied to mine frequent patterns with a rank not exceeding k.In the existing algorithms,although a level-wise-search could fully mine the target patterns,it usually leads to t...Currently,the top-rank-k has been widely applied to mine frequent patterns with a rank not exceeding k.In the existing algorithms,although a level-wise-search could fully mine the target patterns,it usually leads to the delay of high rank patterns generation,resulting in the slow growth of the support threshold and the mining efficiency.Aiming at this problem,a greedy-strategy-based top-rank-k frequent patterns hybrid mining algorithm(GTK)is proposed in this paper.In this algorithm,top-rank-k patterns are stored in a static doubly linked list called RSL,and the patterns are divided into short patterns and long patterns.The short patterns generated by a rank-first-search always joins the two patterns of the highest rank in RSL that have not yet been joined.On the basis of the short patterns satisfying specific conditions,the long patterns are extracted through level-wise-search.To reduce redundancy,GTK improves the generation method of subsume index and designs the new pruning strategies of candidates.This algorithm also takes the use of reasonable pruning strategies to reduce the amount of computation to improve the computational speed.Real datasets and synthetic datasets are adopted in experiments to evaluate the proposed algorithm.The experimental results show the obvious advantages in both time efficiency and space efficiency of GTK.展开更多
近年来,极端天气事件发生频次不断增加,强度不断加大,其中,由暴雨引发的城市内涝导致交通应急事件发生概率进一步增大。为提升暴雨灾害下应急救援响应速度,本文开展应急车辆救援路径优化研究。以通行时间最短为目标,考虑路面积水对车辆...近年来,极端天气事件发生频次不断增加,强度不断加大,其中,由暴雨引发的城市内涝导致交通应急事件发生概率进一步增大。为提升暴雨灾害下应急救援响应速度,本文开展应急车辆救援路径优化研究。以通行时间最短为目标,考虑路面积水对车辆通行速度的动态影响,构建应急车辆救援路径优化模型,提出动态最短路径优化算法求解模型。选取上海市长宁区东北部作为研究区域,根据SWMM(Storm Water Management Model)模拟得到的50年一遇暴雨条件下城市道路路面的积水情况,设定应急救援场景,求解应急救援路径。通过本文提出算法求解得到的路径与传统静态最短路径算法求解结果对比可知,通行用时同比减少了25.42%。同时,考虑应急物资储备情况分配应急救援任务,扩展了算法的应用场景,形成可靠和高效的应急响应方案,可为提升暴雨灾害下应急响应效率提供参考。展开更多
基金This research was supported in part by the Hunan Province’s Strategic and Emerging Industrial Projects under Grant 2018GK4035in part by the Hunan Province’s Changsha Zhuzhou Xiangtan National Independent Innovation Demonstration Zone projects under Grant 2017XK2058+1 种基金in part by the National Natural Science Foundation of China under Grant 61602171in part by the Scientific Research Fund of Hunan Provincial Education Department under Grant 17C0960 and 18B037.
文摘Currently,the top-rank-k has been widely applied to mine frequent patterns with a rank not exceeding k.In the existing algorithms,although a level-wise-search could fully mine the target patterns,it usually leads to the delay of high rank patterns generation,resulting in the slow growth of the support threshold and the mining efficiency.Aiming at this problem,a greedy-strategy-based top-rank-k frequent patterns hybrid mining algorithm(GTK)is proposed in this paper.In this algorithm,top-rank-k patterns are stored in a static doubly linked list called RSL,and the patterns are divided into short patterns and long patterns.The short patterns generated by a rank-first-search always joins the two patterns of the highest rank in RSL that have not yet been joined.On the basis of the short patterns satisfying specific conditions,the long patterns are extracted through level-wise-search.To reduce redundancy,GTK improves the generation method of subsume index and designs the new pruning strategies of candidates.This algorithm also takes the use of reasonable pruning strategies to reduce the amount of computation to improve the computational speed.Real datasets and synthetic datasets are adopted in experiments to evaluate the proposed algorithm.The experimental results show the obvious advantages in both time efficiency and space efficiency of GTK.
文摘近年来,极端天气事件发生频次不断增加,强度不断加大,其中,由暴雨引发的城市内涝导致交通应急事件发生概率进一步增大。为提升暴雨灾害下应急救援响应速度,本文开展应急车辆救援路径优化研究。以通行时间最短为目标,考虑路面积水对车辆通行速度的动态影响,构建应急车辆救援路径优化模型,提出动态最短路径优化算法求解模型。选取上海市长宁区东北部作为研究区域,根据SWMM(Storm Water Management Model)模拟得到的50年一遇暴雨条件下城市道路路面的积水情况,设定应急救援场景,求解应急救援路径。通过本文提出算法求解得到的路径与传统静态最短路径算法求解结果对比可知,通行用时同比减少了25.42%。同时,考虑应急物资储备情况分配应急救援任务,扩展了算法的应用场景,形成可靠和高效的应急响应方案,可为提升暴雨灾害下应急响应效率提供参考。
