The similarity is computed using the Hamming distance (between the outcomes of the related pair of CCP-nets) and the number of preference statements shared by ...
We propose an algorithm to compute the distance between a pair of CCP-nets, based on the similarity we defined. In order to evaluate the time performance of our ...
... CP-net is polynomially bounded. The exact complexity of dominance testing in multiply connected, binary-valued, acyclic. CP-nets remains an open problem—at ...
Conditional Preference Networks: Constraints and Similarity - ProQuest
search.proquest.com › openview
In this thesis, we explore two objectives associated with constrained CP-nets (CCP-nets). Our first objective is to extend the underlying constraint network of ...
We propose an algorithm to compute the distance between a pair of CCP-nets, based on the similarity we defined. In order to evaluate the time performance of our ...
The complexity results for the CP-net based preferential comparison be- tween the outcomes (presented in Section 2.4.2) induce the following, some- what ...
CP nets bear some similarity to Bayesian networks. Both utilize directed graphs where each node stands for a domain variable, and assume a set of features ...
The constrained CP-net graphical model has been proposed to manage both conditional preferences and hard constraints. In order to include soft constraints, we ...
We first show that the optimal and undominated outcomes of an unconstrained (and possibly cyclic) CP-net are the solu- tions of a set of hard constraints. We ...
Abstract. We present a novel approach to deal with preferences expressed as a mixture of hard constraints, soft constraints, and CP-nets.