|
|
|
|
LEADER |
01000naa a22002652 4500 |
001 |
NLM166620122 |
003 |
DE-627 |
005 |
20231223111201.0 |
007 |
tu |
008 |
231223s2007 xx ||||| 00| ||eng c |
028 |
5 |
2 |
|a pubmed24n0556.xml
|
035 |
|
|
|a (DE-627)NLM166620122
|
035 |
|
|
|a (NLM)17108391
|
040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
041 |
|
|
|a eng
|
100 |
1 |
|
|a Wei, Hua-Liang
|e verfasserin
|4 aut
|
245 |
1 |
0 |
|a Feature subset selection and ranking for data dimensionality reduction
|
264 |
|
1 |
|c 2007
|
336 |
|
|
|a Text
|b txt
|2 rdacontent
|
337 |
|
|
|a ohne Hilfsmittel zu benutzen
|b n
|2 rdamedia
|
338 |
|
|
|a Band
|b nc
|2 rdacarrier
|
500 |
|
|
|a Date Completed 30.01.2007
|
500 |
|
|
|a Date Revised 10.11.2019
|
500 |
|
|
|a published: Print
|
500 |
|
|
|a Citation Status MEDLINE
|
520 |
|
|
|a A new unsupervised forward orthogonal search (FOS) algorithm is introduced for feature selection and ranking. In the new algorithm, features are selected in a stepwise way, one at a time, by estimating the capability of each specified candidate feature subset to represent the overall features in the measurement space. A squared correlation function is employed as the criterion to measure the dependency between features and this makes the new algorithm easy to implement. The forward orthogonalization strategy, which combines good effectiveness with high efficiency, enables the new algorithm to produce efficient feature subsets with a clear physical interpretation
|
650 |
|
4 |
|a Journal Article
|
700 |
1 |
|
|a Billings, Stephen A
|e verfasserin
|4 aut
|
773 |
0 |
8 |
|i Enthalten in
|t IEEE transactions on pattern analysis and machine intelligence
|d 1979
|g 29(2007), 1 vom: 16. Jan., Seite 162-6
|w (DE-627)NLM098212257
|x 1939-3539
|7 nnns
|
773 |
1 |
8 |
|g volume:29
|g year:2007
|g number:1
|g day:16
|g month:01
|g pages:162-6
|
912 |
|
|
|a GBV_USEFLAG_A
|
912 |
|
|
|a SYSFLAG_A
|
912 |
|
|
|a GBV_NLM
|
912 |
|
|
|a GBV_ILN_350
|
951 |
|
|
|a AR
|
952 |
|
|
|d 29
|j 2007
|e 1
|b 16
|c 01
|h 162-6
|