Algorithms for estimating relative importance in networks Export

@inproceedings{citeulike:142464, 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.}, address = {New York, NY, USA}, author = {White, Scott and Smyth, Padhraic}, booktitle = {KDD '03: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining}, citeulike-article-id = {142464}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=956782}, citeulike-linkout-1 = {http://dx.doi.org/10.1145/956750.956782}, doi = {10.1145/956750.956782}, isbn = {1-58113-737-0}, keywords = {link\_analysis}, location = {Washington, D.C.}, pages = {266--275}, posted-at = {2009-02-27 12:48:28}, priority = {2}, publisher = {ACM}, title = {Algorithms for estimating relative importance in networks}, url = {http://dx.doi.org/10.1145/956750.956782}, year = {2003} }

TY - CONF ID - citeulike:142464 L3 - citeulike-article-id:142464 N2 - 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. CY - Washington, D.C. SN - 1-58113-737-0 AD - New York, NY, USA EP - 275 TI - Algorithms for estimating relative importance in networks PB - ACM T2 - KDD '03: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining SP - 266 KW - link_analysis AU - White, Scott AU - Smyth, Padhraic PY - 2003/// UR - http://dx.doi.org/10.1145/956750.956782 ER -