Skip to main content

Inter-Profile Similarity (IPS): A Method for Semantic Analysis of Online Social Networks

  • Conference paper
Complex Sciences (Complex 2009)

Abstract

Online Social Networks (OSN)[OSN] are experiencing an explosive growth rate and are becoming an increasingly important part of people’s lives. There is an increasing desire to aid online users in identifying potential friends, interesting groups, and compelling products to users. These networks have offered researchers almost total access to large corpora of data. An interesting goal in utilizing this data is to analyze user profiles and identify how similar subsets of users are. The current techniques for comparing users are limited as they require common terms to be shared by users. We present a simple and novel extension to a word-comparison algorithm [6], entitled Inter-Profile Similarity (IPS), which allows comparison of short text phrases even if they share no common terms. The output of Inter-Profile Similarity (IPS) is simply a scalar value in [0,1], with 1 denoting complete similarity and 0 the opposite. Therefore it is easy to understand and can provide a total ordering of users. We, first, evaluated the effectiveness of Inter-Profile Similarity (IPS) with a user-study, and then applied it to datasets from Facebook and Orkut verifying and extending earlier results. We show that Inter-Profile Similarity (IPS) yields both a larger range for the similarity value and obtains a higher value than intersection-based mechanisms. Both Inter-Profile Similarity (IPS) and the output from the analysis of the two Online Social Networks (OSN)[OSN] should help to predict and classify social links, make recommendations, and annotate friends relations for social network analysis.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Wallenius’ noncentral hypergeometric distribution, http://en.wikipedia.org/wiki/Wallenius_noncentral_hypergeometric_distribution

  2. Hammouda, K., Kamel, M.: Phrase-based Document Similarity Based on an Index Graph Model. In: Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM 2002), p. 203. IEEE Computer Society, Washington (2002)

    Chapter  Google Scholar 

  3. Investigating Measures for Pairwise Document Similarity, http://www.ncstrl.org:8900/ncstrl/servlet/search?formname=detail&id=oai

  4. Zamir, O., Etzioni, O., Karp, R.: In: Kamel, M.K. (ed.) Knowledge Discovery and Data Mining, pp. 287–290 (1997)

    Google Scholar 

  5. Sahami, M., Heilman, T.: A web-based kernel function for measuring the similarity of short text snippets. In: Proceedings of the 15th international conference on World Wide Web, pp. 377–386. ACM, New York (2006)

    Chapter  Google Scholar 

  6. Patwardhan, S., Pedersen, T.: Using WordNet-based context vectors to estimate the semantic relatedness of concepts. In: Proceedings of the EACL 2006 workshop, pp. 1–8 (2006)

    Google Scholar 

  7. Mislove, A., Marcon, M., Gummadi, K., Druschel, P., Bhattacharjee, B.: Measurement and analysis of online social networks. In: Proceedings of the 7th ACM SIGCOMM conference on Internet measurement, pp. 29–42. ACM, New York (2007)

    Chapter  Google Scholar 

  8. Marlow, C., Naaman, M., Boyd, D., Davis, M.: HT 2006, tagging paper, taxonomy, Flickr, academic article, to read. In: Proceedings of the 17th conference on Hypertext, pp. 31–40. ACM, New York (2006)

    Google Scholar 

  9. Information Flow in Social Groups, http://www.citebase.org/abstract?id=oai:arXiv.org:cond-mat/0305305

  10. Fellbaum, C.: WordNet: An Electronic Lexical Database (Language, Speech, and Communication). The MIT Press, Cambridge (1998)

    MATH  Google Scholar 

  11. Spertus, E., Sahami, M., Buyukkokten, O.: Evaluating similarity measures: a large-scale study in the orkut social network. In: Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining, pp. 678–684. ACM, New York (2005)

    Chapter  Google Scholar 

  12. Wen, Z., Tzerpos, V.: Evaluating Similarity Measures for Software Decompositions. In: Proceedings of the 20th IEEE International Conference on Software Maintenance, pp. 368–377. IEEE Computer Society, Washington (2004)

    Google Scholar 

  13. Bradley, E.: Better Bootstrap Confidence Intervals. Journal of the American Statistical Association 82, 171–185 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  14. Tan, P., Steinback, M., Kumar, V.: Introduction to Data Mining. Addison-Wesley, Reading (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering

About this paper

Cite this paper

Spear, M., Lu, X., Matloff, N.S., Wu, S.F. (2009). Inter-Profile Similarity (IPS): A Method for Semantic Analysis of Online Social Networks. In: Zhou, J. (eds) Complex Sciences. Complex 2009. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 4. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02466-5_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02466-5_31

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02465-8

  • Online ISBN: 978-3-642-02466-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics