Skip to main content

KeyWorld:Extracting Keywords from Document s Small World

  • Conference paper
  • First Online:
Discovery Science (DS 2001)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2226))

Included in the following conference series:

Abstract

The small world topology is known widespread in biological, social and man-made systems. This paper shows that the small world structure also exists in documents,such as papers. A document is represented by a network;the nodes represent terms,and the edges represent the co-occurrence of terms. This network is shown to have the characteristics of being a small world,i.e.,nodes are highly clustered yet the path length between them is small. Based on the topology,we develop an indexing system called KeyWorld,which extracts important terms by measuring their contribution to the graph being small world.

A term is a word or a word sequence.

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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Albert, H. Jeong,and A.-L. Barabasi.The diameter of the World Wide Web. Nature,401,1999.

    Google Scholar 

  2. L.C. Freeman.Centrality in social networks:Conceptual clarification.Social Networks,1:215–239,1979.

    Google Scholar 

  3. M. Granovetter.Strength of weak ties.American Journal of Sociology,78:1360–1380,1973.

    Google Scholar 

  4. H. Kautz, B. Selman,and M. Shah.The hidden Web.AI magagine,18(2),1997.

    Google Scholar 

  5. S. Milgram.The small-world problem.Psychology Today,2:60–67,1967.

    Google Scholar 

  6. Y. Ohsawa, N.E. Benson,and M. Yachida.KeyGraph:Automatic indexing by co-occurrence graph based on building construction metaphor. In Proc. Advanced Digital Library Conference (IEEE ADL’ 98),1998.

    Google Scholar 

  7. Y. Ohsawa and M. Yachida.Discover risky active faults by indexing an earthquake sequence. In Proc. Discovery Science,pages 208–219,1999.

    Google Scholar 

  8. G. Salton.Automatic Text Processing. Addison-Wesley,1988.

    Google Scholar 

  9. T. Walsh.Search in a small world. In Proc. IJCAI’ 99,pages 1172–1177,1999.

    Google Scholar 

  10. D. Watts.Small worlds:the dynamics of networks between order and randomness. Princeton,1999.

    Google Scholar 

  11. D. Watts and S. Strogatz.Collective dynamics of small-world networks.Nature, 393:440–442,1998.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Matsuo, Y., Ohsawa, Y., Ishizuka, M. (2001). KeyWorld:Extracting Keywords from Document s Small World. In: Jantke, K.P., Shinohara, A. (eds) Discovery Science. DS 2001. Lecture Notes in Computer Science(), vol 2226. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45650-3_24

Download citation

  • DOI: https://doi.org/10.1007/3-540-45650-3_24

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42956-2

  • Online ISBN: 978-3-540-45650-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics