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 18 Next

Displaying 341 – 360 of 941

Showing per page

Dynamic estimation of evidence discounting rates based on information credibility

M. C. Florea, A.-L. Jousselme, É. Bossé (2010)

RAIRO - Operations Research

Information quality is crucial to any information fusion system as combining unreliable or partially credible pieces of information may lead to erroneous results. In this paper, Dempster-Shafer theory of evidence is being used as a framework for representing and combining uncertain pieces of information. We propose a method of dynamic estimation of evidence discounting rates based on the credibility of pieces of information. The credibility of a piece of information Cre(In) is evaluated through...

Dynamic gridmaps: comparing building techniques.

José María Cañas, Vicente Matellán (2006)

Mathware and Soft Computing

Mobile robots need to represent obstacles in their surroundings, even moving ones, to make right movement decisions. For higher autonomy the robot should automatically build such representation from its sensory input. This paper compares the dynamic character of several gridmap building techniques: probabilistic, fuzzy, theory of evidence and histogramic. Two criteria are defined to rank such dynamism in the representation: time to show a new obstacle and time to show a new hole. The update rules...

Dynamic programming for reduced NFAs for approximate string and sequence matching

Jan Holub (2002)

Kybernetika

searching for all occurrences of a pattern (string or sequence) in some text, where the pattern can occur with some limited number of errors given by edit distance. Several methods were designed for the approximate string matching that simulate nondeterministic finite automata (NFA) constructed for this problem. This paper presents reduced NFAs for the approximate string matching usable in case, when we are interested only in occurrences having edit distance less than or equal to a given integer,...

Dynamiques recuites de type Feynman-Kac : résultats précis et conjectures

Pierre Del Moral, Laurent Miclo (2006)

ESAIM: Probability and Statistics

Soit U une fonction définie sur un ensemble fini E muni d'un noyau markovien irréductible M. L'objectif du papier est de comparer théoriquement deux procédures stochastiques de minimisation globale de U : le recuit simulé et un algorithme génétique. Pour ceci on se placera dans la situation idéalisée d'une infinité de particules disponibles et nous ferons une hypothèse commode d'existence de suffisamment de symétries du cadre (E,M,U). On verra notamment que contrairement au recuit simulé, toute...

Efficiency-conscious propositionalization for relational learning

Filip Železný (2004)

Kybernetika

Systems aiming at discovering interesting knowledge in data, now commonly called data mining systems, are typically employed in finding patterns in a single relational table. Most of mainstream data mining tools are not applicable in the more challenging task of finding knowledge in structured data represented by a multi-relational database. Although a family of methods known as inductive logic programming have been developed to tackle that challenge by immediate means, the idea of adapting structured...

Employing different loss functions for the classification of images via supervised learning

Radu Boţ, André Heinrich, Gert Wanka (2014)

Open Mathematics

Supervised learning methods are powerful techniques to learn a function from a given set of labeled data, the so-called training data. In this paper the support vector machines approach is applied to an image classification task. Starting with the corresponding Tikhonov regularization problem, reformulated as a convex optimization problem, we introduce a conjugate dual problem to it and prove that, whenever strong duality holds, the function to be learned can be expressed via the dual optimal solutions....

Epoch-incremental reinforcement learning algorithms

Roman Zajdel (2013)

International Journal of Applied Mathematics and Computer Science

In this article, a new class of the epoch-incremental reinforcement learning algorithm is proposed. In the incremental mode, the fundamental TD(0) or TD(λ) algorithm is performed and an environment model is created. In the epoch mode, on the basis of the environment model, the distances of past-active states to the terminal state are computed. These distances and the reinforcement terminal state signal are used to improve the agent policy.

Equivalence of compositional expressions and independence relations in compositional models

Francesco M. Malvestuto (2014)

Kybernetika

We generalize Jiroušek’s (right) composition operator in such a way that it can be applied to distribution functions with values in a “semifield“, and introduce (parenthesized) compositional expressions, which in some sense generalize Jiroušek’s “generating sequences” of compositional models. We say that two compositional expressions are equivalent if their evaluations always produce the same results whenever they are defined. Our first result is that a set system ℋ is star-like with centre X if...

Estimating composite functions by model selection

Yannick Baraud, Lucien Birgé (2014)

Annales de l'I.H.P. Probabilités et statistiques

We consider the problem of estimating a function s on [ - 1 , 1 ] k for large values of k by looking for some best approximation of s by composite functions of the form g ∘ u . Our solution is based on model selection and leads to a very general approach to solve this problem with respect to many different types of functions g , u and statistical frameworks. In particular, we handle the problems of approximating s by additive functions, single and multiple index models, artificial neural networks, mixtures of Gaussian...

Euler's Polyhedron Formula

Jesse Alama (2008)

Formalized Mathematics

Euler's polyhedron theorem states for a polyhedron p, thatV - E + F = 2,where V, E, and F are, respectively, the number of vertices, edges, and faces of p. The formula was first stated in print by Euler in 1758 [11]. The proof given here is based on Poincaré's linear algebraic proof, stated in [17] (with a corrected proof in [18]), as adapted by Imre Lakatos in the latter's Proofs and Refutations [15].As is well known, Euler's formula is not true for all polyhedra. The condition on polyhedra considered...

Evaluating many valued modus ponens

Dana Hliněná, Vladislav Biba (2012)

Kybernetika

This paper deals with many valued case of modus ponens. Cases with implicative and with clausal rules are studied. Many valued modus ponens via discrete connectives is studied with implicative rules as well as with clausal rules. Some properties of discrete modus ponens operator are given.

Currently displaying 341 – 360 of 941