DMCA
Algorithms for estimating relative importance in networks (2003)
| Venue: | In Proceedings of KDD 2003 |
| Citations: | 138 - 4 self |
BibTeX
@INPROCEEDINGS{White03algorithmsfor,
author = {Scott White and Padhraic Smyth},
title = {Algorithms for estimating relative importance in networks},
booktitle = {In Proceedings of KDD 2003},
year = {2003},
pages = {266--275}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Large and complex graphs representing relationships among sets of entities are an increasingly common focus of interest in data analysis—examples include social networks, Web graphs, telecommunication networks, and biological networks. In interactive analysis of such data a natural query is “which entities are most important in the network relative to a particular individual or set of individuals? ” We investigate the problem of answering such queries in this paper, focusing in particular on defining and computing the importance of nodes in a graph relative to one or more root nodes. We define a general framework and a number of different algorithms, building on ideas from social networks, graph theory, Markov models, and Web graph analysis. We experimentally evaluate the different properties of these algorithms on toy graphs and demonstrate how our approach can be used to study relative importance in real-world networks including a network of interactions among September 11th terrorists, a network of collaborative research in biotechnology among companies and universities, and a network of co-authorship relationships among computer science researchers.
Keyphrases
relative importance social network root node biological network graph relative general framework collaborative research interactive analysis common focus data analysis example different algorithm telecommunication network graph theory particular individual computer science researcher co-authorship relationship natural query toy graph real-world network web graph analysis network relative web graph different property complex graph markov model
