4.5 Article

Sparse group LASSO based uncertain feature selection

出版社

SPRINGER HEIDELBERG
DOI: 10.1007/s13042-013-0156-6

关键词

Uncertain data; Feature selection; Sparse group LASSO

资金

  1. National Natural Science Foundation of China [61105054, 61071179, 10978011]
  2. Key Laboratory of Network Oriented Intelligent Computation, Program for New Century Excellent Talents in University [NCET-08-0156]
  3. China Postdoctoral Science Foundation

向作者/读者索取更多资源

Uncertain data management and mining is becoming a hot topic in recent years. However, little attention has been paid to uncertain feature selection so far. In this paper, we introduce the sparse group least absolution shrinkage and selection operator (LASSO) technique to construct a feature selection algorithm for uncertain data. Each uncertain feature is represented with a probability density function. We take each feature as a group of values. Through analysis of the current four sparse feature selection methods, LASSO, elastic net, group LASSO and sparse group LASSO, the sparse group LASSO is introduced to select feature selection from uncertain data. The proposed algorithm can select not only the features between groups, but also the sub-features in groups. As the trained weights of feature groups are sparse, the groups of features with weight zero are removed. Experiments on nine UCI datasets show that feature selection for uncertain data can reduce the number of features and sub-features at the same time. Moreover it can produce comparable accuracy with all features.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.5
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据