Density-based clustering using graphics processors

International Conference on Information and Knowledge Management, Proceedings

Volumn , Issue , 2009, Pages 661-670

  Böhm, Christian ^a   Noll, Robert ^a   Plant, Claudia ^b   Wackersreuther, Bianca ^a  

^a UNIVERSITY OF MUNICH   (Germany)

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

Data mining; Performance

Indexed keywords

ARBITRARY SHAPE; CO-PROCESSORS; DENSITY-BASED CLUSTERING; GRAPHICS PROCESSING UNIT; GRAPHICS PROCESSOR; HIGH BANDWIDTH; INDEX STRUCTURE; LARGE DATASETS; LOW COSTS; SPEED-UPS; SYMBOLIC COMPUTATION; TIME COMPLEXITY;

COMPUTER GRAPHICS; DATABASE SYSTEMS; DISPLAY DEVICES; KNOWLEDGE MANAGEMENT; PARALLEL ALGORITHMS; PROGRAM PROCESSORS; VECTOR SPACES;

CLUSTERING ALGORITHMS;

EID: 74549212607     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1645953.1646038     Document Type: Conference Paper

References (23)

1. NVIDIA CUDA Compute Unified Device Architecture - Programming Guide, 2007.
2. R. Agrawal, J. Gehrke, D. Gunopulos, and P. Raghavan. Automatic Subspace Clustering of High Dimensional Data for Data Mining Applications. In SIGMOD Conference, 1998.
3. M. Ankerst, M. M. Breunig, H.-P. Kriegel, and J. Sander. OPTICS: Ordering Points To Identify the Clustering Structure. In SIGMOD Conference, 1999.
4. D. Arlia and M. Coppola. Experiments in Parallel Clustering with DBSCAN. In Euro-Par, 2001.
5. C. Böhm, R. Noll, C. Plant, and A. Zherdin. Indexsupported Similarity Join on Graphics Processors. In BTW, 2009.
6. S. Brecheisen, H.-P. Kriegel, and M. Pfeifle. Parallel Density-Based Clustering of Complex Objects. In PAKDD, 2006.
7. F. Cao, A. K. H. Tung, and A. Zhou. Scalable Clustering Using Graphics Processors. In WAIM, 2006.
8. M. Ester, H.-P. Kriegel, J. Sander, and X. Xu. A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise. In KDD, 1996.
9. N. K. Govindaraju, J. Gray, R. Kumar, and D. Manocha. GPUTeraSort: High Performance Graphics Co-processor Sorting for Large Database Management. In SIGMOD Conference, 2006.
10. N. K. Govindaraju, B. Lloyd, W. Wang, M. C. Lin, and D. Manocha. Fast Computation of Database Operations using Graphics Processors. In SIGMOD Conference, 2004.
11. J. A. Hartigan. Clustering Algorithms. John Wiley & Sons, 1975.
12. B. He, K. Yang, R. Fang, M. Lu, N. K. Govindaraju, Q. Luo, and P. V. Sander. Relational Joins on Graphics Processors. In SIGMOD, 2008.
13. A. Hinneburg and H.-H. Gabriel. DENCLUE 2.0: Fast Clustering Based on Kernel Density Estimation. In IDA, 2007.
14. A. Hinneburg and D. A. Keim. An Efficient Approach to Clustering in Large Multimedia Databases with Noise. In KDD, 1998.
15. M. Kitsuregawa, L. Harada, and M. Takagi. Join Strategies on KD-Tree Indexed Relations. In ICDE, 1989.
16. S. T. Leutenegger, J. M. Edgington, and M. A. Lopez. STR: A Simple and Efficient Algorithm for R-Tree Packing. In ICDE, 1997.
17. M. D. Lieberman, J. Sankaranarayanan, and H. Samet. A Fast Similarity Join Algorithm Using Graphics Processing Units. In ICDE, 2008.
18. F. Murtagh. A Survey of Recent Advances in Hierarchical Clustering Algorithms. Comput. J., 26(4), 1983.
19. R. T. Ng and J. Han. Efficient and Effective Clustering Methods for Spatial Data Mining. In VLDB, 1994.
20. S. A. A. Shalom, M. Dash, and M. Tue. Efficient K-Means Clustering Using Accelerated Graphics Processors. In DaWaK, 2008.
21. C. Van-Rijsbergen. Information Retrieval. Butterworths, London, England, 2nd edition, 1979.
22. X. Xu, J. Jäger, and H.-P. Kriegel. A Fast Parallel Clustering Algorithm for Large Spatial Databases. Data Min. Knowl. Discov., 3(3), 1999.
23. A. M. Yip, C. H. Q. Ding, and T. F. Chan. Dynamic Cluster Formation Using Level Set Methods. IEEE Trans. Pattern Anal. Mach. Intell., 28(6), 2006.