125 search results - page 4 / 25 » A Fast Parallel Clustering Algorithm for Large Spatial Datab... |
SIGMOD
2008
ACM
14 years 7 months ago
2008
ACM
The problem of simultaneously clustering columns and rows (coclustering) arises in important applications, such as text data mining, microarray analysis, and recommendation system...
IDEAS
2006
IEEE
14 years 1 months ago
2006
IEEE
We present a parallel version of BIRCH with the objective of enhancing the scalability without compromising on the quality of clustering. The incoming data is distributed in a cyc...
SIGMOD
2004
ACM
14 years 1 months ago
2004
ACM
Clustering is one of the most important analysis tasks in spatial databases. We study the problem of clustering objects, which lie on edges of a large weighted spatial network. Th...
WEBI
2001
Springer
14 years 18 hour ago
2001
Springer
Abstract. Thanks to the recent explosive progress of WWW (WorldWide Web), we can easily access a large number of images from WWW. There are, however, no established methods to make...
IPPS
2006
IEEE
14 years 1 months ago
2006
IEEE
Sampling is a widely used technique to increase efficiency in database and data mining applications operating on large dataset. In this paper we present a scalable sampling imple...