Sciweavers

834 search results - page 80 / 167
» The Web as a Graph
Sort
View
KDD
2004
ACM
145views Data Mining» more  KDD 2004»
14 years 4 months ago
A graph-theoretic approach to extract storylines from search results
We present a graph-theoretic approach to discover storylines from search results. Storylines are windows that offer glimpses into interesting themes latent among the top search re...
Ravi Kumar, Uma Mahadevan, D. Sivakumar
WAW
2007
Springer
144views Algorithms» more  WAW 2007»
14 years 5 months ago
Approximating Betweenness Centrality
Betweenness is a centrality measure based on shortest paths, widely used in complex network analysis. It is computationally-expensive to exactly determine betweenness; currently th...
David A. Bader, Shiva Kintali, Kamesh Madduri, Mil...
WWW
2005
ACM
14 years 12 months ago
PageRank as a function of the damping factor
PageRank is defined as the stationary state of a Markov chain. The chain is obtained by perturbing the transition matrix induced by a web graph with a damping factor that spreads...
Paolo Boldi, Massimo Santini, Sebastiano Vigna
PPOPP
2010
ACM
14 years 8 months ago
A distributed placement service for graph-structured and tree-structured data
Effective data placement strategies can enhance the performance of data-intensive applications implemented on high end computing clusters. Such strategies can have a significant i...
Gregory Buehrer, Srinivasan Parthasarathy, Shirish...
WIRI
2005
IEEE
14 years 4 months ago
Collaborative Filtering by Mining Association Rules from User Access Sequences
Recent research in mining user access patterns for predicting Web page requests focuses only on consecutive sequential Web page accesses, i.e., pages which are accessed by followi...
Mei-Ling Shyu, Choochart Haruechaiyasak, Shu-Ching...