Page 1 Next

Displaying 1 – 20 of 36

Showing per page

Majority multiplicative ordered weighting geometric operators and their use in the aggregation of multiplicative preference relations.

José Ignacio Peláez, Jesús María Doña, Alejandro Mesas (2005)

Mathware and Soft Computing

In this paper, we introduced the majority multiplicative ordered weighted geometric (MM-OWG) operator and its properties. This is a general type of the aggregate dependent weights which we have applied in geometric environment. The MM-OWG operator is based on the OWG operators and on the majority operators. We provide the MM-OWG operators to aggregate in a multiplicative environment, i.e. when it's necessary to aggregate information given on a ratio scale. Therefore, it allows us to incorporate...

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.

Max-min fuzzy neural networks for solving relational equations.

Armando Blanco, Miguel Delgado, Ignacio Requena (1994)

Mathware and Soft Computing

The Relational Equations approach is one of the most usual ones for describing (Fuzzy) Systems and in most cases, it is the final expression for other descriptions. This is why the identification of Relational Equations from a set of examples has received considerable atention in the specialized literature. This paper is devoted to this topic, more specifically to the topic of max-min neural networks for identification. Three methods of learning Fuzzy Systems are developed by combining the most...

Measuring criteria weights by means of Dimension Theory.

Daniel Gómez, Javier Montero de Juan, Javier Yáñez Gestoso (2006)

Mathware and Soft Computing

Measuring criteria weights in multicriteria decision making is a key issue in order to amalgamate information when reality is being described from several different points of view. In this paper we propose a method for evaluating those weights taking advantage of Dimension Theory, which allows the representation of the set of alternatives within a real space, provided that decision maker preferences satisfy certain consistency conditions. Such a representation allows a first information about possible...

Mechanical analogy of statement networks

Wojciech Cholewa (2008)

International Journal of Applied Mathematics and Computer Science

The paper demonstrates briefly the reasoning capabilities in condition monitoring offered by systems based on statement networks. The usefulness of the networks considered results among others from possibilities of their optimization related to the minimization of contradictions between rules acquired from different knowledge sources. A mechanical analogy of such networks introduces an interpretation of statements as material points that are able to move. Dependencies between statements are considered...

Meta-optimization of bio-inspired algorithms for antenna array design

Virgilio Zúñiga-Grajeda, Alberto Coronado-Mendoza, Kelly Joel Gurubel-Tun (2018)

Kybernetika

In this article, a technique called Meta-Optimization is used to enhance the effectiveness of bio-inspired algorithms that solve antenna array synthesis problems. This technique consists on a second optimization layer that finds the best behavioral parameters for a given algorithm, which allows to achieve better results. Bio-inspired computational methods are useful to solve complex multidimensional problems such as the design of antenna arrays. However, their performance depends heavily on the...

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

Mining indirect association rules for web recommendation

Przemysław Kazienko (2009)

International Journal of Applied Mathematics and Computer Science

Classical association rules, here called “direct”, reflect relationships existing between items that relatively often co-occur in common transactions. In the web domain, items correspond to pages and transactions to user sessions. The main idea of the new approach presented is to discover indirect associations existing between pages that rarely occur together but there are other, “third” pages, called transitive, with which they appear relatively frequently. Two types of indirect associations rules...

Currently displaying 1 – 20 of 36

Page 1 Next