Next Article in Journal
Effects of Long-Wavelength Track Irregularities Due to Thermal Deformations of Railway Bridge on Dynamic Response of Running Train
Previous Article in Journal
Magnetooptics in Cylindrical Structures

Online Streaming Feature Selection via Conditional Independence

School of Information Science and Engineering, Yanshan University, Qinhuangdao 066004, China
School of Computing and Informatics, University of Louisiana at Lafayette, Lafayette, LA 70504, USA
Institute of Advanced Technology, Nanjing University Post & Telecommunication, Nanjing 210003, China
Authors to whom correspondence should be addressed.
Appl. Sci. 2018, 8(12), 2548;
Received: 22 November 2018 / Accepted: 5 December 2018 / Published: 8 December 2018
Online feature selection is a challenging topic in data mining. It aims to reduce the dimensionality of streaming features by removing irrelevant and redundant features in real time. Existing works, such as Alpha-investing and Online Streaming Feature Selection (OSFS), have been proposed to serve this purpose, but they have drawbacks, including low prediction accuracy and high running time if the streaming features exhibit characteristics such as low redundancy and high relevance. In this paper, we propose a novel algorithm about online streaming feature selection, named ConInd that uses a three-layer filtering strategy to process streaming features with the aim of overcoming such drawbacks. Through three-layer filtering, i.e., null-conditional independence, single-conditional independence, and multi-conditional independence, we can obtain an approximate Markov blanket with high accuracy and low running time. To validate the efficiency, we implemented the proposed algorithm and tested its performance on a prevalent dataset, i.e., NIPS 2003 and Causality Workbench. Through extensive experimental results, we demonstrated that ConInd offers significant performance improvements in prediction accuracy and running time compared to Alpha-investing and OSFS. ConInd offers 5.62% higher average prediction accuracy than Alpha-investing, with a 53.56% lower average running time compared to that for OSFS when the dataset is lowly redundant and highly relevant. In addition, the ratio of the average number of features for ConInd is 242% less than that for Alpha-investing. View Full-Text
Keywords: streaming feature; feature selection; conditional independence; markov blanket streaming feature; feature selection; conditional independence; markov blanket
Show Figures

Figure 1

MDPI and ACS Style

You, D.; Wu, X.; Shen, L.; He, Y.; Yuan, X.; Chen, Z.; Deng, S.; Ma, C. Online Streaming Feature Selection via Conditional Independence. Appl. Sci. 2018, 8, 2548.

AMA Style

You D, Wu X, Shen L, He Y, Yuan X, Chen Z, Deng S, Ma C. Online Streaming Feature Selection via Conditional Independence. Applied Sciences. 2018; 8(12):2548.

Chicago/Turabian Style

You, Dianlong, Xindong Wu, Limin Shen, Yi He, Xu Yuan, Zhen Chen, Song Deng, and Chuan Ma. 2018. "Online Streaming Feature Selection via Conditional Independence" Applied Sciences 8, no. 12: 2548.

Find Other Styles
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

Back to TopTop