1403 search results - page 8 / 281 » Set cover algorithms for very large datasets |
SEMWEB
2010
Springer
13 years 6 months ago
2010
Springer
As knowledge bases move into the landscape of larger ontologies and have terabytes of related data, we must work on optimizing the performance of our tools. We are easily tempted t...
ICML
2005
IEEE
14 years 9 months ago
2005
IEEE
In this paper, we extend the recently proposed Core Vector Machine algorithm to the regression setting by generalizing the underlying minimum enclosing ball problem. The resultant...
CSC
2008
13 years 9 months ago
2008
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
ICDE
2000
IEEE
14 years 9 months ago
2000
IEEE
In this paper, we introduce dynamic histograms, which are constructed and maintained incrementally. We develop several dynamic histogram construction algorithms and show that they...
ICDM
2006
IEEE
2006
IEEE
Hierarchical Density Shaving: A clustering and visualization framework for large biological datasets
14 years 2 months ago
In many clustering applications for bioinformatics, only part of the data clusters into one or more groups while the rest needs to be pruned. For such situations, we present Hiera...