Sciweavers

119 search results - page 1 / 24
» Sparse kernel methods for high-dimensional survival data
Sort
View
UAI
2000
13 years 6 months ago
The Anchors Hierarchy: Using the Triangle Inequality to Survive High Dimensional Data
This paper is about the use of metric data structures in high-dimensionalor non-Euclidean space to permit cached sufficientstatisticsaccelerationsof learning algorithms. It has re...
Andrew W. Moore
BIOINFORMATICS
2008
80views more  BIOINFORMATICS 2008»
13 years 5 months ago
Sparse kernel methods for high-dimensional survival data
Ludger Evers, Claudia-Martina Messow
ICML
2010
IEEE
13 years 6 months ago
Learning Sparse SVM for Feature Selection on Very High Dimensional Datasets
A sparse representation of Support Vector Machines (SVMs) with respect to input features is desirable for many applications. In this paper, by introducing a 0-1 control variable t...
Mingkui Tan, Li Wang, Ivor W. Tsang
ICONIP
2007
13 years 6 months ago
Principal Component Analysis for Sparse High-Dimensional Data
Abstract. Principal component analysis (PCA) is a widely used technique for data analysis and dimensionality reduction. Eigenvalue decomposition is the standard algorithm for solvi...
Tapani Raiko, Alexander Ilin, Juha Karhunen
ICDE
2008
IEEE
150views Database» more  ICDE 2008»
14 years 6 months ago
On the Anonymization of Sparse High-Dimensional Data
Abstract-- Existing research on privacy-preserving data publishing focuses on relational data: in this context, the objective is to enforce privacy-preserving paradigms, such as ka...
Gabriel Ghinita, Yufei Tao, Panos Kalnis