메뉴 건너뛰기




Volumn 24, Issue 8, 2013, Pages 1602-1612

K-means for parallel architectures using all-prefix-sum sorting and updating steps

Author keywords

biology and genetics; Clustering algorithms; graphics processors; parallel algorithms

Indexed keywords

BIOLOGY AND GENETICS; DATA PREPROCESSING; GRAPHICS PROCESSOR; K-MEANS CLUSTERING; NUMERICAL SOFTWARE; PARALLEL SORTING; PERFORMANCE IMPROVEMENTS; THREE ORDERS OF MAGNITUDE;

EID: 84880048054     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPDS.2012.234     Document Type: Article
Times cited : (27)

References (17)
  • 6
    • 52949125648 scopus 로고    scopus 로고
    • Efficient K-means clustering using accelerated graphics processors
    • I. Song, J. Eder, and T. Nguyen, eds. doi: 10.1007/978-3- 540-85836-2-16
    • S.A.A. Shalom, M. Dash, and M. Tue, "Efficient K-Means Clustering Using Accelerated Graphics Processors," Proc. 10th Int'l Conf. Data Warehousing and Knowledge Discovery I. Song, J. Eder, and T. Nguyen, eds., pp. 166-175, 2008, doi: 10.1007/978-3- 540-85836-2-16.
    • (2008) Proc. 10th Int'l Conf. Data Warehousing and Knowledge Discovery , pp. 166-175
    • Shalom, S.A.A.1    Dash, M.2    Tue, M.3
  • 7
    • 0030157145 scopus 로고    scopus 로고
    • BIRCH: An efficient data clustering method for very large databases
    • doi: 10.1145/235968.233324
    • T. Zhang, R. Ramakrishnan, and M. Livny, "BIRCH: An Efficient Data Clustering Method for Very Large Databases," Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 103-114, 1996, doi: 10.1145/235968.233324.
    • (1996) Proc. ACM SIGMOD Int'l Conf. Management of Data , pp. 103-114
    • Zhang, T.1    Ramakrishnan, R.2    Livny, M.3
  • 8
    • 0036709106 scopus 로고    scopus 로고
    • CLARANS: A method for clustering objects for spatial data mining
    • Sept./Oct.
    • R.T. Ng and J. Han, "CLARANS: A Method for Clustering Objects for Spatial Data Mining," IEEE Trans. Knowledge Data Eng., vol. 14, no. 5, pp. 1003-1016, Sept./Oct. 2002.
    • (2002) IEEE Trans. Knowledge Data Eng. , vol.14 , Issue.5 , pp. 1003-1016
    • Ng, R.T.1    Han, J.2
  • 10
    • 78649334862 scopus 로고    scopus 로고
    • Independent component analysis: Mining microarray data for fundamental human gene expression modules
    • doi: 10.1016/j.jbi.2010.07.001
    • J.M. Engreitz, B.J. Daigle Jr., J.J. Marshall, and R.B. Altman, "Independent Component Analysis: Mining Microarray Data for Fundamental Human Gene Expression Modules," J. Biomedical Informatics, vol. 43, pp. 923-944, 2010, doi: 10.1016/j.jbi.2010.07.001.
    • J. Biomedical Informatics , vol.43 , Issue.2010 , pp. 923-944
    • Engreitz, J.M.1    Daigle Jr., B.J.2    Marshall, J.J.3    Altman, R.B.4
  • 11
    • 54049101457 scopus 로고    scopus 로고
    • Optimizing parallel reduction in CUDA
    • M. Harris, "Optimizing Parallel Reduction in CUDA" Nvidia CUDA SDK Whitepaper, http://developer.download.nvidia.com/compute/cuda/1-1/Website/ projects/reduction/doc/reduction.pdf, 2007.
    • (2007) Nvidia CUDA SDK Whitepaper
    • Harris, M.1
  • 12
    • 0022882379 scopus 로고
    • Data parallel algorithms
    • Dec. doi:10.1145/7902.7903
    • W.D. Hillis and G.L. Steele Jr., "Data Parallel Algorithms," Comm. ACM, vol. 29, no. 12, pp. 1170-1183, Dec. 1986, doi:10.1145/7902.7903.
    • (1986) Comm. ACM , vol.29 , Issue.12 , pp. 1170-1183
    • Hillis, W.D.1    Steele Jr., G.L.2
  • 13
    • 36049035884 scopus 로고    scopus 로고
    • Parallel prefix sum (Scan) with CUDA
    • H. Nguyen, ed. Pearson Education
    • M. Harris, S. Sengupta, and J.D. Owens, "Parallel Prefix Sum (Scan) with CUDA," GPU Gems 3, H. Nguyen, ed., Pearson Education, 2007.
    • (2007) GPU Gems 3
    • Harris, M.1    Sengupta, S.2    Owens, J.D.3
  • 14
    • 0042622410 scopus 로고    scopus 로고
    • WebFEATURE: An interactive web tool for identifying and visualizing functional sites on macromolecular structures
    • M.P. Liang, D.R. Banatao, T.E. Klein, D.L. Brutlag, and R.B. Altman, "WebFEATURE: An Interactive Web Tool for Identifying and Visualizing Functional Sites on Macromolecular Structures," Nucleic Acids Research, vol. 31, no. 13, pp. 3324-3327, 2003.
    • (2003) Nucleic Acids Research , vol.31 , Issue.13 , pp. 3324-3327
    • Liang, M.P.1    Banatao, D.R.2    Klein, T.E.3    Brutlag, D.L.4    Altman, R.B.5
  • 15
    • 0020102027 scopus 로고
    • Least squares quantization in PCM
    • Mar.
    • S.P. Lloyd, "Least Squares Quantization in PCM," IEEE Trans. Information Theory, vol. IT-28, no. 2, pp. 128-137, Mar. 1982.
    • (1982) IEEE Trans. Information Theory , vol.IT-28 , Issue.2 , pp. 128-137
    • Lloyd, S.P.1
  • 17
    • 79961194949 scopus 로고    scopus 로고
    • CAMPAIGN: An open-source library of GPU-accelerated data clustering algorithms
    • doi:10.1093/bioinformatics/btr386, 2011
    • K.J. Kohlhoff, M.H. Sosnick, W.T. Hsu, V.S. Pande, and R.B. Altman, "CAMPAIGN: an Open-Source Library of GPU-Accelerated Data Clustering Algorithms," Bioinformatics, vol. 27, no. 16, pp. 2322-2323, doi:10.1093/bioinformatics/btr386, 2011.
    • Bioinformatics , vol.27 , Issue.16 , pp. 2322-2323
    • Kohlhoff, K.J.1    Sosnick, M.H.2    Hsu, W.T.3    Pande, V.S.4    Altman, R.B.5


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.