Authors
Jialei Wang, Peilin Zhao, Steven CH Hoi, Rong Jin
Publication date
2013/5/31
Journal
IEEE Transactions on knowledge and data engineering
Volume
26
Issue
3
Pages
698-710
Publisher
IEEE
Description
Feature selection is an important technique for data mining. Despite its importance, most studies of feature selection are restricted to batch learning. Unlike traditional batch learning methods, online learning represents a promising family of efficient and scalable machine learning algorithms for large-scale applications. Most existing studies of online learning require accessing all the attributes/features of training instances. Such a classical setting is not always appropriate for real-world applications when data instances are of high dimensionality or it is expensive to acquire the full set of attributes/features. To address this limitation, we investigate the problem of online feature selection (OFS) in which an online learner is only allowed to maintain a classifier involved only a small and fixed number of features. The key challenge of online feature selection is how to make accurate prediction for an instance using a small …
Total citations
2012201320142015201620172018201920202021202220232024111026334344413338372417
Scholar articles
J Wang, P Zhao, SCH Hoi, R Jin - IEEE Transactions on knowledge and data engineering, 2013