Results 221 to 230 of about 756,826 (263)
Some of the next articles are maybe not open access.
Generalized subdifferentials of the rank function
Optimization Letters, 2012zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hai Yen Le
exaly +5 more sources
Revision by Comparison for Ranking Functions
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022Revision by Comparison (RbC) is a non-prioritized belief revision mechanism on epistemic states that specifies constraints on the plausibility of an input sentence via a designated reference sentence, allowing for kind of relative belief revision. In this paper, we make the strategy underlying RbC more explicit and transfer the mechanism together with ...
Meliha Sezgin, Gabriele Kern-Isberner
openaire +1 more source
Rankings and Ranking Functions
Canadian Journal of Mathematics, 1981Suppose that n competitors compete in r races and in each race they are awarded placings l, 2, 3, …, n – 1, n. After the r races each competitor has a result consisting of his r placings. Let such a result be written (αj)1≦j≦r where for convenience the positive integers αj are arranged in ascending order.
openaire +1 more source
Order, 2005
The authors describe the correspondence between closure operators \(\text{cl}: D \to D\) and \(\land\)-subsemilattices \(L \subseteq D\) where \(D\) is a lattice of finite height. They investigate what type of number-valued function \(D \to N\) induces a \(\land\)-subsemilattice \(L\) and, conversely, what type of function \(D \to N\) is induced by ...
openaire +1 more source
The authors describe the correspondence between closure operators \(\text{cl}: D \to D\) and \(\land\)-subsemilattices \(L \subseteq D\) where \(D\) is a lattice of finite height. They investigate what type of number-valued function \(D \to N\) induces a \(\land\)-subsemilattice \(L\) and, conversely, what type of function \(D \to N\) is induced by ...
openaire +1 more source
Construct Weak Ranking Functions for Learning Linear Ranking Function
2011Many Learning to Rank models, which apply machine learning techniques to fuse weak ranking functions and enhance ranking performances, have been proposed for web search. However, most of the existing approaches only apply the Min --- Max normalization method to construct the weak ranking functions without considering the differences among the ranking ...
Guichun Hua +4 more
openaire +1 more source
A contest success function for rankings [PDF]
Social Choice and Welfare, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Discovery and Ranking of Functional Dependencies
2019 IEEE 35th International Conference on Data Engineering (ICDE), 2019Computing the functional dependencies that hold on a given data set is one of the most important problems in data profiling. Utilizing new data structures and original techniques for the dynamic computation of stripped partitions, we devise a new hybridization strategy that outperforms the best algorithms in terms of efficiency, column-, and row ...
Ziheng Wei, Sebastian Link
openaire +1 more source