Algorithm to find hidden links in a web page

3,337 views

Published on

Published in: Technology, Design
0 Comments
0 Likes
Statistics
Notes
  • Be the first to comment

  • Be the first to like this

No Downloads
Views
Total views
3,337
On SlideShare
0
From Embeds
0
Number of Embeds
2
Actions
Shares
0
Downloads
11
Comments
0
Likes
0
Embeds 0
No embeds

No notes for slide

Algorithm to find hidden links in a web page

  1. 1. ALGORITHM TO FIND HIDDEN LINKS IN A WEB PAGE
  2. 2. INTRODUCTION <ul><li>Hidden links are ones that real people aren’t supposed to actually notice or click on </li></ul><ul><li>Hidden links is a way to guide a search engine to our doorway pages. </li></ul><ul><li>New dynamic “hidden link” technique for linking a large highly connected graph in a simple hyperbolic space without cluttering the display. </li></ul>[ ]
  3. 3. A CYCLIC HYPERBOLIC SPACE WITH HIDDEN LINKS [ ]
  4. 4. A CYCLIC HYPERBOLIC SPACE WITH HIDDEN LINKS <ul><li>In a hyperbolic space, the far away nodes/edges (paths) are diminished when the user is not focusing on them. </li></ul><ul><li>The user can dynamically warp the display to focus on thousands of different nodes for navigation . </li></ul><ul><li>This graph is a non-cyclic hierarchical hyperbolic structure without multiple connected paths. </li></ul>[ ]
  5. 5. NEW TECHNIQUE <ul><li>The user can easily navigate through all possible paths without tracing many lines and intersections </li></ul><ul><li>Robot programs called spiders create search engine databases, computer robot programs that crawl the web seeking search engine content </li></ul><ul><li>Pages created as the result of a search are called &quot;dynamically generated&quot; pages . </li></ul>[ ]
  6. 6. <ul><li>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 . </li></ul>[ ] Definitions
  7. 7. DEFINITION OF CYCLIC HIERARCHICAL SPACE [ ]
  8. 8. DEFINITION OF CYCLIC HIERARCHICAL SPACE <ul><li>Primary Path: (tree-link) “ AE ” </li></ul><ul><li>Secondary Path (non-tree/cross link) “ AB </li></ul><ul><li>Hidden-Link Node </li></ul><ul><li>Primary Sub-Space Nodes </li></ul><ul><li>Secondary Sub-Space Nodes </li></ul><ul><li>Placeholder </li></ul>[ ]
  9. 9. HIDDEN LINK STATES AND PROCESSING FLOW <ul><li>State 1: Idle State </li></ul><ul><li>State 2: Activate State </li></ul>[ ]
  10. 10. HIDDEN LINK STATES AND PROCESSING FLOW <ul><li>State 3: Map/Unmap (move) State </li></ul><ul><li>State 4: Navigation State </li></ul>[ ]
  11. 11. HIDDEN LINK STATES AND PROCESSING FLOW <ul><li>State 5: Reset </li></ul>[ ]
  12. 12. “ HIDDEN LINK ” CLIENT-SERVER WEB STRUCTURE [ ]
  13. 13. CODE <ul><li>The basic link tag looks something like <a href=&quot;hidden.html&quot;>click here</a>. </li></ul><ul><li><a href=&quot;hidden.html&quot; style=&quot;cursor:help&quot;> </li></ul><ul><li><a href=&quot;hidden.html&quot; style=&quot;color:#FF0080&quot;> </li></ul><ul><li><a href=&quot;hidden.html&quot; style=&quot;text-decoration:none&quot;> </li></ul>[ ] Cursor Type ………… . auto …………… crosshair …………… hand
  14. 14. <ul><li>Build hash table of links in the website. </li></ul><ul><li>Partition web log by visitor </li></ul><ul><li>For each visitor, partition web log file such that each subsequence terminates in a target page. </li></ul><ul><li>For each visitor and target page, find any expected locations for that page: </li></ul>[ ] Algorithm
  15. 15. [ ] Website & Search Pattern of Hidden Links
  16. 16. HIDDEN LINK APPLICATIONS <ul><li>CONTENT AND USAGE MINING </li></ul><ul><li>CUSTOMER INTERVIEW WEB SERVICE </li></ul>[ ]
  17. 17. <ul><li><div id=&quot;Links0&quot; style=&quot;LEFT:0px;TOP:0px; VISIBILITY:hidden; POSITION: absolute;&quot;> <a href=&quot;index1.htm&quot;>hasdf hdkfh afhkj </a> <a href=&quot;index2.htm&quot;>kjhf haksf hkasf </a> <a href=&quot;index3.htm&quot;>kjhkjdf khdkf haf</a> <a href=&quot;index4.htm&quot;>ghdf gdjf kgdf</a> </li></ul>[ ] Related Work
  18. 18. [ ] Conclusion <ul><li>The hidden link technique enables the mining of large hierarchies with multiple secondary paths </li></ul><ul><li>Hidden link enables the user to easily navigate through different links without being overwhelmed with large member of nodes and paths. </li></ul>
  19. 19. <ul><li>Thank You!! </li></ul>[ ]

×