|
|
|
|
| LEADER |
01000naa a22002652 4500 |
| 001 |
NLM226045692 |
| 003 |
DE-627 |
| 005 |
20231224070536.0 |
| 007 |
cr uuu---uuuuu |
| 008 |
231224s2013 xx |||||o 00| ||eng c |
| 024 |
7 |
|
|a 10.1109/TPAMI.2012.197
|2 doi
|
| 028 |
5 |
2 |
|a pubmed24n0753.xml
|
| 035 |
|
|
|a (DE-627)NLM226045692
|
| 035 |
|
|
|a (NLM)23520258
|
| 040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
| 041 |
|
|
|a eng
|
| 100 |
1 |
|
|a Wu, Xindong
|e verfasserin
|4 aut
|
| 245 |
1 |
0 |
|a Online feature selection with streaming features
|
| 264 |
|
1 |
|c 2013
|
| 336 |
|
|
|a Text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a ƒaComputermedien
|b c
|2 rdamedia
|
| 338 |
|
|
|a ƒa Online-Ressource
|b cr
|2 rdacarrier
|
| 500 |
|
|
|a Date Completed 16.09.2013
|
| 500 |
|
|
|a Date Revised 22.03.2013
|
| 500 |
|
|
|a published: Print
|
| 500 |
|
|
|a Citation Status PubMed-not-MEDLINE
|
| 520 |
|
|
|a We propose a new online feature selection framework for applications with streaming features where the knowledge of the full feature space is unknown in advance. We define streaming features as features that flow in one by one over time whereas the number of training examples remains fixed. This is in contrast with traditional online learning methods that only deal with sequentially added observations, with little attention being paid to streaming features. The critical challenges for Online Streaming Feature Selection (OSFS) include 1) the continuous growth of feature volumes over time, 2) a large feature space, possibly of unknown or infinite size, and 3) the unavailability of the entire feature set before learning starts. In the paper, we present a novel Online Streaming Feature Selection method to select strongly relevant and nonredundant features on the fly. An efficient Fast-OSFS algorithm is proposed to improve feature selection performance. The proposed algorithms are evaluated extensively on high-dimensional datasets and also with a real-world case study on impact crater detection. Experimental results demonstrate that the algorithms achieve better compactness and higher prediction accuracy than existing streaming feature selection algorithms
|
| 650 |
|
4 |
|a Journal Article
|
| 650 |
|
4 |
|a Research Support, Non-U.S. Gov't
|
| 650 |
|
4 |
|a Research Support, U.S. Gov't, Non-P.H.S.
|
| 700 |
1 |
|
|a Yu, Kui
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Ding, Wei
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Wang, Hao
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Zhu, Xingquan
|e verfasserin
|4 aut
|
| 773 |
0 |
8 |
|i Enthalten in
|t IEEE transactions on pattern analysis and machine intelligence
|d 1979
|g 35(2013), 5 vom: 23. Mai, Seite 1178-92
|w (DE-627)NLM098212257
|x 1939-3539
|7 nnns
|
| 773 |
1 |
8 |
|g volume:35
|g year:2013
|g number:5
|g day:23
|g month:05
|g pages:1178-92
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1109/TPAMI.2012.197
|3 Volltext
|
| 912 |
|
|
|a GBV_USEFLAG_A
|
| 912 |
|
|
|a SYSFLAG_A
|
| 912 |
|
|
|a GBV_NLM
|
| 912 |
|
|
|a GBV_ILN_350
|
| 951 |
|
|
|a AR
|
| 952 |
|
|
|d 35
|j 2013
|e 5
|b 23
|c 05
|h 1178-92
|