Sciweavers

234 search results - page 26 / 47
» Rademacher Margin Complexity
Sort
View
PODS
2000
ACM
120views Database» more  PODS 2000»
14 years 1 months ago
Indexing the Edges - A Simple and Yet Efficient Approach to High-Dimensional Indexing
In this paper, we propose a new tunable index scheme, called iMinMax , that maps points in high dimensional spaces to single dimension values determined by their maximum or minimu...
Beng Chin Ooi, Kian-Lee Tan, Cui Yu, Stépha...
EMNLP
2007
13 years 11 months ago
Online Learning for Deterministic Dependency Parsing
Deterministic parsing has emerged as an effective alternative for complex parsing algorithms which search the entire search space to get the best probable parse tree. In this pape...
Prashanth Mannem
SDM
2008
SIAM
117views Data Mining» more  SDM 2008»
13 years 11 months ago
A Feature Selection Algorithm Capable of Handling Extremely Large Data Dimensionality
With the advent of high throughput technologies, feature selection has become increasingly important in a wide range of scientific disciplines. We propose a new feature selection ...
Yijun Sun, Sinisa Todorovic, Steve Goodison
NIPS
2007
13 years 11 months ago
Learning with Tree-Averaged Densities and Distributions
We utilize the ensemble of trees framework, a tractable mixture over superexponential number of tree-structured distributions [1], to develop a new model for multivariate density ...
Sergey Kirshner
UAI
1996
13 years 11 months ago
Asymptotic Model Selection for Directed Networks with Hidden Variables
We extend the Bayesian Information Criterion (BIC), an asymptotic approximation for the marginal likelihood, to Bayesian networks with hidden variables. This approximation can be ...
Dan Geiger, David Heckerman, Christopher Meek