1310 search results - page 47 / 262 » Learning the k in k-means |
ICIP
2001
IEEE
15 years 11 months ago
2001
IEEE
Although widely studied for many years, colour quantisation remains a practical problem in image processing. Unlike previous works where the image can only be quantised after the ...
126
click to vote
STOC
2000
ACM
15 years 2 months ago
2000
ACM
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...
STACS
1999
Springer
15 years 2 months ago
1999
Springer
Leo Harrington surprisingly constructed a machine which can learn any computable function f according to the following criterion (called Bc∗ -identification). His machine, on t...
106
click to vote
IPL
2008
14 years 9 months ago
2008
Bayesian Network structures with a maximum in-degree of k can be approximated with respect to a positive scoring metric up to an factor of 1/k. Key words: approximation algorithm,...
KDD
1998
ACM
15 years 2 months ago
1998
ACM
Verylarge databases with skewedclass distributions and non-unlformcost per error are not uncommonin real-world data mining tasks. Wedevised a multi-classifier meta-learningapproac...