Fast Orthogonal Foward Selection Algorithm for Feature Subset Selection  

Oleh:

Mao, K. Z.

Jenis: Article from Journal - ilmiah internasional
Dalam koleksi: IEEE Transactions on Neural Networks vol. 13 no. 5 (2002), page 1218-1224.
Topik: ORTHOGONALITY; orthogonal; algorithm; feature subset; selection

Ketersediaan

Perpustakaan Pusat (Semanggi) Nomor Panggil: II36.7A Non-tandon: 1 (dapat dipinjam: 0) Tandon: tidak ada

Lihat Detail Induk

Isi artikel

Feature selection is an important issue in pattern classification. In the presented study, we develop a fast orthogonal forward selection (FOFS) algorithm for feature subset selection. The FOFS algorithm employs an orthogonal transform to decompose correlations among candidate features, but it performs the orthogonal decomposition in an implicit way. Consequently, the fast algorithm demands less computational effort as compared with conventional orthogonal forward selection (OFS).

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali