A convex formulation for semi-supervised multi-label feature selection

Publication Type:
Conference Proceeding
Citation:
Proceedings of the National Conference on Artificial Intelligence, 2014, 2 pp. 1171 - 1177
Issue Date:
2014-01-01
Metrics:
Full metadata record
Files in This Item:
Filename Description Size
8594-38275-1-PB.pdfPublished version726.17 kB
Adobe PDF
Copyright © 2014, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved. Explosive growth of multimedia data has brought challenge of how to efficiently browse, retrieve and organize these data. Under this circumstance, different approaches have been proposed to facilitate multimedia analysis. Several semi-supervised feature selection algorithms have been proposed to exploit both labeled and unlabeled data. However, they are implemented based on graphs, such that they cannot handle large-scale datasets. How to conduct semi-supervised feature selection on large-scale datasets has become a challenging research problem. Moreover, existing multi-label feature selection algorithms rely on eigen-decomposition with heavy computational burden, which further prevent current feature selection algorithms from being applied for big data. In this paper, we propose a novel convex semi-supervised multi-label feature selection algorithm, which can be applied to large-scale datasets. We evaluate performance of the proposed algorithm over five benchmark datasets and compare the results with state- of-the-art supervised and semi-supervised feature selection algorithms as well as baseline using all features. The experimental results demonstrate that our proposed algorithm consistently achieve superiors performances.
Please use this identifier to cite or link to this item: