Sciweavers

216 search results - page 11 / 44
» Learning Minimum Volume Sets
Sort
View
ICPR
2006
IEEE
14 years 11 months ago
Domain Based LDA and QDA
We propose an alternative to probability density classifiers based on normal distributions LDA and QDA. Instead of estimating covariance matrices using the standard maximum likeli...
David M. J. Tax, Piotr Juszczak, Robert P. W. Duin...
RANDOM
2001
Springer
14 years 2 months ago
On Euclidean Embeddings and Bandwidth Minimization
We study Euclidean embeddings of Euclidean metrics and present the following four results: (1) an O(log3 n √ log log n) approximation for minimum bandwidth in conjunction with a ...
John Dunagan, Santosh Vempala
SODA
1993
ACM
119views Algorithms» more  SODA 1993»
13 years 11 months ago
Iterated Nearest Neighbors and Finding Minimal Polytopes
We introduce a new method for nding several types of optimal k-point sets, minimizing perimeter, diameter, circumradius, and related measures, by testing sets of the O(k) nearest ...
David Eppstein, Jeff Erickson
CVPR
2010
IEEE
14 years 6 months ago
Visual Event Recognition in Videos by Learning from Web Data
We propose a visual event recognition framework for consumer domain videos by leveraging a large amount of loosely labeled web videos (e.g., from YouTube). First, we propose a new...
Lixin Duan, Dong Xu, Wai-Hung Tsang, Jiebo Luo
CIKM
2006
Springer
14 years 1 months ago
Performance thresholding in practical text classification
In practical classification, there is often a mix of learnable and unlearnable classes and only a classifier above a minimum performance threshold can be deployed. This problem is...
Hinrich Schütze, Emre Velipasaoglu, Jan O. Pe...