Introduction to Machine Learning for SEO
- Marketing and SEO implementations of entity and sentiment analysis
- Marketing and SEO Implementations of fuzzy matching
- Marketing and SEO implementations of ML classification
NEW: AI Search Optimisation and Agentic SEO Course by Beatrice Gamba -> Immediate start, on-demand learning for how to optimise for discovery in agentic search ✨ ✨
ML Models & Algorithms
In shortPageRank is the link analysis algorithm behind early Google that scores a page's importance from the number and importance of the pages linking to it.
PageRank is an algorithm that scores how important a page is based on the links pointing to it. It was described by Larry Page and Sergey Brin at Stanford in 1998 and became one of the foundations of Google Search. The core idea is that a link is a vote, and votes from important pages count for more than votes from obscure ones.
Imagine a “random surfer” who clicks links at random and occasionally jumps to a random page. A page’s PageRank is the probability that the surfer is on it at any moment. Each page shares its score across the pages it links to, so a page linked from many well-linked pages accumulates a high score. A damping factor (classically 0.85) models the chance of jumping to a random page instead of following a link. The scores are calculated by iterating over the whole link graph until they settle.
Google stopped showing public Toolbar PageRank scores in 2016, but has said that PageRank, in evolved forms, is still one of many signals in its ranking systems. The same maths is widely used outside search as a measure of how central a node is in any graph, including entity and knowledge graphs.
A crawl of a 2,000-page site is loaded into networkx and PageRank is calculated on the internal link graph. The top pages are the homepage, category hubs and two old blog posts that the main navigation still links to. A key product guide sits near the bottom, which leads the team to link it from the relevant hubs.