3823: C3823 The Algorithm

C3823 The Algorithm

He waved at the staff next to him, and soon five whiteboards were carried to the report desk.

They had prepared a lot of whiteboards. They had originally planned to prepare them for Qin Luo.

Unexpectedly, they had used it on Jon Cleenberg first.

"Thank you." Jon Cleenberg thanked him and then looked at the crowd. "Before I officially prove it, I would like to tell you what the HIT algorithm is."

"This is a brand new computing mode. When the user inputs the keywords, the algorithm calculated two values on the corresponding page. One was the Hub value. The other was the Authority value. The Hub value referred to the sum of all the Authority values on the page that were exported and pointed to the page. Authority value referred to the sum of all Hub values on the page where the connection was..."

" Compared to the traditional Package K algorithm, the HIT algorithm can better describe the characteristics of the Internet's organizational structure. Moreover, the convergence speed is faster, reducing the search time... "

... ""

In a grand manner, Jon Cleenberg briefly explained the advantages of the hist algorithm.

There was a lot of content, but there were only two sentences to summarize.

The reaction speed of the HIT algorithm was faster, and the time it took was shorter.

After a simple introduction of the HIT algorithm, Jon Cleenberg began to make an official report.

"I think so. Submit Query Q to the search system based on keyword queries. Retrieve the first N page (for example, N = 200) from the collection of the return results page. As the base collection, write it down as S, and then S is satisfied:

" The number of pages in 1.S is relatively low. "

" The website in 2.S is related to Query Q "

“3. S's website contains more authoritative websites."

... ""

"By adding S page and S page, S page will be expanded into a larger collection of Ts. With S page Hub as the peak, V1 as the peak, and Authority page as the peak, V2 as the peak..."

"The link between the websites in V1 and V2 will be the side collection E, forming a two-point directional diagram. ... "

"I operate: A (U) = Jade H (V); O operate: H (V) = Jade A (U). Every time the process is repeated, A (U), H (V) will be standardized... "

... ""

At the beginning, everyone was still listening with great interest.

However, as the debate went deeper, their eyes started to become more and more confused.

They actually understood a little.

However, they did not have the slightest bit of contempt. Instead, the expressions on their faces became more and more solemn.

Who was Jon Cleenberg?

He was a world-renowned computer scientist, and now he was even a professor at the world-class Cornel Academy.

Would he lie?

Of course not.

Since there was no problem with Jon Cleenberg's argument, there was only one answer. The reason they could not understand was not because of Joen Cleenberg's nonsense. It was because the knowledge he expressed was too profound, so they could not understand it for a moment.

It was precisely because they couldn't understand that they felt that Joen Clegg's argument was correct.

Jon Cleenberg's report continued, and there was no limit to it at all.1

"I was talking about the specific algorithm for the HIT algorithm."

"Next, I want to talk about the false code in the algorithm..."

pqdm.com