Sciweavers

119 search results - page 6 / 24
» Sparse kernel methods for high-dimensional survival data
Sort
View
IJCAI
2007
13 years 8 months ago
A Subspace Kernel for Nonlinear Feature Extraction
Kernel based nonlinear Feature Extraction (KFE) or dimensionality reduction is a widely used pre-processing step in pattern classification and data mining tasks. Given a positive...
Mingrui Wu, Jason D. R. Farquhar
IJON
2011
133views more  IJON 2011»
13 years 2 months ago
Relational generative topographic mapping
Abstract. The generative topographic mapping (GTM) has been proposed as a statistical model to represent high dimensional data by means of a sparse lattice of points in latent spac...
Andrej Gisbrecht, Bassam Mokbel, Barbara Hammer
NECO
2000
190views more  NECO 2000»
13 years 7 months ago
Generalized Discriminant Analysis Using a Kernel Approach
We present a new method that we call Generalized Discriminant Analysis (GDA) to deal with nonlinear discriminant analysis using kernel function operator. The underlying theory is ...
G. Baudat, Fatiha Anouar
SDM
2007
SIAM
118views Data Mining» more  SDM 2007»
13 years 8 months ago
On Privacy-Preservation of Text and Sparse Binary Data with Sketches
In recent years, privacy preserving data mining has become very important because of the proliferation of large amounts of data on the internet. Many data sets are inherently high...
Charu C. Aggarwal, Philip S. Yu
ICML
2004
IEEE
14 years 24 days ago
Learning a kernel matrix for nonlinear dimensionality reduction
We investigate how to learn a kernel matrix for high dimensional data that lies on or near a low dimensional manifold. Noting that the kernel matrix implicitly maps the data into ...
Kilian Q. Weinberger, Fei Sha, Lawrence K. Saul