194 search results - page 13 / 39 » Reconstructing Randomized Social Networks |
KDD
2012
ACM
11 years 10 months ago
2012
ACM
We study a novel clustering problem in which the pairwise relations between objects are categorical. This problem can be viewed as clustering the vertices of a graph whose edges a...
TIP
2008
13 years 7 months ago
2008
Abstract--In this paper, we propose a maximum-entropy expectation-maximization (MEEM) algorithm. We use the proposed algorithm for density estimation. The maximum-entropy constrain...
CCS
2010
ACM
13 years 6 months ago
2010
ACM
Social network-based Sybil defenses exploit the trust exhibited in social graphs to detect Sybil nodes that disrupt an algorithmic property (i.e., the fast mixing) in these graphs...
ATAL
2007
Springer
14 years 1 months ago
2007
Springer
This paper proposes a new variant of the task allocation problem, where the agents are connected in a social network and tasks arrive at the agents distributed over the network. W...
SIGCOMM
2006
ACM
14 years 1 months ago
2006
ACM
Researchers have proposed a variety of metrics to measure important graph properties, for instance, in social, biological, and computer networks. Values for a particular graph met...