slide1 n.
Download
Skip this Video
Download Presentation
Under the guidance of Mr. Indraneel Mukhopadhyay

Loading in 2 Seconds...

play fullscreen
1 / 20

Under the guidance of Mr. Indraneel Mukhopadhyay - PowerPoint PPT Presentation


  • 84 Views
  • Uploaded on

ALGORITHM TO FIND HIDDEN LINKS IN A WEB PAGE. Under the guidance of Mr. Indraneel Mukhopadhyay. Presented by Pradyut Kumar Mallick Roll # IT200127292. Hidden links are ones that real people aren’t supposed to actually notice or click on

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about 'Under the guidance of Mr. Indraneel Mukhopadhyay' - brooke-fowler


Download Now An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
slide1

ALGORITHM TO FIND HIDDEN LINKS IN A WEB PAGE

Under the guidance of

Mr. Indraneel Mukhopadhyay

Presented by

Pradyut Kumar Mallick

Roll # IT200127292

introduction
Hidden links are ones that real people aren’t supposed to actually notice or click on

Hidden links is a way to guide a search engine to our doorway pages.

New dynamic “hidden link” technique for linking a large highly connected graph in a simple hyperbolic space without cluttering the display.

Introduction
a cyclic hyperbolic space with hidden links1
In a hyperbolic space, the far away nodes/edges (paths) are diminished when the user is not focusing on them.

The user can dynamically warp the display to focus on thousands of different nodes for navigation.

This graph is a non-cyclic hierarchical hyperbolic structure without multiple connected paths.

A cyclic hyperbolic space with hidden links
new technique
The user can easily navigate through all possible paths without tracing many lines and intersections

Robot programs called spiders create search engine databases, computer robot programs that crawl the web seeking search engine content

Pages created as the result of a search are called "dynamically generated" pages .

New Technique
slide6
In a directed non-cyclic hierarchical space, there is a primary graph, which links all the nodes in a tree form. These links are primary tree links. The others are non-tree/cross links in a highly connected graph. A node can have one incoming primary link and many non-tree/cross links.

Definitions

definition of cyclic hierarchical space1
Primary Path: (tree-link) “AE”

Secondary Path (non-tree/cross link) “AB

Hidden-Link Node

Primary Sub-Space Nodes

Secondary Sub-Space Nodes

Placeholder

Definition of Cyclic Hierarchical Space
slide13
Code
  • The basic link tag looks something like <a href="hidden.html">click here</a>.
  • <a href="hidden.html" style="cursor:help">
  • <a href="hidden.html" style="color:#FF0080">
  • <a href="hidden.html" style="text-decoration:none">

Cursor Type…………. auto

……………crosshair

……………hand

slide14
Build hash table of links in the website.

Partition web log by visitor

For each visitor, partition web log file such that each subsequence terminates in a target page.

For each visitor and target page, find any expected locations for that page:

Algorithm

slide17
<div id="Links0" style="LEFT:0px;TOP:0px; VISIBILITY:hidden; POSITION: absolute;"><a href="index1.htm">hasdf hdkfh afhkj </a><a href="index2.htm">kjhf haksf hkasf </a><a href="index3.htm">kjhkjdf khdkf haf</a><a href="index4.htm">ghdf gdjf kgdf</a>

Related Work

slide18

Conclusion

The hidden link technique enables the mining of large hierarchies with multiple secondary paths

Hidden link enables the user to easily navigate through different links without being overwhelmed with large member of nodes and paths.