메뉴 건너뛰기




Volumn 5, Issue , 2009, Pages 161-168

Semi-supervised affinity propagation with instance-level constraints

Author keywords

[No Author keywords available]

Indexed keywords

AFFINITY PROPAGATION; AP ALGORITHM; DATA POINTS; INTERACTIVE IMAGE SEGMENTATION; SEMI-SUPERVISED; SEMI-SUPERVISED METHOD; SUPERPIXELS; SUPERVISED CLUSTERING;

EID: 84862270727     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Conference Paper
Times cited : (63)

References (15)
  • 1
    • 12244300524 scopus 로고    scopus 로고
    • A probabilistic framework for semi-supervised clustering
    • ACM
    • Basu, S., Bilenko, M., & Mooney, R. J. (2004). A probabilistic framework for semi-supervised clustering. In Acm sigkdd. ACM.
    • (2004) Acm Sigkdd
    • Basu, S.1    Bilenko, M.2    Mooney, R.J.3
  • 2
    • 33847172327 scopus 로고    scopus 로고
    • Clustering by passing messages between data points
    • Frey, B. J., & Dueck, D. (2007). Clustering by passing messages between data points. Science, 305 (5814), 972 - 976.
    • (2007) Science , vol.305 , Issue.5814 , pp. 972-976
    • Frey, B.J.1    Dueck, D.2
  • 3
    • 67651015658 scopus 로고    scopus 로고
    • A binary variable model for affinity propagation
    • Givoni, I., & Frey, B. J. (2009). A binary variable model for affinity propagation. Neural Computation.
    • (2009) Neural Computation
    • Givoni, I.1    Frey, B.J.2
  • 4
    • 9444294778 scopus 로고    scopus 로고
    • From instance-level constraints to space-level constraints: Making the most of prior knowledge in data clustering
    • Klein, D., Kamvar, S. D., & Manning, C. D. (2002). From instance-level constraints to space-level constraints: Making the most of prior knowledge in data clustering. In ICML.
    • (2002) ICML
    • Klein, D.1    Kamvar, S.D.2    Manning, C.D.3
  • 6
    • 59349092011 scopus 로고    scopus 로고
    • Unspervised and semi-supervised clustering by message passing: Soft constraint affinity propagation
    • Leone, M., Sumedha, & Weigt, M. (2008). Unspervised and semi-supervised clustering by message passing: soft constraint affinity propagation. European Phys.J. B.
    • (2008) European Phys.J. B
    • Leone, M.S.1    Weigt, M.2
  • 7
    • 33745875647 scopus 로고    scopus 로고
    • Guiding model search using segmentation
    • Mori, G. (2005). Guiding model search using segmentation. In ICCV.
    • (2005) ICCV
    • Mori, G.1
  • 8
    • 84950632109 scopus 로고
    • Objective criteria for the evaluation of clustering methods
    • Rand, W. M. (1971). Objective criteria for the evaluation of clustering methods. J. American Stat. Assoc., 6 (336), 846-850.
    • (1971) J. American Stat. Assoc. , vol.6 , Issue.336 , pp. 846-850
    • Rand, W.M.1
  • 9
    • 12844262766 scopus 로고    scopus 로고
    • GrabCut": Interactive foreground extraction using iterated graph cuts
    • Rother, C., Kolmogorov, V., & Blake, A. (2004). \GrabCut": interactive foreground extraction using iterated graph cuts. ACM Trans. Graph., 23 (3), 309-314.
    • (2004) ACM Trans. Graph. , vol.23 , Issue.3 , pp. 309-314
    • Rother, C.1    Kolmogorov, V.2    Blake, A.3
  • 10
    • 14344263356 scopus 로고    scopus 로고
    • Computing gaussian mixture models with EM using equivalence constraints
    • Shental, N., Bar-hillel, A., Hertz, T., & Weinshall, D. (2003). Computing gaussian mixture models with EM using equivalence constraints. In NIPS.
    • (2003) NIPS
    • Shental, N.1    Bar-Hillel, A.2    Hertz, T.3    Weinshall, D.4
  • 11
    • 80053229205 scopus 로고    scopus 로고
    • Flexible priors for exemplar-based clustering
    • Tarlow, D., Zemel, R., & Frey, B. J. (2008). Flexible priors for exemplar-based clustering. In UAI.
    • (2008) UAI.
    • Tarlow, D.1    Zemel, R.2    Frey, J.B.3
  • 12
    • 0001898293 scopus 로고    scopus 로고
    • Clustering with instance-level constraints
    • Wagstaff, K., & Cardie, C. (2000). Clustering with instance-level constraints. In ICML.
    • (2000) ICML
    • Wagstaff, K.1    Cardie, C.2
  • 13
    • 0042377235 scopus 로고    scopus 로고
    • Constrained k-means clustering with background knowledge
    • Wagstaff, K., Cardie, C., Rogers, S., & Schroedl, S. (2001). Constrained k-means clustering with background knowledge. In ICML.
    • (2001) ICML
    • Wagstaff, K.1    Cardie, C.2    Rogers, S.3    Schroedl, S.4
  • 14
    • 50649123946 scopus 로고    scopus 로고
    • Joint affinity propagation for multiple view segmentation
    • Xiao, J., Wang, J., Tan, P., & Quan, L. (2007). Joint affinity propagation for multiple view segmentation. In ICCV.
    • (2007) ICCV
    • Xiao, J.1    Wang, J.2    Tan, P.3    Quan, L.4
  • 15
    • 84879571292 scopus 로고    scopus 로고
    • Distance metric learning, with application to clustering with side-information
    • Xing, E. P., Ng, A. Y., Jordan, M. I., & Russell, S. (2003). Distance metric learning, with application to clustering with side-information. In NIPS.
    • (2003) NIPS
    • Xing, E.P.1    Ng, A.Y.2    Jordan, M.I.3    Russell, S.4


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