Alpha, Epsilon, and the Dangling Node

So I stayed up quite late last night along with Alex Koz and Maria Rabinovich trying to full understand the details of the pageranking algorithm. Unfortunately, I found it too dense and could not fully grasp the inner-workings of the system. So, I cannot confidently speak to that.

However, it is interesting to consider the basic principle behind page-raking search and their implications when utilized by, say, Google. The PageRanking algorithm naturally provides users with the most popular results for their search term, which will gravitate more towards the “average,” constituting those pages that garner mass interest. But, that is not necessarily what we want at all times. Sometimes, you may want to find more unique or original results. We propose a new kind of search engine, thedanglingnode.com.

The Dangling Node would provide users with the most unique, original, and hip search results possible. One issue we found with the PageRanking system is that the more people use Google to find pages, the more people will point to the page that they find, reinforcing those pages’ popularity and ranking status perpetually. As a result, you are likely to get the same old boring results indefinitely, making it down right impossible to discover anything really new or interesting on the internetz. An interesting side-effect of the Dangling Node would be that the more popular a page gets, the less likely it is to be returned as a high-ranking result, in effect always giving users new and interesting search results.

 

This entry was posted in Learning Bit by Bit. Bookmark the permalink.

Leave a Reply

Your email address will not be published. Required fields are marked *

*

You may use these HTML tags and attributes: <a href="" title=""> <abbr title=""> <acronym title=""> <b> <blockquote cite=""> <cite> <code> <del datetime=""> <em> <i> <q cite=""> <strike> <strong>