Skip to main content

VPRSM Approach to WEB Searching

  • Conference paper
  • First Online:
Rough Sets and Current Trends in Computing (RSCTC 2002)

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

Included in the following conference series:

Abstract

An information retrieval methodology based on variable precision rough set model (VPRSM) is proposed. In the methodology, both queries and documents are represented as rough sets. The documents are relevance-ranked using rough set theory algebraic operators. The results of preliminary tests with the system WebRank for retrieving Web pages are also reported.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. P. Das-Gupta. “Rough Sets and Information Retrieval”. Proc. of 11th Conference on R&D in Information Retrieval, ACM SIGIR, Grenoble, pp. 567–581, 1988.

    Chapter  Google Scholar 

  2. T. B. Ho, and K. Furakoshi. “Information Retrieval Using Rough Sets”. Journal of Japanese Society for AI, Vol. 23, No. 102, 1990.

    Google Scholar 

  3. Z. Pawlak. Rough Set: Theoretical Aspects of Reasoning about Data, Kluwer Academic Publishers, 1991.

    Google Scholar 

  4. J. Van. Rijsbergen. Information Retrieval, London: Butterworth, 1979.

    Google Scholar 

  5. G. Salton and M. J. McGill. Introduction to Modern Information Retrieval, McGraw-Hill Book Company, 1983.

    Google Scholar 

  6. G. Salton. Dynamic Information and Library Processing, Prentice-Hall Inc., Englewood Cliffs, New Jersey, 1975.

    Google Scholar 

  7. S. K. M. Wong and W. Ziarko. “A Machine Learning Approach to Information Retrieval”. Proceeding of 1986 ACM SIGIR Conference, Italy, pp. 228–233, 1986.

    Google Scholar 

  8. W. Ziarko. “Variable Precision Rough Sets Model”, Journal of Computer and Systems Sciences, Vol. 46. No. 1, pp. 39–59, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  9. J. Katzberg and W. Ziarko. “Variable Precision Rough Sets with Asymmetric Bounds”, in Rough Sets, Fuzzy Sets and Knowledge Discovery, Springer Verlag, pp. 167–177, 1994.

    Google Scholar 

  10. X. Fei. “WebRank: A Web Ranked Query System Based on Rough Sets”. M.Sc. thesis, University of Regina, 2001.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ziarko, W., Fei, X. (2002). VPRSM Approach to WEB Searching. In: Alpigini, J.J., Peters, J.F., Skowron, A., Zhong, N. (eds) Rough Sets and Current Trends in Computing. RSCTC 2002. Lecture Notes in Computer Science(), vol 2475. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45813-1_68

Download citation

  • DOI: https://doi.org/10.1007/3-540-45813-1_68

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44274-5

  • Online ISBN: 978-3-540-45813-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics