978 search results - page 45 / 196 » Some neural networks compute, others don't |
ICANN
2009
Springer
14 years 1 months ago
2009
Springer
This paper proposes a clustering method SOMAK, which is composed by Self-Organizing Maps (SOM) followed by the Ant K-means (AK) algorithm. The aim of this method is not to find an...
IJCNN
2000
IEEE
14 years 1 months ago
2000
IEEE
The well-known backpropagation (BP) derivative computation process for multilayer perceptrons (MLP) learning can be viewed as a simplified version of the Kelley-Bryson gradient f...
ESANN
2006
13 years 10 months ago
2006
Abstract. Feature Selection techniques usually follow some search strategy to select a suitable subset from a set of features. Most neural network growing algorithms perform a sear...
SYRCODIS
2007
13 years 10 months ago
2007
High complexity of lattice construction algorithms and uneasy way of visualising lattices are two important problems connected with the formal concept analysis. Algorithm complexi...
AI
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. In this paper, we test some of the most commonly used classifiers to identify which ones are the most robust to changing environments. The environment may change over tim...