Sciweavers

119 search results - page 8 / 24
» Sparse kernel methods for high-dimensional survival data
Sort
View
ICASSP
2010
IEEE
13 years 8 months ago
Fast signal analysis and decomposition on graphs using the Sparse Matrix Transform
Recently, the Sparse Matrix Transform (SMT) has been proposed as a tool for estimating the eigen-decomposition of high dimensional data vectors [1]. The SMT approach has two major...
Leonardo R. Bachega, Guangzhi Cao, Charles A. Boum...
KDD
2008
ACM
199views Data Mining» more  KDD 2008»
14 years 8 months ago
Building semantic kernels for text classification using wikipedia
Document classification presents difficult challenges due to the sparsity and the high dimensionality of text data, and to the complex semantics of the natural language. The tradi...
Pu Wang, Carlotta Domeniconi
NIPS
2000
13 years 9 months ago
A Support Vector Method for Clustering
We present a novel method for clustering using the support vector machine approach. Data points are mapped to a high dimensional feature space, where support vectors are used to d...
Asa Ben-Hur, David Horn, Hava T. Siegelmann, Vladi...
ICCV
2011
IEEE
12 years 8 months ago
A Linear Subspace Learning Approach via Sparse Coding
Linear subspace learning (LSL) is a popular approach to image recognition and it aims to reveal the essential features of high dimensional data, e.g., facial images, in a lower di...
Lei Zhang, Pengfei Zhu, Qinghu Hu, David Zhang
PR
2008
129views more  PR 2008»
13 years 8 months ago
A comparison of generalized linear discriminant analysis algorithms
7 Linear discriminant analysis (LDA) is a dimension reduction method which finds an optimal linear transformation that maximizes the class separability. However, in undersampled p...
Cheong Hee Park, Haesun Park