메뉴 건너뛰기




Volumn 1, Issue , 2012, Pages 19-27

Finding exemplars from pairwise dissimilarities via simultaneous sparse recovery

Author keywords

[No Author keywords available]

Indexed keywords

METRIC-BASED METHODS; MULTIPLE CLUSTERS; OPTIMIZATION PROGRAMS; REAL-WORLD IMAGE; REGULARIZATION PARAMETERS; REGULARIZED TRACES; SPARSE RECOVERY; TRIANGLE INEQUALITY;

EID: 84877733739     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (82)

References (22)
  • 3
    • 0003216822 scopus 로고    scopus 로고
    • Efficient algorithms for computing a strong rank-revealing qr factorization
    • M. Gu and S. C. Eisenstat, "Efficient algorithms for computing a strong rank-revealing qr factorization," SIAM Journal on Scientific Computing, vol. 17, pp. 848-869, 1996.
    • (1996) SIAM Journal on Scientific Computing , vol.17 , pp. 848-869
    • Gu, M.1    Eisenstat, S.C.2
  • 4
    • 33847172327 scopus 로고    scopus 로고
    • Clustering by passing messages between data points
    • B. J. Frey and D. Dueck, "Clustering by passing messages between data points," Science, vol. 315, pp. 972-976, 2007.
    • (2007) Science , vol.315 , pp. 972-976
    • Frey, B.J.1    Dueck, D.2
  • 5
    • 70349135853 scopus 로고    scopus 로고
    • Column subset selection, matrix factorization, and eigenvalue optimization
    • J. A. Tropp, "Column subset selection, matrix factorization, and eigenvalue optimization," ACM-SIAM Symp. Discrete Algorithms (SODA), pp. 978-986, 2009.
    • (2009) ACM-SIAM Symp. Discrete Algorithms (SODA) , pp. 978-986
    • Tropp, J.A.1
  • 6
    • 70349152160 scopus 로고    scopus 로고
    • An improved approximation algorithm for the column subset selection problem
    • C. Boutsidis, M. W. Mahoney, and P. Drineas, "An improved approximation algorithm for the column subset selection problem," in Proceedings of SODA, 2009, pp. 968-977.
    • (2009) Proceedings of SODA , pp. 968-977
    • Boutsidis, C.1    Mahoney, M.W.2    Drineas, P.3
  • 8
    • 85162015690 scopus 로고    scopus 로고
    • CUR from a sparse optimization viewpoint
    • J. Bien, Y. Xu, and M. W. Mahoney, "CUR from a sparse optimization viewpoint," NIPS, 2010.
    • (2010) NIPS
    • Bien, J.1    Xu, Y.2    Mahoney, M.W.3
  • 9
    • 0002170151 scopus 로고
    • Rank revealing QR factorizations
    • T. Chan, "Rank revealing QR factorizations," Lin. Alg. and its Appl., vol. 88-89, pp. 67-82, 1987.
    • (1987) Lin. Alg. And its Appl. , vol.88-89 , pp. 67-82
    • Chan, T.1
  • 11
    • 84862519707 scopus 로고    scopus 로고
    • A convex model for non-negative matrix factorization and dimensionality reduction on physical space
    • E. Esser, M. Moller, S. Osher, G. Sapiro, and J. Xin, "A convex model for non-negative matrix factorization and dimensionality reduction on physical space," IEEE Transactions on Image Processing, vol. 21, no. 7, pp. 3239-3252, 2012.
    • (2012) IEEE Transactions on Image Processing , vol.21 , Issue.7 , pp. 3239-3252
    • Esser, E.1    Moller, M.2    Osher, S.3    Sapiro, G.4    Xin, J.5
  • 12
    • 23844463259 scopus 로고    scopus 로고
    • A constant-factor approximation algorithm for the k-median problem
    • M. Charikar, S. Guha, A. Tardos, and D. B. Shmoys, "A constant-factor approximation algorithm for the k-median problem," Journal of Computer System Sciences, vol. 65, no. 1, pp. 129-149, 2002.
    • (2002) Journal of Computer System Sciences , vol.65 , Issue.1 , pp. 129-149
    • Charikar, M.1    Guha, S.2    Tardos, A.3    Shmoys, D.B.4
  • 20
    • 33750383209 scopus 로고    scopus 로고
    • K-SVD: An algorithm for designing overcomplete dictionaries for sparse representation
    • M. Aharon, M. Elad, and A. M. Bruckstein, "K-SVD: An algorithm for designing overcomplete dictionaries for sparse representation," IEEE Trans. on Signal Processing, vol. 54, no. 11, pp. 4311-4322, 2006.
    • (2006) IEEE Trans. on Signal Processing , vol.54 , Issue.11 , pp. 4311-4322
    • Aharon, M.1    Elad, M.2    Bruckstein, A.M.3


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