Algorithms for estimating relative importance in networks

By Scott White, Padhraic Smyth. Knowledge Discovery and Data Mining, 2003

494 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Statistical and Nonlinear Physics

View Paper: https://www.semanticscholar.org/paper/baafb9f23ee511930104e4b15532b6094f429c8b

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

In Statistical and Nonlinear Physics

Citations in the corpus

Community detection in graphs (2009, background): “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.”
Diffusion maps (2006, methodology): “Several variations around this theme appear in the literature [7,8], where, just like PageRank, various techniques provide a ranking function based on the top eigenvector of a Markov matrix [9,10].”
Audience selection for on-line brand advertising: privacy-friendly social network targeting (2009, background): “If more sophisticated techniques [14, 18, 19, 25, 26] can scale, they may provide the basis for improving the results we present below.”
Analysis and Visualization of Network Data using JUNG (2005, methodology): “…of root vertices; HITS (Kleinberg (1999)), which ranks each vertex in a graph according to the“hubs-and-authorities” importance measures; KStepMarkov (White and Smyth (2003)), which ranks each vertex according to a fast approximation of the PageRankWithPriors algorithm; and VoltageRanker (Wu and…”
ToppGene Suite for gene list enrichment analysis and candidate gene prioritization (2009, methodology): “…networks share many properties with Web and social networks (28), ToppNet uses extended versions of three algorithms from White and Smyth (31)—PageRank with Priors, HITS with Priors and K-step Markov—to prioritize disease candidate genes by estimating their relative importance in the…”
The slashdot zoo: mining a social network with negative edges (2009, unknown): “Distance and similarity in unsigned social networks are described in [27].”
FIRM: An Intelligent Fine-Grained Resource Management Framework for SLO-Oriented Microservices (2020, background): “Relative importance [62, 110, 122] is a metric that quantifies the strength of the relationship between two variables.”
Learning author-topic models from text corpora (2010, unknown): “, Yang [1999]).”
A Survey of Gene Prioritization Tools for Mendelian and Complex Human Diseases (2019, methodology): “ToppNet [54], GeneWanderer [55], PhenoRank [31] and many others [56], [57], [58], [59], [60], [61], [62] apply random walk-based algorithms [63], [64], [65] in order to assess relative importance of a node to a group nodes considering the global network topology.”
Disease candidate gene identification and prioritization using protein interaction networks (2009, methodology): “The prioritization approaches are based on the methods of White and Smyth [41], whose general framework, consisting of four successive problem formulations, each building on the next, defines the approach to ranking nodes in an unweighted digraph G(V, E):”
Closure-Tree: An Index Structure for Graph Queries (2006, methodology): “More broadly, graphs have been used for modeling biological pathways [4], chemical compounds [5], protein structures [6], social networks [7], and taxonomies [8, 9].”
Probabilistic author-topic models for information discovery (2004, methodology): “…(1997) developed the interactive ReferralWeb system for exploring networks of computer scientists working in artiﬁcial intelligence and information retrieval, and White and Smyth (2003) used PageRank-style ranking algorithms to analyze relative importance of scientiﬁc authors in co-author graphs.”
ItemRank: A Random-Walk Based Scoring Algorithm for Recommender Engines (2007, methodology): “Similarity measures based on random-walk models have been considered in [White and Smyth, 2003], where average first-passage time has been used as a similarity measure between nodes.”
A high-resolution human contact network for infectious disease transmission (2010, methodology): “White S, Smyth P (2003) Algorithms for estimating relative importance in networks.”