JUCS - Journal of Universal Computer Science 13(2): 317-328, doi: 10.3217/jucs-013-02-0317
Deriving Consensus for Hierarchical Incomplete Ordered Partitions and Coverings
expand article infoMarcin Hernes‡, Ngoc Thanh Nguyen‡
‡ Wroclaw University of Technology, Poland

Corresponding author: Marcin Hernes ( mhernes@interia.pl )

© Marcin Hernes, Ngoc Nguyen.
This article is freely available under the J.UCS Open Content License.
Citation: Hernes M, Nguyen NT (2007) Deriving Consensus for Hierarchical Incomplete Ordered Partitions and Coverings. JUCS - Journal of Universal Computer Science 13(2): 317-328. https://doi.org/10.3217/jucs-013-02-0317
Open Access
Abstract
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.
Keywords
hierarchical incomplete ordered partition and covering, consensus methods