Graph-based lexicon expansion with sparsity-inducing penalties

NAACL HLT 2012 - 2012 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Proceedings of the Conference

Volumn , Issue , 2012, Pages 677-687

  Das, Dipanjan ^a   Smith, Noah A ^a  

^a Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; LEARNING ALGORITHMS; NATURAL LANGUAGE PROCESSING SYSTEMS; SUPERVISED LEARNING;

GAUSSIANS; GRAPH'S VERTICES; GRAPH-BASED; LEARNING FRAMEWORKS; LEXICON EXPANSIONS; MARKOV NETWORKS; NATURAL LANGUAGES; NOVEL METHODS; SEMI-SUPERVISED LEARNING; SOFT LABELS;

GRAPHIC METHODS;

EID: 84907319569     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (38)

1. G. Andrew and J. Gao. 2007. Scalable training of L1- regularized log-linear models. In Proc. of ICML.
2. C. Baker, M. Ellsworth, and K. Erk. 2007. Task 19: frame semantic structure extraction. In Proc. of SemEval.
3. S. Baluja, R. Seth, D. Sivakumar, Y. Jing, J. Yagnik, S. Kumar, D. Ravichandran, and M. Aly. 2008. Video suggestion and discovery for Youtube: taking random walks through the view graph. In Proc. of WWW.
4. Y. Bengio, O. Delalleau, and N. Le Roux. 2006. Label propagation and quadratic criterion. In Olivier Chapelle, Bernhard Schölkopf, and Alexander Zien, editors, Semi-Supervised Learning, pages 193-216. MIT Press.
5. J. Burbea and C. R. Rao. 1982. On the convexity of some divergence measures based on entropy functions. IEEE Transactions on Information Theory, 28:489-495.
6. O. Chapelle, B. Schölkopf, and A. Zien, editors. 2006. Semi-Supervised Learning. MIT Press.
7. A. Corduneanu and T. Jaakkola. 2003. On information regularization. In Proc. of UAI.
8. T. M. Cover and J. A. Thomas. 1991. Elements of information theory. Wiley-Interscience.
9. D. Das and S. Petrov. 2011. Unsupervised part-ofspeech tagging with bilingual graph-based projections. In Proc. of ACL.
10. D. Das and N. A. Smith. 2011. Semi-supervised framesemantic parsing for unknown predicates. In Proc. of ACL.
11. J. Dean and S. Ghemawat. 2008. MapReduce: simplified data processing on large clusters. Communications of the ACM, 51:107-113, January.
12. P. S. Dhillon, D. Foster, and L. Ungar. 2011. Multiview learning of word embeddings via cca. In Proc. of NIPS.
13. C. J. Fillmore, C. R. Johnson, and M. R.L. Petruck. 2003. Background to FrameNet. International Journal of Lexicography, 16(3).
14. C. J. Fillmore. 1982. Frame semantics. In Linguistics in the Morning Calm, pages 111-137. Hanshin Publishing Co., Seoul, South Korea.
15. D. Graff. 2003. English Gigaword. Linguistic Data Consortium.
16. Y. Grandvalet and Y. Bengio. 2004. Semi-supervised learning by entropy minimization. In Proc. of NIPS.
17. W. Gropp, E. Lusk, and A. Skjellum. 1994. Using MPI: Portable Parallel Programming with the Message- Passing Interface. MIT Press.
18. F. Huang and A. Yates. 2009. Distributional representations for handling sparsity in supervised sequence labeling. In Proc. of ACL.
19. F. Jiao, S. Wang, C.-H. Lee, R. Greiner, and D. Schuurmans. 2006. Semi-supervised conditional random fields for improved sequence segmentation and labeling. In Proc. of ACL.
20. M. Kowalski and B. Torrésani. 2009. Sparsity and persistence: mixed norms provide simple signal models with dependent coefficients. Signal, Image and Video Processing, 3:251-264.
21. S. Kullback and R. A. Leibler. 1951. On information and sufficiency. Annals of Mathematical Statistics, 22.
22. J. Lin. 1991. Divergence measures based on the shannon entropy. IEEE Transactions on Information theory, 37:145-151.
23. M. P. Marcus, M. A. Marcinkiewicz, and B. Santorini. 1993. Building a large annotated corpus of English: the Penn Treebank. Computational Linguistics, 19(2).
24. D. McClosky, E. Charniak, and M. Johnson. 2006. Effective self-training for parsing. In Proc. of HLTNAACL.
25. J. A. O'Sullivan. 1998. Alternating minimization algorithms: from Blahut-Arimoto to Expectation- Maximization. In A. Vardy, editor, Codes, Curves, and Signals: Common Threads in Communications, pages 173-192. Kluwer.
26. D. A. Smith and J. Eisner. 2007. Bootstrapping featurerich dependency parsers with entropic priors. In Proc. of EMNLP.
27. A. Subramanya and J. Bilmes. 2008. Soft-supervised learning for text classification. In Proc. of EMNLP.
28. A. Subramanya and J. Bilmes. 2009. Entropic graph regularization in non-parametric semi-supervised classification. In Proc. of NIPS.
29. A. Subramanya, S. Petrov, and F. Pereira. 2010. Efficient Graph-based Semi-Supervised Learning of Structured Tagging Models. In Proc. of EMNLP.
30. M. Szummer and T. Jaakkola. 2001. Partially labeled classification with Markov random walks. In Proc. of NIPS. MIT Press.
31. P. P. Talukdar and K. Crammer. 2009. New regularized algorithms for transductive learning. In Proc. of the ECML-PKDD.
32. P. P. Talukdar. 2010. Graph-Based Weakly-Supervised Methods for Information Extraction and Integration. Ph.D. thesis, University of Pennsylvania.
33. R. Tibshirani. 1996. Regression shrinkage and selection via the lasso. Journal of the Royal Statistical Society (Series B), 58:267-288.
34. J. Turian, L. Ratinov, and Y. Bengio. 2010. Word representations: a simple and general method for semisupervised learning. In Proc. of ACL.
35. X. Zhu and Z. Ghahramani. 2002. Learning from labeled and unlabeled data with Label Propagation. Technical report, Carnegie Mellon University.
36. C. Zhu, R. H. Byrd, P. Lu, and J. Nocedal. 1997. Algorithm 778: L-BFGS-B: Fortran subroutines for largescale bound-constrained optimization. ACM Transactions on Mathematical Software, 23:550-560.
37. X. Zhu, Z. Ghahramani, and J. Lafferty. 2003. Semisupervised learning using gaussian fields and harmonic functions. In Proc. of ICML.
38. X. Zhu. 2008. Semi-Supervised Learning Literature Survey. Online publication., July.