Dan Pelleg
Andrew Moore
- 1.J. L. Bentley. Multidimensional Divide and Conquer. Communications of the A CM, 23(4):214--229, 1980. Google Scholar
Digital Library
- 2.C. M. Bishop. Neural Networks for Pattern Recognition. Clarendon Press, Oxford, 1995. Google ScholarDigital Library
- 3.K. Deng and A. W. Moore. Multiresolution instancebased learning. In The Proceedings of IJCAI-95, pages 1233-1242. Morgan Kaufmann, 1995. Google ScholarDigital Library
- 4.R. O. Duda and P. E. Hart. Pattern Classification and Scene Analysis. John Wiley & Sons, 1973.Google Scholar
- 5.M. Ester, H.-P. Kriegel, and Xiaowei Xu. A database interface for clustering in large spatial databases. In Proceedings of First International Conference on Knowledge Discovery and Data Mining. AAAI; Menlo Park, CA, USA, 1995.Google Scholar
- 6.A. Gersho and R. Gray. Vector quantization and signal compression. Kluwer Academic Publishers; Dordrecht, Netherlands, 1992. Google ScholarDigital Library
- 7.Andrew W. Moore. Efficient Memory-based Learning .for Robot Control. PhD thesis, University of Cambridge, 1991. Technical Report 209, Computer Laboratory, University of Cambridge.Google Scholar
- 8.Andrew W. Moore. Very fast EM-based mixture model clustering using multiresolution kd-trees. In Neural Information Processing Systems Conference, 1998. Google ScholarDigital Library
- 9.Andrew W. Moore and Mary Soon Lee. Cached sutcient statistics for efficient machine learning with large datasets. Journal of Artificial Intelligence Research, 8:67-91, 1998. Google ScholarDigital Library
- 10.Raymond T. Ng and Jiawei Han. Efficient and effective clustering methods for spatial data mining,. In Proc. of VLDB,, 1994. Google ScholarDigital Library
- 11.D. Pelleg and A. Moore. Accelerating exact k-means with geometric reasoning. Technical report, Carnegie Mellon University, June 1999. also available from www.cs.cmu.edu/-odpelleg/.Google Scholar
- 12.Tian Zhang, Raghu Ramakrishnan, and Miron Livny. Birch: An efficient data clustering method for very large databases,. In to appear on Proc. of A CM SIGMOD Conf., pages 103-114, 1995. Google ScholarDigital Library
Index Terms
- Accelerating exact k-means algorithms with geometric reasoning
Recommendations
Accelerating K-Means on the Graphics Processor via CUDA
INTENSIVE '09: Proceedings of the 2009 First International Conference on Intensive Applications and ServicesIn this paper an optimized k-means implementation on the graphics processing unit (GPU) is presented. NVIDIA’s Compute Unified Device Architecture (CUDA), available from the G80 GPU family onwards, is used as the programming environment. Emphasis is ...
Accelerating CUDA graph algorithms at maximum warp
PPoPP '11Graphs are powerful data representations favored in many computational domains. Modern GPUs have recently shown promising results in accelerating computationally challenging graph problems but their performance suffered heavily when the graph structure ...
Comments