25041 search results - page 347 / 5009 » Algorithms for Clustering Data |
209
click to vote
PODS
2003
ACM
16 years 7 months ago
2003
ACM
The sliding window model is useful for discounting stale data in data stream applications. In this model, data elements arrive continually and only the most recent N elements are ...
185
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
The main motivation for using a multi–objective evolutionary algorithm for finding biclusters in gene expression data is motivated by the fact that when looking for biclusters ...
198
click to vote
ESA
2003
Springer
16 years 8 days ago
2003
Springer
A promising approach to graph clustering is based on the intuitive notion of intra-cluster density vs. inter-cluster sparsity. While both formalizations and algorithms focusing on ...
183
click to vote
ICTAI
2008
IEEE
16 years 1 months ago
2008
IEEE
We consider a variation of the problem of combining expert opinions for the situation in which there is no ground truth to use for training. Even though we don’t have labeled da...
183
click to vote
MIDDLEWARE
2007
Springer
16 years 1 months ago
2007
Springer
Distributed computations, dealing with large amounts of data, are scheduled in Grid clusters today using either a task-centric mechanism, or a worker-centric mechanism. Because of ...