Sciweavers

4660 search results - page 663 / 932
» Learning from imperfect data
Sort
View
SDM
2007
SIAM
81views Data Mining» more  SDM 2007»
14 years 7 days ago
A PAC Bound for Approximate Support Vector Machines
We study a class of algorithms that speed up the training process of support vector machines (SVMs) by returning an approximate SVM. We focus on algorithms that reduce the size of...
Dongwei Cao, Daniel Boley
NIPS
2004
14 years 6 days ago
Joint Probabilistic Curve Clustering and Alignment
Clustering and prediction of sets of curves is an important problem in many areas of science and engineering. It is often the case that curves tend to be misaligned from each othe...
Scott Gaffney, Padhraic Smyth
NIPS
2003
14 years 5 days ago
One Microphone Blind Dereverberation Based on Quasi-periodicity of Speech Signals
Speech dereverberation is desirable with a view to achieving, for example, robust speech recognition in the real world. However, it is still a challenging problem, especially when...
Tomohiro Nakatani, Masato Miyoshi, Keisuke Kinoshi...
NIPS
1998
14 years 5 days ago
A Polygonal Line Algorithm for Constructing Principal Curves
Principal curves have been defined as "self consistent" smooth curves which pass through the "middle" of a d-dimensional probability distribution or data cloud...
Balázs Kégl, Adam Krzyzak, Tam&aacut...
CACM
2010
105views more  CACM 2010»
13 years 11 months ago
Censored exploration and the dark pool problem
We introduce and analyze a natural algorithm for multi-venue exploration from censored data, which is motivated by the Dark Pool Problem of modern quantitative finance. We prove t...
Kuzman Ganchev, Yuriy Nevmyvaka, Michael Kearns, J...