IDEAS home Printed from https://ideas.repec.org/a/spr/telsys/v67y2018i2d10.1007_s11235-017-0339-7.html
   My bibliography  Save this article

Budget-constraint mechanism for incremental multi-labeling crowdsensing

Author

Listed:
  • Jiajun Sun

    (Nanjing University of Aeronautics and Astronautics)

  • Ningzhong Liu

    (Nanjing University of Aeronautics and Astronautics)

  • Dianliang Wu

    (Shanghai Jiao Tong University)

Abstract

Machine learning techniques require an enormous amount of high-quality data labeling for more naturally simulating human comprehension. Recently, mobile crowdsensing, as a new paradigm, makes it possible that a large number of instances can be often quickly labeled at low cost. Existing works only focus on the single labeling for supervised learning problems of traditional machine learning, where one instance associates with only label. However, in many real world applications, an instance may have more than one label. To the end, in this paper, we explore an incremental multi-labeling issue by incentivizing crowd users to label instances under the budget constraint, where each instance is composed of multiple labels. Considering both uncertainty and diversity of the number of each instance’s labels, this paper proposes two mechanisms for incremental multi-labeling crowdsensing by introducing both uncertainty and diversity. Through extensive simulations, we validate their theoretical properties and evaluate the performance.

Suggested Citation

  • Jiajun Sun & Ningzhong Liu & Dianliang Wu, 2018. "Budget-constraint mechanism for incremental multi-labeling crowdsensing," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 67(2), pages 297-307, February.
  • Handle: RePEc:spr:telsys:v:67:y:2018:i:2:d:10.1007_s11235-017-0339-7
    DOI: 10.1007/s11235-017-0339-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11235-017-0339-7
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s11235-017-0339-7?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:spr:telsys:v:67:y:2018:i:2:d:10.1007_s11235-017-0339-7. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.