Author's network

In this article a number of neural networks based on self organizing maps, that can be successfully used for dynamic object identification, is described. The structure and algorithms of learning and operation of such SOM-based neural networks are described in details, also some experimental results is given.
View full abstract»

This paper presents an automatic clustering system, built as a committee machine, which is used to cohesively partition the self-organizing map. In the proposed method, each expert from the committee machine analyzes the connections of the neuron grid based on a particular similarity matrix, and thus decides which ones should be pruned by gradually removing them and observing the intervals of stab...
View full abstract»

Both Semi-Supervised Leaning and Active Learning are techniques used when unlabeled data is abundant, but the process of labeling them is expensive and/or time consuming. In this paper, those two machine learning techniques are combined into a single nature-inspired method. It features particles walking on a network built from the data set, using a unique random-greedy rule to select neighbors to ...
View full abstract»

Semi-supervised learning algorithms address the problem of learning from partially labeled data. However, most of the semi-supervised classification methods proposed in the literature considers a stationary distribution of data. Which means that future data patterns tend to conform to the data distribution presented in data set throughout the application lifetime. However, for plenty of new variet...
View full abstract»

Neural assembly computing (NAC) is a framework for investigating computational operations realized by spiking cell assemblies and for designing spiking neural machines. NAC concerns the way assemblies interact and how it results in information processing with causal and hierarchical relations. In addition, NAC investigates how assemblies represent states of the world, how they control data flux ca...
View full abstract»

Optical fibers are commonly used in communications today, mainly because that the data transmission rates of those systems are faster than those in any other digital communication system. Despite this great advantage, some problems prevent the full use of optical connection: by increasing transmission rates over longer distances, the data is affected by non-linear inter-symbol interference caused ...
View full abstract»

Tuberculosis is an infectious disease widely present in developing countries, which is largely motivated by the difficulty of a rapid and efficient diagnosis. In order to reduce the number of patients suspected of having TB unnecessarily isolated in hospitals, thus optimize the use of health resources, we propose a systematic procedure for developing a decision support system based on specialized ...
View full abstract»

Models of spiking neural networks have a great potential to become a crucial tool in the development of complex network theory. Of particular interest, these models can be used to better understand the important class of brain functional networks, which are frequently studied in the context of computational network analysis. A fundamental question is whether functional connectivity sampling via su...
View full abstract»

Finding a good clustering solution for an unknown problem is a challenging task. Evolutionary algorithms have proved to be reliable methods to search for high quality solutions to complex problems. The present paper proposes a new set of genetic operators for the Fast Evolutionary Algorithm for Clustering (Fast-EAC) to improve the solution quality and computational efficiency. The new algorithm, c...
View full abstract»

Differential evolution (DE) was originally designed to solve continuous optimization problems, but recent works have been investigating this algorithm for tackling combinatorial optimization (CO), particularly in permutation-based combinatorial problems. However, most DE approaches for combinatorial optimization are not general approaches to CO, being exclusive for per mutational problems and ofte...
View full abstract»

This paper utilises Evolved Linker Gene Expression Programming (EL-GEP), a new variant of Gene Expression Programming (GEP), to solve symbolic regression and sequence induction problems. The new technique was first proposed in [6] to evolve modularity in robotic behaviours. The technique extends the GEP algorithm by incorporating a new alphabetic set (linking set) from which genome linking functio...
View full abstract»

This paper presents a Copula-based Estimation of Distribution Algorithm with Parameter Updating for numeric optimization problems. This model implements an estimation of distribution algorithm using a multivariate extension of the Archimedean copula (MEC-EDA) to estimate the conditional probability for generating a population of individuals. Moreover, the model uses traditional crossover and eliti...
View full abstract»

The shortest common superstring problem has important applications in computational biology (e.g. genome assembly) and data compression. This problem is NP-hard, but several heuristic algorithms proved to be efficient for this problem. For example, for the algorithm known as GREEDY it was shown that, if the optimal superstring has the length of N, it produces an answer with length not exceeding 3....
View full abstract»