Skip to main content

S-node: A Small-World Navigation System for Exploratory Search

  • Conference paper
Information Retrieval Technology (AIRS 2009)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 5839))

Included in the following conference series:

  • 825 Accesses

Abstract

In the retrieval of newspapers or weblogs in which particular terms and expressions are used frequently, it is not easy to remind the user of appropriate query terms. For this case, it is necessary to present typical feature terms or documents in the document set without depending on the user’s input. In this paper, we propose the navigation system ‘S-node’ for documents. The system extracts two kinds of words that show exhaustivity or specificity from documents written in Japanese based on repetition index, and constructs hyperlinks between documents that can reach as short as possible to various documents based on co-occurrence of terms. We describe the implementation of the system, and the results of evaluation.

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

  • White, R., Kales, B., Ducker, S., Schraefel, M.: Supporting exploratory search. Communications of the ACM 49(4), 36–39 (2006)

    Article  Google Scholar 

  • Watts, D., Strogatz, S.: Collective dynamics of small-world networks. Nature 393(6684), 440–442 (1998)

    Article  MATH  Google Scholar 

  • Matsuo, Y., Ohsawa, Y., Ishizuka, M.: Keyworld: Extracting keywords from document s small world. In: Jantke, K.P., Shinohara, A. (eds.) DS 2001. LNCS (LNAI), vol. 2226, pp. 271–281. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  • Shirai, S., Torii, O., Kanai, T.: Keyword extraction from documents based on the string repetition acyclic graph. DBSJ Letters 4(1), 77–80 (2005)

    Google Scholar 

  • Yamada, K., Komine, H., Kinukawa, H., Nakagawa, H.: Abstract of abstract: A new summarizing method based on document frequency and clause length. In: SCI 2004. The 8th World Multi-Conference on Systemics, Cybernetics and Informatics, vol. XIV, pp. 56–61 (2004)

    Google Scholar 

  • Takeda, Y., Umemura, K.: Selecting indexing strings using adaptation. In: SIGIR 2002: Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval, pp. 427–428. ACM, New York (2002)

    Google Scholar 

  • Shimada, S., Fukuhara, T., Satoh, T.: Evaluation of comprehensive web navigation method using social network analysis. In: WebDB Forum 2008, Tokyo, Japan, 5A–2 (2008) (in Japanese)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Shimada, S., Fukuhara, T., Satoh, T. (2009). S-node: A Small-World Navigation System for Exploratory Search. In: Lee, G.G., et al. Information Retrieval Technology. AIRS 2009. Lecture Notes in Computer Science, vol 5839. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04769-5_37

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04769-5_37

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04768-8

  • Online ISBN: 978-3-642-04769-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics