Sciweavers

2898 search results - page 384 / 580
» Ensemble Methods in Machine Learning
Sort
View
ICML
2010
IEEE
15 years 5 months ago
Feature Selection Using Regularization in Approximate Linear Programs for Markov Decision Processes
Approximate dynamic programming has been used successfully in a large variety of domains, but it relies on a small set of provided approximation features to calculate solutions re...
Marek Petrik, Gavin Taylor, Ronald Parr, Shlomo Zi...
CORR
2010
Springer
155views Education» more  CORR 2010»
15 years 4 months ago
Repairing People Trajectories Based on Point Clustering
This paper presents a method for improving any object tracking algorithm based on machine learning. During the training phase, important trajectory features are extracted which are...
Duc Phu Chau, François Brémond, Etie...
ML
2006
ACM
15 years 4 months ago
XRules: An effective algorithm for structural classification of XML data
Abstract XML documents have recently become ubiquitous because of their varied applicability in a number of applications. Classification is an important problem in the data mining ...
Mohammed Javeed Zaki, Charu C. Aggarwal
JMLR
2002
115views more  JMLR 2002»
15 years 3 months ago
PAC-Bayesian Generalisation Error Bounds for Gaussian Process Classification
Approximate Bayesian Gaussian process (GP) classification techniques are powerful nonparametric learning methods, similar in appearance and performance to support vector machines....
Matthias Seeger
CVPR
2010
IEEE
16 years 21 days ago
Unified Graph Matching in Euclidean Spaces
Graph matching is a classical problem in pattern recognition with many applications, particularly when the graphs are embedded in Euclidean spaces, as is often the case for comput...
Julian McAuley, Teofilo de Campos, Tiberio Caetano