Vol 10 Chapter 3825: hits algorithm

Waved to the staff next to him, and soon 5 whiteboards were carried to the report table.
They prepared a lot for the white board, and the original plan was for Qin Luo.
Unexpectedly, he used Jon Kleinberg first.
"Thank you." Jon Kleinberg thanked him, then looked at everyone: "Before I formally demonstrate, I want to talk to you about what the HITS algorithm is."
"This is a brand-new calculation model. When the user enters a keyword, the algorithm calculates two values ​​for the returned matching page. One is the pivot value and the other is the authority value. The pivot value refers to all the values ​​on the page. The sum of the authoritative value of the page that the export link points to. The authoritative value refers to the sum of the hub of the page where all imported links are located...
"Compared with the traditional pagerangk algorithm, the HITS algorithm can better describe the organizational characteristics of the Internet, and the convergence speed is faster, reducing the search time..."
"..."
With eloquence, Jon Kleinberg briefly explained the advantages of the hist algorithm.
There is a lot of content, but it boils down to two sentences.
The HITS algorithm reacts faster and takes less time.
After a brief introduction to the HITS algorithm, Jon Kleinberg began to make a formal report.
"I think so, submit the query q to the retrieval system based on keyword query, take the first n webpages (such as n=200) from the set of returned result pages, as the root set, record it as S, then S satisfies :
"The number of pages in 1.S is small"
"The webpages in 2.S are webpages related to query q"
"The pages in 3.S contain more authoritative pages"
"..."
"By adding web pages referenced by S and web pages referencing S to S, S is expanded into a larger set T. The Hub web pages in T are used as the vertex set V1, and the authoritative web pages are used as the vertex set V2..."
"The hyperlink from the webpage in V1 to the webpage in V2 is the edge set E, forming a bipartite directed graph..."
"Among them I operation: a(u)=Σh(v); O operation: h(v)=Σa(u). Normalize a(u) and h(v) in each iteration..."
"..."
At first, everyone listened with gusto.
But as the argument deepened, everyone's eyes began to become more and more confused.
They actually understood a little bit.
But everyone did not show the slightest scorn, instead the expression on their faces became more and more solemn.
Who is Jon Kleinberg?
The world-famous computer scientist, he is now a professor at the world-class Cornell College.
Will he be nonsense?
Of course not.
Since Jon Kleinberg’s argument is okay, there is only one answer. The reason they don’t understand is not because Jon Kleinberg’s nonsense, but the knowledge he expressed is too profound. , So that they could not understand for a while.
It is precisely because they do not understand that they feel more and more that Jon Kleinberg's argument is correct.
Jon Kleinberg's report continues, and there is no limit to it.
"What I just said was the specific algorithm of the HITS algorithm."
"Next I want to talk about the pseudo code in the algorithm..."
I like the super learning master system in one second, please collect it: (EbookFREE.me) The super learning master system in one second is the fastest literature update.