Order-sensitive imputation for clustered missing values (Extended Abstract)

Qian Ma; Yu Gu; Wang Chien Lee; Ge Yu

doi:10.1109/ICDE.2019.00268

Order-sensitive imputation for clustered missing values (Extended Abstract)

Qian Ma, Yu Gu, Wang Chien Lee, Ge Yu

Computer Science and Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

To study the issue of missing values (MVs), we propose the Order-Sensitive Imputation for Clustered Missing values (OSICM) framework, in which missing values are imputed sequentially such that the values filled earlier in the process are also used for later imputation of other MVs. Obviously, the order of imputations is critical to the effectiveness and efficiency of OSICM framework. We formulate the searching of the optimal imputation order as an optimization problem, and show its NP-hardness. Furthermore, we devise an algorithm to find the exact optimal solution and propose two approximate/heuristic algorithms to trade off effectiveness for efficiency. Finally, we conduct extensive experiments on real and synthetic datasets to demonstrate the superiority of our OSICM framework.

Original language	English (US)
Title of host publication	Proceedings - 2019 IEEE 35th International Conference on Data Engineering, ICDE 2019
Publisher	IEEE Computer Society
Pages	2147-2148
Number of pages	2
ISBN (Electronic)	9781538674741
DOIs	https://doi.org/10.1109/ICDE.2019.00268
State	Published - Apr 2019
Event	35th IEEE International Conference on Data Engineering, ICDE 2019 - Macau, China Duration: Apr 8 2019 → Apr 11 2019

Publication series

Name	Proceedings - International Conference on Data Engineering
Volume	2019-April
ISSN (Print)	1084-4627

Conference

Conference	35th IEEE International Conference on Data Engineering, ICDE 2019
Country	China
City	Macau
Period	4/8/19 → 4/11/19

All Science Journal Classification (ASJC) codes

Software
Signal Processing
Information Systems

Access to Document

10.1109/ICDE.2019.00268

Fingerprint Dive into the research topics of 'Order-sensitive imputation for clustered missing values (Extended Abstract)'. Together they form a unique fingerprint.

Cite this

Ma, Q., Gu, Y., Lee, W. C., & Yu, G. (2019). Order-sensitive imputation for clustered missing values (Extended Abstract). In Proceedings - 2019 IEEE 35th International Conference on Data Engineering, ICDE 2019 (pp. 2147-2148). [8731477] (Proceedings - International Conference on Data Engineering; Vol. 2019-April). IEEE Computer Society. https://doi.org/10.1109/ICDE.2019.00268

@inproceedings{3233caa83b254918975ef8f6b19496bf,

title = "Order-sensitive imputation for clustered missing values (Extended Abstract)",

abstract = "To study the issue of missing values (MVs), we propose the Order-Sensitive Imputation for Clustered Missing values (OSICM) framework, in which missing values are imputed sequentially such that the values filled earlier in the process are also used for later imputation of other MVs. Obviously, the order of imputations is critical to the effectiveness and efficiency of OSICM framework. We formulate the searching of the optimal imputation order as an optimization problem, and show its NP-hardness. Furthermore, we devise an algorithm to find the exact optimal solution and propose two approximate/heuristic algorithms to trade off effectiveness for efficiency. Finally, we conduct extensive experiments on real and synthetic datasets to demonstrate the superiority of our OSICM framework.",

author = "Qian Ma and Yu Gu and Lee, {Wang Chien} and Ge Yu",

year = "2019",

month = apr,

doi = "10.1109/ICDE.2019.00268",

language = "English (US)",

series = "Proceedings - International Conference on Data Engineering",

publisher = "IEEE Computer Society",

pages = "2147--2148",

booktitle = "Proceedings - 2019 IEEE 35th International Conference on Data Engineering, ICDE 2019",

address = "United States",

note = "35th IEEE International Conference on Data Engineering, ICDE 2019 ; Conference date: 08-04-2019 Through 11-04-2019",

}

Ma, Q, Gu, Y, Lee, WC & Yu, G 2019, Order-sensitive imputation for clustered missing values (Extended Abstract). in Proceedings - 2019 IEEE 35th International Conference on Data Engineering, ICDE 2019., 8731477, Proceedings - International Conference on Data Engineering, vol. 2019-April, IEEE Computer Society, pp. 2147-2148, 35th IEEE International Conference on Data Engineering, ICDE 2019, Macau, China, 4/8/19. https://doi.org/10.1109/ICDE.2019.00268

Order-sensitive imputation for clustered missing values (Extended Abstract). / Ma, Qian; Gu, Yu; Lee, Wang Chien; Yu, Ge.

Proceedings - 2019 IEEE 35th International Conference on Data Engineering, ICDE 2019. IEEE Computer Society, 2019. p. 2147-2148 8731477 (Proceedings - International Conference on Data Engineering; Vol. 2019-April).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Order-sensitive imputation for clustered missing values (Extended Abstract)

AU - Ma, Qian

AU - Gu, Yu

AU - Lee, Wang Chien

AU - Yu, Ge

PY - 2019/4

Y1 - 2019/4

N2 - To study the issue of missing values (MVs), we propose the Order-Sensitive Imputation for Clustered Missing values (OSICM) framework, in which missing values are imputed sequentially such that the values filled earlier in the process are also used for later imputation of other MVs. Obviously, the order of imputations is critical to the effectiveness and efficiency of OSICM framework. We formulate the searching of the optimal imputation order as an optimization problem, and show its NP-hardness. Furthermore, we devise an algorithm to find the exact optimal solution and propose two approximate/heuristic algorithms to trade off effectiveness for efficiency. Finally, we conduct extensive experiments on real and synthetic datasets to demonstrate the superiority of our OSICM framework.

AB - To study the issue of missing values (MVs), we propose the Order-Sensitive Imputation for Clustered Missing values (OSICM) framework, in which missing values are imputed sequentially such that the values filled earlier in the process are also used for later imputation of other MVs. Obviously, the order of imputations is critical to the effectiveness and efficiency of OSICM framework. We formulate the searching of the optimal imputation order as an optimization problem, and show its NP-hardness. Furthermore, we devise an algorithm to find the exact optimal solution and propose two approximate/heuristic algorithms to trade off effectiveness for efficiency. Finally, we conduct extensive experiments on real and synthetic datasets to demonstrate the superiority of our OSICM framework.

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

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

U2 - 10.1109/ICDE.2019.00268

DO - 10.1109/ICDE.2019.00268

M3 - Conference contribution

AN - SCOPUS:85067963755

T3 - Proceedings - International Conference on Data Engineering

SP - 2147

EP - 2148

BT - Proceedings - 2019 IEEE 35th International Conference on Data Engineering, ICDE 2019

PB - IEEE Computer Society

T2 - 35th IEEE International Conference on Data Engineering, ICDE 2019

Y2 - 8 April 2019 through 11 April 2019

ER -