Page 1

Displaying 1 – 16 of 16

Showing per page

Text document classification based on mixture models

Jana Novovičová, Antonín Malík (2004)

Kybernetika

Finite mixture modelling of class-conditional distributions is a standard method in a statistical pattern recognition. This paper, using bag-of-words vector document representation, explores the use of the mixture of multinomial distributions as a model for class-conditional distribution for multiclass text document classification task. Experimental comparison of the proposed model and the standard Bernoulli and multinomial models as well as the model based on mixture of multivariate Bernoulli distributions...

The finite automata approaches in stringology

Jan Holub (2012)

Kybernetika

We present an overview of four approaches of the finite automata use in stringology: deterministic finite automaton, deterministic simulation of nondeterministic finite automaton, finite automaton as a model of computation, and compositions of finite automata solutions. We also show how the finite automata can process strings build over more complex alphabet than just single symbols (degenerate symbols, strings, variables).

Theory of classification : a survey of some recent advances

Stéphane Boucheron, Olivier Bousquet, Gábor Lugosi (2005)

ESAIM: Probability and Statistics

The last few years have witnessed important new developments in the theory and practice of pattern classification. We intend to survey some of the main new ideas that have led to these recent results.

Theory of Classification: a Survey of Some Recent Advances

Stéphane Boucheron, Olivier Bousquet, Gábor Lugosi (2010)

ESAIM: Probability and Statistics

The last few years have witnessed important new developments in the theory and practice of pattern classification. We intend to survey some of the main new ideas that have led to these recent results.

Currently displaying 1 – 16 of 16

Page 1