Deriving Consensus for Hierarchical Incomplete Ordered Partitions and Coverings

Простая страница элемента
dc.creatorHernes,Marcin
dc.creatorNguyen,Ngoc
dc.date2007
dc.date.accessioned2024-02-06T12:55:07Z
dc.date.available2024-02-06T12:55:07Z
dc.descriptionA 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.
dc.formattext/html
dc.identifierhttps://doi.org/10.3217/jucs-013-02-0317
dc.identifierhttps://lib.jucs.org/article/28744/
dc.identifier.urihttps://openrepository.mephi.ru/handle/123456789/9275
dc.languageen
dc.publisherJournal of Universal Computer Science
dc.relationinfo:eu-repo/semantics/altIdentifier/eissn/0948-6968
dc.relationinfo:eu-repo/semantics/altIdentifier/pissn/0948-695X
dc.rightsinfo:eu-repo/semantics/openAccess
dc.rightsJ.UCS License
dc.sourceJUCS - Journal of Universal Computer Science 13(2): 317-328
dc.subjecthierarchical incomplete ordered partition and covering
dc.subjectconsensus methods
dc.titleDeriving Consensus for Hierarchical Incomplete Ordered Partitions and Coverings
dc.typeResearch Article
Файлы
Коллекции