1310 search results - page 143 / 262 » Learning the k in k-means |
158
click to vote
TIP
2008
15 years 6 months ago
2008
Abstract--Local learning methods, such as local linear regression and nearest neighbor classifiers, base estimates on nearby training samples, neighbors. Usually, the number of nei...
184
click to vote
COLT
2010
Springer
15 years 4 months ago
2010
Springer
We analyze the regret, measured in terms of log loss, of the maximum likelihood (ML) sequential prediction strategy. This "follow the leader" strategy also defines one o...
223
click to vote
COMBINATORICA
2010
15 years 1 months ago
2010
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...
168
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
In this paper, we describe a novel speaker adaptation algorithm based on Gaussian mixture weight adaptation. A small number of latent speaker vectors are estimated with non-negati...
162
click to vote
WWW
2005
ACM
16 years 7 months ago
2005
ACM
Whereas schools typically record mounds of data regarding student performance, attendance, and other behaviors over the course of a school year, rarely is that data consulted and ...