首页    期刊浏览 2024年11月23日 星期六
登录注册

文章基本信息

  • 标题:Recognizing Indonesian Acronym and Expansion Pairs with Supervised Learning and MapReduce
  • 本地全文:下载
  • 作者:Taufik Fuadi Abidin ; Amir Mahazir ; Muhammad Subianto
  • 期刊名称:Information
  • 电子版ISSN:2078-2489
  • 出版年度:2020
  • 卷号:11
  • 期号:4
  • 页码:210-222
  • DOI:10.3390/info11040210
  • 出版社:MDPI Publishing
  • 摘要:During the previous decades, intelligent identification of acronym and expansion pairs from a large corpus has garnered considerable research attention, particularly in the fields of text mining, entity extraction, and information retrieval. Herein, we present an improved approach to recognize the accurate acronym and expansion pairs from a large Indonesian corpus. Generally, an acronym can be either a combination of uppercase letters or a sequence of speech sounds (syllables). Our proposed approach can be computationally divided into four steps: (1) acronym candidate identification; (2) acronym and expansion pair collection; (3) feature generation; and (4) acronym and expansion pair recognition using supervised learning techniques. Further, we introduce eight numerical features and evaluate their effectiveness in representing the acronym and expansion pairs based on the precision, recall, and F-measure. Furthermore, we compare the k-nearest neighbors (K-NN), support vector machine (SVM), and bidirectional encoder representations from transformers (BERT) algorithms in terms of accurate acronym and expansion pair classification. The experimental results indicate that the SVM polynomial model that considers eight features exhibits the highest accuracy (97.93%), surpassing those of the SVM polynomial model that considers five features (90.45%), the K-NN algorithm with k = 3 that considers eight features (96.82%), the K-NN algorithm with k = 3 that considers five features (95.66%), BERT-Base model (81.64%), and BERT-Base Multilingual Cased model (88.10%). Moreover, we analyze the performance of the Hadoop technology using various numbers of data nodes to identify the acronym and expansion pairs and obtain their feature vectors. The results reveal that the Hadoop cluster containing a large number of data nodes is faster than that with fewer data nodes when processing from ten million to one hundred million pairs of acronyms and expansions.
  • 关键词:acronym and expansion pair recognition; feature vectors; mapreduce; supervised learning techniques acronym and expansion pair recognition ; feature vectors ; mapreduce ; supervised learning techniques
国家哲学社会科学文献中心版权所有