Web Searching With Logarithmic and Probability Measure

The web is a huge and highly dynamic environment which is growing exponentially in content and developing fast in structure. No search engine can cover the whole web, but it has to focus on the most valuable pages for crawling. Many methods have been developed based on link and text analysis for ret...

Full description

Saved in:
Bibliographic Details
Published in:International journal of computer applications 2013-01, Vol.64 (6), p.16-19
Main Authors: Devi, S Subatra, Abdul Khader, P Sheik
Format: Article
Language:English
Subjects:
Algorithms
Dynamics
Links
Probabilistic methods
Probability theory
Search engines
Searching
Texts
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The web is a huge and highly dynamic environment which is growing exponentially in content and developing fast in structure. No search engine can cover the whole web, but it has to focus on the most valuable pages for crawling. Many methods have been developed based on link and text analysis for retrieving the pages. In this paper, an algorithm based on link, text, logarithmic distance and probabilistic measure is presented to find the relevancy of the web pages. Here, the most relevant pages are retrieved. It has been proved experimentally that this method provides more number of relevant pages.
ISSN:0975-8887
0975-8887
DOI:10.5120/10638-5380