Extension card · Fuzzy
Fuzzy Entropy
Fuzzy Entropy Weighting is the form of Entropy Weighting used when the decision table's cells are given as a lowest-most likely-highest triple, that is, a triangular fuzzy number. It computes entropy separately on each of the three components and averages the result into a single weight vector.
Base method
Entropy Weighting →
Philosophy, mechanics, strengths and weaknesses are on the base method card; this card describes only the difference.
Data type (family)
Fuzzy →
What this data type is, when to use it, how to write it in a cell: the family's full account is here.
What Changes from the Base Method?
Three things change; the entropy logic does not.
Cells. In crisp entropy every cell is a single number. Here every cell is three numbers: lowest, most likely, highest. No weight is entered, because this method already generates weights; the input is only the decision matrix and, for each criterion, its direction (more or less is better).
Scale equalisation. Crisp entropy converts cost criteria by dividing the smallest value by every value, then converts the column to a probability by dividing by the column sum. This extension uses a different normalisation: for each component (lowest, most likely, highest), it computes (value minus the column minimum) for a benefit criterion, or (the column maximum minus the value) for a cost criterion, and then turns this difference into a share by dividing by the column sum. This is a shift-and-sum normalisation, "taking the difference from the smallest", rather than the "dividing by the smallest" of the crisp ENTROPY card; the two methods can give different probability distributions, and hence different entropy values, on the same data.
Entropy and weight. On each component, that is, the lowest, most likely and highest matrices, an independent crisp entropy calculation is run with the normalisation above: conversion to a probability, Shannon entropy, divergence (1 minus entropy), and a weight that sums to 1. Three separate weight vectors emerge from the three components; these three vectors are averaged and renormalised so that the sum is again 1, giving the final weight. In other words, the fuzziness is split across three parallel crisp calculations and only "settles" through averaging at the end; no triangular arithmetic, addition or multiplication, is used at any step.
DecisionMind fixes three things in this extension: the shift-and-sum normalisation (benefit: value minus minimum, cost: maximum minus value), the independent crisp entropy calculation for each of the three components, and the rule that the final weight is the plain arithmetic mean of the three component weights, not their centre of gravity.
How to Read the Output
The output, as in crisp entropy, is a weight vector summing to 1, and it is read on the same principle: a weight shows not how important the decision-maker considers the criterion, but how much this criterion discriminates between the alternatives in this table.
The difference is this. The further apart the weights given by the three components (lowest, most likely, highest) sit from one another, the wider the triangle, and the more uncertain that criterion's weight becomes. If the three component weights sit close together, that is, if the triangle's width barely affects the weight, the result is robust. Where the components diverge sharply, a single average number conceals that uncertainty.
Thus instead of writing:
"The fuzzy entropy weight came out at 0.358, so this criterion determines close to a third of the decision"
the report should read:
"The average weight is 0.358; whether the weights given separately by the lowest, most likely and highest components sit close together, or far apart, shows how robust this result is, and it should be stated in the report"
When to Prefer This over the Base Method
Use this extension when the values in the decision table are not exact measurements but expert estimates or approximate magnitudes; the rule given on the fuzzy data-type card applies here in exactly the same way. Crisp entropy's exit condition also applies here: every value must be positive, and if a criterion is identical across all alternatives its weight comes out at zero and that criterion should be removed from the table. In addition, every triangle must satisfy lowest ≤ most likely ≤ highest; no criterion may be constant across all three components at once, otherwise that criterion's weight becomes undefined in all three components.
Mistakes Specific to This Extension
Uniform proportional fuzzification. Widening every cell by the same proportion, say ±10 per cent, to build the triangle makes the three components' normalised weights nearly identical to one another; in that case the fuzzy extension adds no information over the crisp method, and this is a situation the manifest itself warns about.
Assuming there is one natural, canonical "fuzzy entropy" formula. The literature contains more than one formulation of fuzzy entropy weighting, with different normalisations and different forms of fuzzy arithmetic; the independent-calculation-then-average approach DecisionMind uses here is only one of them, not the single "correct" method.
Confusing this scale equalisation with the crisp ENTROPY card's. This extension uses "taking the difference from the smallest" normalisation, not "dividing by the smallest"; the two methods can give different weights on the same table, and which one was used should be stated in the report.
Over-trusting a weight produced from few alternatives. The warning on the crisp entropy card holds even more strongly here: a change at just one end of a fuzzy cell, for instance in its highest value, can shift the weight noticeably in a table built from a small number of alternatives.
The governing principle is this:
The fuzzy entropy weight is built by computing the three components, lowest, most likely and highest, separately and then averaging them; the larger the gap between the components, the more fragile the average weight is, and this fragility should be shown in the report.
Cases
The first case is DecisionMind's validation example; the manifest's own note states plainly that this input is not a literature example but a fidelity test generated from DecisionMind's own codebase (an executable source named "analyse_asisance"), at evidence level C. The second case is an illustrative fiction.
1. Illustrative example: Four alternatives, three criteria (DecisionMind validation example)
This example is not a literature case; it is a table used to validate DecisionMind's fuzzy entropy engine against its own source code's output. Four alternatives are evaluated on three criteria; the first and third criteria are "more is better", the second is "less is better"; every cell is a triangular fuzzy number.
| Alternative | K1 (more is better) | K2 (less is better) | K3 (more is better) |
|---|---|---|---|
| A1 | (1; 2; 3) | (4; 5; 6) | (7; 8; 9) |
| A2 | (2; 3; 5) | (7; 8; 10) | (3; 4; 6) |
| A3 | (5; 6; 7) | (2; 3; 4) | (8; 9; 10) |
| A4 | (4; 5; 6) | (6; 7; 8) | (1; 2; 3) |
The method runs an independent crisp entropy calculation, with the normalisation above, on each component (lowest, most likely, highest), producing three weight vectors, and averages them. The three calculations were independently reproduced in Python and matched DecisionMind's own validation values to a tolerance of 1e-8.
| Criterion | Lowest-component weight | Most-likely-component weight | Highest-component weight | Average weight |
|---|---|---|---|---|
| K1 | 0.328 | 0.328 | 0.312 | 0.323 |
| K2 | 0.358 | 0.358 | 0.359 | 0.358 |
| K3 | 0.315 | 0.315 | 0.329 | 0.319 |
The result can be read as follows. The weights given by the three components sit very close together, at most 0.016 apart; this shows that in this table the weights are barely affected by the triangle's width, that is, the result is robust. K2 takes the highest average weight (0.358), because it is the column that discriminates most, relatively speaking, among the four alternatives.
The team has one hesitation. If A2's highest value in column K2 (10) is pulled down to 8, that is, if the triangle's width is narrowed, then K2's weight rises from 0.358 to 0.415, while K1's and K3's weights fall. In a small, four-alternative table, a single extreme value can shift a weight noticeably; this shows that the "few alternatives, sensitive to a single extreme value" finding of the crisp entropy card also holds in fuzzy form.
In the report: "The weights are derived from the average of entropy weights independently computed on the three components; K2's highest weight reflects the discriminating power it holds among the alternatives. Because the gap between components is small, the result is robust for this dataset, though a small four-alternative table is sensitive to a single extreme value."
Source: DecisionMind's FUZZY-ENTROPY engine validation example. It is a reproduction of DecisionMind's own "analyse_asisance" codebase's implementation, which performs an independent entropy calculation on the components of a triangular fuzzy number (evidence level C, not based on a published paper). The figures were independently verified against this codebase's output in Python.
2. Telecoms: Weighting network-investment regions with indicators
A telecoms operator will compare six regions on five indicators for a next-generation network investment: current coverage rate (less is better, since low coverage signals investment need), population density, average household income, number of competing operators (less is better), and a three-year population growth forecast. Because the last indicator is a forward-looking forecast, it is entered as a triangular fuzzy number, using the planning unit's lowest, most likely and highest scenario estimates; the other indicators are measured, so all three components are entered as the same number, giving zero width.
The method runs an independent entropy calculation on each component and averages the result. Suppose that in regions where the population-growth forecast's width, that is, the gap between the lowest and highest scenarios, is large, this indicator's three component weights diverge noticeably from one another, whereas the measured indicators' component weights, which have zero width, automatically come out exactly equal.
The operator has one hesitation. If the population-growth forecast's weight differs across the three components, say 0.15 at the lowest scenario and 0.28 at the highest, with an average of 0.21, that average conceals this uncertainty. If the investment decision is sensitive to this indicator, the planning unit should not finalise the result without narrowing the scenario range, that is, without producing a more reliable forecast.
In the report: "The indicator weights are exact for the measured indicators and are derived as the average of three scenario components for the population-growth forecast; this indicator's weight is sensitive to the scenario range, and the investment ranking should not be finalised without narrowing that range."
3. What Not to Do
The first mistake is collapsing the illustrative example's triangles to their centre value at the outset (K1 for A1 to 2, for A2 to 3.33, and so on) and running a single crisp entropy calculation. This inflates K3's weight from 0.319 to 0.452 and lowers K1's from 0.323 to 0.262; even the criteria's relative order changes (K2>K1>K3 in the correct calculation, K3>K2>K1 in the wrong one).
The second mistake is forgetting the cost criterion's (K2) direction and treating it as "more is better" too. This gives the highest share to the alternative with the highest K2 value and builds the weight in the wrong direction.
The third mistake is reporting only the average without comparing the weights produced by the three components. If the gap between the components is small, the result is robust; if it is large, the average alone is misleading.
Sources
For the formulas behind each step, the intermediate tables and citation formats, see the DecisionMind method page: decisionmind.app/library/fuzzy-entropy
Shannon, C. E. (1948). A mathematical theory of communication. Bell System Technical Journal, 27(3), 379–423. DOI: 10.1002/j.1538-7305.1948.tb01338.x
Hwang, C. L., & Yoon, K. (1981). Multiple Attribute Decision Making: Methods and Applications — A State-of-the-Art Survey. Lecture Notes in Economics and Mathematical Systems, Vol. 186. Springer-Verlag. DOI: 10.1007/978-3-642-48318-9
Zadeh, L. A. (1965). Fuzzy sets. Information and Control, 8(3), 338–353. DOI: 10.1016/S0019-9958(65)90241-X