Search

Abstract: Some of the real-world problems are represented with just one label but many of today’s issues are currently being defined with multiple labels. This second group is important because multi-label classes provide a more global picture of the problem. From the study of the characteristics of the most influential systems in this area, MlKnn and RAkEL, we can observe that the main drawback of these specific systems is the time required. Therefore, the aim of the current paper is to develop a more efficient system in terms of computation without incurring accuracy loss. To meet this objective we propose MlCBR, a system for multi-label classification based on Case-Based Reasoning. The results obtained highlight the strong performance of our algorithm in comparison with previous benchmark methods in terms of accuracy rates and computational time reduction. [Copyright &y& Elsevier]

Abstract: The traditional particle filter algorithm cannot solve the validity of particles ideally. In this situation, a large amount of particles are required to guarantee tracking performance and tracking windows cannot change scale with targets adaptively. In addition, the particle filter algorithm which uses a single cue cannot achieve stable tracking regarding sudden illumination variation and similarly coloured background clutters. In this paper, an algorithm that combines CamShift with particle filter using multiple cues is proposed. The effectiveness of particles is improved and the tracking window can change scale with the target adaptively because of the use of CamShift. At the same time, an adaptive integration method is used to combine colour information with motion information, so the problems can be solved which are encountered in tracking an object with illumination variation and the background color clutter. Moreover, an occlusion handler is proposed to handle the full occlusion for a long time. [ABSTRACT FROM AUTHOR]

Abstract: Enhanced index tracking is a popular strategy in portfolio management that focuses on adding reliable value relative to the index on the basis of mimicking the behavior of the benchmark index. In this paper, we propose a multi-objective optimization scheme for the enhanced index tracking problem, which provides the framework of defining the objectives as both maximizing the degree of beating the benchmark index and minimizing the accumulated error of underperforming the benchmark. Transaction costs are limited in the constraints. An immunity-based multi-objective optimization algorithm is presented to search for the solution of the enhanced index tracking problem. Treatment of infeasibility and solution selection are also presented. Our proposed approach is implemented to five data sets drawn from major world markets. The computational results compared with other published results show that our method has superior performance. [ABSTRACT FROM AUTHOR]

Abstract: The permutation flow shop scheduling problem is addressed in this paper. Two objectives, minimization of makespan and total flow time, are considered. We propose a memetic algorithm, called NNMA, by integrating a general multiobjective evolutionary algorithm (NSGA-II) with a problem-specific heuristic (NEH). We take NEH as a local improving procedure in NNMA and propose several adaptations including the acceptance criterion and job-insertion ordering to deal with multiple objectives and to improve its performance. We test the performance of NNMA using 90 public problem instances with different problem scales, and compare its performance with 23 algorithms. The experimental results show that our NNMA provides close performance for 30 small-scale instances and better performance for 50 medium- and large-scale instances. Furthermore, more than 70% of the net set of non-dominated solutions is updated by NNMA for these 50 instances. [ABSTRACT FROM AUTHOR]

Abstract: This paper presents a discussion of “Solution of economic dispatch problems by seeker optimization algorithm” by Binod Shaw et al. “Expert Systems with Applications”, 39 January (2012) 508–519. The discussed paper presented economic dispatch problem by experimenting with four example systems considering 20, 38, 40 and 10-unit test systems considering convex and nonconvex cost functions with and without transmission loss. However in the reported results, the total cost calculations are different for the given generation schedule. In this discussion, clarification regarding cost calculations is presented. [Copyright &y& Elsevier]