Displaying similar documents to “Treshold logic unit optimization by linear programming”

On the learning of weights in some aggregation operators: the weigthed mean and OWA operators.

Vicenç Torra (1999)

Mathware and Soft Computing

Similarity:

We study the determination of weights for two types of aggregation operators: the weighted mean and the OWA operator. We assume that there is at our disposal a set of examples for which the outcome of the aggregation operator is known. In the case of the OWA operator, we compare the results obtained by our method with another one in the literature. We show that the optimal weighting vector is reached with less cost.

Consistency-driven approximation of a pairwise comparison matrix

Esther Dopazo, Jacinto González-Pachón (2003)

Kybernetika

Similarity:

The pairwise comparison method is an interesting technique for building a global ranking from binary comparisons. In fact, some web search engines use this method to quantify the importance of a set of web sites. The purpose of this paper is to search a set of priority weights from the preference information contained in a general pairwise comparison matrix; i.e., a matrix without consistency and reciprocity properties. For this purpose, we consider an approximation methodology within...

Evaluation of decision-making units based on the weight-optimized DEA model

Jiasen Sun, Rui Yang, Xiang Ji, Jie Wu (2017)

Kybernetika

Similarity:

Data envelopment analysis (DEA) is a methodology for measuring best relative efficiencies of a group of peer decision-making units (DMUs) that take multiple inputs to produce multiple outputs. However, the traditional DEA model only aims to maximize the efficiency of the DMU under evaluation. This usually leads to very small weights (even zero weights) being assigned to some inputs or outputs. Correspondingly, these inputs or outputs have little or even no contribution to efficiency,...

Building a knowledge base for correspondence analysis.

M.ª Carmen Bravo Llatas (1994)

Qüestiió

Similarity:

This paper introduces a statistical strategy for Correspondence Analysis. A formal description of the choices, actions and decisions taken during data analysis is built. Rules and heuristics have been obtained from the application of this technique to real case studies. The strategy proposed checks suitability of certain types of data matrices for this analysis and also considers a guidance and interpretation of the application of this technique. Some algorithmic-like rules...