emnlp emnlp2010 emnlp2010-20 emnlp2010-20-reference knowledge-graph by maker-knowledge-mining
Source: pdf
Author: Apoorv Agarwal ; Owen Rambow
Abstract: In this paper we introduce the new task of social event extraction from text. We distinguish two broad types of social events depending on whether only one or both parties are aware of the social contact. We annotate part of Automatic Content Extraction (ACE) data, and perform experiments using Support Vector Machines with Kernel methods. We use a combination of structures derived from phrase structure trees and dependency trees. A characteristic of our events (which distinguishes them from ACE events) is that the participating entities can be spread far across the parse trees. We use syntactic and semantic insights to devise a new structure derived from dependency trees and show that this plays a role in achieving the best performing system for both social event detection and classification tasks. We also use three data sampling approaches to solve the problem of data skewness. Sampling methods improve the F1-measure for the task of relation detection by over 20% absolute over the baseline.
Apoorv Agarwal, Owen Rambow, and Rebecca J Passonneau. 2010. Annotation scheme for social network extraction from text. In Fourth Linguistic Annotation Workshop, ACL. N V Chawla, L O Hall, K W Bowyer, and W P Kegelmeyer. 2002. Smote: Synthetic minority oversampling technique. In Journal of Artificial Intelligence Research. M. Collins and N. Duffy. 2002. Convolution kernels for natural language. In Advances in neural information processing systems. Aron Culotta and Sorensen Jeffrey. 2004. Dependency tree kernels for relation extraction. In Proceedings of the 42ndMeeting oftheAssociationfor Computational Linguistics (ACL’04), Main Volume, pages 423–429, Barcelona, Spain, July. G Doddington, A Mitchell, M Przybocki, L Ramshaw, S Strassel, and R Weischedel. 2004. The automatic content extraction (ace) program–tasks, data, and evaluation. LREC, pages 837–840. David K. Elson, Nicholas Dames, and Kathleen R. McKeown. 2010. Extracting social networks from literary fiction. In Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics (ACL 2010), Uppsala, Sweden. Ralph Grishman, David Westbrook, and Adam Meyers Proc. 2005. Nyu’s english ace 2005 system description. In ACE Evaluation Workshop. Zhou GuoDong, Su Jian, Zhang Jie, and Zhang Min. 2005. Exploring various knowledge in relation extraction. In Proceedings of 43th Annual Meeting of the Association for Computational Linguistics. T. M. Ha and H Bunke. 1997. Off-line, handwritten numerical recognition by perturbation method. In Pattern Analysis and Machine Intelligence. Sanda Harabagiu, Cosmin Adrian Bejan, and Paul Morarescu. 2005. Shallow semantics for relation extraction. In International Joint Conference On Artificial Intelligence. David Haussler. 1999. Convolution kernels on discrete structures. Technical report, University of California at Santa Cruz. Nathalie Japkowicz. 2000. Learning from imbalanced data sets: Comparison of various strategies. In AAAI Workshop on Learning from Imbalanced Data Sets. Heng Ji and Ralph Grishman. 2008. Refining event extraction through unsupervised cross-document inference. In Proceedings of ACL. Thorsten Joakhims. 1999. Making large-scale svm learning practical. In B. Scholkopf, C. Burges, and A. Smola, editors, Advances in Kernel Methods - Support Vector Learning. Klein and Chistopher D. Manning. 2003. Fast exact inference with a factored model for natural language parsing. In In Advances in Neural Information Processing Systems 15 (NIPS). Aleksander Kolcz, Abdur Chowdhury, and Joshua Alspector. 2003. Data duplication: An imbalance problem. In Workshop on Learning from Imbalanced Dan Datasets, ICML. Kotsiantis, Dimitris Kanellopoulos, and Panayiotis Pintelas. 2006. Handling imbalanced datasets: A Sotiris review. In GESTS International Transactions on Computer Science and Engineering. Beth Levin. 1993. English Verb Classes and Alternations: A Preliminary Investigation. The University of Chicago Press. Alessandro Moschitti. 2004. A study on convolution kernels for shallow semantic parsing. In Proceedings of the 42nd Conference on Association for Computational Linguistic. Alessandro Moschitti. 2006a. Efficient convolution kernels for dependency and constituent syntactic trees. In Proceedings of the 1 European Conference on Ma7th chine Learning. Alessandro Moschitti. 2006b. Making tree kernels practical for natural language learning. In Proceedings of European chapter of Association for Computational Linguistics. Truc-Vien T. Nguyen, Alessandro Moschitti, and Giuseppe Riccardi. 2009. Convolution kernels on constituent, dependency and sequential structures for relation extraction. Conference on Empirical Methods in Natural Language Processing. Karin Kipper Schuler. 2005. Verbnet: A BroadCoverage, Comprehensive Verb Lexicon. Ph.D. thesis, upenncis. Gary M Weiss and Foster Provost. 2001. The effect of class distribution on classifier learning: an empirical study. Technical Report ML.TR-44, Rutgers University, August. D. Zelenko, C. Aone, and A. Richardella. 2002. Kernel methods for relation extraction. In Proceedings of the EMNLP. Min Zhang, Jie Zhang, Jian Su, and Guodong Zhou. 2006. A composite kernel to extract relations between entities with both flat and structured features. In Proceedings of COLING-ACL. Shubin Zhao and Ralph Grishman. 2005. Extracting relations with integrated information using kernel methods. In Proceedings of the 43rd Meeting of the ACL. GuoDong Zhou, Min Zhang, DongHong Ji, and QiaoMing Zhu. 2007. Tree kernel-based relation extraction with context-sensitive structured parse tree information. In Proceedings of EMNLP-CoNLL. 1034