4 ms·
One example I'm interested in exploring: eigenvector centrality analysis on the social graph. It would be like a PageRank algorithm for people, quantifying how
by m0th87 17y ago
One example I'm interested in exploring: eigenvector centrality analysis on the social graph. It would be like a PageRank algorithm for people, quantifying how influential individuals are. This necessitates a full social graph. Having only a subset of it would be like Google only looking at the first 10 links on a page for its search algorithm.
- byrneseyeview 17y agoGoogle used to limit the number of links they looked at. Now they don't explicitly limit it, but they'll stop if the links seem boring.
- m0th87 17y agoFor the PageRank chunk of their search algorithm? If so, that is fascinating, because that means I could work with a graph subset and get good results. Could you link me?
- byrneseyeview 17y agoUnfortunately, this is something I heard from a Googler at SMX East. And I don't know how applicable it is--a human would find a long list of navigation links boring, but to a search bot they have much more content than, e.g., a list of "related pages".
- greenlblue 17y agoI don't think this data set in complete in that sense since only public profiles can be crawled in this way. At least that's what I gathered from the article.