IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v32y2016i4d10.1007_s10878-015-9920-8.html
   My bibliography  Save this article

Efficient accuracy evaluation for multi-modal sensed data

Author

Listed:
  • Yan Zhang

    (Harbin Institute of Technology)

  • Hongzhi Wang

    (Harbin Institute of Technology)

  • Hong Gao

    (Harbin Institute of Technology)

  • Jianzhong Li

    (Harbin Institute of Technology)

Abstract

Data accuracy is an important aspect in sensed data quality. Thus one necessary task for data quality management is to evaluate the accuracy of sensed data. However, to our best knowledge, neither measure nor effective methods for the accuracy evaluation are proposed for multi-typed sensed data. To address the problem for accuracy evaluation, we propose a systematic method. With MSE, a parameter to measure the accuracy in statistics, we design the accuracy evaluation framework for multi-modal data. Within this framework, we classify data types into three categories and develop accuracy evaluation algorithms for each category in cases of in presence and absence of true values. Extensive experimental results show the efficiency and effectiveness of our proposed framework and algorithms.

Suggested Citation

  • Yan Zhang & Hongzhi Wang & Hong Gao & Jianzhong Li, 2016. "Efficient accuracy evaluation for multi-modal sensed data," Journal of Combinatorial Optimization, Springer, vol. 32(4), pages 1068-1088, November.
    • Handle: RePEc:spr:jcomop:v:32:y:2016:i:4:d:10.1007_s10878-015-9920-8
    DOI: 10.1007/s10878-015-9920-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-015-9920-8
    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/s10878-015-9920-8?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.

    References listed on IDEAS

    as
    1. Minming Li & Qin Liu & Jianping Wang & Yingchao Zhao, 2012. "Dispatching design for storage-centric wireless sensor networks," Journal of Combinatorial Optimization, Springer, vol. 24(4), pages 485-507, November.
    2. Hongjie Du & Weili Wu & Shan Shan & Donghyun Kim & Wonjun Lee, 2012. "Constructing weakly connected dominating set for secure clustering in distributed sensor network," Journal of Combinatorial Optimization, Springer, vol. 23(2), pages 301-307, February.
    3. Guangting Chen & Suhui Cui, 2013. "Relay node placement in two-tiered wireless sensor networks with base stations," Journal of Combinatorial Optimization, Springer, vol. 26(3), pages 499-508, October.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Ran Bi & Jianzhong Li & Hong Gao & Yingshu Li, 2016. "$$(\alpha , \tau )$$ ( α , τ ) -Monitoring for event detection in wireless sensor networks," Journal of Combinatorial Optimization, Springer, vol. 32(4), pages 985-1001, November.
    2. Hongwei Du & Panos Pardalos & Weili Wu & Lidong Wu, 2013. "Maximum lifetime connected coverage with two active-phase sensors," Journal of Global Optimization, Springer, vol. 56(2), pages 559-568, June.
    3. Hongyu Liang & Tiancheng Lou & Haisheng Tan & Yuexuan Wang & Dongxiao Yu, 2015. "On the complexity of connectivity in cognitive radio networks through spectrum assignment," Journal of Combinatorial Optimization, Springer, vol. 29(2), pages 472-487, February.
    4. Jing Gao & Jianzhong Li & Yingshu Li, 2016. "Approximate event detection over multi-modal sensing data," Journal of Combinatorial Optimization, Springer, vol. 32(4), pages 1002-1016, November.
    5. Tian Liu & Zhao Lu & Ke Xu, 2015. "Tractable connected domination for restricted bipartite graphs," Journal of Combinatorial Optimization, Springer, vol. 29(1), pages 247-256, January.

    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:jcomop:v:32:y:2016:i:4:d:10.1007_s10878-015-9920-8. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.