1403 search results - page 55 / 281 » Set cover algorithms for very large datasets |
CORR
2011
Springer
14 years 4 months ago
2011
Springer
In this paper we present clustering method is very sensitive to the initial center values ,requirements on the data set too high, and cannot handle noisy data the proposal method ...
ICDM
2005
IEEE
15 years 3 months ago
2005
IEEE
Frequent itemset mining is a core data mining operation and has been extensively studied over the last decade. This paper takes a new approach for this problem and makes two major...
NIPS
2008
14 years 11 months ago
2008
Neuroimaging datasets often have a very large number of voxels and a very small number of training cases, which means that overfitting of models for this data can become a very se...
WWW
2006
ACM
15 years 10 months ago
2006
ACM
Web spam is behavior that attempts to deceive search engine ranking algorithms. TrustRank is a recent algorithm that can combat web spam. However, TrustRank is vulnerable in the s...
PVLDB
2008
14 years 9 months ago
2008
Online communities like Flickr, del.icio.us and YouTube have established themselves as very popular and powerful services for publishing and searching contents, but also for ident...