Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

ICPP

2000

IEEE

2000

IEEE

Clustering is a data mining problem which ﬁnds dense regions in a sparse multi-dimensional data set. The attribute values and ranges of these regions characterize the clusters. Clustering algorithms need to scale with the data base size and also with the large dimensionality of the data set. Further, these algorithms need to explore the embedded clusters in a subspace of a high dimensional space. However, the time complexity of the algorithm to explore clusters in subspaces is exponential in the dimensionality of the data and is thus extremely compute intensive. Thus, parallelization is the choice for discovering clusters for large data sets. In this paper we present a scalable parallel subspace clustering algorithm which has both data and task parallelism embedded in it. We also formulate the technique of adaptive grids and present a truly un-supervised clustering algorithm requiring no user inputs. Our implementation shows near linear speedups with negligible communication overhea...

Related Content

Added |
31 Jul 2010 |

Updated |
31 Jul 2010 |

Type |
Conference |

Year |
2000 |

Where |
ICPP |

Authors |
Harsha S. Nagesh, Sanjay Goil, Alok N. Choudhary |

Comments (0)