12 search results - page 2 / 3 » Unbiased sampling in directed social graph |
ASUNAM
2009
IEEE
13 years 9 months ago
2009
IEEE
In this paper, we present a horizontal view of social influence, more specifically a quantitative study of the influence of neighbours on the probability of a particular node to jo...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Abstract--Breadth First Search (BFS) and other graph traversal techniques are widely used for measuring large unknown graphs, such as online social networks. It has been empiricall...
JMLR
2006
13 years 4 months ago
2006
We describe anytime search procedures that (1) find disjoint subsets of recorded variables for which the members of each subset are d-separated by a single common unrecorded cause...
SIGMOD
2010
ACM
13 years 9 months ago
2010
ACM
Our world today is generating huge amounts of graph data such as social networks, biological networks, and the semantic web. Many of these real-world graphs are edge-labeled graph...
KDD
2007
ACM
14 years 5 months ago
2007
ACM
We focus on large graphs where nodes have attributes, such as a social network where the nodes are labelled with each person's job title. In such a setting, we want to find s...