Though vortex search（VS） algorithm has good performance in solving global numerical optimization problems, it cannot fully search the whole space occasionally. Combining the vortex search algorithm and the artificia...Though vortex search（VS） algorithm has good performance in solving global numerical optimization problems, it cannot fully search the whole space occasionally. Combining the vortex search algorithm and the artificial bee colony algorithm（ABC） which has good performance in exploration, we present a HVS（hybrid vortex search） algorithm to solve the numerical optimization problems. We first use the employed bees and onlooker bees of ABC algorithm to find a solution, and then adopt the VS algorithm to find the best solution. In the meantime, we cannot treat the best solution so far as the center of the algorithm all the time. The algorithm is tested by 50 benchmark functions. The numerical results show the HVS algorithm has superior performance over the ABC and the VS algorithms.展开更多
Traditional normalized tree edit distances do not satisfy the triangle inequality. We present a metric normalization method for tree edit distance, which results in a new normalized tree edit distance fulfilling the t...Traditional normalized tree edit distances do not satisfy the triangle inequality. We present a metric normalization method for tree edit distance, which results in a new normalized tree edit distance fulfilling the triangle inequality, under the condition that the weight function is a metric over the set of elementary edit operations with all costs of insertions/deletions having the same weight. We prove that the new distance, in the range [0, 1], is a genuine metric as a simple function of the sizes of two ordered labeled trees and the tree edit distance between them, which can be directly computed through tree edit distance with the same complexity. Based on an efficient algorithm to represent digits as ordered labeled trees, we show that the normalized tree edit metric can provide slightly better results than other existing methods in handwritten digit recognition experiments using the approximating and eliminating search algorithm （AESA） algorithm.展开更多
针对室内接收信号强度指示(received signal strength indication,RSSI)定位精度较低,无法实现动态跟踪参数变化的问题,将改进的引力搜索算法(GSA)应用于RSSI定位中.先利用极大似然估计得出定位模型的参数,再使用最小二乘法计算估计结果...针对室内接收信号强度指示(received signal strength indication,RSSI)定位精度较低,无法实现动态跟踪参数变化的问题,将改进的引力搜索算法(GSA)应用于RSSI定位中.先利用极大似然估计得出定位模型的参数,再使用最小二乘法计算估计结果,最后利用引力搜索算法对估计结果和参数进行优化.该算法具有收敛速度快,精度高等优点.实验结果表明,该算法不仅能够提高定位的精度,而且能够实现动态跟踪RSSI定位数学模型中的参数变化,从而提高了其对环境变化的自适应能力.展开更多
基金Supported by the National Natural Science Foundation of China(71471140)
文摘Though vortex search（VS） algorithm has good performance in solving global numerical optimization problems, it cannot fully search the whole space occasionally. Combining the vortex search algorithm and the artificial bee colony algorithm（ABC） which has good performance in exploration, we present a HVS（hybrid vortex search） algorithm to solve the numerical optimization problems. We first use the employed bees and onlooker bees of ABC algorithm to find a solution, and then adopt the VS algorithm to find the best solution. In the meantime, we cannot treat the best solution so far as the center of the algorithm all the time. The algorithm is tested by 50 benchmark functions. The numerical results show the HVS algorithm has superior performance over the ABC and the VS algorithms.
文摘Traditional normalized tree edit distances do not satisfy the triangle inequality. We present a metric normalization method for tree edit distance, which results in a new normalized tree edit distance fulfilling the triangle inequality, under the condition that the weight function is a metric over the set of elementary edit operations with all costs of insertions/deletions having the same weight. We prove that the new distance, in the range [0, 1], is a genuine metric as a simple function of the sizes of two ordered labeled trees and the tree edit distance between them, which can be directly computed through tree edit distance with the same complexity. Based on an efficient algorithm to represent digits as ordered labeled trees, we show that the normalized tree edit metric can provide slightly better results than other existing methods in handwritten digit recognition experiments using the approximating and eliminating search algorithm （AESA） algorithm.
文摘针对室内接收信号强度指示(received signal strength indication,RSSI)定位精度较低,无法实现动态跟踪参数变化的问题,将改进的引力搜索算法(GSA)应用于RSSI定位中.先利用极大似然估计得出定位模型的参数,再使用最小二乘法计算估计结果,最后利用引力搜索算法对估计结果和参数进行优化.该算法具有收敛速度快,精度高等优点.实验结果表明,该算法不仅能够提高定位的精度,而且能够实现动态跟踪RSSI定位数学模型中的参数变化,从而提高了其对环境变化的自适应能力.
