Abstract | ||
---|---|---|
Determining the number of clusters in a data set is a critical issue in cluster analysis. The Visual Assessment of (cluster) Tendency (VAT) algorithm is an effective tool for investigating cluster tendency, which produces an intuitive image of matrix as the representation of complex data sets. However, VAT can be computationally expensive for large data sets due to its O(N2) time complexity. In this paper, we propose an efficient parallel scheme to accelerate the original VAT using NVIDIA GPU and CUDA architecture. We show that, on a range of data sets, the GPU-based VAT features good scalability and can achieve significant speedups compared to the original algorithm. © 2017, Springer International Publishing AG. |
Year | DOI | Venue |
---|---|---|
2017 | 10.1007/978-3-319-57529-2_34 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
Keywords | Field | DocType |
Cluster analysis,Cluster tendency,GPU,VAT | Data mining,Cluster (physics),Data set,Computer science,Matrix (mathematics),CUDA,Complex data type,Computational science,Artificial intelligence,Time complexity,Computer vision,Visual assessment,Scalability | Conference |
Volume | ISSN | ISBN |
10235 LNAI | 03029743 | 9783319575285 |
Citations | PageRank | References |
1 | 0.36 | 14 |
Authors | ||
2 |