Sciweavers

119 search results - page 7 / 24
» Sparse kernel methods for high-dimensional survival data
Sort
View
SADM
2010
173views more  SADM 2010»
13 years 3 months ago
Data reduction in classification: A simulated annealing based projection method
This paper is concerned with classifying high dimensional data into one of two categories. In various settings, such as when dealing with fMRI and microarray data, the number of v...
Tian Siva Tian, Rand R. Wilcox, Gareth M. James
ICIP
2006
IEEE
14 years 10 months ago
Robust Kernel Regression for Restoration and Reconstruction of Images from Sparse Noisy Data
We introduce a class of robust non-parametric estimation methods which are ideally suited for the reconstruction of signals and images from noise-corrupted or sparsely collected s...
Hiroyuki Takeda, Sina Farsiu, Peyman Milanfar
JMLR
2010
161views more  JMLR 2010»
13 years 3 months ago
Training and Testing Low-degree Polynomial Data Mappings via Linear SVM
Kernel techniques have long been used in SVM to handle linearly inseparable problems by transforming data to a high dimensional space, but training and testing large data sets is ...
Yin-Wen Chang, Cho-Jui Hsieh, Kai-Wei Chang, Micha...
SDM
2008
SIAM
256views Data Mining» more  SDM 2008»
13 years 9 months ago
Graph Mining with Variational Dirichlet Process Mixture Models
Graph data such as chemical compounds and XML documents are getting more common in many application domains. A main difficulty of graph data processing lies in the intrinsic high ...
Koji Tsuda, Kenichi Kurihara
CVPR
2009
IEEE
14 years 9 days ago
Efficiently training a better visual detector with sparse eigenvectors
Face detection plays an important role in many vision applications. Since Viola and Jones [1] proposed the first real-time AdaBoost based object detection system, much effort has ...
Sakrapee Paisitkriangkrai, Chunhua Shen, Jian Zhan...