English
Related papers

Related papers: The Fresh-Finger Property

200 papers

Users consume their favorite content in temporal proximity of consumption bundles according to their preferences and tastes. Thus, the underlying attributes of items implicitly match user preferences, however, current recommender systems…

Information Retrieval · Computer Science 2018-10-23 Arun Kumar , Karan Aggarwal , Paul Schrater

Measurement professionals cannot come to an agreement on the definition of the term 'item fairness'. In this paper a continuous measure of item unfairness is proposed. The more the unfairness measure deviates from zero, the less fair the…

Artificial Intelligence · Computer Science 2020-10-06 Yefim Bakman

Given a distance $D$ on a finite set $X$ with $n$ elements, it is interesting to understand how the ranking $R_x = z_1,z_2,\dots,z_n$ obtained by ordering the elements in $X$ according to increasing distance $D(x,z_i)$ from $x$, varies with…

Discrete Mathematics · Computer Science 2019-10-23 Vincent Moulton , Andreas Spillner

How best to quantify the information of an object, whether natural or artifact, is a problem of wide interest. A related problem is the computability of an object. We present practical examples of a new way to address this problem. By…

Artificial Intelligence · Computer Science 2011-06-14 Fionn Murtagh

Clustering is an unsupervised machine learning task that consists of identifying groups of similar objects. It has numerous applications and is increasingly used in fairness-sensitive domains where objects represent individuals, such as…

Machine Learning · Computer Science 2026-05-14 Claudio Mantuano , Manuel Kammermann , Philipp Baumann

We consider the problem of pure exploration with subset-wise preference feedback, which contains $N$ arms with features. The learner is allowed to query subsets of size $K$ and receives feedback in the form of a noisy winner. The goal of…

Machine Learning · Computer Science 2021-04-13 Shubham Gupta , Aadirupa Saha , Sumeet Katariya

To a good extent, words can be understood as corresponding to patterns or categories that appeared in order to represent concepts and structures that are particularly important or useful in a given time and space. Words are characterized by…

Computation and Language · Computer Science 2021-07-21 Henrique Ferraz de Arruda , Luciano da Fontoura Costa

A critical piece of the modern information retrieval puzzle is approximate nearest neighbor search. Its objective is to return a set of $k$ data points that are closest to a query point, with its accuracy measured by the proportion of exact…

Information Retrieval · Computer Science 2024-07-15 Thomas Vecchiato , Claudio Lucchese , Franco Maria Nardini , Sebastian Bruch

We have constructed a fitness parameter, characterizing the intrinsic attractiveness for patents to be cited, from attributes of the associated inventions known at the time a patent is granted. This exogenously obtained fitness is shown to…

Physics and Society · Physics 2019-06-26 K. W. Higham , M. Governale , A. B. Jaffe , U. Zülicke

We propose a new method for evaluating the readability of simplified sentences through pair-wise ranking. The validity of the method is established through in-corpus and cross-corpus evaluation experiments. The approach correctly identifies…

Computation and Language · Computer Science 2016-03-22 Sowmya Vajjala , Detmar Meurers

The widely considered assertion is that the unitarity of quantum mechanical evolution assures the preservation of information. It is even promoted in popular literature as an established fact. (Susskind, 2008) Yet, a simple chain of…

Quantum Physics · Physics 2013-11-27 Peter B. Lerner

Fuzzy authentication allows authentication based on the fuzzy matching of two objects, for example based on the similarity of two strings in the Hamming metric, or on the similiarity of two sets in the set difference metric. Aim of this…

Information Theory · Computer Science 2017-03-10 Alessandro Neri , Joachim Rosenthal , Davide Schipani

Machine learning-driven rankings, where individuals (or items) are ranked in response to a query, mediate search exposure or attention in a variety of safety-critical settings. Thus, it is important to ensure that such rankings are fair.…

Machine Learning · Computer Science 2025-02-18 Aparna Balagopalan , Kai Wang , Olawale Salaudeen , Asia Biega , Marzyeh Ghassemi

In this work, we introduce a novel metric for auditing group fairness in ranked lists. Our approach offers two benefits compared to the state of the art. First, we offer a blueprint for modeling of user attention. Rather than assuming a…

Computers and Society · Computer Science 2019-05-14 Piotr Sapiezynski , Wesley Zeng , Ronald E. Robertson , Alan Mislove , Christo Wilson

Chunking data is obviously no new concept; however, I had never found any data structures that used chunking as the basis of their implementation. I figured that by using chunking alongside concurrency, I could create an extremely fast…

Data Structures and Algorithms · Computer Science 2022-02-21 Daniel Szelogowski

Looking into the growth of information in the web it is a very tedious process of getting the exact information the user is looking for. Many search engines generate user profile related data listing. This paper involves one such process…

Information Retrieval · Computer Science 2011-09-12 L. K. Joshila Grace , V. Maheswari , Dhinaharan Nagamalai

To improve our understanding of connected systems, different tools derived from statistics, signal processing, information theory and statistical physics have been developed in the last decade. Here, we will focus on the graph comparison…

Physics and Society · Physics 2018-04-23 Johann H. Martínez , Mario Chavez

Humans can determine a proper strategy to grasp an object according to the measured physical attributes or the prior knowledge of the object. This paper proposes an approach to determining the strategy of dexterous grasping by using an…

Robotics · Computer Science 2020-11-18 Bharath Rao , Hui Li , Krishna Krishnan , Enkhsaikhan Boldsaikhan , Hongsheng He

We present an algorithm that takes an unannotated corpus as its input, and returns a ranked list of probable morphologically related pairs as its output. The algorithm tries to discover morphologically related pairs by looking for pairs…

Computation and Language · Computer Science 2007-05-23 Marco Baroni , Johannes Matiasek , Harald Trost

We develop a unified framework for testing independence and quantifying association between random objects that are located in general metric spaces. Special cases include functional and high-dimensional data as well as networks, covariance…

Methodology · Statistics 2025-10-07 Hang Zhou , Hans-Georg Müller