953 search results - page 27 / 191 » Using Clustering and Blade Clusters in the Terabyte Task |
PAMI
2007
13 years 8 months ago
2007
—A variety of clustering algorithms have recently been proposed to handle data that is not linearly separable; spectral clustering and kernel k-means are two of the main methods....
IV
2005
IEEE
14 years 2 months ago
2005
IEEE
Visualising large graphs faces the challenges of both data complexity and visual complexity. This paper presents a framework for visualising large graphs that reduces data complex...
ICDE
2009
IEEE
14 years 10 months ago
2009
IEEE
In this paper, we will examine the problem of clustering massive domain data streams. Massive-domain data streams are those in which the number of possible domain values for each a...
CIKM
2008
Springer
13 years 10 months ago
2008
Springer
Managing large-scale software projects involves a number of activities such as viewpoint extraction, feature detection, and requirements management, all of which require a human a...
CIKM
2000
Springer
14 years 25 days ago
2000
Springer
We examine applications of clustering to the filtering task. We use the on-line version of the star algorithm [JPR98, JPR99] as the clustering tool because this algorithm compute...