Provider: | ITTB |
---|---|
Version: | 1.1 |
This web service cuts a fuzzy relation (on alternatives) at a given threshold and produces a relation. Compared to the web service cutRelation, the produced relation is not necessary binary. In fact, some parameters are added. You can choose between classical cut and bipolar cut. The cut level is specified and an output relation is generated. In the case of classical cut, the output relation can be crisp output, binary output or other binary output. When a bipolar cut is taken into account, the output relation can be a bipolar output or other bipolar output.
(For outputs, see below)
Generates a graph taking into account the proposed options.
Parameter values can be defined via the GUI or the XMCDA file, by default via GUI.
Name: Cut type:
Choose between classical or bipolar.
Name: Cut threshold:
Float for the cut level. The default value is zero.
Name: Classical output:
Choose between crisp, binary or other binary output.
Name: Bipolar output:
Choose between bipolar or other bipolar output.
Name: True:
Float for the true value. The default value is 1.
Name: False:
Float for the false value. The default value is an 0.
Name: Indeterminate:
Float for the indeterminate value. The default value is 0.5.
A list of alternatives. Alternatives can be activated or desactivated via the <active> tag (true or false). By default (no <active> tag), alternatives are considered as active.
Tag: alternatives
Code:
<alternatives>
<alternative>
<active>[...]</active>
[...]
</alternative>
[...]
</alternatives>
A valued relation relative to comparisons of the alternatives. A numeric <value> indicates a the valuation for each <pair> of the relation.
Tag: alternativesComparisons
Code:
<alternativesComparisons>
<pairs>
<pair>
<initial>
<alternativeID>[...]</alternativeID>
</initial>
<terminal>
<alternativeID>[...]</alternativeID>
</terminal>
<value>
<real>[...]</real>
</value>
</pair>
[...]
</pairs>
</alternativesComparisons>
The relation resulting from the cut.
A list of messages generated by the algorithm.
For further technical details on the web service underlying this program, have a look at its documentation here.