Inferring Rankings Using Constrained Sensing

DOI10.1109/TIT.2011.2165827zbMath1365.94060arXiv0910.0895OpenAlexW2148174192MaRDI QIDQ5272233

Srikanth Jagabathula, Devavrat Shah

Publication date: 12 July 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0910.0895

Mathematics Subject Classification ID

Application of orthogonal and other special functions (94A11) Almost periodic functions on groups and semigroups and their generalizations (recurrent functions, distal functions, etc.); almost automorphic functions (43A60)

Related Items (8)

Geometric inference for general high-dimensional linear inverse problems ⋮ High-dimensional change-point estimation: combining filtering with convex optimization ⋮ The convex geometry of linear inverse problems ⋮ A Fourier-theoretic approach for inferring symmetries ⋮ Uncovering the riffled independence structure of ranked data ⋮ Inferring Sparse Preference Lists from Partial Information ⋮ Simple, Robust and Optimal Ranking from Pairwise Comparisons ⋮ Online Collaborative Filtering on Graphs

This page was built for publication: Inferring Rankings Using Constrained Sensing