1310 search results - page 4 / 262 » Learning the k in k-means |
ICML
2007
IEEE
14 years 7 months ago
2007
IEEE
Although each iteration of the popular kMeans clustering heuristic scales well to larger problem sizes, it often requires an unacceptably-high number of iterations to converge to ...
GFKL
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. We consider the problem of finding communities in large linked networks such as web structures or citation networks. We review similarity measures for linked objects and...
COLT
2005
Springer
13 years 11 months ago
2005
Springer
We consider the problem of learning mixtures of distributions via spectral methods and derive a tight characterization of when such methods are useful. Specifically, given a mixt...
KAIS
2008
13 years 6 months ago
2008
This paper presents the top 10 data mining algorithms identified by the IEEE International Conference on Data Mining (ICDM) in December 2006: C4.5, k-Means, SVM, Apriori, EM, Page...
CTRSA
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. We consider a statistical database in which a trusted administrator introduces noise to the query responses with the goal of maintaining privacy of individual database en...