Sciweavers

346 search results - page 21 / 70
» A New Approximate Maximal Margin Classification Algorithm
Sort
View
ICCV
2009
IEEE
13 years 5 months ago
Local distance functions: A taxonomy, new algorithms, and an evaluation
We present a taxonomy for local distance functions where most existing algorithms can be regarded as approximations of the geodesic distance defined by a metric tensor. We categor...
Deva Ramanan, Simon Baker
NIPS
2004
13 years 9 months ago
Incremental Algorithms for Hierarchical Classification
We study the problem of hierarchical classification when labels corresponding to partial and/or multiple paths in the underlying taxonomy are allowed. We introduce a new hierarchi...
Nicolò Cesa-Bianchi, Claudio Gentile, Andre...
KDD
2009
ACM
192views Data Mining» more  KDD 2009»
14 years 8 months ago
Time series shapelets: a new primitive for data mining
Classification of time series has been attracting great interest over the past decade. Recent empirical evidence has strongly suggested that the simple nearest neighbor algorithm ...
Lexiang Ye, Eamonn J. Keogh
PRL
2000
76views more  PRL 2000»
13 years 7 months ago
Road sign classification using Laplace kernel classifier
Driver support systems of intelligent vehicles will predict potentially dangerous situations in heavy traffic, help with navigation and vehicle guidance and interact with a human ...
Pavel Paclík, Jana Novovicová, Pavel...
FOCS
2003
IEEE
14 years 25 days ago
Approximation Algorithms for Orienteering and Discounted-Reward TSP
In this paper, we give the rst constant-factor approximationalgorithmfor the rooted Orienteering problem, as well as a new problem that we call the Discounted-Reward TSP, motivate...
Avrim Blum, Shuchi Chawla, David R. Karger, Terran...