✦ LIBER ✦

Gene subset selection in kernel-induced feature space

✍ Scribed by Satoshi Niijima; Satoru Kuhara

Book ID: 108234834
Publisher: Elsevier Science
Year: 2006
Tongue: English
Weight: 225 KB
Volume: 27
Category: Article
ISSN: 0167-8655
DOI: 10.1016/j.patrec.2006.04.017

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Feature Subset Selection for Support Vec

Feature Subset Selection for Support Vector Machine Through Separability Assessment in Kernel-Defined Feature Space

✍ Tang, Yaohua; Gao, Jinghuai; Yang, Cunxiang; Yang, Xiaoliang 📂 Article 📅 2007 🏛 American Scientific Publishers 🌐 English ⚖ 400 KB

Clustering interval data through kernel-

Clustering interval data through kernel-induced feature space

✍ Anderson F. B. F. da Costa, Bruno A. Pimentel, Renata M. C. R. de Souza 📂 Article 📅 2012 🏛 Springer US 🌐 English ⚖ 880 KB

Feature subset selection in large dimens

Feature subset selection in large dimensionality domains

✍ Iffat A. Gheyas; Leslie S. Smith 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 207 KB

Feature space versus empirical kernel ma

Feature space versus empirical kernel map and row kernel space in SVMs

✍ Xun Liang 📂 Article 📅 2010 🏛 Springer-Verlag 🌐 English ⚖ 495 KB

Mercer kernel-based clustering in featur

Mercer kernel-based clustering in feature space

✍ Girolami, M. 📂 Article 📅 2002 🏛 IEEE 🌐 English ⚖ 363 KB

Evaluation of the performance of cluster

Evaluation of the performance of clustering algorithms in kernel-induced feature space

✍ Dae-Won Kim; Ki Young Lee; Doheon Lee; Kwang H. Lee 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 223 KB

By using a kernel function, data that are not easily separable in the original space can be clustered into homogeneous groups in the implicitly transformed high-dimensional feature space. Kernel k-means algorithms have recently been shown to perform better than conventional k-means algorithms in uns