v10 Chapter 3825： hits algorithm (2/2)

”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: (novelhall.com) The super learning master system in one second is the fastest literature update.