Automatic subspace clustering of high dimensional data for data mining applications
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
OPTICS: ordering points to identify the clustering structure
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Information Retrieval
Clustering Algorithms
A Fast Parallel Clustering Algorithm for Large Spatial Databases
Data Mining and Knowledge Discovery
STR: A Simple and Efficient Algorithm for R-Tree Packing
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
Join Strategies on KB-Tree Indexed Relations
Proceedings of the Fifth International Conference on Data Engineering
Efficient and Effective Clustering Methods for Spatial Data Mining
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Fast computation of database operations using graphics processors
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Dynamic Cluster Formation Using Level Set Methods
IEEE Transactions on Pattern Analysis and Machine Intelligence
GPUTeraSort: high performance graphics co-processor sorting for large database management
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Relational joins on graphics processors
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
A Fast Similarity Join Algorithm Using Graphics Processing Units
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
DENCLUE 2.0: fast clustering based on kernel density estimation
IDA'07 Proceedings of the 7th international conference on Intelligent data analysis
Parallel density-based clustering of complex objects
PAKDD'06 Proceedings of the 10th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining
Scalable clustering using graphics processors
WAIM '06 Proceedings of the 7th international conference on Advances in Web-Age Information Management
GPU-WAH: applying GPUs to compressing bitmap indexes with word aligned hybrid
DEXA'10 Proceedings of the 21st international conference on Database and expert systems applications: Part II
Speeding up large-scale geospatial polygon rasterization on GPGPUs
Proceedings of the ACM SIGSPATIAL Second International Workshop on High Performance and Distributed Geographic Information Systems
GPU accelerated genetic clustering
SEAL'12 Proceedings of the 9th international conference on Simulated Evolution and Learning
Mr. Scan: extreme scale density-based clustering using a tree-based network of GPGPU nodes
SC '13 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
GPUMAFIA: efficient subspace clustering with MAFIA on GPUs
Euro-Par'13 Proceedings of the 19th international conference on Parallel Processing
| Hi-index | 0.00 |
During the last few years, GPUs have evolved from simple devices for the display signal preparation into powerful coprocessors that do not only support typical computer graphics tasks but can also be used for general numeric and symbolic computation tasks. As major advantage GPUs provide extremely high parallelism combined with a high bandwidth in memory transfer at low cost. We want to exploit these dvantages in density-based clustering, an important paradigm in clustering since typical algorithms of this category are noise and outlier robust and search for clusters of an arbitrary shape in metric and vector spaces. Moreover, with a time complexity ranging from O(n log n) to O(n2) these algorithms are scalable to large data sets in a database system. In this paper, we propose CUDA-DClust, a massively parallel algorithm for density-based clustering for the use of a Graphics Processing Unit (GPU). While the result of this algorithm is guaranteed to be equivalent to that of DBSCAN, we demonstrate a high speed-up, particularly in combination with a novel index structure for use in GPUs.