메뉴 건너뛰기




Volumn 26, Issue 10, 2005, Pages 1412-1422

Maximum within-cluster association

Author keywords

Clustering; Information theoretic learning; Minimum entropy; Spectral clustering

Indexed keywords

COMPUTATIONAL COMPLEXITY; EIGENVALUES AND EIGENFUNCTIONS; ENTROPY; ESTIMATION; INFORMATION ANALYSIS; MATRIX ALGEBRA; OPTIMIZATION; PROBABILITY DENSITY FUNCTION; VECTORS;

EID: 19744367328     PISSN: 01678655     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.patrec.2004.11.025     Document Type: Article
Times cited : (2)

References (12)
  • 4
    • 10944243750 scopus 로고    scopus 로고
    • Minimum entropy, k-means, spectral clustering
    • Budapest, Hungary
    • Lee, Y., Choi, S., 2004. Minimum entropy, k-means, spectral clustering. In: Proc. Int. Joint Conf. Neural Networks, Budapest, Hungary, pp. 117-122.
    • (2004) Proc. Int. Joint Conf. Neural Networks , pp. 117-122
    • Lee, Y.1    Choi, S.2
  • 7
    • 0035422134 scopus 로고    scopus 로고
    • Minimum entropy data partitioning using reversible jump Markov chain Monte Carlo
    • S.J. Roberts, C. Holmes, and D. Denison Minimum entropy data partitioning using reversible jump Markov chain Monte Carlo IEEE Trans. Pattern Anal. Machine Intell. 23 8 2001 909 914
    • (2001) IEEE Trans. Pattern Anal. Machine Intell. , vol.23 , Issue.8 , pp. 909-914
    • Roberts, S.J.1    Holmes, C.2    Denison, D.3


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