Skip to main content

IBRE: An Incremental Bootstrapping Approach for Chinese Appointment and Dismissal Relation Extraction

  • Conference paper
  • First Online:
Knowledge Graph and Semantic Computing: Knowledge Graph and Cognitive Intelligence (CCKS 2020)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1356))

Included in the following conference series:

  • 905 Accesses

Abstract

In the field of government affairs, Appointment and Dismissal Relation Extraction (ADRE) of officials from personnel news is crucial for updating government knowledge. However, ADRE faces great challenges, including extremely high accuracy demand, lack of data, tuple sparsity and conflict, and requiring incremental update. To address these challenges, we propose an Incremental Bootstrapping approach for Relation Extraction (IBRE) and apply it to real-time updating of personnel knowledge in government-affair Knowledge Graphs. IBRE starts with few seeds and trains with pattern generation, pattern evaluation, tuple prediction and seed augmentation in an iterative and incremental manner. First, we design a new strategy for defining seeds as document-tuple pairs to eliminate the effects of tuple sparsity and conflict. Then, a new definition of patterns with both word and part-of-speech is proposed to get high accuracy. Finally, we augment seeds with corrected tuples and apply incremental learning to continually improve performance with least training cost. We build a dataset called ADNP (Appointment and Dismissal News from People.cn) and compare our approach with baselines. Comparison results show that our approach performs the best. Moreover, experimental results demonstrate that incremental learning continuously improves the performance of IBRE.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    renshi.people.com.cn.

  2. 2.

    www.xinhuanet.com/politics/rs.htm.

References

  1. Agichtein, E., Gravano, L.: Snowball: extracting relations from large plain-text collections. Proc. ACM DL 2000, 85–94 (2000)

    Google Scholar 

  2. Brin, S.: Extracting patterns and relations from the world wide web. In: Atzeni, P., Mendelzon, A., Mecca, G. (eds.) WebDB 1998. LNCS, vol. 1590, pp. 172–183. Springer, Heidelberg (1999). https://doi.org/10.1007/10704656_11

    Chapter  Google Scholar 

  3. Hoffmann, R., Zhang, C., Ling, X., Zettlemoyer, L., Weld, D.S.: Knowledge-based weak supervision for information extraction of overlapping relations. Proc. ACL-HLT 2011, 541–550 (2011)

    Google Scholar 

  4. Jian, X., Zhixiong, Z., Zhenxin, W.: Review on techniques of entity relation extraction. Data Anal. Knowl. Disc. 24(8), 18–23 (2008)

    Google Scholar 

  5. Jiao, Z., Sun, S., Sun, K.: Chinese lexical analysis with deep Bi-GRU-CRF network. arXiv pp. arXiv-1807 (2018)

    Google Scholar 

  6. Mintz, M., Bills, S., Snow, R., Jurafsky, D.: Distant supervision for relation extraction without labeled data. Proc. ACL-IJCNLP 2009, 1003–1011 (2009)

    Article  Google Scholar 

  7. Mooney, R.J., Bunescu, R.C.: Subsequence kernels for relation extraction. NIPS 2006, 171–178 (2006)

    Google Scholar 

  8. Nguyen, T.H., Grishman, R.: Relation extraction: perspective from convolutional neural networks. Proc. NAACL-HLT 2015, 39–48 (2015)

    Google Scholar 

  9. Pawar, S., Palshikar, G.K., Bhattacharyya, P.: Relation extraction: a survey. arXiv preprint arXiv:1712.05191 (2017)

  10. dos Santos, C., Xiang, B., Zhou, B.: Classifying relations by ranking with convolutional neural networks. In: Proceedings of ACL-IJCNLP 2015, vol. 1, Long Papers, pp. 626–634 (2015)

    Google Scholar 

  11. Socher, R., Huval, B., Manning, C.D., Ng, A.Y.: Semantic compositionality through recursive matrix-vector spaces. Proc. EMNLP-CoNLL 2012, 1201–1211 (2012)

    Google Scholar 

  12. Song, Y., Shi, S., Li, J., Zhang, H.: Directional skip-gram: explicitly distinguishing left and right context for word embeddings. In: Proceedings of NAACL HLT 2018, vol. 2 (Short Papers), pp. 175–180 (2018)

    Google Scholar 

  13. Yao, L., Haghighi, A., Riedel, S., McCallum, A.: Structured relation discovery using generative models. In: proceedings of EMNLP 2011, pp. 1456–1466 (2011)

    Google Scholar 

  14. Yoo, S., Jeong, O.: Automating the expansion of a knowledge graph. Expert Syst. Appl. 141, 112965 (2020)

    Article  Google Scholar 

  15. Zelenko, D., Aone, C., Richardella, A.: Kernel methods for relation extraction. J. Mach. Learn. Res. 3, 1083–1106 (2003)

    MathSciNet  MATH  Google Scholar 

  16. Zeng, D., Liu, K., Lai, S., Zhou, G., Zhao, J.: Relation classification via convolutional deep neural network. In: Proceedings of COLING 2014: Technical Papers, pp. 2335–2344 (2014)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Changliang Li .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Mao, L., Wang, M., Li, C., Fan, J., Hou, C. (2021). IBRE: An Incremental Bootstrapping Approach for Chinese Appointment and Dismissal Relation Extraction. In: Chen, H., Liu, K., Sun, Y., Wang, S., Hou, L. (eds) Knowledge Graph and Semantic Computing: Knowledge Graph and Cognitive Intelligence. CCKS 2020. Communications in Computer and Information Science, vol 1356. Springer, Singapore. https://doi.org/10.1007/978-981-16-1964-9_11

Download citation

  • DOI: https://doi.org/10.1007/978-981-16-1964-9_11

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-16-1963-2

  • Online ISBN: 978-981-16-1964-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics