1310 search results - page 128 / 262 » Learning the k in k-means |
154
click to vote
CHI
2008
ACM
16 years 6 months ago
2008
ACM
Arizona State University's Arts, Media, and Engineering Program is currently addressing the need to assess the growth of group creativity in trans-disciplinary collaboration....
178
click to vote
ICPR
2008
IEEE
16 years 24 days ago
2008
IEEE
In this paper, we report our work on spam filtering with three novel bayesian classification methods: Aggregating One-Dependence Estimators (AODE), Hidden Naïve Bayes (HNB), Loca...
158
click to vote
ASSETS
2006
ACM
16 years 10 days ago
2006
ACM
As ASSETS attendees, we are clearly interested in promoting accessibility in computing. One way to do this is to teach courses on the topic. Most such courses are aimed at upper-l...
151
click to vote
HT
2003
ACM
15 years 11 months ago
2003
ACM
The Ambient Wood project aims to facilitate a learning experience using an adaptive infrastructure in an outdoor environment. This involves sensor technology, virtual world orches...
170
click to vote
SODA
2008
ACM
15 years 7 months ago
2008
ACM
The problem of maximizing a concave function f(x) in a simplex S can be solved approximately by a simple greedy algorithm. For given k, the algorithm can find a point x(k) on a k-...