12194 search results - page 368 / 2439 » Numberings Optimal for Learning |
173
click to vote
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
We propose new Continuous Hidden Markov Model (CHMM) structure that integrates feature weighting component. We assume that each feature vector could include different subsets of f...
160
click to vote
ICMCS
2007
IEEE
16 years 1 months ago
2007
IEEE
A common trait of background subtraction algorithms is that they have learning rates, thresholds, and initial values that are hand-tuned for a scenario in order to produce the des...
162
click to vote
ISNN
2007
Springer
16 years 27 days ago
2007
Springer
Abstract. Compared to normal learning algorithms, for example backpropagation, the optimal bounded ellipsoid (OBE) algorithm has some better properties, such as faster convergence,...
224
click to vote
ICDM
2005
IEEE
16 years 10 days ago
2005
IEEE
In this paper we address the problem of learning the Markov blanket of a quantity from data in an efficient manner. Markov blanket discovery can be used in the feature selection ...
196
click to vote
NIPS
2008
15 years 8 months ago
2008
Recently, supervised dimensionality reduction has been gaining attention, owing to the realization that data labels are often available and indicate important underlying structure...