[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content

An Iterative Approach to Keywords Extraction

  • Conference paper
Advances in Swarm Intelligence (ICSI 2012)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7332))

Included in the following conference series:

Abstract

It is fundamental and important task to extract keyword form documents. Existing methods mainly use statistical or linguistic information to extract the most salient keyword from document. However, those methods ignore the relationship between different granularities (i.e., relationship between word, sentence, and topic). In order to capture and make better use of their relationships between these granularities, this paper proposed an iterative approach for keyword extraction. The method is first implemented by constructing a graph which reflect relationship between different size of granularity nodes, and then using iterative algorithm to calculate score of keywords. Finally, highest score of words in the document will be chosen as keywords. Experimental results show that our approach outperforms baseline methods.

This paper is funded by College science and technology projects in Shanxi Province china under grant 20110015.

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

Access this chapter

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
GBP 19.95
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
GBP 35.99
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
GBP 44.99
Price includes VAT (United Kingdom)
  • 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Turney, P.D.: Learning algorithms for keyphrase extraction. Information Retrieval 2, 303–336 (2000)

    Article  Google Scholar 

  2. Barker, K., Cornacchia, N.: Using nounphrase heads to extract document keyphrases. In: Canadian Conference on AI (2000)

    Google Scholar 

  3. Frank, E., Paynter, G.W., Witten, I.H., Gutwin, C., Nevill-Manning, C.G.: Domain-specific keyphrase extraction. In: Proceedings of IJCAI 1999, pp. 668–673 (1999)

    Google Scholar 

  4. Mihalcea, R., Tarau, P.: TextRank: Bringing order into texts. In: Proceedings of EMNL 2004 (2004)

    Google Scholar 

  5. Page, L., Brin, S., Motwani, R., Winograd, T.: The pagerank citation ranking: Bringing order to the web. Technical report, Stanford Digital Libraries (1998)

    Google Scholar 

  6. Muñoz, A.: Compound key word generation from document databases using a hierarchical clustering ART model. Intelligent Data Analysis 1(1) (1996)

    Google Scholar 

  7. Pedersen, T., Patwardhan, S., Michelizzi, J.: WordNet:Similarity – Measuring the relatedness of concepts. In: Proceedings of AAAI 2004 (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wei, Y. (2012). An Iterative Approach to Keywords Extraction. In: Tan, Y., Shi, Y., Ji, Z. (eds) Advances in Swarm Intelligence. ICSI 2012. Lecture Notes in Computer Science, vol 7332. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31020-1_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31020-1_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31019-5

  • Online ISBN: 978-3-642-31020-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics