There is such a thing as InfluenceRank and it is relevant to social media as a whole. It is very difficult to rank users, find authority blogs and to create any sort of order in this world as a whole. It is important though because existing ranking algorithms are mostly made for digital libraries an[...]
Archive for the ‘Ranking algorithms’ Category
Bounce rate & Google
There is an excellent post over at Search Engine called “9 Reasons Your Website Can Have a High Bounce Rate“. There’s a lot more to say about “Bounce rate” which I might launch into in another post, but for now we’ll focus on this one. The author of the post does [...]
Papers on PageRank you should read
PageRank is a standard and much discussed topic in SEO and while it is relevant, the methods and techniques discussed are often not. There is a lot of discussion around the original PageRank formula which is relevant, but there have been many changes and improvements since 1998. If you are an SEO w[...]
Ranking by semantic similarity
A useful method is presented in “Categorizing and Ranking Search Engine’s Results by Semantic Similarity” by Tianyong Hao, Zhi Lu, Shitong Wang, Tiansong Zou, Shenhua GU, Liu Wenyin (University Hong Kong). Google ranks results according to page relevance and importance. This importance[...]
G patent: Autocompletion using ranked results
“Method and system for autocompletion using ranked results” is a patent granted to Google on the 3rd of February 2009. Their invention is to process query information received from a user prior to the user having indicated that the query is completed. So just as we have seen with the s[...]
BookRank
“Remembering what we like: Toward an agent-based model of Web traffic” by Bruno Gonçalves & Mark R. Meiss (Indiana University) and José J. Ramasco (CNLL, ISI foundation, Turin) is a paper due to be presented at WSDM 2009. The PageRank model is “Markovian” meaning tha[...]
The RankMass crawler
The paper entitled “RankMass Crawler: A Crawler with High Personalized PageRank Coverage Guarantee” (Cho, Schonfeld, University of California) deals with the important topic of how many pages should be collected to cover most of the web, and how to ensure that important documents are [...]

