메뉴 건너뛰기




Volumn , Issue , 2010, Pages 504-513

Practical very large scale CRFs

Author keywords

[No Author keywords available]

Indexed keywords

CARDINALITIES; COMPACT PARAMETERS; COMPUTATIONAL EFFORT; CONDITIONAL RANDOM FIELDS (CRFS); PENALTY TERM; REGULARIZATION STRATEGIES;

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

References (36)
  • 2
    • 33947180792 scopus 로고    scopus 로고
    • Stochastic learning
    • Olivier Bousquet and Ulrike von Luxburg, editors, Advanced Lectures on Machine Learning, Lecture Notes in Artificial Intelligence. Springer Verlag, Berlin
    • Léon Bottou. 2004. Stochastic learning. In Olivier Bousquet and Ulrike von Luxburg, editors, Advanced Lectures on Machine Learning, Lecture Notes in Artificial Intelligence, LNAI 3176, pages 146-168. Springer Verlag, Berlin.
    • (2004) LNAI , vol.3176 , pp. 146-168
    • Bottou, L.1
  • 7
    • 9444278508 scopus 로고    scopus 로고
    • Performance guarantees for regularized maximum entropy density estimation
    • John Shawe-Taylor and Yoram Singer, editors, volume 3120 of Lecture Notes in Computer Science, Springer
    • Miroslav Dudík, Steven J. Phillips, and Robert E. Schapire. 2004. Performance guarantees for regularized maximum entropy density estimation. In John Shawe-Taylor and Yoram Singer, editors, Proceedings of the 17th annual Conference on Learning Theory, volume 3120 of Lecture Notes in Computer Science, pages 472-486. Springer.
    • (2004) Proceedings of the 17th Annual Conference on Learning Theory , pp. 472-486
    • Dudík, M.1    Phillips, S.J.2    Schapire, R.E.3
  • 9
  • 14
    • 0142192295 scopus 로고    scopus 로고
    • Conditional random fields: Probabilistic models for segmenting and labeling sequence data
    • Morgan Kaufmann, San Francisco, CA
    • John Lafferty, Andrew McCallum, and Fernando Pereira. 2001. Conditional random fields: probabilistic models for segmenting and labeling sequence data. In Proceedings of the International Conference on Machine Learning, pages 282-289. Morgan Kaufmann, San Francisco, CA.
    • (2001) Proceedings of the International Conference on Machine Learning , pp. 282-289
    • Lafferty, J.1    McCallum, A.2    Pereira, F.3
  • 16
    • 33646887390 scopus 로고
    • On the limited memory BFGS method for large scale optimization
    • Dong C. Liu and Jorge Nocedal. 1989. On the limited memory BFGS method for large scale optimization. Mathematical Programming, 45:503-528.
    • (1989) Mathematical Programming , vol.45 , pp. 503-528
    • Liu, D.C.1    Nocedal, J.2
  • 17
    • 80052652249 scopus 로고    scopus 로고
    • Efficient large-scale distributed training of conditional maximum entropy models
    • Y. Bengio, D. Schuurmans, J. Lafferty, C. K. I.Williams, and A.Culotta, editors
    • Gideon Mann, Ryan McDonald, Mehryar Mohri, Nathan Silberman, and Dan Walker. 2009. Efficient large-scale distributed training of conditional maximum entropy models. In Y. Bengio, D. Schuurmans, J. Lafferty, C. K. I.Williams, and A.Culotta, editors, Advances in Neural Information Processing Systems 22, pages 1231-1239.
    • (2009) Advances in Neural Information Processing Systems , vol.22 , pp. 1231-1239
    • Mann, G.1    McDonald, R.2    Mohri, M.3    Silberman, N.4    Walker, D.5
  • 18
    • 34249852033 scopus 로고
    • Building a large annotated corpus of English: The Penn Treebank
    • Mitchell P. Marcus, Mary Ann Marcinkiewicz, and Beatrice Santorini. 1993. Building a large annotated corpus of English: The Penn treebank. Computational Linguistics, 19(2):313-330.
    • (1993) Computational Linguistics , vol.19 , Issue.2 , pp. 313-330
    • Marcus, M.P.1    Marcinkiewicz, M.A.2    Santorini, B.3
  • 22
    • 1942418470 scopus 로고    scopus 로고
    • Grafting: Fast, incremental feature selection by gradient descent in function space
    • Simon Perkins, Kevin Lacker, and James Theiler. 2003. Grafting: Fast, incremental feature selection by gradient descent in function space. Journal of Machine Learning Research, 3:1333-1356.
    • (2003) Journal of Machine Learning Research , vol.3 , pp. 1333-1356
    • Perkins, S.1    Lacker, K.2    Theiler, J.3
  • 25
    • 85117181888 scopus 로고    scopus 로고
    • Incremental feature selection and l1 regularization for relaxed maximum-entropy modeling
    • Dekang Lin and Dekai Wu, editors, Barcelona, Spain, July
    • Stefan Riezler and Alexander Vasserman. 2004. Incremental feature selection and l1 regularization for relaxed maximum-entropy modeling. In Dekang Lin and Dekai Wu, editors, Proceedings of the conference on Empirical Methods in Natural Language Processing, pages 174-181, Barcelona, Spain, July.
    • (2004) Proceedings of the Conference on Empirical Methods in Natural Language Processing , pp. 174-181
    • Riezler, S.1    Vasserman, A.2
  • 27
    • 0000383868 scopus 로고
    • Parallel networks that learn to pronounce English text
    • Terrence J. Sejnowski and Charles R. Rosenberg. 1987. Parallel networks that learn to pronounce english text. Complex Systems, 1.
    • (1987) Complex Systems , vol.1
    • Sejnowski, T.J.1    Rosenberg, C.R.2
  • 30
    • 33750032384 scopus 로고    scopus 로고
    • An introduction to conditional random fields for relational learning
    • Lise Getoor and Ben Taskar, editors, Cambridge, MA. The MIT Press
    • Charles Sutton and Andrew McCallum. 2006. An introduction to conditional random fields for relational learning. In Lise Getoor and Ben Taskar, editors, Introduction to Statistical Relational Learning, Cambridge, MA. The MIT Press.
    • (2006) Introduction to Statistical Relational Learning
    • Sutton, C.1    McCallum, A.2
  • 32
    • 85194972808 scopus 로고    scopus 로고
    • Regression shrinkage and selection via the lasso
    • Robert Tibshirani. 1996. Regression shrinkage and selection via the lasso. J.R.Statist.Soc.B, 58(1):267-288.
    • (1996) J.R.Statist.Soc.B , vol.58 , Issue.1 , pp. 267-288
    • Tibshirani, R.1
  • 36
    • 16244401458 scopus 로고    scopus 로고
    • Regularization and variable selection via the elastic net
    • Hui Zhou and Trevor Hastie. 2005. Regularization and variable selection via the elastic net. J. Royal. Stat. Soc. B., 67(2):301-320.
    • (2005) J. Royal. Stat. Soc. B. , vol.67 , Issue.2 , pp. 301-320
    • Zhou, H.1    Hastie, T.2


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