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

Displaying 21 – 40 of 69

Showing per page

Conditional problem for objective probability

Otakar Kříž (1998)

Kybernetika

Marginal problem (see [Kel]) consists in finding a joint distribution whose marginals are equal to the given less-dimensional distributions. Let’s generalize the problem so that there are given not only less-dimensional distributions but also conditional probabilities. It is necessary to distinguish between objective (Kolmogorov) probability and subjective (de Finetti) approach ([Col,Sco]). In the latter, the coherence problem incorporates both probabilities and conditional probabilities in a unified...

Design of a Participatory Decision Making Agent Architecture Based on Argumentation and Influence Function – Application to a Serious Game about Biodiversity Conservation

Alessandro Sordoni, Jean-Pierre Briot, Isabelle Alvarez, Eurico Vasconcelos, Marta de Azevedo Irving, Gustavo Melo (2010)

RAIRO - Operations Research

This paper addresses an ongoing experience in the design of an artificial agent taking decisions and combining them with the decisions taken by human agents. The context is a serious game research project, aimed at computer-based support for participatory management of protected areas (and more specifically national parks) in order to promote biodiversity conservation and social inclusion. Its objective is to help various stakeholders (e.g., environmentalist, tourism operator) to collectively understand...

Discriminating between causal structures in Bayesian Networks given partial observations

Philipp Moritz, Jörg Reichardt, Nihat Ay (2014)

Kybernetika

Given a fixed dependency graph G that describes a Bayesian network of binary variables X 1 , ⋯ , X n , our main result is a tight bound on the mutual information I c ( Y 1 , ⋯ , Y k ) = ∑ j = 1 k H ( Y j ) / c - H ( Y 1 , ⋯ , Y k ) of an observed subset Y 1 , ⋯ , Y k of the variables X 1 , ⋯ , X n . Our bound depends on certain quantities that can be computed from the connective structure of the nodes in G . Thus it allows to discriminate between different dependency graphs for a probability distribution, as we show from numerical experiments.

Fuzzy set theory for cumulative trauma prediction.

Daniel J. Fonseca, Thomas W. Merritt, Gary P. Moynihan (2001)

Mathware and Soft Computing

A widely used fuzzy reasoning algorithm was modified and implemented via an expert system to assess the potential risk of employee repetitive strain injury in the workplace. This fuzzy relational model, known as the Priority First Cover Algorithm (PFC), was adapted to describe the relationship between 12 cumulative trauma disorders (CTDs) of the upper extremity, and 29 identified risk factors. The algorithm, which finds a suboptimal subset from a group of variables based on the criterion of priority,...

Generalized Möbius transformation of knowledge bases

Milan Daniel (1998)

Kybernetika

Möbius transformation is an important tool for establishing weights of compositional expert systems rules from conditional weights. In this paper, an applicability of Möbius transformation of rule bases is also extended to knowledge bases with elementary disjunctions in antecedents of rules. This paper contains an existence theorem, an algorithm of the transformation and some open problems which tend to maximal generality as well.

Grounding and extracting modal responses in cognitive agents: 'AND' query and states of incomplete knowledge

Radosław Katarzyniak, Agnieszka Pieczynska-Kuchtiak (2004)

International Journal of Applied Mathematics and Computer Science

In this study an original way of modeling language grounding and generation for a simple set of language responses is presented. It is assumed that the language is used by a cognitive agent and consists of a few modal belief and possibility formulas that are used by this agent to communicate its opinions on the current state of an object. The cognitive agent is asked a simple AND query and the language is tailored to this situation. The agent's knowledge bases are characterized by certain incompleteness...

Guided Local Search for query reformulation using weight propagation

Issam Moghrabi (2006)

International Journal of Applied Mathematics and Computer Science

A new technique for query reformulation that assesses the relevance of retrieved documents using weight propagation is proposed. The technique uses a Guided Local Search (GLS) in conjunction with the latent semantic indexing model (to semantically cluster documents together) and Lexical Matching (LM). The GLS algorithm is used to construct a minimum spanning tree that is later employed in the reformulation process. The computations done for Singular Value Decomposition (SVD), LM and the minimum...

How to secure a high quality knowledge base in a rulebased system with uncertainty

Beata Jankowska (2006)

International Journal of Applied Mathematics and Computer Science

Although the first rule-based systems were created as early as thirty years ago, this methodology of expert systems designing still proves to be useful. It becomes especially important in medical applications, while treating evidence given in an electronic format. Constructing the knowledge base of a rule-based system and, especially, of a system with uncertainty is a difficult task because of the size of this base as well as its heterogeneous character. The base consists of facts, ordinary rules...

Idempotent operators on a finite chain.

Margalida Mas Grimalt, Joan Torrens, Tomasa Calvo, Marc Carbonell (1999)

Mathware and Soft Computing

This work is devoted to find and study some possible idempotent operators on a finite chain L. Specially, all idempotent operators on L which are associative, commutative and non-decreasing in each place are characterized. By adding one smoothness condition, all these operators reduce to special combinations of Minimum and Maximum.

Interpretability of linguistic variables: a formal account

Ulrich Bodenhofer, Peter Bauer (2005)

Kybernetika

This contribution is concerned with the interpretability of fuzzy rule-based systems. While this property is widely considered to be a crucial one in fuzzy rule-based modeling, a more detailed formal investigation of what “interpretability” actually means is not available. So far, interpretability has most often been associated with rather heuristic assumptions about shape and mutual overlapping of fuzzy membership functions. In this paper, we attempt to approach this problem from a more general...

Currently displaying 21 – 40 of 69