Results 31 to 40 of about 105 (101)

The Core Might Change Anyhow We Define It: The Instability of Key Actors in Longitudinal Social Network Data

open access: yesComplexity, Volume 2024, Issue 1, 2024.
Central actors or opinion leaders are in the right structural position to spread relevant information or convince others about adopting an innovation or behaviour change. Who is a central actor or opinion leader might be conceptualised in various ways.
Róbert Pethes   +4 more
wiley   +1 more source

Multi-view MDS plot displaying the preserved Spearman’s footrule distances between methods.

open access: yes, 2019
The differential ranking of their top 100 novel predictions using known drug target inputs are taken into account across all 22 diseases. Results are shown separately for the 2 networks considered in this study.
Alex Gutteridge (202586)   +5 more
core   +1 more source

The Sweet Spot between Inverted Indices and Metric-Space Indexing for Top-K–List Similarity Search

open access: yes, 2015
We consider the problem of processing similarity queries over a set of top-k rankings where the query ranking and the similarity threshold are provided at query time.
Michel, Sebastian   +2 more
core   +1 more source

A picture fuzzy set multi criteria decision-making approach to customize hospital recommendations based on patient feedback [PDF]

open access: yes
open access articleSentiment analysis techniques have allowed exploiting the information available in millions of opinions conveyed through different Internet services.
Chiclana, Francisco   +4 more
core   +1 more source

The exact region determined by Blomqvist’s beta, Spearman’s footrule and Gini’s gamma

open access: yes
To quantify the degree of association between random variables, concordance measures are employed. To express such a degree, a single measure might give too much space, so several are used for comparison.
Mojškerc, Blaž   +1 more
core   +1 more source

How Many Pairwise Preferences Do We Need to Rank a Graph Consistently?

open access: yes, 2019
We consider the problem of optimal recovery of true ranking of n items from a randomly chosen subset of their pairwise preferences. It is well known that without any further assumption, one requires a sample size of Ω(n2) for the purpose.
Shivanna, Rakesh   +2 more
core   +1 more source

Exact bounds of Spearman’s footrule in the presence of missing data with applications to independence testing

open access: yes
This work studies exact bounds of Spearman’s footrule in the presence of missing data for two n-dimensional distinct real-valued vectors X and Y. The lower bound is obtained by sequentially constructing imputations of the partially observed vectors, each
Zeng, Yijin   +2 more
core   +1 more source

Advanced rank-aware queries and recommendation with novel types of data

open access: yes, 2014
Nowadays we are living in an era of rich data, not only in the sense of the amount of data, but also in the sense of various sources and content of data. Efficient search, management, and exploitation of data have, over decades, been a major direction of
王皓, Wang, Hao
core   +1 more source

Similarity Search Algorithms over Top-k Rankings and Class-Constrained Objects [PDF]

open access: yes, 2019
In this thesis, we consider the problem of processing similarity queries over a dataset of top-k rankings and class constrained objects. Top-k rankings are the most natural and widely used technique to compress a large amount of information into a ...
Milchevski, Evica
core  

Approximate Sorting

open access: yes, 2008
We show that any randomized algorithm to approximate any given ranking of n items within expected Spearman’s footrule distance n 2 /ν(n) needs at least n (min{log ν(n), log n} − 6) comparisons.
Eva Schuberth, et al., Joachim Giesen
core  

Home - About - Disclaimer - Privacy