A multicriteria ordered clustering algorithm to determine precise or disjunctive partitions
by Mohamed Ayman Boujelben; Yves De Smet
International Journal of Multicriteria Decision Making (IJMCDM), Vol. 6, No. 2, 2016

Abstract: We consider multicriteria clustering problems where the groups are ordered from the best to the worst. An approach relying on the principles of the k-means algorithm and disjunctive sorting based on evidence theory (DISSET) method is proposed for the detection of ordered clusters. The distinctive feature of this method is that it allows to obtain both precise and disjunctive partitions. In such situation, the actions can be assigned even to pair of groups (and not only to precise clusters). The decision maker is assumed to provide the following inputs: an evaluation table, the desired number of clusters and a valued preference model (obtained for instance by PROMETHEE method). The method is illustrated on two real examples: the Human Development Index (HDI-2013) and the Logistics Performance Index (LPI-2014).

Online publication date: Wed, 20-Jul-2016

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Multicriteria Decision Making (IJMCDM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com