On the use of valued action profiles for relational multi-criteria clustering
by Stefan Eppe; Julien Roland; Yves De Smet
International Journal of Multicriteria Decision Making (IJMCDM), Vol. 4, No. 3, 2014

Abstract: Clustering techniques aim at eliciting hidden structures of a dataset by partitioning it into groups of similar elements. We will focus on the special case of relational clustering, where the similarity is based on relations that exist between elements rather than on their respective intrinsic features. As will be shown, particular attention has to be paid when applying a relational approach to the context of multi-criteria decision making. This paper introduces the concept of valued action profiles, a formalism for handling elements that are defined by pairwise valued outranking relations. For our experimental study, we then integrate these profiles into an adapted k-means algorithm that returns a relational partition. Results on both artificial and real datasets show that the use of the proposed method leads to meaningful relational partitions.

Online publication date: Tue, 30-Sep-2014

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