메뉴 건너뛰기




Volumn 3827 LNCS, Issue , 2005, Pages 226-235

Correlation clustering and consensus clustering

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; CORRELATION METHODS; PROBLEM SOLVING;

EID: 33744956616     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11602613_24     Document Type: Conference Paper
Times cited : (19)

References (14)
  • 1
    • 0001657065 scopus 로고    scopus 로고
    • Some APX-completeness results for cubic graphs
    • P. Alimonti and V. Kann. Some APX-completeness results for cubic graphs. Theoretical Computer Science, 237(1-2):123-134, 2000.
    • (2000) Theoretical Computer Science , vol.237 , Issue.1-2 , pp. 123-134
    • Alimonti, P.1    Kann, V.2
  • 2
    • 0033077325 scopus 로고    scopus 로고
    • Polynomial time approximation schemes for dense instances of NP-hard problems
    • S. Arora, D. Karger, and M. Karpinski. Polynomial time approximation schemes for dense instances of NP-hard problems. Journal of Computer and System Sciences, 58:193-210, 2000.
    • (2000) Journal of Computer and System Sciences , vol.58 , pp. 193-210
    • Arora, S.1    Karger, D.2    Karpinski, M.3
  • 5
    • 3142665421 scopus 로고    scopus 로고
    • Correlation clustering
    • N. Bansal, A. Blum, and S. Chawla. Correlation clustering. In Machine Learning 56(1-3): 89-113 (2004).
    • (2004) Machine Learning , vol.56 , Issue.1-3 , pp. 89-113
    • Bansal, N.1    Blum, A.2    Chawla, S.3
  • 8
    • 0142214933 scopus 로고    scopus 로고
    • Correlation clustering - Minimizing disagreements on arbitrary weighted graphs
    • D. Emanuel and A. Fiat. Correlation clustering - minimizing disagreements on arbitrary weighted graphs. In Proc. 11th European Symp. on Algorithms (ESA), pages 208-220, 2003.
    • (2003) Proc. 11th European Symp. on Algorithms (ESA) , pp. 208-220
    • Emanuel, D.1    Fiat, A.2
  • 11
    • 0024717601 scopus 로고
    • A cutting plane algorithm for a clustering problem
    • M. Grtschel and Y. Wakabayashi. A cutting plane algorithm for a clustering problem. Mathematical Programming, 45:52-96, 1989.
    • (1989) Mathematical Programming , vol.45 , pp. 52-96
    • Grtschel, M.1    Wakabayashi, Y.2
  • 12
    • 0022735230 scopus 로고
    • Hard problems in hierarchical-tree clustering
    • M. Krivanek and J. Moravek. Hard problems in hierarchical-tree clustering. Acta Infomatica, 23:311-323, 1986.
    • (1986) Acta Infomatica , vol.23 , pp. 311-323
    • Krivanek, M.1    Moravek, J.2
  • 13
    • 1842435182 scopus 로고    scopus 로고
    • Correlation clustering: Maximizing agreements via semidefinite programming
    • C. Swamy. Correlation clustering: maximizing agreements via semidefinite programming. In Proc. 15th Symp. on Discrete Algorithms (SODA), pages 526-527, 2004.
    • (2004) Proc. 15th Symp. on Discrete Algorithms (SODA) , pp. 526-527
    • Swamy, C.1
  • 14
    • 0345007607 scopus 로고    scopus 로고
    • The complexity of computing medians of relations
    • Y. Wakabayashi. The complexity of computing medians of relations. Resenhas, 3(3):323-349, 1998.
    • (1998) Resenhas , vol.3 , Issue.3 , pp. 323-349
    • Wakabayashi, Y.1


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