kendall tau distance
Recently Published Documents


TOTAL DOCUMENTS

7
(FIVE YEARS 1)

H-INDEX

2
(FIVE YEARS 0)

2021 ◽  
Author(s):  
Esteban Vázquez-Cano ◽  
Paz Díez-Arcón

This communication presents an educational experience with pre-universitary students consisting of the creation of a video game in the classroom through the computer application "Scratch". From a qualitative approach, a measure of pair documents similarity PDMS through Kendall Tau distance is applied in order to analyze students´ perception with regard to the implementation of this resource based on block programming. The results show that the most relevant positive aspects are: the increase of support between colleagues and group work, as well as the resolution of doubts. Aspects to be improved or less positive are related to its repetitive nature in the technical procedure and its reduced application in real life. Additionally, the students perceive limitations as its development is mostly constrained to tablets and smartphones, excluding mobile phones from the process. Finally, with regard to its didactic features, benefits for students in relation to their motivation towards study and greater interactivity in the work in the classroom are perceived.


Author(s):  
Foram Lakhani ◽  
Dominik Peters ◽  
Edith Elkind

We use social choice theory to develop correlation coefficients between ranked preferences and an ordinal attribute such as educational attainment or income level. For example, such correlations could be used to formalise statements such as "voters' preferences over parties are better explained by age than by income level". In the literature, preferences that are perfectly explained by a single-dimensional agent attribute are commonly taken to be single-crossing preferences. Thus, to quantify how well an attribute explains preferences, we can order the voters by the value of the attribute and compute how far the resulting ordered profile is from being single-crossing, for various commonly studied distance measures (Kendall tau distance, voter/alternative deletion, etc.). The goal of this paper is to evaluate the computational feasibility of this approach. To this end, we investigate the complexity of computing these distances, obtaining an essentially complete picture for the distances we consider.


Author(s):  
Ao Liu ◽  
Qiong Wu ◽  
Zhenming Liu ◽  
Lirong Xia

This paper studies a stylized, yet natural, learning-to-rank problem and points out the critical incorrectness of a widely used nearest neighbor algorithm. We consider a model with n agents (users) {xi}i∈[n] and m alternatives (items) {yl}l∈[m], each of which is associated with a latent feature vector. Agents rank items nondeterministically according to the Plackett-Luce model, where the higher the utility of an item to the agent, the more likely this item will be ranked high by the agent. Our goal is to identify near neighbors of an arbitrary agent in the latent space for prediction.We first show that the Kendall-tau distance based kNN produces incorrect results in our model. Next, we propose a new anchor-based algorithm to find neighbors of an agent. A salient feature of our algorithm is that it leverages the rankings of many other agents (the so-called “anchors”) to determine the closeness/similarities of two agents. We provide a rigorous analysis for one-dimensional latent space, and complement the theoretical results with experiments on synthetic and real datasets. The experiments confirm that the new algorithm is robust and practical.


2018 ◽  
Vol 29 (1) ◽  
pp. 653-663 ◽  
Author(s):  
Ritu Meena ◽  
Kamal K. Bharadwaj

Abstract Many recommender systems frequently make suggestions for group consumable items to the individual users. There has been much work done in group recommender systems (GRSs) with full ranking, but partial ranking (PR) where items are partially ranked still remains a challenge. The ultimate objective of this work is to propose rank aggregation technique for effectively handling the PR problem. Additionally, in real applications, most of the studies have focused on PR without ties (PRWOT). However, the rankings may have ties where some items are placed in the same position, but where some items are partially ranked to be aggregated may not be permutations. In this work, in order to handle problem of PR in GRS for PRWOT and PR with ties (PRWT), we propose a novel approach to GRS based on genetic algorithm (GA) where for PRWOT Spearman foot rule distance and for PRWT Kendall tau distance with bucket order are used as fitness functions. Experimental results are presented that clearly demonstrate that our proposed GRS based on GA for PRWOT (GRS-GA-PRWOT) and PRWT (GRS-GA-PRWT) outperforms well-known baseline GRS techniques.


2013 ◽  
Vol 05 (02) ◽  
pp. 1360003 ◽  
Author(s):  
FRANZ J. BRANDENBURG ◽  
ANDREAS GLEIßNER ◽  
ANDREAS HOFMEIER

Comparing and ranking information is an important topic in social and information sciences, and in particular on the web. Its objective is to measure the difference of the preferences of voters on a set of candidates and to compute a consensus ranking. Commonly, each voter provides a total order or a bucket order of all candidates, where bucket orders allow ties. In this work we consider the generalization of total and bucket orders to partial orders and compare them by the nearest neighbor and the Hausdorff Kendall tau distances. For total and bucket orders these distances can be computed in [Formula: see text] time. We show that the computation of the nearest neighbor Kendall tau distance is NP-hard, 2-approximable and fixed-parameter tractable for a total and a partial order. The computation of the Hausdorff Kendall tau distance for a total and a partial order is shown to be coNP-hard. The rank aggregation problem is known to be NP-complete for total and bucket orders, even for four voters and solvable in [Formula: see text] time for two voters. We show that it is NP-complete for two partial orders and the nearest neighbor Kendall tau distance. For the Hausdorff Kendall tau distance it is in [Formula: see text], but not in NP or coNP unless NP = coNP, even for four voters.


Author(s):  
Lin Li ◽  
Huifan Xiao ◽  
Guandong Xu

Computing similarity between short microblogs is an important step in microblog recommendation. In this chapter, the authors utilize three kinds of approaches—traditional term-based approach, WordNet-based semantic approach, and topic-based approach—to compute similarities between micro-blogs and recommend top related ones to users. They conduct experimental study on the effectiveness of the three approaches in terms of precision. The results show that WordNet-based semantic similarity approach has a relatively higher precision than that of the traditional term-based approach, and the topic-based approach works poorest with 548 tweets as the dataset. In addition, the authors calculated the Kendall tau distance between two lists generated by any two approaches from WordNet, term, and topic approaches. Its average of all the 548 pair lists tells us the WordNet-based and term-based approach have generally high agreement in the ranking of related tweets, while the topic-based approach has a relatively high disaccord in the ranking of related tweets with the WordNet-based approach.


Sign in / Sign up

Export Citation Format

Share Document