Jon Kleinberg studies algorithms and networks, including how the link structure of information can reveal useful organization. His work on the HITS algorithm assigns separate authority and hub scores to web pages: an authority is supported by good hubs, while a hub points to good authorities.[ref]
If when page links to page , the updates take the form and , with normalization. Combining them gives a power iteration on for authority scores and on for hub scores. Thus the apparently circular verbal definition becomes a numerical eigenvector problem rather than an infinite regress. Link structure supplies a ranking signal, not a guarantee of truth.
With Éva Tardos, Kleinberg also wrote the algorithms textbook Algorithm Design; his institutional page identifies network structure as a central research theme.[ref]
Figure 1.
Jon Kleinberg, portrait identified by the linked author, institutional or Commons source
.

Tagged

Articles by others on the same topic (1)

Jon Kleinberg is a prominent computer scientist known for his work in various areas, including algorithms, social networks, and information retrieval. He is a professor in the Department of Computer Science at Cornell University and has made significant contributions to the understanding of how information spreads through networks and how online social systems function. Kleinberg is particularly well-known for his research on the HITS algorithm (Hyperlink-Induced Topic Search), which is related to the ranking of web pages and has influenced the development of search engines.