All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Page 1

Displaying 1 – 18 of 18

Showing per page

Cascading classifiers

Ethem Alpaydin, Cenk Kaynak (1998)

Kybernetika

We propose a multistage recognition method built as a cascade of a linear parametric model and a k -nearest neighbor ( k -NN) nonparametric classifier. The linear model learns a “rule” and the k -NN learns the “exceptions” rejected by the “rule.” Because the rule-learner handles a large percentage of the examples using a simple and general rule, only a small subset of the training set is stored as exceptions during training. Similarly during testing, most patterns are handled by the rule -learner and...

Comparison of supervised learning methods for spike time coding in spiking neural networks

Andrzej Kasiński, Filip Ponulak (2006)

International Journal of Applied Mathematics and Computer Science

In this review we focus our attention on supervised learning methods for spike time coding in Spiking Neural Networks (SNNs). This study is motivated by recent experimental results regarding information coding in biological neural systems, which suggest that precise timing of individual spikes may be essential for efficient computation in the brain. We are concerned with the fundamental question: What paradigms of neural temporal coding can be implemented with the recent learning methods? In order...

Completing an uncertainty criterion of classification.

Joaquín Abellán (2005)

Mathware and Soft Computing

We present a variation of a method of classification based in uncertainty on credal set. Similarly to its origin it use the imprecise Dirichlet model to create the credal set and the same uncertainty measures. It take into account sets of two variables to reduce the uncertainty and to seek the direct relations between the variables in the data base and the variable to be classified. The success are equivalent to the success of the first method except in those where there are a direct relations between...

Conceptual base of feature selection consulting system

Pavel Pudil, Jana Novovičová, Petr Somol, Radek Vrňata (1998)

Kybernetika

The paper briefly reviews recent advances in the methodology of feature selection (FS) and the conceptual base of a consulting system for solving FS problems. The reasons for designing a kind of expert or consulting system which would guide a less experienced user are outlined. The paper also attempts to provide a guideline which approach to choose with respect to the extent of a priori knowledge of the problem. The methods discussed here form the core of the software package being developed for...

Construction of nonlinear discrimination function based on the MDL criterion

Manabu Sato, Mineichi Kudo, Jun Toyama, Masaru Shimbo (1998)

Kybernetika

Although a nonlinear discrimination function may be superior to linear or quadratic classifiers, it is difficult to construct such a function. In this paper, we propose a method to construct a nonlinear discrimination function using Legendre polynomials. The selection of an optimal set of Legendre polynomials is determined by the MDL (Minimum Description Length) criterion. Results using many real data show the effectiveness of this method.

Convergence analysis for principal component flows

Shintaro Yoshizawa, Uwe Helmke, Konstantin Starkov (2001)

International Journal of Applied Mathematics and Computer Science

A common framework for analyzing the global convergence of several flows for principal component analysis is developed. It is shown that flows proposed by Brockett, Oja, Xu and others are all gradient flows and the global convergence of these flows to single equilibrium points is established. The signature of the Hessian at each critical point is determined.

Correlation-based feature selection strategy in classification problems

Krzysztof Michalak, Halina Kwaśnicka (2006)

International Journal of Applied Mathematics and Computer Science

In classification problems, the issue of high dimensionality, of data is often considered important. To lower data dimensionality, feature selection methods are often employed. To select a set of features that will span a representation space that is as good as possible for the classification task, one must take into consideration possible interdependencies between the features. As a trade-off between the complexity of the selection process and the quality of the selected feature set, a pairwise...

Could a combinatorial optimization problem be solved by a differential equation?

Pedro Martínez Talaván, Javier Yáñez (2001)

RACSAM

El Problema del Viajante puede plantearse a partir del modelo de red neuronal continuo de Hopfield, que determina una solución de equilibrio para una ecuación diferencial con parámetros desconocidos. En el artículo se detalla el procedimiento de determinación de dichos parámetros con el fin de asegurar que la solución de la ecuación diferencial proporcione soluciones válidas para el Problema del Viajante.

Cross-task code reuse in genetic programming applied to visual learning

Wojciech Jaśkowski, Krzysztof Krawiec, Bartosz Wieloch (2014)

International Journal of Applied Mathematics and Computer Science

We propose a method that enables effective code reuse between evolutionary runs that solve a set of related visual learning tasks. We start with introducing a visual learning approach that uses genetic programming individuals to recognize objects. The process of recognition is generative, i.e., requires the learner to restore the shape of the processed object. This method is extended with a code reuse mechanism by introducing a crossbreeding operator that allows importing the genetic material from...

Currently displaying 1 – 18 of 18

Page 1