Identify the ranking algorithms of search engines

Food for thought


When some time working in the field of SEO, sooner or later, involuntarily thoughts of what the formulas use the search engines to place a website in search results above or below. We all know that it is all stored in the deepest secrecy, and we, SEOs, we know only what is written in the recommendations for webmasters, and some resources dedicated to promotion of sites. Now think for a second: what if you had a tool that reliably accurate in 80-95% would show what needs to be done on the page of your website, or website in General, in order to a certain search your site on the first positions in the issuance, or the fifth, or just on the first page. Moreover, if this tool could with the same accuracy to determine on what position the issue will end up if you perform certain actions. And as soon as the search engine would be change in your formula would have changed the importance of a factor, it would be possible to see what exactly the formula was changed. And this is only a small fraction of the information that you could obtain from such a tool.

So, this is not advertising of another service to promote, and is not providing a specific formula for ranking sites by search engines. I want to share my theory on the realization of which I have neither the means nor the time, nor sufficient knowledge of programming and mathematics. But I do know that even those who have it all, the realization of this may take not even 1 a month, maybe 1-1. 5 years.

Theory


So, the theory is that random finger to the sky to figure out which factor affects the position more or less of another factor. On your toes is to tell very difficult, so I had to make a table that more or less shows what I want to convey.br>
image

Looked at the table? Now down to business. Take any key phrase, it does not matter what you enter in search engine and from the issuance take the first 10 sites, this will be our test subjects. Now we need to do the following: to write code that will at random change the significance of the factors (DF in the table) ranking as long as our program does not arrange the sites in such a way that they would exactly coincide with the results of the search engine. We have at random to repeat the ranking algorithm of a search engine. The significance of the factors themselves, we can only define as positive, neutral or negative.

Now, in order on the table and factors. Conventionally, each factor is assigned a value from 1 to 800 (approximately). Since it is known that in Yandex, for example, ranking factors somewhere close to this number. Roughly speaking, we have the maximum number will be how much ranking factors we do know. The two factors may not be the same number, that is, each factor value is unique. In the table for each factor separate kolodochka, and a lot of them, physically I fail at the picture, everything place.

Now the question is how to calculate page rank? Very simple: for starters, simple math, if the factor has a positive effect the page rank add rank factor, if negative, then add 0. Can be more difficult to make 3 choices and add, for example, subtraction of a rank factor from a page rank, if this factor is critical, for example, the rough key phrase spam.

We have obtained about the algorithm for calculating page rank. We'll go for (PR), and the factor will take as (F) and then

PR = Take the first factor If F1 is positive, to do PR + F1, if F1 is negative then do PR — F1, if F1 is neutral, then doing nothing, then check the same F2, F3, F4 and so on, until the factors end.
And the selection carried out so that each factor is to try each value of rank. That is, to each factor to test each value.
The whole difficulty is to take into account all the influencing factors, up to the amount of text on the page and the TIC website, which is the link to our lab page, and the complexity is not even in the light of this information, and its collection. Because manually collect all of this information is unrealistic, you need to write all the parsers, our program collected all these data automatically.

The work is very large and complex and requires a certain level of knowledge, but just imagine what opportunities it will open after implementation. I won't go into all the details of the calculations and the influence of factors not like a lot of scribbling, I find it easier to explain to the person directly.

Now some will say that a match will be a lot of different variations. Yes, it will, but if you take not the first page, and, for example, the first 50 pages? How many times then reduced the probability of a miss?

Still there is the difficulty that some factors we simply have nowhere to take, for example, we may not be able to account for behavioral factors. Even if all the sites of the issue will be under our control, we will not be able to do that, because most likely, it is considered how the user behaves on the results, hence there is the second unknown in our equation, in addition to the position.

That will give us this software after implementation? No, the exact formula of the search engine, he will not, but will tell you exactly which factors affect the ranking is stronger, and what is not significant. And with the promotion we can in this formula to substitute page in your site, with your settings, before to start promotion, we will see what position will be a page for a particular query after the search will take into account all changes.

In General, this is a very complex topic and very useful information for the mind, because it makes one think, enough, for example, a single computer for such computations? And if enough, how much time will it take for example? If you are not satisfied with the result, the formula as it is possible to complicate, to change until you 100% accurate results on 100 pages of output. Moreover, it is possible for the experiment to connect about 100 different sites and implement them on a non-existent key phrase and then for the same keyword phrase and to keep track of the algorithm. The mass of options. You need to work.
Article based on information from habrahabr.ru

Комментарии

Отправить комментарий

Популярные сообщения из этого блога

Integration of PostgreSQL with MS SQL Server for those who want faster and deeper

Изображение
Recently habré was already published integration PostgreSQL and MSSQL. But, items there is categorically not enough. Therefore, the objectives of this publication are the following: the the to broaden and deepen publicly available information about FDW for MSSQL-called tds_fdw to tell the difference in major versions and describe basic compatibility issues; the to talk about the possibilities of optimization of queries that use the foreign table; the to address the subject of caching external data in a materialized view; the to say a few words about the exotic ways to integrate PostgreSQL and MSSQL. the Installing and configuring TDS FDW The guys from PostgresPro already sufficiently said about this process, I will not repeat. Will leave a few links to the official PostgreSQL documentation and examples from tds_fdw: the the creating an extension (extension) in PG: off.dokumentacija ; the server: off.documentation , example of tds_fdw ; the creating ...
Далее...

Custom database queries in MODx Revolution

This topic will certainly be useful for those who have quite a lot of projects on MODx Revolution, as with the usual sites of business cards is enough and the standard working methods of a La $modx- > getObject() , $modx->getCollection() , etc., and these methods are inherently not just a job database, but also with the objects of MODx. When working with large projects methods a La $modx- > getCollection() for us is not the best solution for two reasons: 1. The overexpenditures. These methods are not just getting data from DB, but also create instance of the retrieved objects. In this case, getting information about 10000 documents, we get 10000 objects of modResource that it is not very cool. 2. The task is complicated by the count of records. In addition to the direct difficulties of counting even at the query level, even if you get 10 records of the same document (for example), MODx will return as a result only one object modResource. Although often that will su...
Далее...

Google Web Mercator: a mixed coordinate system

Изображение
the First of October 2014, the us National Geospatial-Intelligence Agency ( NGA ) has published report , which contained criticism of the coordinate system of the Web Mercator used in the web mapping services. The document was accompanied by a detailed explanation of the problem and recommendations for partners NGA. The document received a great response, but not all articles based on this report, very accurate and literate presentation. This applies, for example, articles on the website of the GIS Association, which, because of gross errors in terminology, can be considered illiterate. Because this coordinate system the developers of web services face more often, I think it makes sense to understand the problem. what is it? For a start, a couple definitions, without which some of the details may not be clear. It is important to understand that Web Mercator is the coordinate system, not only the projection, although its name is similar to many well-known Mercator projection...
Далее...