Sciweavers

57 search results - page 3 / 12
» Anonymizing Weighted Social Network Graphs
Sort
View
PAKDD
2009
ACM
133views Data Mining» more  PAKDD 2009»
14 years 2 months ago
On Link Privacy in Randomizing Social Networks
Many applications of social networks require relationship anonymity due to the sensitive, stigmatizing, or confidential nature of relationship. Recent work showed that the simple ...
Xiaowei Ying, Xintao Wu
SPAA
2010
ACM
14 years 8 days ago
Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
Matti Åstrand, Jukka Suomela
WWW
2008
ACM
14 years 8 months ago
Feature weighting in content based recommendation system using social network analysis
We propose a hybridization of collaborative filtering and content based recommendation system. Attributes used for content based recommendations are assigned weights depending on ...
Souvik Debnath, Niloy Ganguly, Pabitra Mitra
SOCIALCOM
2010
13 years 5 months ago
A Private and Reliable Recommendation System for Social Networks
Abstract--With the proliferation of internet-based social networks into our lives, new mechanisms to control the release and use of personal data are required. As a step toward thi...
T. Ryan Hoens, Marina Blanton, Nitesh V. Chawla
WWW
2010
ACM
14 years 23 days ago
Privacy in dynamic social networks
Recent work on anonymizing online social networks (OSNs) has looked at privacy preserving techniques for publishing a single instance of the network. However, OSNs evolve and a si...
Smriti Bhagat, Graham Cormode, Balachander Krishna...