نتایج جستجو برای: interval full ranking
تعداد نتایج: 521872 فیلتر نتایج به سال:
We present a supervised learning to rank algorithm that effectively orders images by exploiting the structure in image sequences. Most often in the supervised learning to rank literature, ranking is approached either by analyzing pairs of images or by optimizing a list-wise surrogate loss function on full sequences. In this work we propose MidRank, which learns from moderately sized sub-sequenc...
We argue that ranking algorithms for XML should reflect the actual combined content and structure constraints of queries, while at the same time producing equal rankings for queries that are semantically equal. Ranking algorithms that produce different rankings for queries that are semantically equal are easily detected by tests on large databases: We call such algorithms not sound. We report t...
Interval joins find applications in several domains, including temporal and spatial databases, uncertain data management, streaming data processing. In this paper, we study the evaluation of an interval count semi-join (ICS J ) operation that can be used for selecting or ranking intervals based on the number of join pairs they appear in. We extend the state-of-the-art algorithm for interval joi...
In this paper, we first use a fuzzy preference relation with a membership function representing preference degree forcomparing two interval-valued fuzzy numbers and then utilize a relative preference relation improved from the fuzzypreference relation to rank a set of interval-valued fuzzy numbers. Since the fuzzy preference relation is a total orderingrelation that satisfies reciprocal and tra...
A vertex k-ranking of a graph G is a function c : V (G) → {1, . . . , k} such that if c(u) = c(v), u, v ∈ V (G) then each path connecting vertices u and v contains a vertex w with c(w) > c(u). If each vertex v has a list of integers L(v) and for a vertex ranking c it holds c(v) ∈ L(v) for each v ∈ V (G) then c is called L-list k-ranking, where L = {L(v) : v ∈ V (G)}. In this paper we investigat...
Ranking methods, similarity measures and uncertainty measures are very important concepts for interval type-2 fuzzy sets (IT2 FSs). So far, there is only one ranking method for such sets, whereas there are many similarity and uncertainty measures. A new ranking method and a new similarity measure for IT2 FSs are proposed in this paper. All these ranking methods, similarity measures and uncertai...
We consider the problem of statistical inference for ranking data, specifically rank aggregation, under the assumption that samples are incomplete in the sense of not comprising all choice alternatives. In contrast to most existing methods, we explicitly model the process of turning a full ranking into an incomplete one, which we call the coarsening process. To this end, we propose the concept ...
Centering Theory is applied to a narrated film retelling in Kaqchikel Mayan in order to better understand discourse constraints on the form of referring expression. It is shown that Backwards Looking Centers are very often encoded by zero pronouns, and that center Shifts more often employ full pronouns and full noun phrases than do center Continues and Retains. Preverbal pronouns and full noun ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید