Abstract
In the field of multicriteria decision aid, considerable attention has been paid to supervised classification problems where the purpose is to assign alternatives into predefined ordered classes. In these approaches, often referred to as sorting methods, it is usually assumed that classes are either known a priori or can be identified by the decision maker. On the other hand, when the objective is to identify groups (clusters) of alternatives sharing similar characteristics, the problem is known as a clustering problem, also called an unsupervised learning problem. This paper proposes an agglomerative clustering method based on a crisp outranking relation. The method regroups alternatives into partially ordered classes, based on a quality of partition measure which reflects the percentage of pairs of alternatives that are compatible with a decision-maker’s multicriteria preference model.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.