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

Displaying 61 – 80 of 120

Showing per page

Hierarchical text categorization using fuzzy relational thesaurus

Domonkos Tikk, Jae Dong Yang, Sun Lee Bang (2003)

Kybernetika

Text categorization is the classification to assign a text document to an appropriate category in a predefined set of categories. We present a new approach for the text categorization by means of Fuzzy Relational Thesaurus (FRT). FRT is a multilevel category system that stores and maintains adaptive local dictionary for each category. The goal of our approach is twofold; to develop a reliable text categorization method on a certain subject domain, and to expand the initial FRT by automatically added...

Homogeneous aggregation operators

Tatiana Rückschlossová, Roman Rückschloss (2006)

Kybernetika

Recently, the utilization of invariant aggregation operators, i.e., aggregation operators not depending on a given scale of measurement was found as a very current theme. One type of invariantness of aggregation operators is the homogeneity what means that an aggregation operator is invariant with respect to multiplication by a constant. We present here a complete characterization of homogeneous aggregation operators. We discuss a relationship between homogeneity, kernel property and shift-invariance...

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...

Imposing restrictions on density functions utilised in computing with words

Marcus Gemeinder (2002)

International Journal of Applied Mathematics and Computer Science

Applying the generalised extension principle within the area of Computing with Words typically leads to complex maximisation problems. If distributed quantities-such as, e.g., size distributions within human populations-are considered, density functions representing these distributions become involved. Very often the optimising density functions do not resemble those found in nature; for instance, an optimising density function could consist of two single Dirac pulses positioned near the opposite...

Improving the generalization ability of neuro-fuzzy systems by ε-insensitive learning

Jacek Łęski (2002)

International Journal of Applied Mathematics and Computer Science

A new learning method tolerant of imprecision is introduced and used in neuro-fuzzy modelling. The proposed method makes it possible to dispose of an intrinsic inconsistency of neuro-fuzzy modelling, where zero-tolerance learning is used to obtain a fuzzy model tolerant of imprecision. This new method can be called ε-insensitive learning, where, in order to fit the fuzzy model to real data, the ε-insensitive loss function is used. ε-insensitive learning leads to a model with minimal Vapnik-Chervonenkis...

Inference in conditional probability logic

Niki Pfeifer, Gernot D. Kleiter (2006)

Kybernetika

An important field of probability logic is the investigation of inference rules that propagate point probabilities or, more generally, interval probabilities from premises to conclusions. Conditional probability logic (CPL) interprets the common sense expressions of the form “if ..., then ...” by conditional probabilities and not by the probability of the material implication. An inference rule is probabilistically informative if the coherent probability interval of its conclusion is not necessarily...

Influence of modeling structure in probabilistic sequential decision problems

Florent Teichteil-Königsbuch, Patrick Fabiani (2006)

RAIRO - Operations Research

Markov Decision Processes (MDPs) are a classical framework for stochastic sequential decision problems, based on an enumerated state space representation. More compact and structured representations have been proposed: factorization techniques use state variables representations, while decomposition techniques are based on a partition of the state space into sub-regions and take advantage of the resulting structure of the state transition graph. We use a family of probabilistic exploration-like...

Information boundedness principle in fuzzy inference process

Peter Sarkoci, Michal Šabo (2002)

Kybernetika

The information boundedness principle requires that the knowledge obtained as a result of an inference process should not have more information than that contained in the consequent of the rule. From this point of view relevancy transformation operators as a generalization of implications are investigated.

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...

Marginalization in models generated by compositional expressions

Francesco M. Malvestuto (2015)

Kybernetika

In the framework of models generated by compositional expressions, we solve two topical marginalization problems (namely, the single-marginal problem and the marginal-representation problem) that were solved only for the special class of the so-called “canonical expressions”. We also show that the two problems can be solved “from scratch” with preliminary symbolic computation.

Marginalization in multidimensional compositional models

Vladislav Bína, Radim Jiroušek (2006)

Kybernetika

Efficient computational algorithms are what made graphical Markov models so popular and successful. Similar algorithms can also be developed for computation with compositional models, which form an alternative to graphical Markov models. In this paper we present a theoretical basis as well as a scheme of an algorithm enabling computation of marginals for multidimensional distributions represented in the form of compositional models.

Marginalization like a projection.

Juan Francisco Verdegay-López, Serafín Moral (2001)

Mathware and Soft Computing

This paper studies the problem of marginalizing convex polytopes of probabilities represented by a set of constraints. This marginalization is obtained as a special case of projection on a specific subspace. An algorithm that projects a convex polytope on any subspace has been built and the expression of the subspace, where the projection must be made for obtaining the marginalization, has been calculated.

Method of least squares applied to the generalized modus ponens with interval-valued fuzzy sets.

Eduard Agustench, Humberto Bustince, Victoria Mohedano (1999)

Mathware and Soft Computing

Firstly we present a geometric interpretation of interval-valued fuzzy sets. Secondly, we apply the method of least squares to the fuzzy inference rules when working with these sets. We begin approximating the lower and upper extremes of the membership intervals to axb type functions by means of the method of least squares. Then we analyze a technique for evaluating the conclusion of the generalized modus ponens and we verify the fulfillment of Fukami and alumni axioms [9].

Minimal decision rules based on the apriori algorithm

María Fernández, Ernestina Menasalvas, Óscar Marbán, José Peña, Socorro Millán (2001)

International Journal of Applied Mathematics and Computer Science

Based on rough set theory many algorithms for rules extraction from data have been proposed. Decision rules can be obtained directly from a database. Some condition values may be unnecessary in a decision rule produced directly from the database. Such values can then be eliminated to create a more comprehensible (minimal) rule. Most of the algorithms that have been proposed to calculate minimal rules are based on rough set theory or machine learning. In our approach, in a post-processing stage,...

Model of adaptation under indeterminacy

Cyril Klimeš (2011)

Kybernetika

Information retrieval in information systems (IS) with large amounts of data is not only a matter of an effective IS architecture and design and technical parameters of computer technology used for operation of the IS, but also of an easy and intuitive orientation in a number of offers and information provided by the IS. Such retrievals in IS are, however, frequently carried out with indeterminate information, which requires other models of orientation in the environment of the IS.

Non additive ordinal relations representable by lower or upper probabilities

Andrea Capotorti, Giulianella Coletti, Barbara Vantaggi (1998)

Kybernetika

We characterize (in terms of necessary and sufficient conditions) binary relations representable by a lower probability. Such relations can be non- additive (as the relations representable by a probability) and also not “partially monotone” (as the relations representable by a belief function). Moreover we characterize relations representable by upper probabilities and those representable by plausibility. In fact the conditions characterizing these relations are not immediately deducible by means...

On a fuzzy querying and data mining interface

Janusz Kacprzyk, Sławomir Zadrożny (2000)

Kybernetika

In the paper an interface is proposed that combines flexible (fuzzy) querying and data mining functionality. The point of departure is the fuzzy querying interface designed and implemented previously by the present authors. It makes it possible to formulate and execute, against a traditional (crisp) database, queries containing imprecisely specified conditions. Here we discuss possibilities to extend it with some data mining features. More specifically, linguistic summarization of data (databases),...

Currently displaying 61 – 80 of 120