180 search results - page 21 / 36 » Learning random walks to rank nodes in graphs |
ASUNAM
2009
IEEE
14 years 2 months ago
2009
IEEE
—This paper presents a novel methodology for social network discovery based on the sensitivity coefficients of importance metrics, namely the Markov centrality of a node, a metr...
ICDM
2009
IEEE
14 years 2 months ago
2009
IEEE
—Applying the concept of organizational structure to social network analysis may well represent the power of members and the scope of their power in a social network. In this pap...
WWW
2008
ACM
14 years 8 months ago
2008
ACM
A bipartite query-URL graph, where an edge indicates that a document was clicked for a query, is a useful construct for finding groups of related queries and URLs. Here we use thi...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Scaling up the sparse matrix-vector multiplication kernel on modern Graphics Processing Units (GPU) has been at the heart of numerous studies in both academia and industry. In thi...
PAMI
2007
13 years 7 months ago
2007
This paper exploits the properties of the commute time between nodes of a graph for the purposes of clustering and embedding, and explores its applications to image segmentation a...