List of available XMCDA web services

Name Version Provider Description
2.0
UTAR
Computes ACUTA method - analytic center for UTA - which provides a set of additive value functio ...
1.1
RXMCDA
Identifies an set of piecewise linear additive value functions according to a ranking of the alt ...
1.1
ITTB
This web service computes rankings on the alternatives by distillation of alternatives' qualific ...
1.0
RXMCDA
Calculates the correlation index between two rankings of alternatives (represented by lists of r ...
1.0
kappalab
Computes the normalized entropy of a capacity. The capacity is given either as its Mobius trans ...
1.0
kappalab
Computes the favor indices of a Choquet integral from the underlying normalised Mobius transform ...
1.0
kappalab
Computes the Shapley interaction index for pairs of elements with respect to the Mobius transfor ...
1.0
kappalab
Computes the orness degree of a Choquet integral from the underlying normalized Mobius transform ...
1.0
kappalab
Computes the Shapley value (n indices) of the Mobius transform of a capacity.
1.0
kappalab
Computes the normalized variance of the Mobius transform of a capacity.
1.0
kappalab
Computes the veto indices of a Choquet integral from the underlying normalised Mobius transform ...
1.0
kappalab
Computes the Choquet integral from a normalised Mobius transform of a capacity.
1.0
RXMCDA
Computes the strength, weakness and qualification of the alternatives. Requires a 0-1 valued out ...
1.0
UTAR
Transforms a performance table via value functions.
1.0
ITTB
This web service generates a transformed numeric performance table. The performance table before ...
1.0
PyXMCDA
This web service allows to compute the Condorcet robustness denotation associated to the concord ...
1.0
ITTB
This web service aims at testing the consistency of the judgements provided by an individual or ...
1.0
RXMCDA
Converts ranks of alternatives into alternatives comparisons.
1.0
ITTB
This web service provides statistics about the criteria. It computes for every criterion the ave ...
1.0
PyXMCDA
Transforms a file containing alternatives values from a comma-separated values (CSV) file to two ...
1.0
PyXMCDA
Transforms a file containing categories profiles from a comma-separated values (CSV) file to XMC ...
1.2
PyXMCDA
Transforms a file containing criteria discrimination thresholds and preference directions from a ...
1.2
PyXMCDA
Transforms a file containing criteria values from a comma-separated values (CSV) file to two XMC ...
1.0
PyXMCDA
Transforms a file containing a performance table from a comma-separated values (CSV) file to thr ...
1.0
PyXMCDA
Transforms a file containing value functions from a comma-separated values (CSV) file to a XMCDA ...
1.1
ITTB
This web service cuts a fuzzy relation (on alternatives) at a given threshold and produces a rel ...
0.5.1
J-MCDA
Cuts a fuzzy relation (on alternatives) at a given threshold and produces a binary relation.
0.1.0
PUT
cutRelationCrisp - this module applies cut threshold to the credibility matrix provided as input ...
1.0
PUT
Computes cross efficiency scores for the given DMUs (alternatives) using CCR Data Envelopment An ...
1.0
PUT
Computes efficiency scores for the given DMUs (alternatives) using CCR Data Envelopment Analysis ...
1.0
PUT
Computes efficiency bounds scores for the given DMUs (alternatives) using CCR Data Envelopment A ...
1.0
PUT
Determines ranking intervals for the given DMUs (alternatives) using CCR Data Envelopment Analys ...
1.0
PUT
Determines necessary and possible dominance relations for the given DMUs (alternatives) using CC ...
1.0
PUT
Computes super-efficiency scores for the given DMUs (alternatives) using CCR Data Envelopment An ...
1.0
PUT
Computes efficiency scores for the given DMUs (alternatives) using SMAA-D method and CCR Data En ...
1.0
PUT
Determines dominance relations for the given DMUs (alternatives) using SMAA-D method and CCR Dat ...
1.0
PUT
Computes rankings for the given DMUs (alternatives) using SMAA-D method and CCR Data Envelopment ...
1.0
PUT
Computes efficiency scores for the given DMUs (alternatives) using SMAA-D method and additive Da ...
1.0
PUT
Determines dominance relations for the given DMUs (alternatives) using SMAA-D method and additiv ...
1.0
PUT
Computes rankings for the given DMUs (alternatives) using SMAA-D method and additive Data Envelo ...
1.0
PUT
Computes cross efficiency scores for the given DMUs (alternatives) using additive Data Envelopme ...
1.0
PUT
Computes efficiency scores for the given DMUs (alternatives) using additive Data Envelopment Ana ...
1.0
PUT
Computes efficiency bounds for the given DMUs (alternatives) using additive Data Envelopment Ana ...
1.0
PUT
Determines ranking intervals for the given DMUs (alternatives) using additive Data Envelopment A ...
1.0
PUT
Computes utility values for decision making units based on given functions for inputs and outputs.
1.0
PUT
Determines necessary and possible dominance relations for the given DMUs (alternatives) using ad ...
1.0
PUT
Computes super-efficiency scores for the given DMUs (alternatives) using additive Data Envelopme ...
1.0
URV
Implementation of a defuzzification of set of fuzzy labels Java implementation of a defuzzificat ...
1.0
URV
Implementation of a defuzzification of set of fuzzy labels according to the COM method (Center o ...
1.0
URV
Implementation of a defuzzification of set of fuzzy labels according to their position. The firs ...
0.2.0
PUT
Computes comprehensive discordance index from given discordance relation
0.2.0
PUT
Computes concordance matrix using procedure which is common to the most methods from the Electre ...
0.5.1
J-MCDA
Computes a concordance relation.
0.1.0
PUT
Computes concordance matrix using procedure which is common to the most methods from the Electre ...
0.2.0
PUT
Computes concordance matrix taking into account interactions between criteria. Possible interact ...
0.2.0
PUT
ElectreCredibility - computes credibility matrix using procedure which is common to the most met ...
0.1.0
PUT
ElectreCredibilityWithCounterVeto - computes credibility matrix using procedure which is common ...
0.2.0
PUT
Computes outranking relation as an aggregation of concordance and discordance binary relations. ...
0.2.0
PUT
ElectreDiscordance - computes partial (i.e. per-criterion) discordance matrix using procedure wh ...
0.5.1
J-MCDA
Computes a discordance relation per criteria.
0.2.0
PUT
This module performs distillation (upwards/downwards)
0.1.0
PUT
This module provides three types of resultes performed on downwards and upwards distillation: in ...
0.2.0
PUT
This module constructs a complete pre-order using Electre II procedure based on the provided out ...
0.1.0
PUT
Computes discordance matrix as in Electre Is method. Resulting discordance indices are from rang ...
0.2.0
PUT
ElectreIsFindKernel - finds kernel of a graph (i.e. subset of best alternatives) according to th ...
0.2.0
PUT
ElectreIVCredibility - computes credibility matrix as presented in Electre IV method.
0.2.0
PUT
This module computes Net Flow Score from given outranking (additionally with non_outranking). Ra ...
0.5.1
J-MCDA
Computes an outranking relation.
0.2.0
PUT
Computes class assignments according to the Electre TRI-C method.
0.2.0
PUT
Computes class assignments according to the Electre TRI-rC method.
0.5.3
J-MCDA
Finds electre tri like models with shared profiles and individual weights that matches given gro ...
1.0
PyXMCDA
This web service allows to infer parameters of a Bouyssou-Marchant Electre Tri relation on basis ...
0.2.0
PUT
ElectreTriClassAssignments - computes assignments according to the Electre TRI method. It genera ...
0.5.3
J-MCDA
Computes assignments according to the Electre TRI procedure.
1.0
URV
Two types of uncertainty in fuzzy sets are recognized: (1) specificity, related to the measureme ...
1.0
UTAR
-**Contact:** Boris Leistedt (boris.leistedt@gmail.com)
1.0.0
PUT
Module for calculation group class acceptabilities basing on the assignments to classes of each ...
1.0
PUT
Computes efficiency scores for the given DMUs (alternatives) using SMAA-D method and CCR Data En ...
1.0
PUT
Determines dominance relations for the given DMUs (alternatives) using SMAA-D method and CCR Dat ...
1.0
PUT
Computes ranks for the given DMUs (alternatives) using SMAA-D method and CCR Data Envelopment An ...
1.0
PUT
Computes efficiency scores for the given DMUs (alternatives) using CCR Data Envelopment Analysi ...
1.0
PUT
Computes extrene efficiency ranks for the given DMUs (alternatives) using CCR Data Envelopment A ...
1.0
PUT
Computes extrene efficiency ranks for the given DMUs (alternatives) using CCR Data Envelopment A ...
1.0
PUT
Computes efficiency scores for the given DMUs (alternatives) using SMAA-D method and Additive Da ...
1.0
PUT
Determines dominance relations for the given DMUs (alternatives) using SMAA-D method and Additiv ...
1.0
PUT
Computes ranks for the given DMUs (alternatives) using SMAA-D method and Additive Data Envelopme ...
1.0
PUT
Computes efficiency scores for the given DMUs (alternatives) using Additive Data Envelopment An ...
1.0
PUT
Computes efficiency scores for the given DMUs (alternatives) using Additive Data Envelopment An ...
1.0
PUT
Computes efficiency scores for the given DMUs (alternatives) using Additive Data Envelopment An ...
1.0
RXMCDA
Inverts ranks of alternatives (the highest rank becomes the lowest, etc.).
1.0
oso
The purpose of this webservice is to infer parameters of an ELECTRE TRI Bouyssou-Marchant model, ...
1.0
oso
The purpose of this webservice is to infer parameters of an ELECTRE TRI Bouyssou-Marchant model. ...
1.0
kappalab
Identifies a Mobius capacity by means of an approach grounded on least squares optimization. Mor ...
1.0
kappalab
Identifies a Mobius capacity by means of an approach using the linear programming approach propo ...
1.0
kappalab
Identifies a Mobius capacity by means of an approach called TOMASO in the particular ranking fra ...
1.0
ws-Mcc
This web service computes clusters of alternatives based on the following clustering typology: n ...
1.0
ws-Mcc
This web service gives a summary of the preference relations between a set of clusters of altern ...
1.0
ws-Mcc
This web service evaluates clusters of alternatives based on the following clustering typology: ...
1.0
ws-Mcc
This web service gives 4 different representations for a set of clusters of alternatives. There ...
1.0
ws-Mcc
This web service allows the generation of a preference relation between a set of alternatives fr ...
1.0
kappalab
Identifies a Mobius capacity by means of an approach using a maximum like quadratic entropy prin ...
1.0
RXMCDA
Calculates the correlation index between multiple rankings of alternatives (represented by lists ...
1.0.0
PUT
Module for calculation flows of Net Flow Score in iterative way using chosen function and direct ...
1.0.0
PUT
Module for calculation flows of Net Flow Score using chosen function and direction in parameters.
1.0
PUT
OrderedClustering - clustering method using graphs and flows
1.0
URV
The Ordered Weighted Averaging operators, commonly called OWA operators, provide a parameterized ...
1.0
URV
Balance of the weights given to the Ordered Weighted Average operator (OWA)
1.0
URV
Divergence of the weights given to the Ordered Weighted Average operator (OWA)
1.0
URV
Entropy of the weights given to the Ordered Weighted Average operator (OWA)
1.0
URV
Orness of the weights given to the Ordered Weighted Average operator (OWA)
1.0
AGH
Computes HRE (Heuristic rating estimation) method - approach proposes a new way of using pairwis ...
1.1
ITTB
This web service generates a filtered performance table. A file containing methodParameters tag ...
1.0
ITTB
This web service generates a plot representing the alternatives assignments. Colors can be used. ...
1.1
ITTB
This web service generates a graph representing a partial preorder on the alternatives. Compared ...
0.2
PUT
Draws Hasse diagram - visualization of transitive reduction of a finite partially ordered set. S ...
1.1
ITTB
This web service generates a barplot or a pie plot representing a numeric quantity for each alte ...
1.1
ITTB
This web service generates a graph representing a preorder on the alternatives, according to num ...
1.0.0
PUT
Visualizes class assignments for given alternatives as a single latex table.
1.0.0
PUT
Visualizes class assignments for given alternatives as an image.
1.0
ITTB
This web service generates a graph representing a partial preorder on the criteria. Compared to ...
1.1
ITTB
This web service generates a barplot or a pie plot representing a numeric quantity for each crit ...
1.1
ITTB
This web service generates a graph representing a preorder on the criteria, according to numeric ...
1.0
ITTB
This web service allows to plot fuzzy sets. There are some options to take into account: title, ...
1.0
RXMCDA
Generates the Gaia Plane from decomposed Promethee flows (a.k.a Promethee profiles).
1.1
ITTB
This web service generates a plot representing the performance table (abscissa: alternatives). C ...
1.0
ITTB
This web service generates, for each alternative, a plot representing the performance table as a ...
1.1
ITTB
This web service allows to plot utility functions. Compared to the web service plotValueFunction ...
1.0
PUT
Clustering using Promethee Tri and k-means algorithm
1.0.0
PUT
Computes group class assignment for given data using FlowSortGDSS method.
1.0.0
PUT
Computes class assignment for given alternatives using FlowSort method based on Promethee I.
1.0.0
PUT
This module is calculating ranking using Promethee I method. The result is shown as the table of ...
1.0.0
PUT
Computes class assignment for given alternatives using FlowSort method based on Promethee II.
1.0.0
PUT
Module for calculation PROMETHEE group ranking as a weighted sum of flows from every decision ma ...
1.0.0
PUT
Final flows calculated with Promethee II method as a difference of positive and negative outrank ...
1.0
PUT
Clustering using Promethee II and k-means algorithm
1.0.0
PUT
This module is calculating ranking using Promethee III method. The result is shown as the table ...
1.0.0
PUT
Computes class assignment for given alternatives using PromSort method. This method consists of ...
1.0.0
PUT
Computes class assignment for given alternatives using Promethee Tri method.
1.0
PUT
Promethee V - choose alternatives using linear constraints.
1.0
RXMCDA
Calculates the Promethee 1 ranking from the positive and the negative flows.
1.0.0
PUT
Computes the profiles of the alternatives (the single criterion net flow for each alternative an ...
1.0.0
PUT
Computes aggregated discordance indices and partial discordance indices.
1.0.0
PUT
Computes positive and negative outranking flows using aggregated preference indices
1.0.0
PUT
Computes aggregated preference indices
1.0.0
PUT
Computes aggregated preference indices with interactions between criteria
1.0.0
PUT
Computes aggregated preference indices with reinforced preference effect
1.0.0
PUT
Aggregate preferences (concordance) and discordances(or veto) into one preferences file.
1.0.0
PUT
Computes veto indices which
0.5.1
J-MCDA
Computes Promethee flows (net flows, positive flows, or negative flows).
0.5.1
J-MCDA
Computes a preference relation, a la Promethee.
0.5.1
J-MCDA
Computes the profiles of the given alternatives on the given criteria, a la Promethee.
1.0
PyXMCDA
This web service allows to create a simple list of alternative by simply providing the desired n ...
1.0
RXMCDA
Generates random (uniformly distributed) ranks of alternatives.
1.1
PyXMCDA
This web service allows to create a simple list of criteria by providing the desired number of c ...
1.0
RXMCDA
Generates random (uniformly distributed) and normalized (sum = 1) weights of criteria.
1.0
RXMCDA
Generates a performance table with numeric values in the real unit interval, from a uniform dist ...
1.1
PyXMCDA
This web service allows to create a simple performance table by providing a list of alternatives ...
1.1
RXMCDA
Calculates the rank of alternatives via their overall values. A parameter named maxMin allows to ...
1.0
PUT
Finds the best and worst possible positions of alternatives in the final ranking taking into con ...
1.0
PUT
Finds the best and worst possible positions of alternatives in the final ranking taking into con ...
1.0
PUT
Finds all possible and necessary weak preference relations on the set of alternatives.
1.0
PUT
Finds all possible and necessary weak preference relations on the set of alternatives. It suppor ...
1.1
PUT
The procedure finds pairwise outranking indices matrix for a given problem.
1.1
PUT
Procedure finds a set of matrices of the pair-wise outranking indices for a given problem and a ...
1.0
PUT
Depending on the need, for a given already fulfilled preference relation between two alternative ...
1.0
PUT
Depending on the need, for a given already fulfilled preference relation between two alternative ...
1.0
PUT
Depending on the need, for a given not satisified preference relation between two alternatives: ...
1.0
PUT
Depending on the need, for a given not satisfied preference relation between two alternatives: " ...
1.0
PUT
For a given ranking position n and the alternative a that already attains at least n-th position ...
1.0
PUT
For a given ranking position n and the alternative a that already attains at least n-th position ...
1.0
PUT
For a given ranking position n and the alternative a which is worse than n-th, depending on the ...
1.0
PUT
For a given ranking position n and the alternative a which is worse than n-th, depending on the ...
1.0
PUT
Finds all preferential reducts for the necessary relations. In other words, for each necessary w ...
1.0
PUT
The module finds all preferential reducts for the necessary relations. In other words, for each ...
1.0
PUT
Finds rank acceptability indices matrix for the given problem.
1.0
PUT
The module finds rank acceptability indices matrix for a given problem. it supports a hierarchic ...
1.0
PUT
Finds all rank related preferential reducts. In other words, for each alternative, it finds all ...
1.0
PUT
Finds all rank related preferential reducts. In other words, for each alternative, it finds all ...
1.0
PUT
The procedure finds a representative value function for a given set of necessary relations.
1.0
PUT
The procedure finds a representative value function for a given set of necessary relations. It s ...
0.1
PUT
Robust Ordinal Regression for value-based sorting: RORUTADIS-ExtremeClassCardinalities calculate ...
0.1
PUT
This service allows for merging different assignments, e.g. from various decision makers (group ...
0.1
PUT
Compares necessary assignments of alternatives using Robust Ordinal Regression for value-based s ...
0.1
PUT
Calculates possible and necessary assignments of alternatives to classes (categories) using Robu ...
0.3
PUT
Robust Ordinal Regression for value-based sorting: RORUTADIS-PostFactum-InvestigatePerformanceDe ...
0.3
PUT
Robust Ordinal Regression for value-based sorting: RORUTADIS-PostFactum-InvestigatePerformanceIm ...
0.3
PUT
Robust Ordinal Regression for value-based sorting: RORUTADIS-PostFactum-InvestigateValueChange s ...
0.1
PUT
Robust Ordinal Regression for value-based sorting: RORUTADIS-PreferentialReducts service allows ...
0.3
PUT
Robust Ordinal Regression for value-based sorting: RORUTADIS-RepresentativeValueFunction service ...
0.1
PUT
Calculates stochastic results for alternative assignments, assignment-based preference relation ...
1.0
PyXMCDA
This web service allows to compute a concordance relation as defined in the Rubis methodology.
1.1
PyXMCDA
This web service allows to compute an outranking relation as defined in the Rubis methodology.
0.2
jsmaa
JSMAA adapter for DD. Currently implements only SMAA-2 without preference information and only c ...
1.0
ITTB
This web service computes affectations of the alternatives from the given input data (3 inputs: ...
1.0.0
PUT
SRFWeights - computes weights of criteria using the revised Simos procedure
1.2
LJY
Execute the S-RMP model based aggregation process for a series of alternatives with a given set ...
1.2
LJY
Elicit a S-RMP model from a set of pairwise comparisons without inconsistency. The algorithm wil ...
1.0
PyXMCDA
This web service allows to compute the affectations of some alternatives in predefined categorie ...
1.0.0
PUT
SurrogateWeights - computes weights of criteria using ranking specified by user. Module allows t ...
1.0.0
PyXMCDA
This web service allows to compute intervals of stability on indifference and preference thresho ...
1.0
ITTB
This web service applies a transitive reduction on the relation relative to comparisons of the a ...
1.0
ITTB
This web service applies a transitive reduction on the relation relative to comparisons of the c ...
1.1
URV
This module implements the ULOWA aggregation operator: Unbalanced Linguistic Ordered Weighted Av ...
1.0
ITTB
Computes UTA method and if necessary uses post-optimality analysis.
1.1
UTAR
Computes UTASTAR method and if necessary uses post-optimality analysis among three well-known po ...
1.0
PyXMCDA
This web service allows to compute the weighted sum of alternatives's evaluations through criter ...
1.0
UTAR
Give a graphical XY reprentation of two alternativesValues (ex: ranking), providing an efficient ...