메뉴 건너뛰기




Volumn , Issue , 2010, Pages 1043-1048

Efficient semi-supervised spectral co-clustering with constraints

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC COMPLEXITY; CLICKTHROUGH DATA; CLUSTER STRUCTURE; CO-CLUSTERING; CO-CLUSTERS; EIGENVECTORS; FEATURE CORRELATION; INTERNAL STRUCTURE; MATRIX DECOMPOSITION; NORMALIZED MUTUAL INFORMATION; PATTERN DATUM; PRIOR INFORMATION; PRIOR KNOWLEDGE; SEMI-SUPERVISED; SOCIAL NETWORK SYSTEMS; TRACE MINIMIZATION; USER CLUSTERS;

EID: 79951739034     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2010.64     Document Type: Conference Paper
Times cited : (32)

References (7)
  • 1
    • 0035789644 scopus 로고    scopus 로고
    • Co-clustering documents and words using bipartite spectral graph partitioning
    • Dhillon, I. S.: Co-clustering documents and words using bipartite spectral graph partitioning. KDD'01. (2001)
    • (2001) KDD'01
    • Dhillon, I.S.1
  • 4
    • 79951763110 scopus 로고    scopus 로고
    • Towards constrained co-clustering in ordered 0/1 data sets
    • Pensa, R. G., Robardet C., and Boulicaut, J.: Towards constrained co-clustering in ordered 0/1 data sets. ISMIS'06. (2006)
    • (2006) ISMIS'06
    • Pensa, R.G.1    Robardet, C.2    Boulicaut, J.3
  • 7
    • 78149333073 scopus 로고    scopus 로고
    • Gspan: Graph-based substructure pattern mining
    • Yan, X. and Han, J.: Gspan: Graph-based substructure pattern mining. ICDM'02. (2002)
    • (2002) ICDM'02
    • Yan, X.1    Han, J.2


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