Sciweavers

220 search results - page 30 / 44
» Training linear SVMs in linear time
Sort
View
ACIVS
2006
Springer
14 years 1 months ago
A Comparison of Nearest Neighbor Search Algorithms for Generic Object Recognition
The nearest neighbor (NN) classifier is well suited for generic object recognition. However, it requires storing the complete training data, and classification time is linear in ...
Ferid Bajramovic, Frank Mattern, Nicholas Butko, J...
HIS
2004
13 years 8 months ago
Adaptive Boosting with Leader based Learners for Classification of Large Handwritten Data
Boosting is a general method for improving the accuracy of a learning algorithm. AdaBoost, short form for Adaptive Boosting method, consists of repeated use of a weak or a base le...
T. Ravindra Babu, M. Narasimha Murty, Vijay K. Agr...
TCOM
2010
141views more  TCOM 2010»
13 years 5 months ago
Communications over the Best Singular Mode of a Reciprocal MIMO Channel
We consider two nodes equipped with multiple antennas that intend to communicate i.e. both of which transmit and receive data. We model the responses of the communication channels...
Saeed Gazor, Khalid AlSuhaili
COLT
1999
Springer
13 years 11 months ago
Regret Bounds for Prediction Problems
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...
Geoffrey J. Gordon
ICDM
2008
IEEE
146views Data Mining» more  ICDM 2008»
14 years 1 months ago
Isolation Forest
Most existing model-based approaches to anomaly detection construct a profile of normal instances, then identify instances that do not conform to the normal profile as anomalies...
Fei Tony Liu, Kai Ming Ting, Zhi-Hua Zhou