메뉴 건너뛰기




Volumn , Issue , 2009, Pages 1265-1272

On primal and dual sparsity of Markov networks

Author keywords

[No Author keywords available]

Indexed keywords

EXTREME CASE; HIGH-DIMENSIONAL; MARKOV NETWORKS; SYNTHETIC AND REAL DATA;

EID: 71149096265     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (4)

References (22)
  • 2
    • 31844436350 scopus 로고    scopus 로고
    • Exponentiated gradient algorithms for large margin structured classification
    • Bartlett, P., Collins, M., Taskar, B. & McAllester, D (2004). Exponentiated gradient algorithms for large margin structured classification. NIPS, 113-120.
    • (2004) NIPS , pp. 113-120
    • Bartlett, P.1    Collins, M.2    Taskar, B.3    McAllester, D.4
  • 7
    • 0004123838 scopus 로고    scopus 로고
    • Least absolute shrinkage is equivalent to quadratic penalization
    • Grandvalet, Y. (1998). Least absolute shrinkage is equivalent to quadratic penalization. Inter. Conf. on Aartifical Neural Networks, 201-206.
    • (1998) Inter. Conf. on Aartifical Neural Networks , pp. 201-206
    • Grandvalet, Y.1
  • 8
    • 0142192295 scopus 로고    scopus 로고
    • Conditional random fields: Probabilistic models for segmenting and labeling sequence data
    • Lafferty, J., McCallum, A., & Pereira, F. (2001). Conditional random fields: Probabilistic models for segmenting and labeling sequence data. International Conference on Machine Learning, 282-289.
    • (2001) International Conference on Machine Learning , pp. 282-289
    • Lafferty, J.1    McCallum, A.2    Pereira, F.3
  • 10
    • 14344253847 scopus 로고    scopus 로고
    • Predictive automatic relevance determination by expectation propagation
    • Qi, Y., Minka, T., Picard, R., & Ghahramani, Z. (2004). Predictive automatic relevance determination by expectation propagation. ICML, 671-678.
    • (2004) ICML , pp. 671-678
    • Qi, Y.1    Minka, T.2    Picard, R.3    Ghahramani, Z.4
  • 12
    • 44649116452 scopus 로고    scopus 로고
    • Buddie methods for machine learning
    • Smola, A., Vishwanathan, S., & Le, Q. (2007). Buddie methods for machine learning. NIPS, 1377-1384.
    • (2007) NIPS , pp. 1377-1384
    • Smola, A.1    Vishwanathan, S.2    Le, Q.3
  • 16
    • 0001224048 scopus 로고    scopus 로고
    • Sparse bayesian learning and the relevance vector machine
    • Tipping, M. E. (2001). Sparse bayesian learning and the relevance vector machine. JMLR, 211-244.
    • (2001) JMLR , pp. 211-244
    • Tipping, M.E.1
  • 19
    • 48849087800 scopus 로고    scopus 로고
    • Dynamic hierarchical Markov random fields for integrated web data extraction
    • Zhu, J., Nie, Z., Zhang, B., & Wen, J.-R. (2008a). Dynamic hierarchical Markov random fields for integrated web data extraction. JMLR, 1583-1614.
    • (2008) JMLR , pp. 1583-1614
    • Zhu, J.1    Nie, Z.2    Zhang, B.3    Wen, J.-R.4
  • 21
    • 70049109054 scopus 로고    scopus 로고
    • Maximum entropy discrimination Markov networks
    • Zhu, J., & Xing, E. (2009). Maximum entropy discrimination Markov networks. ArXiv 0901.2730.
    • (2009) ArXiv 0901.2730
    • Zhu, J.1    Xing, E.2
  • 22
    • 56449096750 scopus 로고    scopus 로고
    • Laplace maximum margin Markov networks
    • Zhu, J., Xing, E., & Zhang, B. (2008b). Laplace maximum margin Markov networks. ICML, 1977-1984.
    • (2008) ICML , pp. 1977-1984
    • Zhu, J.1    Xing, E.2    Zhang, B.3


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