By Topic

Detecting sequences and cycles of Web pages

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Narayan, B.L. ; Machine Intelligence Unit, Indian Stat. Inst., Calcutta, India ; Pal, S.K.

Cycle detection in graphs and digraphs has received wide attention and several algorithms are available for this purpose. While the Web may be modeled as a digraph, such algorithms would not be of much use due to both the scale of the Web and the number of uninteresting cycles and sequences in it. We propose a novel sequence detection algorithm for Web pages, and highlight its importance for search related systems. Here, the sequence found is such that its consecutive elements have the same relation among them. This relation is measured in terms of the positional properties of navigational links, for which we provide a method for identifying navigational links. The proposed methodology does not detect all possible sequences and cycles in the Web graph, but just those that were intended by the creators of those Web pages. Experimental results confirm the accuracy of the proposed algorithm.

Published in:

Web Intelligence, 2005. Proceedings. The 2005 IEEE/WIC/ACM International Conference on

Date of Conference:

19-22 Sept. 2005