Javascript must be enabled to continue!
Multiattribute Group Decision-Making Method Using a Genetic K-Means Clustering Algorithm
View through CrossRef
Multiattribute group decision-making (MAGDM) problems are characterized by the large number, uneven levels, and bounded rationality of decision-makers; multiple attributes and fuzziness of decision problems; and complex group behaviours. Considering these characteristics, we propose a MAGDM method using a genetic K-means clustering algorithm. First, we briefly review the traditional multiattribute decision-making method based on prospect theory (PT) and trapezoidal intuitionistic fuzzy numbers (TrIFNs) under the premise of human bounded rationality and uncertain decision environment. Then, the aggregation model of decision information given by decision-makers is established using the genetic K-means algorithm in order to determine optimal clustering results. Each clustering center represents decision information given by decision-makers in each cluster, and the weight of each clustering center is determined by considering the tightness of decision information within a cluster and the count of decision-makers in each cluster. Finally, the ranking of schemes is obtained according to the comparison rules of TrIFNs. We design comparison simulation experiments to test the proposed method and the simulation results demonstrate that the proposed method is apprehensible and feasible to solve MAGDM problems.
Title: Multiattribute Group Decision-Making Method Using a Genetic K-Means Clustering Algorithm
Description:
Multiattribute group decision-making (MAGDM) problems are characterized by the large number, uneven levels, and bounded rationality of decision-makers; multiple attributes and fuzziness of decision problems; and complex group behaviours.
Considering these characteristics, we propose a MAGDM method using a genetic K-means clustering algorithm.
First, we briefly review the traditional multiattribute decision-making method based on prospect theory (PT) and trapezoidal intuitionistic fuzzy numbers (TrIFNs) under the premise of human bounded rationality and uncertain decision environment.
Then, the aggregation model of decision information given by decision-makers is established using the genetic K-means algorithm in order to determine optimal clustering results.
Each clustering center represents decision information given by decision-makers in each cluster, and the weight of each clustering center is determined by considering the tightness of decision information within a cluster and the count of decision-makers in each cluster.
Finally, the ranking of schemes is obtained according to the comparison rules of TrIFNs.
We design comparison simulation experiments to test the proposed method and the simulation results demonstrate that the proposed method is apprehensible and feasible to solve MAGDM problems.
Related Results
Autonomy on Trial
Autonomy on Trial
Photo by CHUTTERSNAP on Unsplash
Abstract
This paper critically examines how US bioethics and health law conceptualize patient autonomy, contrasting the rights-based, individualist...
The Kernel Rough K-Means Algorithm
The Kernel Rough K-Means Algorithm
Background:
Clustering is one of the most important data mining methods. The k-means
(c-means ) and its derivative methods are the hotspot in the field of clustering research in re...
Młodociani sprawcy przestępstw przeciwko mieniu
Młodociani sprawcy przestępstw przeciwko mieniu
The new Polish penal legislation of 1969 introduced special rules of criminal liability of young adult offenders' aged 17-20. In 1972 criminological research was undertaken in orde...
Piece by piece: Collaborative mosaic-making for inclusive policy development
Piece by piece: Collaborative mosaic-making for inclusive policy development
This report sets out the findings from one of four projects commissioned by Wellcome Policy Lab to pilot creative approaches to policy development. In this project, Scientia Script...
Evaluating Clustering Algorithms: An Analysis using the EDAS Method
Evaluating Clustering Algorithms: An Analysis using the EDAS Method
Data clustering is frequently utilized in the early stages of analyzing big data. It enables the examination of massive datasets encompassing diverse types of data, with the aim of...
A Hybrid K-means Method based on Modified Rat Swarm Optimization Algorithm for Data Clustering
A Hybrid K-means Method based on Modified Rat Swarm Optimization Algorithm for Data Clustering
Abstract
The original K-means clustering algorithm is prone to local optima and sensitive to the initial clustering center, which have a great impact on accuracy and stabil...
Big Data Clustering Method Based on an Improved PSO-Means Algorithm
Big Data Clustering Method Based on an Improved PSO-Means Algorithm
There are problems in big data clustering processing, such as poor clustering effect of different types of data and long clustering time. Therefore, a big data clustering processin...
ANALYSIS OF THE APPLICABILITY CRITERION FOR K MEANS CLUSTERING ALGORITHM RUN TEN NUMBER OF TIMES ON THE FIRST 25 NUMBERS OF THE FIBONACCI SERIES
ANALYSIS OF THE APPLICABILITY CRITERION FOR K MEANS CLUSTERING ALGORITHM RUN TEN NUMBER OF TIMES ON THE FIRST 25 NUMBERS OF THE FIBONACCI SERIES
In this research investigation Analysis Of The Applicability Criterion For K Means Clustering Algorithm Run Ten Number Of Times On The First 25 Numbers Of The Fibonacci Series is p...

