8381 search results - page 1201 / 1677 » The security of machine learning |
200
click to vote
ML
2002
ACM
15 years 6 months ago
2002
ACM
An issue that is critical for the application of Markov decision processes MDPs to realistic problems is how the complexity of planning scales with the size of the MDP. In stochas...
194
Voted
ML
2002
ACM
15 years 6 months ago
2002
ACM
We consider the existence of a linear weak learner for boosting algorithms. A weak learner for binary classification problems is required to achieve a weighted empirical error on t...
208
click to vote
ML
1998
ACM
15 years 6 months ago
1998
ACM
We introduce, analyze and demonstrate a recursive hierarchical generalization of the widely used hidden Markov models, which we name Hierarchical Hidden Markov Models (HHMM). Our m...
208
click to vote
TIT
2002
15 years 6 months ago
2002
Generalization bounds depending on the margin of a classifier are a relatively recent development. They provide an explanation of the performance of state-of-the-art learning syste...
168
click to vote
ML
2007
ACM
15 years 6 months ago
2007
ACM
The problem of disjoint sets, also known as union-find, consists in maintaining a partition of a finite set within a data structure. This structure provides two operations: a fu...