Carte Algorithmic Decision Making with Python Resources Raymond Bisdorff

Algorithmic Decision Making with Python Resources

From Multicriteria Performance Records to Decision Algorithms via Bipolar-Valued Outranking Digraphs

Limbă: engleză
Legare: Copertă tare
Disponibilitate: În depozitul extern
Expediem în 10-13 zile
595.73 lei
This book describes Python3 programming resources for implementing decision aiding algorithms in the...

Informații despre carte

Limbă
engleză
Legare
Carte - Copertă tare
Publicat
2022
Pagini
346
EAN
9783030909277
ISBN
3030909271
Enbook ID
38323313
Greutate
740
Dimensiuni
155 x 235 x 27

Descriere completă

This book describes Python3 programming resources for implementing decision aiding algorithms in the context of a bipolar-valued outranking approach. These computing resources, made available under the name Digraph3, are useful in the field of Algorithmic Decision Theory and more specifically in outranking-based Multiple-Criteria Decision Aiding (MCDA).The first part of the book presents a set of tutorials introducing the Digraph3 collection of Python3 modules and its main objects, such as bipolar-valued digraphs and outranking digraphs. In eight methodological chapters, the second part illustrates multiple-criteria evaluation models and decision algorithms. These chapters are largely problem-oriented and demonstrate how to edit a new multiple-criteria performance tableau, how to build a best choice recommendation, how to compute the winner of an election and how to make rankings or ratings using incommensurable criteria. The book's third part presents three real-world decision case studies, while the fourth part addresses more advanced topics, such as computing ordinal correlations between bipolar-valued outranking digraphs, computing kernels in bipolar-valued digraphs, testing for confidence or stability of outranking statements when facing uncertain or solely ordinal criteria significance weights, and tempering plurality tyranny effects in social choice problems. The fifth and last part is more specifically focused on working with undirected graphs, tree graphs and forests. The closing chapter explores comparability, split, interval and permutation graphs.The book is primarily intended for graduate students in management sciences, computational statistics and operations research. The chapters presenting algorithms for ranking multicriteria performance records will be of computational interest for designers of web recommender systems. Similarly, the relative and absolute quantile-rating algorithms, discussed and illustrated in several chapters, will be of practical interest to public and private performance auditors. 

S-ar putea să te intereseze

585.42 lei

LOVE'S YOUNG DREAM

FRANCES ELIZ NOTLEY
179.19 lei

Jump with Wobbly

Johanna Louis
74.52 lei
261.10 lei

More Than Miracles

Steve de Shazer
245.53 lei
48.83 lei
415.73 lei

Burning Heir

Kelsey Forster
85.24 lei
277.38 lei
82.51 lei

Wild Ohio

Gary Meszaros
204.67 lei

Sidetracked

Allan Michael Hardin
61.47 lei
129.54 lei

Clienții care au cumpărat această carte au mai cumpărat și

106.78 lei

Oesterreichische Kunst-Institute

Rudolf Von Eitelberger Von Edelberg
149.26 lei

LETRAS DE CUENTO-C5-LA

LOPEZ FERNANDEZ
121.34 lei
128.83 lei
41.65 lei

Gedichte

Johann Wolfgang von Goethe
97.07 lei
125.29 lei
383.06 lei

Wegweiser Schrift

Hans Peter Willberg
80.89 lei

Der grimmig Tod

Ettinger/Sonnleitner/Pekny
135.00 lei

Brüder

Jackie Thomae
105.47 lei