Sciweavers

119 search results - page 17 / 24
» Pruning Training Samples Using a Supervised Clustering Algor...
Sort
View
ICPR
2010
IEEE
13 years 5 months ago
Boosting Bayesian MAP Classification
In this paper we redefine and generalize the classic k-nearest neighbors (k-NN) voting rule in a Bayesian maximum-a-posteriori (MAP) framework. Therefore, annotated examples are u...
Paolo Piro, Richard Nock, Frank Nielsen, Michel Ba...
KDD
2003
ACM
180views Data Mining» more  KDD 2003»
14 years 7 months ago
Classifying large data sets using SVMs with hierarchical clusters
Support vector machines (SVMs) have been promising methods for classification and regression analysis because of their solid mathematical foundations which convey several salient ...
Hwanjo Yu, Jiong Yang, Jiawei Han
NIPS
2001
13 years 8 months ago
Algorithmic Luckiness
Classical statistical learning theory studies the generalisation performance of machine learning algorithms rather indirectly. One of the main detours is that algorithms are studi...
Ralf Herbrich, Robert C. Williamson
CVPR
2006
IEEE
14 years 9 months ago
Unsupervised Learning of Categories from Sets of Partially Matching Image Features
We present a method to automatically learn object categories from unlabeled images. Each image is represented by an unordered set of local features, and all sets are embedded into...
Kristen Grauman, Trevor Darrell
ICGA
2007
157views Optimization» more  ICGA 2007»
13 years 7 months ago
Computing "Elo Ratings" of Move Patterns in the Game of Go
Abstract. Move patterns are an essential method to incorporate domain knowledge into Go-playing programs. This paper presents a new Bayesian technique for supervised learning of su...
Rémi Coulom