• DocumentCode
    138689
  • Title

    Smooth representation of rankings

  • Author

    Mazumdar, Arya ; Milenkovic, Olgica

  • Author_Institution
    Dept. of ECE, Univ. of Minnesota- Twin Cities, Minneapolis, MN, USA
  • fYear
    2014
  • fDate
    19-21 March 2014
  • Firstpage
    1
  • Lastpage
    4
  • 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.
  • Keywords
    data handling; storage management; Kendall metric; data encoding; digital storage; smooth encoding problem; smooth rankings representation; Educational institutions; Encoding; Error correction codes; Measurement; Tin; Vectors;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Sciences and Systems (CISS), 2014 48th Annual Conference on
  • Conference_Location
    Princeton, NJ
  • Type

    conf

  • DOI
    10.1109/CISS.2014.6814149
  • Filename
    6814149