Related papers: Mutual Conversion Between Preference Maps And Cook…

Let G be a complex reductive group and K a maximal compact subgroup. If X is a smooth projective G-variety, with a fixed (not necessarily integral) K-invariant Kaehler form, then the K-action is Hamiltonian. Let M be the zero fiber of the…

We study a generalization of conditional probability for arbitrary ordered vector spaces. A related problem is that of assigning a numerical value to one vector relative to another. We characterize the groups for which these generalized…

It has been shown recently that the Eigenvector Method may lead to strong rank reversal in group decision making, that is, the alternative with the highest priority according to all individual vectors may lose its position when evaluations…

Picture-valued invariants are the main achievement of parity theory by V.O. Manturov. In the paper we give a general description of such invariants which can be assigned to a parity (in general, a trait) on diagram crossings. We distinguish…

Kendall transformation is a conversion of an ordered feature into a vector of pairwise order relations between individual values. This way, it preserves ranking of observations and represents it in a categorical form. Such transformation…

Invertible maps from operators of quantum obvservables onto functions of c-number arguments and their associative products are first assessed. Different types of maps like Weyl-Wigner-Stratonovich map and s-ordered quasidistribution are…

We establish a pre-order principle. From the principle, we obtain a very general set-valued Ekeland variational principle, where the objective function is a set-valued map taking values in a quasi ordered linear space and the perturbation…

To help individuals express themselves better, quotation recommendation is receiving growing attention. Nevertheless, most prior efforts focus on modeling quotations and queries separately and ignore the relationship between the quotations…

We propose a novel and efficient algorithm for the collaborative preference completion problem, which involves jointly estimating individualized rankings for a set of entities over a shared set of items, based on a limited number of…

In this article the algorithm for calculating a mutual influence of the vertices in cognitive maps is introduced. It has been shown, that in the proposed algorithm, there is no problem in comparing with a widely used method - the impulse…

Search engine results pages are usually abstracted as binary relevance vectors and hence are categorical data, meaning that only a limited set of operations is permitted, most notably tabulation of occurrence frequencies, with determination…

Conditional preference statements have been used to compactly represent preferences over combinatorial domains. They are at the core of CP-nets and their generalizations, and lexicographic preference trees. Several works have addressed the…

This paper focuses on flow-adapted point-shifts of point processes on topological groups, which map points of a point process to other points of the point process in a translation invariant way. Foliations and connected components generated…

The notion of Fourier transform is among the more important tools in analysis, which has been generalized in abstract harmonic analysis to the level of abelian locally compact groups. The aim of this paper is to further generalize the…

Modeling the preferences of agents over a set of alternatives is a principal concern in many areas. The dominant approach has been to find a single reward/utility function with the property that alternatives yielding higher rewards are…

Conditional preference networks (CP-nets) are a graphical representation of a person's (conditional) preferences over a set of discrete variables. In this paper, we introduce a novel method of quantifying preference for any given outcome…

Let M be a manifold endowed with a symmetric affine connection $\Gamma.$ The aim of this paper is to describe a quantization map between the space of second-order polynomials on the cotangent bundle T^{*} M and the space of second-order…

Collaborative filtering is an effective recommendation technique wherein the preference of an individual can potentially be predicted based on preferences of other members. Early algorithms often relied on the strong locality in the…

We discuss a fine tuning of the co- and contra-variant transforms through construction of specific fiducial and reconstructing vectors. The technique is illustrated on three different forms of induced representations of the Heisenberg…

The comparison of alternative rankings of a set of items is a general and prominent task in applied statistics. Predictor variables are ranked according to magnitude of association with an outcome, prediction models rank subjects according…