Acronym extraction using SVM with Uneven Margins

Weijian Ni, Tong Liu, Jun Xu, Yalou Huang, Jianye Ge

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Scopus citations

Abstract

Extracting acronyms and their expansions from plain text is an important problem in text mining. Previous research shows that the problem can be solved via machine learning approaches. That is, converting the problem of acronym extraction to binary classification. We investigate the classification problem and find that the classes are highly unbalanced (the positive instances are very rare compared to negative ones). So we try to tackle the problem using an uneven margin classifier - SVM with Uneven Margins. Experimental results showed that our approach can get better results than baseline methods of using heuristic rules and conventional SVM models. Experimental results also showed how uneven margins classifier made the tradeoff between the precision and recall of extraction.

Original languageEnglish
Title of host publicationProceedings - 2010 IEEE 2nd Symposium on Web Society, SWS 2010
Pages132-138
Number of pages7
DOIs
StatePublished - 23 Dec 2010
Event2010 IEEE 2nd Symposium on Web Society, SWS 2010 - Beijing, China
Duration: 16 Aug 201017 Aug 2010

Publication series

NameProceedings - 2010 IEEE 2nd Symposium on Web Society, SWS 2010

Conference

Conference2010 IEEE 2nd Symposium on Web Society, SWS 2010
CountryChina
CityBeijing
Period16/08/1017/08/10

Fingerprint Dive into the research topics of 'Acronym extraction using SVM with Uneven Margins'. Together they form a unique fingerprint.

  • Cite this

    Ni, W., Liu, T., Xu, J., Huang, Y., & Ge, J. (2010). Acronym extraction using SVM with Uneven Margins. In Proceedings - 2010 IEEE 2nd Symposium on Web Society, SWS 2010 (pp. 132-138). [5607463] (Proceedings - 2010 IEEE 2nd Symposium on Web Society, SWS 2010). https://doi.org/10.1109/SWS.2010.5607463