Weakly-supervised acquisition of labeled class instances using graph random walks

EMNLP 2008 - 2008 Conference on Empirical Methods in Natural Language Processing, Proceedings of the Conference: A Meeting of SIGDAT, a Special Interest Group of the ACL

Volumn , Issue , 2008, Pages 582-590

  Talukdar, Partha Pratim ^a   Reisinger, Joseph ^b   Paşca, Marius ^c   Ravichandran, Deepak ^c   Bhagat, Rahul ^d   Pereira, Fernando ^c  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^c GOOGLE INC   (United States)

^d UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPHIC METHODS; MERGERS AND ACQUISITIONS;

FREE TEXTS; GRAPH-BASED; LABEL PROPAGATION; RANDOM WALK; SEMI-SUPERVISED; STRUCTURED TEXT;

NATURAL LANGUAGE PROCESSING SYSTEMS;

EID: 80053380980     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.3115/1613715.1613787     Document Type: Conference Paper

References (16)

1. A. Azran. 2007. The rendezvous algorithm: multiclass semi-supervised learning with markov random walks. Proceedings of the 24th international conference on Machine learning, pages 49-56.
2. 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.
3. K. Bellare, P. Talukdar, G. Kumaran, F. Pereira, M. Liberman, A. McCallum, and M. Dredze. 2007. Lightly-Supervised Attribute Extraction. NIPS 2007Workshop on Machine Learning for Web Search.
4. M. Cafarella, A. Halevy, D. Wang, E. Wu, and Y. Zhang. 2008. Webtables: Exploring the power of tables on the web. VLDB.
5. C. Fellbaum, editor. 1998. WordNet: An Electronic Lexical Database and Some of its Applications. MIT Press.
6. M. Hearst. 1992. Automatic acquisition of hyponyms from large text corpora. In Proceedings of the 14th International Conference on Computational Linguistics (COLING-92), pages 539-545, Nantes, France.
7. P. Indyk and J. Matousek. 2004. Low-distortion embeddings of finite metric spaces. Handbook of Discrete and Computational Geometry.
8. B. Jansen, A. Spink, and T. Saracevic. 2000. Real life, real users, and real needs: a study and analysis of user queries on the Web. Information Processing and Management, 36(2):207-227.
9. D. Lin and P. Pantel. 2002. Concept discovery from text. In Proceedings of the 19th International Conference on Computational linguistics (COLING-02), pages 1-7.
10. K. McCarthy and W. Lehnert. 1995. Using decision trees for coreference resolution. In Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI-95), pages 1050-1055
11. Montreal, Quebec. E. Riloff and R. Jones. 1999. Learning dictionaries for information extraction by multi-level bootstrapping. In Proceedings of the 16th National Conference on Artificial Intelligence (AAAI-99), pages 474-479, Orlando, Florida.
12. M. Stevenson and R. Gaizauskas. 2000. Using corpusderived name lists for named entity recognition. In Proceedings of the 6th Conference on Applied Natural Language Processing (ANLP-00), Seattle, Washington.
13. M. Szummer and T. Jaakkola. 2002. Partially labeled classification with markov random walks. Advances in Neural Information Processing Systems 14: Proceedings of the 2002 NIPS Conference.
14. B. Van Durme and M. Paşca. 2008. Finding cars, goddesses and enzymes: Parametrizable acquisition of labeled instances for open-domain information extraction. Twenty-Third AAAI Conference on Artificial Intelligence.
15. R. Wang and W. Cohen. 2007. Language-Independent Set Expansion of Named Entities Using theWeb. Data Mining, 2007. ICDM 2007. Seventh IEEE International Conference on, pages 342-350.
16. X. Zhu, Z. Ghahramani, and J. Lafferty. 2003. Semisupervised learning using gaussian fields and harmonic functions. ICML-03, 20th International Conference on Machine Learning.