Peaking summarized

Monday, April 29th, 2013 at 00:00  

…Pattern recognition learns from examples. Thereby, generalization is needed. This can only be done if the objects, or at least the differences between pattern classes have a finite complexity….

Aristotle and the ugly duckling theorem

Monday, November 24th, 2014 at 14:52  

…The Aristotelian researcher starts from his observations and tries to combine them logically. In the extreme he is mainly a collector of observations and at most comes to empty abstractions….

Who invented the nearest neighbor rule?

Tuesday, January 28th, 2014 at 13:58  

…same results. It is thereby very suitable as a base routine in comparative studies. But who invented it? Marcello Pelillo looked back in history and tried to give an answer….

There is no best classifier

Friday, September 12th, 2014 at 21:17  

…need more training examples to compensate for the lack of prior knowledge. Classifiers that make assumptions that are not true, perform worse. The above is illustrated by one of the…

Pattern recognition and neural networks, Kuhn and Popper

Monday, May 6th, 2013 at 00:00  

…Is the neural network model good for pattern recognition? Or, is it too complex, too vague, too clumsy to be of any use in performing applications or in building…

Random Representations

Wednesday, January 8th, 2014 at 11:35  

…The goal of representation is in pattern recognition to map objects into a domain in which they can be compared. Usually, this domain is a vector space. It…

The Eurovision Song Contest Analyzed

Wednesday, May 14th, 2014 at 18:07  

…to be represented by very distant vectors. A complicating aspect is that countries are not allowed to give points to their own song. Such a restriction only holds for the…

The dissimilarity space – a step into the darkness

Monday, February 4th, 2013 at 00:00  

…large if they don’t. The quality of the measure directly relates to the discriminative power of the dissimilarity-based feature. Let us interpret dissimilarities as features! We first compute suitable dissimilarities…

Non-Euclidean embedding

Monday, January 21st, 2013 at 00:00  

…are computed according to then the resulting set of dissimilarities appears to be Euclidean. For the above example the, so-called, p-space can be a one-dimensional space in which the book,…

Discovered by accident

Tuesday, September 8th, 2015 at 22:17  

…that a castle or a ship is hidden in the heap. They randomly combine them. A surprising result may suddenly appear, depending on their imagination. When they are sufficiently skilled…

 Page 2 of 4 « 1  2  3  4 »