DARC: Timely classification with randomly delayed features

Jie Xu, Qi Cai, Cong Shen

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

Many emerging Big Data applications involve real- time classification in which data instances arriving sequentially over time need to be classified based on their feature vectors. A common and implicit assumption in existing works is that the features become available instantly with the instance and simultaneously with each other, which, however, rarely holds in practice. Instead, features of an instance may experience various random delays to be available. In such scenarios, an important trade-off emerges between accurate classification and timely classification. In this paper, we provide a first formulation of this important problem and propose efficient online algorithms, namely DAlay-aware Real-time Classification (DARC) algorithms, that maximize the classification accuracy given an average classification delay constraint. The algorithms are developed based on the Lyapunov stochastic optimization technique which provides strong performance guarantee. Numerical results on an intrusion detection dataset are provided to show the effectiveness of the proposed algorithm.

Original languageEnglish (US)
Title of host publication2016 IEEE Global Communications Conference, GLOBECOM 2016 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781509013289
DOIs
StatePublished - Feb 2 2017
Event59th IEEE Global Communications Conference, GLOBECOM 2016 - Washington, United States
Duration: Dec 4 2016Dec 8 2016

Other

Other59th IEEE Global Communications Conference, GLOBECOM 2016
CountryUnited States
CityWashington
Period12/4/1612/8/16

Fingerprint

Intrusion detection
Big data

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Computer Networks and Communications
  • Hardware and Architecture
  • Safety, Risk, Reliability and Quality

Cite this

Xu, J., Cai, Q., & Shen, C. (2017). DARC: Timely classification with randomly delayed features. In 2016 IEEE Global Communications Conference, GLOBECOM 2016 - Proceedings [7841715] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/GLOCOM.2016.7841715

DARC : Timely classification with randomly delayed features. / Xu, Jie; Cai, Qi; Shen, Cong.

2016 IEEE Global Communications Conference, GLOBECOM 2016 - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2017. 7841715.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Xu, J, Cai, Q & Shen, C 2017, DARC: Timely classification with randomly delayed features. in 2016 IEEE Global Communications Conference, GLOBECOM 2016 - Proceedings., 7841715, Institute of Electrical and Electronics Engineers Inc., 59th IEEE Global Communications Conference, GLOBECOM 2016, Washington, United States, 12/4/16. https://doi.org/10.1109/GLOCOM.2016.7841715
Xu J, Cai Q, Shen C. DARC: Timely classification with randomly delayed features. In 2016 IEEE Global Communications Conference, GLOBECOM 2016 - Proceedings. Institute of Electrical and Electronics Engineers Inc. 2017. 7841715 https://doi.org/10.1109/GLOCOM.2016.7841715
Xu, Jie ; Cai, Qi ; Shen, Cong. / DARC : Timely classification with randomly delayed features. 2016 IEEE Global Communications Conference, GLOBECOM 2016 - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2017.
@inproceedings{0d37dea36dda4bbb808ab3f8b5f354ea,
title = "DARC: Timely classification with randomly delayed features",
abstract = "Many emerging Big Data applications involve real- time classification in which data instances arriving sequentially over time need to be classified based on their feature vectors. A common and implicit assumption in existing works is that the features become available instantly with the instance and simultaneously with each other, which, however, rarely holds in practice. Instead, features of an instance may experience various random delays to be available. In such scenarios, an important trade-off emerges between accurate classification and timely classification. In this paper, we provide a first formulation of this important problem and propose efficient online algorithms, namely DAlay-aware Real-time Classification (DARC) algorithms, that maximize the classification accuracy given an average classification delay constraint. The algorithms are developed based on the Lyapunov stochastic optimization technique which provides strong performance guarantee. Numerical results on an intrusion detection dataset are provided to show the effectiveness of the proposed algorithm.",
author = "Jie Xu and Qi Cai and Cong Shen",
year = "2017",
month = "2",
day = "2",
doi = "10.1109/GLOCOM.2016.7841715",
language = "English (US)",
booktitle = "2016 IEEE Global Communications Conference, GLOBECOM 2016 - Proceedings",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - DARC

T2 - Timely classification with randomly delayed features

AU - Xu, Jie

AU - Cai, Qi

AU - Shen, Cong

PY - 2017/2/2

Y1 - 2017/2/2

N2 - Many emerging Big Data applications involve real- time classification in which data instances arriving sequentially over time need to be classified based on their feature vectors. A common and implicit assumption in existing works is that the features become available instantly with the instance and simultaneously with each other, which, however, rarely holds in practice. Instead, features of an instance may experience various random delays to be available. In such scenarios, an important trade-off emerges between accurate classification and timely classification. In this paper, we provide a first formulation of this important problem and propose efficient online algorithms, namely DAlay-aware Real-time Classification (DARC) algorithms, that maximize the classification accuracy given an average classification delay constraint. The algorithms are developed based on the Lyapunov stochastic optimization technique which provides strong performance guarantee. Numerical results on an intrusion detection dataset are provided to show the effectiveness of the proposed algorithm.

AB - Many emerging Big Data applications involve real- time classification in which data instances arriving sequentially over time need to be classified based on their feature vectors. A common and implicit assumption in existing works is that the features become available instantly with the instance and simultaneously with each other, which, however, rarely holds in practice. Instead, features of an instance may experience various random delays to be available. In such scenarios, an important trade-off emerges between accurate classification and timely classification. In this paper, we provide a first formulation of this important problem and propose efficient online algorithms, namely DAlay-aware Real-time Classification (DARC) algorithms, that maximize the classification accuracy given an average classification delay constraint. The algorithms are developed based on the Lyapunov stochastic optimization technique which provides strong performance guarantee. Numerical results on an intrusion detection dataset are provided to show the effectiveness of the proposed algorithm.

UR - http://www.scopus.com/inward/record.url?scp=85015369320&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85015369320&partnerID=8YFLogxK

U2 - 10.1109/GLOCOM.2016.7841715

DO - 10.1109/GLOCOM.2016.7841715

M3 - Conference contribution

AN - SCOPUS:85015369320

BT - 2016 IEEE Global Communications Conference, GLOBECOM 2016 - Proceedings

PB - Institute of Electrical and Electronics Engineers Inc.

ER -