Sciweavers

548 search results - page 11 / 110
» Iterated importance sampling in missing data problems
Sort
View
NIPS
1997
15 years 1 days ago
EM Algorithms for PCA and SPCA
I present an expectation-maximization (EM) algorithm for principal component analysis (PCA). The algorithm allows a few eigenvectors and eigenvalues to be extracted from large col...
Sam T. Roweis
CVPR
2007
IEEE
16 years 22 days ago
Connecting the Out-of-Sample and Pre-Image Problems in Kernel Methods
Kernel methods have been widely studied in the field of pattern recognition. These methods implicitly map, "the kernel trick," the data into a space which is more approp...
Pablo Arias, Gregory Randall, Guillermo Sapiro
ICCV
2003
IEEE
16 years 19 days ago
A Non-Iterative Greedy Algorithm for Multi-frame Point Correspondence
This paper presents a framework for finding point correspondences in monocular image sequences over multiple frames. The general problem of multi-frame point correspondence is NP ...
Khurram Shafique, Mubarak Shah
BMCBI
2010
150views more  BMCBI 2010»
14 years 8 months ago
Kernel based methods for accelerated failure time model with ultra-high dimensional data
Background: Most genomic data have ultra-high dimensions with more than 10,000 genes (probes). Regularization methods with L1 and Lp penalty have been extensively studied in survi...
Zhenqiu Liu, Dechang Chen, Ming Tan, Feng Jiang, R...
ICMLA
2008
15 years 5 days ago
An Improved Generalized Discriminant Analysis for Large-Scale Data Set
In order to overcome the computation and storage problem for large-scale data set, an efficient iterative method of Generalized Discriminant Analysis is proposed. Because sample v...
Weiya Shi, Yue-Fei Guo, Cheng Jin, Xiangyang Xue