В статье описывается алгоритм для сравнения данных о физических лицах в разнородных системах и рассматривается его эффективность в отношении других методов...

This paper presents and exemplifies results developed for cointegration analysis with state space models by Bauer and Wagner in a series of papers. Unit root processes, cointegration and polynomial cointegration are defined. Based upon these definitions the major part of the paper discusses how...

This study presents a first comparative analysis of Lasso-type (Lasso, adaptive Lasso, elastic net) and heuristic subset selection methods. Although the Lasso has shown success in many situations, it has some limitations. In particular, inconsistent results are obtained for pairwise strongly...

A genetic algorithm is convergent when genetic mutations occur on the objective function gradient direction. These genetic mutations are called genetic acquisitions (Mateescu, 2005). We improved the algorithm and its implementation by using the characteristics of parents in order to generate new...

Resource constraints are commonly found in classification tasks. For example, there could be a budget limit on implementation and a deadline for finishing the classification task. Applying the top-down approach for tree induction in this situation may have significant drawbacks. In particular,...

For more than three decades, empirical analysis of stochastic dominance was restricted to settings with mutually exclusive choice alternatives. In recent years, a number of methods for testing efficiency of diversified portfolios have emerged, which can be classified into three main categories:...

This paper shows how can be estimated the value of an option if we assume the double- Heston model on a message-based architecture. For path trace simulation we will discretize continous model with an Euler division of time.