Data Mining and Knowledge Discovery

, Volume 27, Issue 3, pp 396–420 | Cite as

What distinguish one from its peers in social networks?

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


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.


Social query Node identification Social networks 



Mi-Yen Yeh’s research is supported in part by National Science Council of Taiwan, R.O.C., under Contracts NSC101-2221-E-001-013. Shou-De Lin’s research is supported by National Science Council, National Taiwan University and Intel Corporation under Grants NSC100-2911-I-002-001, NSC101-2628-E-002-028-MY2 and NTU102R7501. Jian Pei’s research is supported in part by an NSERC Discovery Grant and a BCFRST NRAS Endowment Research Team Program project. All opinions, findings, conclusions and recommendations in this paper are those of the authors and do not necessarily reflect the views of the funding agencies.


  1. Albert R, Barabási A-L (2002) Statistical mechanics of complex networks. Rev Modern Phys 74:47–97MathSciNetzbMATHCrossRefGoogle Scholar
  2. Erdős P, Rényi A (1961) On the evolution of random graphs. Bull Inst Int Stat 38:343Google Scholar
  3. Fortunato S (2010) Community detection in graphs. Phys Rep 486(3–5):75–174MathSciNetCrossRefGoogle Scholar
  4. Lappas T, Liu K, Terzi E (2009) Finding a team of experts in social networks. In Proceedings of ACM SIGKDD international conference on knowledge discovery and data miningGoogle Scholar
  5. Li C-T, Lin S-D (2009) Egocentric information abstraction for heterogeneous social networks. In ASONAM, 2009Google Scholar
  6. Li C-T, Shan M-K (2010) Team formation for generalized tasks in expertise social networks. In IEEE SocialComGoogle Scholar
  7. Newman M (2004) Detecting community structure in networks. Eur Phys J B Condens Matter Complex Syst 38(2):321–330CrossRefGoogle Scholar
  8. Sozio M, Gionis A (2010) The community-search problem and how to plan a successful cocktail party. In Proceedings of ACM SIGKDD international conference on knowledge discovery and data miningGoogle Scholar
  9. Tang J, Zhang J, Yao L, Li J, Zhang L, Su Z (2008) ArnetMiner: extraction and mining of academic social networks. In Proceedings of ACM SIGKDD international confernce on knowledge discovery and data miningGoogle Scholar
  10. Watts D, Strogatz S (1998) Collective dynamics of small-world networks. Nature 363:202–204Google Scholar
  11. Yang D-N, Chen Y-L, Lee W-C, Chen M-S (2011) Social-temporal group query with acquaintance constraint. In Proceeding of international conference on very large data, basesGoogle Scholar
  12. Zhou B, Pei J (2008) Preserving privacy in social networks against neighborhood attacks. In Proceedings of IEEE international conference on data, engineeringGoogle Scholar
  13. Zhu J, Nie Z, Liu X, Zhang B, Wen J-R (2009) StatSnowball: a statistical approach to extracting entity relationships. In Proceedings of internatinal world wide web conferenceGoogle Scholar

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