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

Previous Page 91 Next

Displaying 1801 – 1820 of 4962

Showing per page

Extraction of fuzzy logic rules from data by means of artificial neural networks

Martin Holeňa (2005)

Kybernetika

The extraction of logical rules from data has been, for nearly fifteen years, a key application of artificial neural networks in data mining. Although Boolean rules have been extracted in the majority of cases, also methods for the extraction of fuzzy logic rules have been studied increasingly often. In the paper, those methods are discussed within a five-dimensional classification scheme for neural-networks based rule extraction, and it is pointed out that all of them share the feature of being...

Extraction of fuzzy rules using deterministic annealing integrated with ε-insensitive learning

Robert Czabański (2006)

International Journal of Applied Mathematics and Computer Science

A new method of parameter estimation for an artificial neural network inference system based on a logical interpretation of fuzzy if-then rules (ANBLIR) is presented. The novelty of the learning algorithm consists in the application of a deterministic annealing method integrated with ε-insensitive learning. In order to decrease the computational burden of the learning procedure, a deterministic annealing method with a "freezing" phase and ε-insensitive learning by solving a system of linear inequalities...

Eye localization for face recognition

Paola Campadelli, Raffaella Lanzarotti, Giuseppe Lipori (2006)

RAIRO - Theoretical Informatics and Applications

We present a novel eye localization method which can be used in face recognition applications. It is based on two SVM classifiers which localize the eyes at different resolution levels exploiting the Haar wavelet representation of the images. We present an extensive analysis of its performance on images of very different public databases, showing very good results.

Factor frequencies in generalized Thue-Morse words

Ľubomíra Balková (2012)

Kybernetika

We describe factor frequencies of the generalized Thue-Morse word 𝐭 b , m defined for b ≥ 2 , m ≥ 1 , b , m ∈ ℕ , as the fixed point starting in 0 of the morphism ϕ b , m ( k ) = k ( k + 1 ) ⋯ ( k + b - 1 ) , where k ∈ { 0 , 1 , ⋯ , m - 1 } and where the letters are expressed modulo m . We...

Factoring and testing primes in small space

Viliam Geffert, Dana Pardubská (2013)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

We discuss how much space is sufficient to decide whether a unary given number n is a prime. We show that O(log log n) space is sufficient for a deterministic Turing machine, if it is equipped with an additional pebble movable along the input tape, and also for an alternating machine, if the space restriction applies only to its accepting computation subtrees. In other words, the language is a prime is in pebble–DSPACE(log log n) and also in accept–ASPACE(log log n). Moreover, if the given n is...

Currently displaying 1801 – 1820 of 4962