Please use this identifier to cite or link to this item: http://e.ieu.edu.ua/handle/123456789/696
Title: Graph-based decision making for varying complexity multicriteria problems
Authors: Nesterenko, Oleksandr
Netesin, Igor
Polischuk, Valery
Selin, Yuri
Keywords: information technologies
MCDM
ontologies
expert voting
analytic hierarchy process
analytic network process
graphs
visualization
Issue Date: 2022
Publisher: Institutul de Matematică şi Informatică "Vladimir Andrunachievici"
Citation: O. Nesterenko, I. Netesin, V. Polischuk and Y. Selin. Graph-based decision making for varying complexity multicriteria problems. Computer Science Journal of Moldova, 2022, vol.30, no.3(90), 391- 412.
Series/Report no.: ;doi:10.56415/csjm.v30.21
Abstract: In the modern world in various spheres of activity, the number of problems that need multi-criteria decision-making (MCDM) is constantly increasing. Researchers and experts offer a number of approaches to MCDM process in such tasks; in particular, most of them are based on expert methods. However, in practice, these methods require significant intellectual effort of experts and or- ganizational and technical workload during the expert survey, and also usually take a long time. At the same time, it is not always possible for experts to use certain characteristics of alter- natives, which also carries the risk of making decisions based on unfounded expert opinions. Therefore, such methods and tools should be clear and informative and at the same time easy to use to ensure the efficiency and effectiveness of their use. We offer a graph-based approach to expert decision-making and information visualization processes that meets these require- ments and can significantly improve the efficiency of decision- making in multi-criteria selection tasks.
URI: http://e.ieu.edu.ua/handle/123456789/696
ISSN: 1561-4042
Appears in Collections:Кафедра інформаційних технологій

Files in This Item:
File Description SizeFormat 
Nesterenko_Graph_2022.pdf766.97 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.