Search results for "algorithm."

Stereotaktisten annossuunnitelmien verifiointi Compass-järjestelmällä

2016

Model selection using limiting distributions of second-order blind source separation algorithms

2015

Signals, recorded over time, are often observed as mixtures of multiple source signals. To extract relevant information from such measurements one needs to determine the mixing coefficients. In case of weakly stationary time series with uncorrelated source signals, this separation can be achieved by jointly diagonalizing sample autocovariances at different lags, and several algorithms address this task. Often the mixing estimates contain close-to-zero entries and one wants to decide whether the corresponding source signals have a relevant impact on the observations or not. To address this question of model selection we consider the recently published second-order blind identification proced…

Surrogate-assisted evolutionary multiobjective shape optimization of an air intake ventilation system

2017

We tackle three different challenges in solving a real-world industrial problem: formulating the optimization problem, connecting different simulation tools and dealing with computationally expensive objective functions. The problem to be optimized is an air intake ventilation system of a tractor and consists of three computationally expensive objective functions. We describe the modeling of the system and its numerical evaluation with a commercial software. To obtain solutions in few function evaluations, a recently proposed surrogate-assisted evolutionary algorithm K-RVEA is applied. The diameters of four different outlets of the ventilation system are considered as decision variables. Fr…

Exact extension of the DIRECT algorithm to multiple objectives

2019

The direct algorithm has been recognized as an efficient global optimization method which has few requirements of regularity and has proven to be globally convergent in general cases. direct has been an inspiration or has been used as a component for many multiobjective optimization algorithms. We propose an exact and as genuine as possible extension of the direct method for multiple objectives, providing a proof of global convergence (i.e., a guarantee that in an infinite time the algorithm becomes everywhere dense). We test the efficiency of the algorithm on a nonlinear and nonconvex vector function. peerReviewed

A Cooperative Coevolution Framework for Parallel Learning to Rank

2015

We propose CCRank, the first parallel framework for learning to rank based on evolutionary algorithms (EA), aiming to significantly improve learning efficiency while maintaining accuracy. CCRank is based on cooperative coevolution (CC), a divide-and-conquer framework that has demonstrated high promise in function optimization for problems with large search space and complex structures. Moreover, CC naturally allows parallelization of sub-solutions to the decomposed sub-problems, which can substantially boost learning efficiency. With CCRank, we investigate parallel CC in the context of learning to rank. We implement CCRank with three EA-based learning to rank algorithms for demonstration. E…

A novel heuristic memetic clustering algorithm

2013

In this paper we introduce a novel clustering algorithm based on the Memetic Algorithm meta-heuristic wherein clusters are iteratively evolved using a novel single operator employing a combination of heuristics. Several heuristics are described and employed for the three types of selections used in the operator. The algorithm was exhaustively tested on three benchmark problems and compared to a classical clustering algorithm (k-Medoids) using the same performance metrics. The results show that our clustering algorithm consistently provides better clustering solutions with less computational effort.

Shape Sensitivity Analysis and Gradient-Based Optimization of Large Structures Using MLFMA

2014

A fast method for computing the action of shape-differentiated electric field integral equation (EFIE) system matrix to a vector is derived exploiting the multilevel fast multipole algorithm (MLFMA). The proposed method is used in conjunction with the adjoint-variable method (AVM) to compute the shape gradient of arbitrary objective functions depending on shape of a metallic scatterer. The method is demonstrated numerically by optimizing the shape of a parabolic reflector illuminated with a half-wave dipole.

Twister Tries

2015

Many commonly used data-mining techniques utilized across research fields perform poorly when used for large data sets. Sequential agglomerative hierarchical non-overlapping clustering is one technique for which the algorithms’ scaling properties prohibit clustering of a large amount of items. Besides the unfavorable time complexity of O(n 2 ), these algorithms have a space complexity of O(n 2 ), which can be reduced to O(n) if the time complexity is allowed to rise to O(n 2 log2 n). In this paper, we propose the use of locality-sensitive hashing combined with a novel data structure called twister tries to provide an approximate clustering for average linkage. Our approach requires only lin…

Interface Detection Using a Quenched-Noise Version of the Edwards-Wilkinson Equation

2015

We report here a multipurpose dynamic-interface-based segmentation tool, suitable for segmenting planar, cylindrical, and spherical surfaces in 3D. The method is fast enough to be used conveniently even for large images. Its implementation is straightforward and can be easily realized in many environments. Its memory consumption is low, and the set of parameters is small and easy to understand. The method is based on the Edwards-Wilkinson equation, which is traditionally used to model the equilibrium fluctuations of a propagating interface under the influence of temporally and spatially varying noise. We report here an adaptation of this equation into multidimensional image segmentation, an…

Genetic programming through bi-objective genetic algorithms with a study of a simulated moving bed process involving multiple objectives

2013

A new bi-objective genetic programming (BioGP) technique has been developed for meta-modeling and applied in a chromatographic separation process using a simulated moving bed (SMB) process. The BioGP technique initially minimizes training error through a single objective optimization procedure and then a trade-off between complexity and accuracy is worked out through a genetic algorithm based bi-objective optimization strategy. A benefit of the BioGP approach is that an expert user or a decision maker (DM) can flexibly select the mathematical operations involved to construct a meta-model of desired complexity or accuracy. It is also designed to combat bloat - a perennial problem in genetic …