In many decision making problems evaluations of possible alternatives of choice, with respect to several points of view (criteria) are expressed by means of h−interval (or fuzzy numbers). For example a pessimistic and an optimistic evaluation generate an interval containing the exact evaluation. These situations reflect lack of information or uncertainty on the same evaluations. In this paper w...

This paper will give a description of all continuous functions which are comparison meaningful in the sense of measurement theory. Copyright 2001 Academic Press.

We explore the possible benefit that provides a linguistic approach to Big Data. The proposal illustrates how implement Linguistic Aggregation Functions using the MapReduce paradigm. The best known paradigm applied to Big Data. The proposal allows several benefits to Big Data e.g., it allows to interpret data in a more intuitive way, reduce data size into different levels of granularity, and ma...

Find loads of the aggregation functions a guide for practitioners book catalogues in this site as the choice of you visiting this page. You can also join to the website book library that will show you numerous books from any types. Literature, science, politics, and many more catalogues are presented to offer you the best book to find. The book that really makes you feels satisfied. Or that's t...

In lattice theory, lattice polynomials have been defined as well-formed expressions involving variables linked by the lattice operations ∧ and ∨ in an arbitrary combination of parentheses. In turn, such expressions naturally define lattice polynomial functions. For instance, p(x1, x2, x3) = (x1 ∧ x2) ∨ x3 is a 3-ary lattice polynomial function. The concept of lattice polynomial function can be ...

Ordinal sums have been introduced in many different contexts, e.g., for posets, semigroups, t-norms, copulas, aggregation operators, or quite recently for hoops. In this contribution, we focus on ordinal sums of t-norms acting on some bounded lattice which is not necessarily a chain or an ordinal sum of posets. Necessary and sufficient conditions are provided for an ordinal sum operation yieldi...

This article discusses Lipschitz properties of generated aggrega-tion functions. Such generated functions include triangular norms and conorms, quasi-arithmetic means, uninorms, nullnorms and continuous generated functions with a neutral element. The Lipschitz property guarantees stability of aggregation operations with respect to input inaccuracies, and is important for applications. We provid...

In many practical applications, the need arises to aggregate data of varying dimension. Following from the self-identity property, some recent studies have looked at the stability of aggregation operators in terms of their behavior as the dimensionality is increased from n−1 to n. We use the penalty-based representation of aggregation functions in order to investigate the conditions for weighti...

Machine learning techniques are increasingly being applied to problems in the domain of information retrieval and text mining. In this paper we present an application of evolutionary computation to the area of expert search. Expert search in the context of enterprise information systems deals with the problem of finding and ranking candidate experts given an information need (query). A difficul...

A relationship between the discrete F-transform and aggregation functions is analyzed. We show that the discrete F-transform (direct or inverse) can be associated with a set of linear aggregation functions that respect a fuzzy partition of a universe. On the other side, we discover conditions that should be added to a set of linear aggregation functions in order to obtain the discrete F-transfo...