메뉴 건너뛰기




Volumn , Issue , 2011, Pages 2865-2872

Online group-structured dictionary learning

Author keywords

[No Author keywords available]

Indexed keywords

E-LEARNING; FACTORIZATION; PATTERN RECOGNITION;

EID: 80052890623     PISSN: 10636919     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CVPR.2011.5995712     Document Type: Conference Paper
Times cited : (45)

References (36)
  • 1
    • 33750383209 scopus 로고    scopus 로고
    • K-SVD: An algorithm for designing of overcomplete dictionaries for sparse representation
    • M. Aharon, M. Elad, and A. Bruckstein. K-SVD: An algorithm for designing of overcomplete dictionaries for sparse representation. IEEE Trans. Signal Process., 54(11), 2006.
    • IEEE Trans. Signal Process. , vol.54 , Issue.11 , pp. 2006
    • Aharon, M.1    Elad, M.2    Bruckstein, A.3
  • 2
    • 55149088329 scopus 로고    scopus 로고
    • Convex multi-task feature learning
    • A. Argyriou, T. Evgeniou, and M. Pontil. Convex multi-task feature learning. Mach. Learn., 73(3):243-272, 2008.
    • (2008) Mach. Learn. , vol.73 , Issue.3 , pp. 243-272
    • Argyriou, A.1    Evgeniou, T.2    Pontil, M.3
  • 3
    • 79952389882 scopus 로고    scopus 로고
    • Online identification and tracking of subspaces from highly incomplete information
    • L. Balzano, R. Nowak, and B. Recht. Online identification and tracking of subspaces from highly incomplete information. In 48th Annual Allerton Conference, 2010.
    • (2010) 48th Annual Allerton Conference
    • Balzano, L.1    Nowak, R.2    Recht, B.3
  • 8
    • 84900510076 scopus 로고    scopus 로고
    • Non-negative matrix factorization with sparseness constraints
    • P. Hoyer. Non-negative matrix factorization with sparseness constraints. J. Mach. Learn. Res., 5:1457-1469, 2004.
    • (2004) J. Mach. Learn. Res. , vol.5 , pp. 1457-1469
    • Hoyer, P.1
  • 9
    • 77955136689 scopus 로고    scopus 로고
    • The benefit of group sparsity
    • J. Huang and T. Zhang. The benefit of group sparsity. Ann. Stat., 38(4):1978-2004, 2010.
    • (2010) Ann. Stat. , vol.38 , Issue.4 , pp. 1978-2004
    • Huang, J.1    Zhang, T.2
  • 11
    • 71149113559 scopus 로고    scopus 로고
    • Group Lasso with overlap and graph Lasso
    • L. Jacob, G. Obozinski, and J.-P. Vert. Group Lasso with overlap and graph Lasso. In ICML 2009, pages 433-440.
    • (2009) ICML , pp. 433-440
    • Jacob, L.1    Obozinski, G.2    Vert, J.-P.3
  • 12
    • 77956506018 scopus 로고    scopus 로고
    • Proximal methods for sparse hierarchical dictionary learning
    • R. Jenatton, J. Mairal, G. Obozinski, and F. Bach. Proximal methods for sparse hierarchical dictionary learning. In ICML 2010, pages 487-494.
    • (2010) ICML , pp. 487-494
    • Jenatton, R.1    Mairal, J.2    Obozinski, G.3    Bach, F.4
  • 14
    • 70450177775 scopus 로고    scopus 로고
    • Learning invariant features through topographic filter maps
    • K. Kavukcuoglu, M. Ranzato, R. Fergus, and Y. LeCun. Learning invariant features through topographic filter maps. In CVPR 2009, pages 1605-1612.
    • (2009) CVPR , pp. 1605-1612
    • Kavukcuoglu, K.1    Ranzato, M.2    Fergus, R.3    LeCun, Y.4
  • 15
    • 77956548668 scopus 로고    scopus 로고
    • Tree-guided group Lasso for multitask regression with structured sparsity
    • S. Kim and E. P. Xing. Tree-guided group Lasso for multitask regression with structured sparsity. In ICML 2010, pages 543-550.
    • (2010) ICML , pp. 543-550
    • Kim, S.1    Xing, E.P.2
  • 17
    • 0001093042 scopus 로고    scopus 로고
    • Algorithms for non-negative matrix factorization
    • D. D. Lee and H. S. Seung. Algorithms for non-negative matrix factorization. In NIPS 2000, pages 556-562.
    • (2000) NIPS , pp. 556-562
    • Lee, D.D.1    Seung, H.S.2
  • 18
    • 85161968806 scopus 로고    scopus 로고
    • Moreau-Yosida regularization for grouped tree structure learning
    • J. Liu and J. Ye. Moreau-Yosida regularization for grouped tree structure learning. In NIPS 2010.
    • (2010) NIPS
    • Liu, J.1    Ye, J.2
  • 20
    • 76749107542 scopus 로고    scopus 로고
    • Online learning for matrix factorization and sparse coding
    • J. Marial, F. Bach, J. Ponce, and G. Sapiro. Online learning for matrix factorization and sparse coding. J. Mach. Learn. Res., 11:10-60, 2010.
    • (2010) J. Mach. Learn. Res. , vol.11 , pp. 10-60
    • Marial, J.1    Bach, F.2    Ponce, J.3    Sapiro, G.4
  • 21
    • 78049443983 scopus 로고    scopus 로고
    • Solving structured sparsity regularization with proximal methods
    • S. Mosci, L. Rosasco, M. Santoro, A. Verri, and S. Villa. Solving structured sparsity regularization with proximal methods. In ECML 2010, pages 418-433.
    • (2010) ECML , pp. 418-433
    • Mosci, S.1    Rosasco, L.2    Santoro, M.3    Verri, A.4    Villa, S.5
  • 22
    • 77953322499 scopus 로고    scopus 로고
    • Joint covariate selection and joint subspace selection for multiple classification problems
    • G. Obozinski, B. Taskar, and M. I. Jordan. Joint covariate selection and joint subspace selection for multiple classification problems. Stat. Comput., 20:231-252, 2010.
    • (2010) Stat. Comput. , vol.20 , pp. 231-252
    • Obozinski, G.1    Taskar, B.2    Jordan, M.I.3
  • 23
    • 0029938380 scopus 로고    scopus 로고
    • Emergence of simple-cell receptive field properties by learning a sparse code for natural images
    • B. A. Olshausen and D. J. Field. Emergence of simple-cell receptive field properties by learning a sparse code for natural images. Nature, 381:607-609, 1996.
    • (1996) Nature , vol.381 , pp. 607-609
    • Olshausen, B.A.1    Field, D.J.2
  • 24
    • 85161965237 scopus 로고    scopus 로고
    • A primal-dual algorithm for group sparse regularization with overlapping groups
    • L. Rosasco, S. Mosci, S. Villa, and A. Verri. A primal-dual algorithm for group sparse regularization with overlapping groups. In NIPS 2010.
    • (2010) NIPS
    • Rosasco, L.1    Mosci, S.2    Villa, S.3    Verri, A.4
  • 26
    • 80052909104 scopus 로고    scopus 로고
    • Convex structure learning in log-linear models: Beyond pairwise potentials
    • M. Schmidt and K. Murphy. Convex structure learning in log-linear models: Beyond pairwise potentials. J. Mach. Learn. Res.: W&CP, 9:709-716, 2010.
    • (2010) J. Mach. Learn. Res.: W&CP , vol.9 , pp. 709-716
    • Schmidt, M.1    Murphy, K.2
  • 27
    • 26144447628 scopus 로고    scopus 로고
    • Non-negative matrix factorization extended by sparse code shrinkage and by weight sparsification
    • B. Szatmáry, B. Póczos, J. Eggert, E. Körner, and A. Lorincz. Non-negative matrix factorization extended by sparse code shrinkage and by weight sparsification. In ECAI 2002, pages 503-507.
    • (2002) ECAI , pp. 503-507
    • Szatmáry, B.1    Póczos, B.2    Eggert, J.3    Körner, E.4    Lorincz, A.5
  • 28
    • 85194972808 scopus 로고    scopus 로고
    • Regression shrinkage and selection via the Lasso
    • R. Tibshirani. Regression shrinkage and selection via the Lasso. J. Roy. Stat. Soc. B. Met., 58(1):267-288, 1996.
    • (1996) J. Roy. Stat. Soc. B. Met. , vol.58 , Issue.1 , pp. 267-288
    • Tibshirani, R.1
  • 31
    • 70149096300 scopus 로고    scopus 로고
    • A penalized matrix decomposition, with applications to sparse principal components and canonical correlation analysis
    • D. M. Witten, R. Tibshirani, and T. Hastie. A penalized matrix decomposition, with applications to sparse principal components and canonical correlation analysis. Biostatistics, 10(3):515-534, 2009.
    • (2009) Biostatistics , vol.10 , Issue.3 , pp. 515-534
    • Witten, D.M.1    Tibshirani, R.2    Hastie, T.3
  • 32
    • 66849115117 scopus 로고    scopus 로고
    • Dictionary learning for sparse approximations with the majorization method
    • M. Yaghoobi, T. Blumensath, and M. Davies. Dictionary learning for sparse approximations with the majorization method. IEEE Trans. Signal Process., 57(6):2178-2191, 2009.
    • (2009) IEEE Trans. Signal Process. , vol.57 , Issue.6 , pp. 2178-2191
    • Yaghoobi, M.1    Blumensath, T.2    Davies, M.3
  • 33
    • 33645035051 scopus 로고    scopus 로고
    • Model selection and estimation in regression with grouped variables
    • M. Yuan and Y. Lin. Model selection and estimation in regression with grouped variables. J. Roy. Stat. Soc. B Met., 68, 2006.
    • (2006) J. Roy. Stat. Soc. B Met. , vol.68
    • Yuan, M.1    Lin, Y.2
  • 34
    • 69949155103 scopus 로고    scopus 로고
    • The composite absolute penalties family for grouped and hierarchical variable selection
    • P. Zhao, G. Rocha, and B. Yu. The composite absolute penalties family for grouped and hierarchical variable selection. Ann. Stat., 37(6A):3468-3497, 2009.
    • (2009) Ann. Stat. , vol.37 , Issue.6 A , pp. 3468-3497
    • Zhao, P.1    Rocha, G.2    Yu, B.3
  • 35
    • 84863386014 scopus 로고    scopus 로고
    • Non-parametric Bayesian dictionary learning for sparse image representations
    • M. Zhou, H. Chen, J. Paisley, L. Ren, G. Sapiro, and L. Carin. Non-parametric Bayesian dictionary learning for sparse image representations. In NIPS 2009, pages 2295-2303.
    • (2009) NIPS , pp. 2295-2303
    • Zhou, M.1    Chen, H.2    Paisley, J.3    Ren, L.4    Sapiro, G.5    Carin, L.6


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