#### DMCA

## Algorithms for estimating relative importance in networks (2003)

Venue: | In Proceedings of KDD 2003 |

Citations: | 138 - 4 self |

### Citations

4668 | The Anatomy of a Large-Scale Hypertextual Web Search Engine
- Brin, Page
- 1998
(Show Context)
Citation Context ... data in latent Euclidean spaces (Hoff, Raftery, and Handcock, 2002). In the area of Web graphs, computer scientists have proposed a number of algorithms (such as HITS (Kleinberg, 1999) and PageRank (=-=Brin and Page, 1998-=-; Page et al, 1998)) for automatically determining the “importance” of Web pages. Virtually all of these techniques focus on global measures of node importance in that each node is ranked relative to ... |

3631 | Authoritative sources in a hyperlinked environment
- Kleinberg
- 1998
(Show Context)
Citation Context ...the embedding of social network data in latent Euclidean spaces (Hoff, Raftery, and Handcock, 2002). In the area of Web graphs, computer scientists have proposed a number of algorithms (such as HITS (=-=Kleinberg, 1999-=-) and PageRank (Brin and Page, 1998; Page et al, 1998)) for automatically determining the “importance” of Web pages. Virtually all of these techniques focus on global measures of node importance in th... |

3267 | The pagerank citation ranking: bringing order to the web
- Page, Brin, et al.
- 1999
(Show Context)
Citation Context ...dean spaces (Hoff, Raftery, and Handcock, 2002). In the area of Web graphs, computer scientists have proposed a number of algorithms (such as HITS (Kleinberg, 1999) and PageRank (Brin and Page, 1998; =-=Page et al, 1998-=-)) for automatically determining the “importance” of Web pages. Virtually all of these techniques focus on global measures of node importance in that each node is ranked relative to all other nodes in... |

1124 |
Denumerable Markov Chains
- Kemeny, Snell, et al.
- 1966
(Show Context)
Citation Context ... of the mean first-passage time in the Markov chain. The mean first passage time mrt from r to t is defined as the expected number of steps taken until the first arrival at node t starting at node r (=-=Kemeny and Snell, 1976-=-): mrt = ∞� n=1 nf (n) rt (3) where n denotes the number of steps taken, and f (n) rt denotes the probability that the chain first returns to state t in exactly n steps. A useful property of using mea... |

1081 | Centrality is social networks I: conceptual clarification
- Freeman
- 1979
(Show Context)
Citation Context ...rtance of a node in a graph relative to all other nodes. For example, a variety of measures have been proposed by sociologists to determine the “centrality” of a node in a social network (Katz, 1953; =-=Freeman, 1979-=-; Stephenson and Zelen, 1989; Wasserman and Faust, 1994). Statisticians have also developed general methods for quantitative graph modeling, such as the embedding of social network data in latent Eucl... |

543 | Topic-Sensitive PageRank”, - Haveliwala - 2002 |

430 |
A new status index derived from sociometric analysis
- Katz
- 1953
(Show Context)
Citation Context ...ize the importance of a node in a graph relative to all other nodes. For example, a variety of measures have been proposed by sociologists to determine the “centrality” of a node in a social network (=-=Katz, 1953-=-; Freeman, 1979; Stephenson and Zelen, 1989; Wasserman and Faust, 1994). Statisticians have also developed general methods for quantitative graph modeling, such as the embedding of social network data... |

409 | Scaling personalized web search - Jeh, Widom - 2003 |

329 | Digital libraries and autonomous citation indexing.
- Lawrence, Giles, et al.
- 1999
(Show Context)
Citation Context ...complex graphs: a graph of the September 11th terrorist network, a network of biotechnology collaborations, and a coauthorship network constructed from the Citeseer database of scientific literature (=-=Lawrence, Giles, and Bollacker, 1999-=-). 8.1 September 11th Terrorist Network The terrorist network graph consists of 63 nodes (terrorists) and 308 edges representing known interactions between terrorists (Krebs, 2001). This graph include... |

318 | Latent space approaches to social network analysis
- Hoff, Raftery, et al.
- 2002
(Show Context)
Citation Context ...nd Zelen, 1989; Wasserman and Faust, 1994). Statisticians have also developed general methods for quantitative graph modeling, such as the embedding of social network data in latent Euclidean spaces (=-=Hoff, Raftery, and Handcock, 2002-=-). In the area of Web graphs, computer scientists have proposed a number of algorithms (such as HITS (Kleinberg, 1999) and PageRank (Brin and Page, 1998; Page et al, 1998)) for automatically determini... |

318 | The stochastic approach for link-structure analysis (SALSA) and the TKC effect. Computer Networks, - Lempel, Moran - 2000 |

272 | Comparing top k lists - Fagin, Kumar, et al. - 2003 |

209 | Mapping networks of terrorist cells.
- Krebs
- 2002
(Show Context)
Citation Context ...ence, Giles, and Bollacker, 1999). 8.1 September 11th Terrorist Network The terrorist network graph consists of 63 nodes (terrorists) and 308 edges representing known interactions between terrorists (=-=Krebs, 2001-=-). This graph includes the 19 September 11th hijackers and their associates. Table 4 show the top ten authorities (shortened last names only) relative to two associates of the September 11th hijackers... |

184 | Network Dynamics and Field Evolution: The Growth of Interorganizational Collaboration in the Life Sciences.
- Powell, White, et al.
- 2005
(Show Context)
Citation Context ...Walid 0.040 10: Khammoun 0.025 Khammoun 0.021 Khammoun 0.029 Bahaji 0.024 Khammoun 0.034 licly and privately held companies involved in human therapeutic and diagnostic applications of biotechnology (=-=Powell et al., 2002-=-). The data set covers collaborations over the 12year period, 1988-99. Collaborations include such relationships as finance, R&D, and commercial ventures. A portion of the network is shown in Figure 5... |

96 |
Rethinking centrality: Methods and examples."
- Stephenson, Zelen
- 1989
(Show Context)
Citation Context ...e in a graph relative to all other nodes. For example, a variety of measures have been proposed by sociologists to determine the “centrality” of a node in a social network (Katz, 1953; Freeman, 1979; =-=Stephenson and Zelen, 1989-=-; Wasserman and Faust, 1994). Statisticians have also developed general methods for quantitative graph modeling, such as the embedding of social network data in latent Euclidean spaces (Hoff, Raftery,... |

84 | Finding authorities and hubs from link structures on the World Wide Web. World Wide Web, - Borodin, Roberts, et al. - 2001 |

24 | Creating customized authority lists. - Cohn, Chang, et al. - 2000 |