메뉴 건너뛰기




Volumn , Issue , 2012, Pages 1737-1741

Web-scale multi-task feature selection for behavioral targeting

Author keywords

behavioral targeting; feature selection; large scale learning; sparsity

Indexed keywords

ADVERTISING CAMPAIGN; BEHAVIORAL TARGETING; CLOSED FORM SOLUTIONS; DISTRIBUTED INFERENCE; DISTRIBUTED PARAMETER ESTIMATION; FEATURE SELECTION METHODS; ITERATIVE THRESHOLDING; LARGE-SCALE LEARNING; MIXED-NORM; OPTIMIZATION ALGORITHMS; SPARSITY; SUBGRADIENT; TARGETING SYSTEMS;

EID: 84871072633     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2396761.2398508     Document Type: Conference Paper
Times cited : (9)

References (11)
  • 2
    • 80052659792 scopus 로고    scopus 로고
    • Scalable distributed inference of dynamic user interests for behavioral targeting
    • Amr Ahmed, Yucheng Low, Mohamed Aly, Vanja Josifovski, and Alexander J. Smola. Scalable distributed inference of dynamic user interests for behavioral targeting. In KDD, 2011.
    • (2011) KDD
    • Ahmed, A.1    Low, Y.2    Aly, M.3    Josifovski, V.4    Smola, A.J.5
  • 4
    • 84860608998 scopus 로고    scopus 로고
    • Optimization with sparsity-inducing penalties
    • abs/1108.0775
    • F. Bach, R. Jenatton, J. Mairal, and G. Obozinski. Optimization with sparsity-inducing penalties. CoRR, abs/1108.0775, 2011.
    • (2011) CoRR
    • Bach, F.1    Jenatton, R.2    Mairal, J.3    Obozinski, G.4
  • 5
    • 85014561619 scopus 로고    scopus 로고
    • A fast iterative shrinkage-thresholding algorithm for linear inverse problems
    • Amir Beck and Marc Teboulle. A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM Journal on Imaging Sciences, 2(1):183-202, 2009.
    • (2009) SIAM Journal on Imaging Sciences , vol.2 , Issue.1 , pp. 183-202
    • Beck, A.1    Teboulle, M.2
  • 6
    • 29144439194 scopus 로고    scopus 로고
    • Decoding by linear programming
    • Emmanuel Candes and Terence Tao. Decoding by linear programming. IEEE Trans. Info Theory, 51(12):4203-4215, 2005.
    • (2005) IEEE Trans. Info Theory , vol.51 , Issue.12 , pp. 4203-4215
    • Candes, E.1    Tao, T.2
  • 7
    • 71149103464 scopus 로고    scopus 로고
    • An accelerated gradient method for trace norm minimization
    • S. Ji and J. Yi. An accelerated gradient method for trace norm minimization. In ICML, 2009.
    • (2009) ICML
    • Ji, S.1    Yi, J.2
  • 8
    • 0030704545 scopus 로고    scopus 로고
    • Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the world wide web
    • New York, May Association for Computing Machinery
    • D. Karger, E. Lehman, T. Leighton, M. Levine, D. Lewin, and R. Panigrahy. Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the world wide web. In Symposium on the Theory of Computing STOC, pages 654-663, New York, May 1997. Association for Computing Machinery.
    • (1997) Symposium on the Theory of Computing STOC , pp. 654-663
    • Karger, D.1    Lehman, E.2    Leighton, T.3    Levine, M.4    Lewin, D.5    Panigrahy, R.6
  • 9
    • 77958606724 scopus 로고    scopus 로고
    • High-dimensional union support recovery in multivariate regression
    • Guillaume Obozinski, Martin Wainwright, and Michael Jordan. High-dimensional union support recovery in multivariate regression. In NIPS, 2008.
    • (2008) NIPS
    • Obozinski, G.1    Wainwright, M.2    Jordan, M.3


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