MPOC: an agglomerative algorithm for multicriteria partially ordered clustering (Q385464): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(9 intermediate revisions by 7 users not shown) | |||
Property / author | |||
Property / author: Luís C. Dias / rank | |||
Property / author | |||
Property / author: Luís C. Dias / rank | |||
Normal rank | |||
Property / review text | |||
The paper proposes a multi-criteria clustering method, for problems where alternatives have to be clustered into classes with preference relations between classes. The authors first discuss a partial order \(\tau\) between classes derived from a given outranking relation \(S\) on alternatives. They first introduce a strong \(S\tau\)-consistency principle before discussing relaxed forms of this consistency, such as \(S\)-consistency, \(\tau\)-consistency, and semi-strong \(SS\tau\)-consistency. With these definitions they proceed to define an outranking degree and outranking relation between classes. They define three indicators \(v_P, v_I\) and \(v_R\) measuring how much a partition respects the principles of preference, indifference, and incompatability between elements. The proposed algorithm follows the agglomerative hierarchical structure of clustering algorithms. The authors then propose an algorithm that restores transitivity of the resulting partition. The method is illustrated on a data set for sorting stocks listed on the Athens Stock Exchange. | |||
Property / review text: The paper proposes a multi-criteria clustering method, for problems where alternatives have to be clustered into classes with preference relations between classes. The authors first discuss a partial order \(\tau\) between classes derived from a given outranking relation \(S\) on alternatives. They first introduce a strong \(S\tau\)-consistency principle before discussing relaxed forms of this consistency, such as \(S\)-consistency, \(\tau\)-consistency, and semi-strong \(SS\tau\)-consistency. With these definitions they proceed to define an outranking degree and outranking relation between classes. They define three indicators \(v_P, v_I\) and \(v_R\) measuring how much a partition respects the principles of preference, indifference, and incompatability between elements. The proposed algorithm follows the agglomerative hierarchical structure of clustering algorithms. The authors then propose an algorithm that restores transitivity of the resulting partition. The method is illustrated on a data set for sorting stocks listed on the Athens Stock Exchange. / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Matthias Ehrgott / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 91C20 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90B50 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C29 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6235150 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
multi-criteria decision making | |||
Property / zbMATH Keywords: multi-criteria decision making / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
clustering | |||
Property / zbMATH Keywords: clustering / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
outranking relation | |||
Property / zbMATH Keywords: outranking relation / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q57641129 / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: ELECTRE / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: clusfind / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2026164008 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Note—A Preference Ranking Organisation Method / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An algorithm for ordinal sorting based on ELECTRE with categories defined by examples / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Towards multicriteria clustering: an extension of the \(k\)-means algorithm / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Extensions of the prudence principle to exploit a valued outranking relation / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Valued outranking relations in ELECTRE providing manageable disaggregation procedures. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Multicriteria decision aid classification methods / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Handling multicriteria preferences in cluster analysis / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A new approach to multi-criteria sorting based on fuzzy outranking relations: the THESEUS method / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Multicriteria sorting using a valued indifference relation under a preference disaggregation paradigm / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4387205 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3994557 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Finding Groups in Data / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4398780 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4156063 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4841242 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Recent progresses in Multicriteria Decision-Aid / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 03:39, 7 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | MPOC: an agglomerative algorithm for multicriteria partially ordered clustering |
scientific article |
Statements
MPOC: an agglomerative algorithm for multicriteria partially ordered clustering (English)
0 references
2 December 2013
0 references
The paper proposes a multi-criteria clustering method, for problems where alternatives have to be clustered into classes with preference relations between classes. The authors first discuss a partial order \(\tau\) between classes derived from a given outranking relation \(S\) on alternatives. They first introduce a strong \(S\tau\)-consistency principle before discussing relaxed forms of this consistency, such as \(S\)-consistency, \(\tau\)-consistency, and semi-strong \(SS\tau\)-consistency. With these definitions they proceed to define an outranking degree and outranking relation between classes. They define three indicators \(v_P, v_I\) and \(v_R\) measuring how much a partition respects the principles of preference, indifference, and incompatability between elements. The proposed algorithm follows the agglomerative hierarchical structure of clustering algorithms. The authors then propose an algorithm that restores transitivity of the resulting partition. The method is illustrated on a data set for sorting stocks listed on the Athens Stock Exchange.
0 references
multi-criteria decision making
0 references
clustering
0 references
outranking relation
0 references
0 references
0 references