메뉴 건너뛰기




Volumn 3, Issue , 2012, Pages 2258-2266

Online ℓ1-dictionary learning with application to novel document detection

Author keywords

[No Author keywords available]

Indexed keywords

ALTERNATING DIRECTIONS METHOD OF MULTIPLIERS; AUTOMATED IDENTIFICATION; BATCH ALGORITHMS; DICTIONARY LEARNING; DICTIONARY LEARNING ALGORITHMS; ON-LINE ALGORITHMS; QUALITY OF RESULTS; RECONSTRUCTION ERROR;

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

References (25)
  • 1
    • 33750383209 scopus 로고    scopus 로고
    • The K-SVD: An algorithm for designing overcomplete dictionaries for sparse representation
    • M. Aharon, M. Elad, and A. Bruckstein. The K-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation. IEEE Transactions on Signal Processing, 54(11), 2006.
    • (2006) IEEE Transactions on Signal Processing , vol.54 , Issue.11
    • Aharon, M.1    Elad, M.2    Bruckstein, A.3
  • 3
    • 84866007412 scopus 로고    scopus 로고
    • Concept labeling: Building text classifiers with minimal supervision
    • V. Chenthamarakshan, P. Melville, V. Sindhwani, and R. D. Lawrence. Concept Labeling: Building Text Classifiers with Minimal Supervision. In IJCAI, pages 1225-1230, 2011.
    • (2011) IJCAI , pp. 1225-1230
    • Chenthamarakshan, V.1    Melville, P.2    Sindhwani, V.3    Lawrence, R.D.4
  • 4
    • 56449092085 scopus 로고    scopus 로고
    • Efficient projections onto the l1-ball for learning in high dimensions
    • J. Duchi, S. Shalev-Shwartz, Y. Singer, and T. Chandra. Efficient Projections onto the l1-ball for Learning in High Dimensions. In ICML, pages 272-279, 2008.
    • (2008) ICML , pp. 272-279
    • Duchi, J.1    Shalev-Shwartz, S.2    Singer, Y.3    Chandra, T.4
  • 5
    • 75249102673 scopus 로고    scopus 로고
    • Efficient online and batch learning using forward backward splitting
    • J. Duchi and Y. Singer. Efficient Online and Batch Learning using Forward Backward Splitting. JMLR, 10:2873-2898, 2009.
    • (2009) JMLR , vol.10 , pp. 2873-2898
    • Duchi, J.1    Singer, Y.2
  • 8
    • 35348918820 scopus 로고    scopus 로고
    • Logarithmic regret algorithms for online convex optimization
    • E. Hazan, A. Agarwal, and S. Kale. Logarithmic Regret Algorithms for Online Convex Optimization. Machine Learning, 69(2-3):169-192, 2007.
    • (2007) Machine Learning , vol.69 , Issue.2-3 , pp. 169-192
    • Hazan, E.1    Agarwal, A.2    Kale, S.3
  • 12
    • 76749107542 scopus 로고    scopus 로고
    • Online learning for matrix factorization and sparse coding
    • J. Mairal, F. Bach, J. Ponce, and G. Sapiro. Online Learning for Matrix Factorization and Sparse Coding. JMLR, 11:19-60, 2010.
    • (2010) JMLR , vol.11 , pp. 19-60
    • Mairal, J.1    Bach, F.2    Ponce, J.3    Sapiro, G.4
  • 15
    • 0030779611 scopus 로고    scopus 로고
    • Sparse coding with an overcomplete basis set: A strategy employed by v1?
    • B. Olshausen and D. Field. Sparse Coding with an Overcomplete Basis Set: A Strategy Employed by V1? Vision Research, 37(23):3311-3325, 1997.
    • (1997) Vision Research , vol.37 , Issue.23 , pp. 3311-3325
    • Olshausen, B.1    Field, D.2
  • 16
    • 80053272732 scopus 로고    scopus 로고
    • Streaming first story detection with application to twitter
    • ACL
    • S. Petrović, M. Osborne, and V. Lavrenko. Streaming First Story Detection with Application to Twitter. In HLT '10, pages 181-189. ACL, 2010.
    • (2010) HLT '10 , pp. 181-189
    • Petrović, S.1    Osborne, M.2    Lavrenko, V.3
  • 17
    • 84858043041 scopus 로고    scopus 로고
    • Learning evolving and emerging topics in social media: A dynamic NMF approach with temporal regularization
    • A. Saha and V. Sindhwani. Learning Evolving and Emerging Topics in Social Media: A Dynamic NMF Approach with Temporal Regularization. In WSDM, pages 693-702, 2012.
    • (2012) WSDM , pp. 693-702
    • Saha, A.1    Sindhwani, V.2
  • 19
    • 84867113187 scopus 로고    scopus 로고
    • Online alternating direction method
    • H. Wang and A. Banerjee. Online Alternating Direction Method. In ICML, 2012.
    • (2012) ICML
    • Wang, H.1    Banerjee, A.2
  • 20
    • 77953803524 scopus 로고    scopus 로고
    • Dense error correction via L1-minimization
    • J. Wright and Y. Ma. Dense Error Correction Via L1-Minimization. IEEE Transactions on Information Theory, 56(7):3540-3560, 2010.
    • (2010) IEEE Transactions on Information Theory , vol.56 , Issue.7 , pp. 3540-3560
    • Wright, J.1    Ma, Y.2
  • 22
    • 78649396336 scopus 로고    scopus 로고
    • Dual averaging methods for regularized stochastic learning and online optimization
    • L. Xiao. Dual Averaging Methods for Regularized Stochastic Learning and Online Optimization. JMLR, 11:2543-2596, 2010.
    • (2010) JMLR , vol.11 , pp. 2543-2596
    • Xiao, L.1
  • 23
    • 78651090983 scopus 로고    scopus 로고
    • Fast L1-minimization algorithms and an application in robust face recognition: A review
    • A. Y. Yang, S. S. Sastry, A. Ganesh, and Y. Ma. Fast L1-minimization Algorithms and an Application in Robust Face Recognition: A Review. In International Conference on Image Processing, pages 1849- 1852, 2010.
    • (2010) International Conference on Image Processing , pp. 1849-1852
    • Yang, A.Y.1    Sastry, S.S.2    Ganesh, A.3    Ma, Y.4
  • 24
    • 79952307213 scopus 로고    scopus 로고
    • Alternating direction algorithms for L1-problems in compressive sensing
    • J. Yang and Y. Zhang. Alternating Direction Algorithms for L1-Problems in Compressive Sensing. SIAM Journal of Scientific Computing, 33(1):250-278, 2011.
    • (2011) SIAM Journal of Scientific Computing , vol.33 , Issue.1 , pp. 250-278
    • Yang, J.1    Zhang, Y.2
  • 25
    • 1942484421 scopus 로고    scopus 로고
    • Online convex programming and generalized infinitesimal gradient ascent
    • M. Zinkevich. Online Convex Programming and Generalized Infinitesimal Gradient Ascent. In ICML, pages 928-936, 2003.
    • (2003) ICML , pp. 928-936
    • Zinkevich, M.1


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