DTW-Global Constraint Learning Using Tabu Search Algorithm
نویسندگان
چکیده
منابع مشابه
Learning DTW Global Constraint for Time Series Classification
1-Nearest Neighbor with the Dynamic TimeWarping (DTW) distance is one of the most effective classifiers on time series domain. Since the global constraint has been introduced in speech community, many global constraint models have been proposed including Sakoe-Chiba (S-C) band, Itakura Parallelogram, and Ratanamahatana-Keogh (R-K) band. The R-K band is a general global constraint model that can...
متن کاملA Tabu Search Evolutionary Algorithm for Solving Constraint Satisfaction Problems
The paper introduces a hybrid Tabu Search-Evolutionary Algorithm for solving the constraint satisfaction problem, called STLEA. Extensive experimental fine-tuning of parameters of the algorithm was performed to optimise the performance of the algorithm on a commonly used test-set. The performance of the STLEA was then compared to the best known evolutionary algorithm and benchmark deterministic...
متن کاملTabu search : global intensification using dynamic programming
Tabu search has proven highly successful in solving hard combinatorial optimization problems. In this paper, we propose a hybrid method that combines adaptive memory, sparse dynamic programming, and reduction techniques to reduce and explore the search space. Our approach starts with a bi-partition of the variables, involving a small core problem, which never exceeds 15 variables, solved using ...
متن کاملStrategic Planning Optimization Using Tabu Search Algorithm
In this paper we introduce a method for optimisation of strategic tasks using an approximation algorithm. We propose the mathematical model and algorithm for solving this problem near optimality. An overall motivation for the development of the proposed algorithm is discussed with detailed e ciency analysis. From the end users' perspective the proposed method has practical application because i...
متن کاملOptimal Power Flow Using Tabu Search Algorithm
This paper presents an e cient and reliable tabu search (TS)–based approach to solve the optimal power ow (OPF) problem. The proposed approach employs TS algorithm for optimal settings of the control variables of the OPF problem. Incorporation of TS as a derivative-free optimization technique in solving OPF problem signicantly reduces the computational burden. One of the main advantages of T...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Computer Science
سال: 2016
ISSN: 1877-0509
DOI: 10.1016/j.procs.2016.04.003