1 / 19

ALGORITHM TO FIND HIDDEN LINKS IN A WEB PAGE

ALGORITHM TO FIND HIDDEN LINKS IN A WEB PAGE. 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.

libby-chambers
Download Presentation

ALGORITHM TO FIND HIDDEN LINKS IN A WEB PAGE

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. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. ALGORITHM TO FIND HIDDEN LINKS IN A WEB PAGE

  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.

  3. A cyclic hyperbolic space with hidden links

  4. A cyclic hyperbolic space with hidden links • 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.

  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 .

  6. Definitions 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.

  7. Definition of Cyclic Hierarchical Space

  8. Definition of Cyclic Hierarchical Space • Primary Path: (tree-link) “AE” • Secondary Path (non-tree/cross link) “AB • Hidden-Link Node • Primary Sub-Space Nodes • Secondary Sub-Space Nodes • Placeholder

  9. Hidden Link States and Processing Flow State 1: Idle State State 2: Activate State

  10. Hidden Link States and Processing Flow State 3: Map/Unmap (move) State State 4: Navigation State

  11. Hidden Link States and Processing Flow State 5: Reset

  12. “Hidden Link” Client-Server Web Structure

  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

  14. Algorithm • 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:

  15. Website & Search Pattern of Hidden Links

  16. Hidden Link Applications CONTENT AND USAGE MINING CUSTOMER INTERVIEW WEB SERVICE

  17. Related Work <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>

  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.

  19. Thank You!!

More Related