메뉴 건너뛰기




Volumn 3, Issue 2, 2011, Pages 29-33

Ckmeans.1d.dp: Optimal k-means clustering in one dimension by dynamic programming

Author keywords

[No Author keywords available]

Indexed keywords


EID: 84873638356     PISSN: None     EISSN: 20734859     Source Type: Journal    
DOI: 10.32614/rj-2011-015     Document Type: Article
Times cited : (347)

References (13)
  • 1
    • 62249143532 scopus 로고    scopus 로고
    • NPhardness of Euclidean sum-of-squares clustering
    • D. Aloise, A. Deshpande, P. Hansen, and P. Popat. NPhardness of Euclidean sum-of-squares clustering. Mach. Learn., 75(2):245-248, 2009.
    • (2009) Mach. Learn. , vol.75 , Issue.2 , pp. 245-248
    • Aloise, D.1    Deshpande, A.2    Hansen, P.3    Popat, P.4
  • 2
    • 67650122797 scopus 로고    scopus 로고
    • Random projection trees for vector quantization
    • S. Dasgupta and Y. Freund. Random projection trees for vector quantization. IEEE T. Inform. Theory, 55 (7):3229-3242, 2009.
    • (2009) IEEE T. Inform. Theory , vol.55 , Issue.7 , pp. 3229-3242
    • Dasgupta, S.1    Freund, Y.2
  • 3
    • 0001138328 scopus 로고
    • Algorithm AS 136: A k-means clustering algorithm
    • J. A. Hartigan, and M. A. Wong. Algorithm AS 136: A k-means clustering algorithm. J. Roy. Stat. Soc. C-App., 28(1):100-108, 1979.
    • (1979) J. Roy. Stat. Soc. C-App. , vol.28 , Issue.1 , pp. 100-108
    • Hartigan, J.A.1    Wong, M.A.2
  • 4
    • 0014489272 scopus 로고
    • Metabolic stability, and epigenesis in randomly constructed genetic nets
    • S. A. Kauffman. Metabolic stability, and epigenesis in randomly constructed genetic nets. J. Theoretical Biology, 22(3):437-467, 1969.
    • (1969) J. Theoretical Biology , vol.22 , Issue.3 , pp. 437-467
    • Kauffman, S.A.1
  • 7
    • 0020102027 scopus 로고
    • Least squares quantization in PCM
    • S. P. Lloyd. Least squares quantization in PCM. IEEE T. Inform. Theory, 28:129 -137, 1982.
    • (1982) IEEE T. Inform. Theory , vol.28
    • Lloyd, S.P.1
  • 11
    • 84883228557 scopus 로고    scopus 로고
    • Ckmeans.1d.dp: Optimal distance-based clustering for one-dimensional data version 2.2.
    • M. Song, and H. Wang. Ckmeans.1d.dp: Optimal distance-based clustering for one-dimensional data, 2011. URL http://CRAN.R-project.org/package=Ckmeans.1d.dp. R package version 2.2.
    • (2011)
    • Song, M.1    Wang, H.2
  • 13
    • 77951444053 scopus 로고    scopus 로고
    • Efficient, and exact maximum likelihood quantisation of genomic features using dynamic programming
    • M. Song, R. M. Haralick,, and S. Boissinot. Efficient, and exact maximum likelihood quantisation of genomic features using dynamic programming. Int. J. Data Min. Bioinform., 4(2):123-141, 2010.
    • (2010) Int. J. Data Min. Bioinform. , vol.4 , Issue.2 , pp. 123-141
    • Song, M.1    Haralick, R.M.2    Boissinot, S.3


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