Sciweavers

318 search results - page 51 / 64
» Learning subspace kernels for classification
Sort
View
CVPR
2010
IEEE
14 years 3 months ago
Sufficient Dimensionality Reduction for Visual Sequence Classification
When classifying high-dimensional sequence data, traditional methods (e.g., HMMs, CRFs) may require large amounts of training data to avoid overfitting. In such cases dimensional...
Alex Shyr, Raquel Urtasun, Michael Jordan
KDD
2008
ACM
178views Data Mining» more  KDD 2008»
14 years 8 months ago
Training structural svms with kernels using sampled cuts
Discriminative training for structured outputs has found increasing applications in areas such as natural language processing, bioinformatics, information retrieval, and computer ...
Chun-Nam John Yu, Thorsten Joachims
TIP
2008
169views more  TIP 2008»
13 years 7 months ago
Weakly Supervised Learning of a Classifier for Unusual Event Detection
In this paper, we present an automatic classification framework combining appearance based features and Hidden Markov Models (HMM) to detect unusual events in image sequences. One...
Mark Jager, Christian Knoll, Fred A. Hamprecht
BMCBI
2007
194views more  BMCBI 2007»
13 years 7 months ago
Kernel-imbedded Gaussian processes for disease classification using microarray gene expression data
Background: Designing appropriate machine learning methods for identifying genes that have a significant discriminating power for disease outcomes has become more and more importa...
Xin Zhao, Leo Wang-Kit Cheung
ECML
2004
Springer
14 years 29 days ago
The Principal Components Analysis of a Graph, and Its Relationships to Spectral Clustering
This work presents a novel procedure for computing (1) distances between nodes of a weighted, undirected, graph, called the Euclidean Commute Time Distance (ECTD), and (2) a subspa...
Marco Saerens, François Fouss, Luh Yen, Pie...