Abstract
An encoding of data for digital storage is called smooth, if, for any small change in the raw data, only a proportionately small change has to be made in the encoded data. In this paper, we consider the problem of smooth encoding for ordinal data, i.e., ranking of objects. It is shown that, simple efficient smooth encoding for storage (as well as compression) of rankings is possible with respect to the well-known Kendall τ metric on permutations.
| Original language | English (US) |
|---|---|
| DOIs | |
| State | Published - 2014 |
| Event | 2014 48th Annual Conference on Information Sciences and Systems, CISS 2014 - Princeton, NJ, United States Duration: Mar 19 2014 → Mar 21 2014 |
Other
| Other | 2014 48th Annual Conference on Information Sciences and Systems, CISS 2014 |
|---|---|
| Country/Territory | United States |
| City | Princeton, NJ |
| Period | 3/19/14 → 3/21/14 |
ASJC Scopus subject areas
- Information Systems