1403 search results - page 120 / 281 » Set cover algorithms for very large datasets |
131
click to vote
PAKDD
2007
ACM
15 years 10 months ago
2007
ACM
Abstract. Noise significantly affects cluster quality. Conventional clustering methods hardly detect clusters in a data set containing a large amount of noise. Projected clusterin...
149
Voted
EDBT
2004
ACM
16 years 4 months ago
2004
ACM
XML suffers from the major limitation of high redundancy. Even if compression can be beneficial for XML data, however, once compressed, the data can be seldom browsed and queried i...
158
click to vote
GECCO
2003
Springer
15 years 9 months ago
2003
Springer
Evolutionary Testing (ET) has been shown to be very successful for testing real world applications [10]. The original ET approach focusesonsearching for a high coverage of the test...
128
click to vote
ICML
2008
IEEE
16 years 5 months ago
2008
IEEE
Sampling is a popular way of scaling up machine learning algorithms to large datasets. The question often is how many samples are needed. Adaptive stopping algorithms monitor the ...
129
click to vote
ISBRA
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. DNA microarrays can monitor the expression levels of thousands of genes simultaneously, providing the opportunity for the identification of genes that are differentiall...