Nati

onal In

stit

ute

of

Sci

en

ce &

Tech

nolo

gy

Algorithm to Find Hidden Links

Pradyut Kumar Mallick [1]

Under the guidance of

Mr. Indraneel Mukhopadhyay

ALGORITHM TO FIND HIDDEN LINKS IN A WEB PAGE

Presented by

Pradyut Kumar MallickRoll # IT200127292

Nati

onal In

stit

ute

of

Sci

en

ce &

Tech

nolo

gy

Algorithm to Find Hidden Links

Pradyut Kumar Mallick [2]

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.

Nati

onal In

stit

ute

of

Sci

en

ce &

Tech

nolo

gy

Algorithm to Find Hidden Links

Pradyut Kumar Mallick [3]

A cyclic hyperbolic space with hidden links

Nati

onal In

stit

ute

of

Sci

en

ce &

Tech

nolo

gy

Algorithm to Find Hidden Links

Pradyut Kumar Mallick [4]

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

Nati

onal In

stit

ute

of

Sci

en

ce &

Tech

nolo

gy

Algorithm to Find Hidden Links

Pradyut Kumar Mallick [5]

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 .

Nati

onal In

stit

ute

of

Sci

en

ce &

Tech

nolo

gy

Algorithm to Find Hidden Links

Pradyut Kumar Mallick [6]

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

Nati

onal In

stit

ute

of

Sci

en

ce &

Tech

nolo

gy

Algorithm to Find Hidden Links

Pradyut Kumar Mallick [7]

Definition of Cyclic Hierarchical Space

Nati

onal In

stit

ute

of

Sci

en

ce &

Tech

nolo

gy

Algorithm to Find Hidden Links

Pradyut Kumar Mallick [8]

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

Nati

onal In

stit

ute

of

Sci

en

ce &

Tech

nolo

gy

Algorithm to Find Hidden Links

Pradyut Kumar Mallick [9]

Hidden Link States and Processing Flow

State 1: Idle State

State 2: Activate State

Nati

onal In

stit

ute

of

Sci

en

ce &

Tech

nolo

gy

Algorithm to Find Hidden Links

Pradyut Kumar Mallick [10]

Hidden Link States and Processing Flow

State 3: Map/Unmap (move) State

State 4: Navigation State

Nati

onal In

stit

ute

of

Sci

en

ce &

Tech

nolo

gy

Algorithm to Find Hidden Links

Pradyut Kumar Mallick [11]

Hidden Link States and Processing Flow

State 5: Reset

Nati

onal In

stit

ute

of

Sci

en

ce &

Tech

nolo

gy

Algorithm to Find Hidden Links

Pradyut Kumar Mallick [12]

“Hidden Link” Client-Server Web Structure

Nati

onal In

stit

ute

of

Sci

en

ce &

Tech

nolo

gy

Algorithm to Find Hidden Links

Pradyut Kumar Mallick [13]

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

Nati

onal In

stit

ute

of

Sci

en

ce &

Tech

nolo

gy

Algorithm to Find Hidden Links

Pradyut Kumar Mallick [14]

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

Nati

onal In

stit

ute

of

Sci

en

ce &

Tech

nolo

gy

Algorithm to Find Hidden Links

Pradyut Kumar Mallick [15]

Website & Search Pattern of Hidden Links

Nati

onal In

stit

ute

of

Sci

en

ce &

Tech

nolo

gy

Algorithm to Find Hidden Links

Pradyut Kumar Mallick [16]

Hidden Link Applications

CONTENT AND USAGE MINING

CUSTOMER INTERVIEW WEB SERVICE

Nati

onal In

stit

ute

of

Sci

en

ce &

Tech

nolo

gy

Algorithm to Find Hidden Links

Pradyut Kumar Mallick [17]

<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

Nati

onal In

stit

ute

of

Sci

en

ce &

Tech

nolo

gy

Algorithm to Find Hidden Links

Pradyut Kumar Mallick [18]

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.

Nati

onal In

stit

ute

of

Sci

en

ce &

Tech

nolo

gy

Algorithm to Find Hidden Links

Pradyut Kumar Mallick [19]

Thank You!!

Nati

onal In

stit

ute

of

Sci

en

ce &

Tech

nolo

gy

Algorithm to Find Hidden Links

Pradyut Kumar Mallick [20]