Deriving Consensus for Hierarchical Incomplete Ordered Partitions and Coverings
|
|
|
|
|
نویسنده
|
Hernes Marcin ,Nguyen Ngoc Thanh
|
منبع
|
journal of universal computer science - 2007 - دوره : 13 - شماره : 2 - صفحه:317 -328
|
چکیده
|
A method for determining consensus of hierarchical incomplete ordered partitions and coverings of sets is presented in this chapter. incomplete ordered partitions and coverings are often used in expert information analysis. these structures should be useful when an expert has to classify elements of a set into given classes, but referring to several elements he does not know to which classes they should belong. the hierarchical ordered partition is a more general structure than incomplete ordered partition. in this chapter we present definitions of the notion of hierarchical incomplete ordered partitions and coverings of sets. the distance functions between hierarchical incomplete ordered partitions and coverings are defined. we present also algorithms of consensus determining for a finite set of hierarchical incomplete ordered partitions and coverings
|
کلیدواژه
|
hierarchical incomplete ordered partition and covering ,consensus methods
|
آدرس
|
Wroclaw University of Technology, Faculty of Computer Science and Management, Poland, Wroclaw University of Technology, Institute of Informatics and Engineering, Poland
|
پست الکترونیکی
|
thanh@pwr.wroc.pl
|
|
|
|
|