IDEAS home Printed from https://ideas.repec.org/a/eee/csdana/v145y2020ics0167947319302609.html
   My bibliography  Save this article

Adjacency-based regularization for partially ranked data with non-ignorable missing

Author

Listed:
  • Nakamura, Kento
  • Yano, Keisuke
  • Komaki, Fumiyasu

Abstract

In analyzing ranked data, we often encounter situations in which data are partially ranked. Regarding partially ranked data as missing data, this paper addresses parameter estimation for partially ranked data under a (possibly) non-ignorable missing mechanism. We propose estimators for both complete rankings and missing mechanisms together with a simple estimation procedure. The proposed procedure leverages the structured regularization based on an adjacency structure behind partially ranked data as well as the Expectation–Maximization algorithm. The experimental results demonstrate that the proposed estimator works well under non-ignorable missing mechanisms.

Suggested Citation

  • Nakamura, Kento & Yano, Keisuke & Komaki, Fumiyasu, 2020. "Adjacency-based regularization for partially ranked data with non-ignorable missing," Computational Statistics & Data Analysis, Elsevier, vol. 145(C).
  • Handle: RePEc:eee:csdana:v:145:y:2020:i:c:s0167947319302609
    DOI: 10.1016/j.csda.2019.106905
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0167947319302609
    Download Restriction: Full text for ScienceDirect subscribers only.

    File URL: https://libkey.io/10.1016/j.csda.2019.106905?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:csdana:v:145:y:2020:i:c:s0167947319302609. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/csda .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.