Data Mining and Knowledge Discovery

, Volume 27, Issue 3, pp 396–420

What distinguish one from its peers in social networks?

  • Yi-Chen Lo
  • Jhao-Yin Li
  • Mi-Yen Yeh
  • Shou-De Lin
  • Jian Pei
Article

DOI: 10.1007/s10618-013-0330-1

Cite this article as:
Lo, YC., Li, JY., Yeh, MY. et al. Data Min Knowl Disc (2013) 27: 396. doi:10.1007/s10618-013-0330-1

Abstract

Being able to discover the uniqueness of an individual is a meaningful task in social network analysis. This paper proposes two novel problems in social network analysis: how to identify the uniqueness of a given query vertex, and how to identify a group of vertices that can mutually identify each other. We further propose intuitive yet effective methods to identify the uniqueness identification sets and the mutual identification groups of different properties. We further conduct an extensive experiment on both real and synthetic datasets to demonstrate the effectiveness of our model.

Keywords

Social query Node identification Social networks 

Copyright information

© The Author(s) 2013

Authors and Affiliations

  • Yi-Chen Lo
    • 1
  • Jhao-Yin Li
    • 2
  • Mi-Yen Yeh
    • 2
    • 3
  • Shou-De Lin
    • 1
  • Jian Pei
    • 4
  1. 1.Department of Computer Science and Information EngineeringNational Taiwan UniversityTaipeiTaiwan
  2. 2.Institute of Information ScienceAcademia SinicaTaipeiTaiwan
  3. 3.Research Center for Information Technology InnovationAcademia SinicaTaipeiTaiwan
  4. 4.School of Computing ScienceSimon Fraser UniversityBurnabyCanada

Personalised recommendations