The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Algorithms for estimating relative importance in networks
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Social Network Analysis: Methods and Applications
Wasserman, S. S., & Faust, K. (1994) · Cited by 17,991
Social Network Analysis: Methods and Applications
Wasserman, S., & Faust, K. (1994) · doi:10.1017/cbo9780511815478 · Cited by 17,557
Centrality in social networks conceptual clarification
Freeman, L. C. (1978) · Social Networks · doi:10.1016/0378-8733(78)90021-7 · Cited by 17,062
The anatomy of a large-scale hypertextual Web search engine
Brin, S., & Page, L. (1998) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(98)00110-x · Cited by 16,004
(1999) · Cited by 12,854
Proceedings of the 24th international conference on Machine learning
(2007) · doi:10.1145/1273496 · Cited by 11,630
Authoritative sources in a hyperlinked environment
Kleinberg, J. M. (1999) · Journal of the ACM · doi:10.1145/324133.324140 · Cited by 8,959
A New Status Index Derived from Sociometric Analysis
Katz, L. (1953) · Psychometrika · doi:10.1007/bf02289026 · Cited by 3,866
Kemeny, J. G., & Snell, J. L. (1976) · Medical Entomology and Zoology · Cited by 2,813
Powell, W. W., White, D. R., Koput, K. W., & Owen‐Smith, J. (2005) · American Journal of Sociology · doi:10.1086/421508 · Cited by 2,016
Cited by
Fortunato, S. (2010) · Physics Reports · doi:10.1016/j.physrep.2009.11.002 · Cited by 11,293
“White and Smyth (White and Smyth, 2003) and Zhou (Zhou, 2003a) used instead the average first passage time, i. e. the average number of steps needed to reach for the first time the target vertex from the source.”
BackgroundInfluentialToppGene Suite for gene list enrichment analysis and candidate gene prioritization
Chen, J., Bardes, E. E., Aronow, B. J., & Jegga, A. G. (2009) · Nucleic Acids Research · doi:10.1093/nar/gkp427 · Cited by 2,952
Fouss, F., Pirotte, A., Renders, J.-M., & Saerens, M. (2007) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2007.46 · Cited by 1,265
Getoor, L., & Diehl, C. P. (2005) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1117454.1117456 · Cited by 973
A high-resolution human contact network for infectious disease transmission
Salathé, M., Kazandjieva, M., Lee, J. W., Levis, P., Feldman, M. W., & Jones, J. H. (2010) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1009094108 · Cited by 739
Probabilistic author-topic models for information discovery
Steyvers, M., Smyth, P., Rosen-Zvi, M., & Griffiths, T. (2004) · Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1014052.1014087 · Cited by 572
Self-citationVisual Analysis of Large Graphs: State‐of‐the‐Art and Future Research Challenges
von Landesberger, T., Kuijper, A., Schreck, T., Kohlhammer, J., van Wijk, J. J., Fekete, J. ‐., & Fellner, D. W. (2011) · Computer Graphics Forum · doi:10.1111/j.1467-8659.2011.01898.x · Cited by 515
The Slashdot Zoo: Mining a Social Network with Negative Edges
Kunegis, J., Lommatzsch, A., & Bauckhage, C. (2017) · arXiv (Cornell University) · doi:10.24406/publica-r-363202 · Cited by 384
Disease candidate gene identification and prioritization using protein interaction networks
Chen, J., Aronow, B. J., & Jegga, A. G. (2009) · BMC Bioinformatics · doi:10.1186/1471-2105-10-73 · Cited by 364
The slashdot zoo: mining a social network with negative edges
Kunegis, J., Lommatzsch, A., & Bauckhage, C. (2009) · Proceedings of the 18th international conference on World wide web · doi:10.1145/1526709.1526809 · Cited by 342
Learning author-topic models from text corpora
Rosen-Zvi, M., Chemudugunta, C., Griffiths, T., Smyth, P., & Steyvers, M. (2010) · ACM Transactions on Information Systems · doi:10.1145/1658377.1658381 · Cited by 302
Self-citationClosure-Tree: An Index Structure for Graph Queries
He, H., & Singh, A. K. (2006) · 22nd International Conference on Data Engineering (ICDE'06) · doi:10.1109/icde.2006.37 · Cited by 293
Discovering important nodes through graph entropy the case of Enron email database
Shetty, J., & Adibi, J. (2005) · Proceedings of the 3rd international workshop on Link discovery · doi:10.1145/1134271.1134282 · Cited by 254
Bezgin, G., Vakorin, V. A., van Opstal, A. J., McIntosh, A. R., & Bakker, R. (2012) · NeuroImage · doi:10.1016/j.neuroimage.2012.04.013 · Cited by 63
Interian, R., G. Marzo, R., Mendoza, I., & Ribeiro, C. C. (2023) · International Transactions in Operational Research · doi:10.1111/itor.13224 · Cited by 67
A Survey of Gene Prioritization Tools for Mendelian and Complex Human Diseases
Zolotareva, O., & Kleine, M. (2019) · Journal of Integrative Bioinformatics · doi:10.1515/jib-2018-0069 · Cited by 46
Metadata
- Authors
- White, S., & Smyth, P.
- Venue
- Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
- Publisher
- ACM
- Published
- 2003-08-24
- Pages
- 266-275
- OpenAlex
- W1978558026
- Cited by
- 408
- References
- 21
- FWCI
- 21.86
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.