
Be the first to like this
Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our User Agreement and Privacy Policy.
Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our Privacy Policy and User Agreement for details.
Published on
Important nodes are individuals who have huge influence on social network. Finding important
nodes in social networks is of great significance for research on the structure of the social
networks. Based on the core idea of Pagerank, a new ranking method is proposed by
considering the link similarity between the nodes. The key concept of the method is the use of
the link vector which records the contact times between nodes. Then the link similarity is
computed based on the vectors through the similarity function. The proposed method
incorporates the link similarity into original Pagerank. The experiment results show that the
proposed method can get better performance.
Clipping is a handy way to collect and organize the most important slides from a presentation. You can keep your great finds in clipboards organized around topics.
Be the first to comment