7th International Conference on Communications and Networking in China

Research Article

On the Feasibility of Common-Friend Measurements for the Distributed Online Social Networks

  • @INPROCEEDINGS{10.1109/ChinaCom.2012.6417442,
        author={Yongquan Fu and Yijie Wang},
        title={On the Feasibility of Common-Friend Measurements for the Distributed Online Social Networks},
        proceedings={7th International Conference on Communications and Networking in China},
        publisher={IEEE},
        proceedings_a={CHINACOM},
        year={2012},
        month={9},
        keywords={distributed online social network common friends bloom filter matrix factorization decentralization},
        doi={10.1109/ChinaCom.2012.6417442}
    }
    
  • Yongquan Fu
    Yijie Wang
    Year: 2012
    On the Feasibility of Common-Friend Measurements for the Distributed Online Social Networks
    CHINACOM
    IEEE
    DOI: 10.1109/ChinaCom.2012.6417442
Yongquan Fu1,*, Yijie Wang1
  • 1: National Key Laboratory for Parallel and Distributed Processing, College of Computer Science, National University of Defense Technology
*Contact email: yongquanf@nudt.edu.cn

Abstract

Distributed social networks have emerged recently. Nevertheless, recommending friends in the distributed social networks has not been exploited fully. We propose FDist, a distributed common-friend estimation scheme that estimates the number of common-friends between any pair of users without disclosing the friends' information. FDist uses privacy-preserving common-friend measurements to collect a small number of common-friend samples, and uses low-dimensional coordinates to estimate the number of common friends to other users. Simulation results on real-world social networks confirm that FDist is both scalable and accurate.