Hypergeometric distribution based semantic searching technique

  • Authors:
  • N. Thakur;S. Gupta

  • Affiliations:
  • Bharati Vidyapeeth's College of Engineering, New Delhi, India;Bharati Vidyapeeth's College of Engineering, New Delhi, India

  • Venue:
  • Proceedings of the International Conference & Workshop on Emerging Trends in Technology
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Semantic Web is, without a doubt, gaining momentum in both industry and academia. The word "Semantic" refers to "meaning" -- a semantic web is a web of meaning. A web that knows what the entities on the web mean can make use of that knowledge. Why do we think that the web would be improved, if it understood the meaning of its contents? Doesn't it understand it now? Google is very good at correcting typing mistakes, figuring out what I "meant" when I miss-typed a query or suggesting keyword to expand our search query. In this paper we redefine the idea of searching related text information on web. The syntactical characters of related keywords and texts are described in detail, but it doesn't involve semantics of the keywords. Hence computers are able to determine the related keywords and texts without actually understanding the meanings or relevance of the keywords. Here Hypergeometric distribution model is used which is a discrete probability distribution that describes the number of successes in a sequence of n keywords to be searched from a finite population without replacement.