Skip to main content

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 5333))

Abstract

Recent increase in population of mobile phone users makes it a valuable source of information for social network analysis. For a given call log, how much can we tell about the person’s social group? Unnoticeably, phone user’s calling personality and habit has been concealed in the call logs from which we believe that it can be extracted to infer its user’s social group information. In this paper, we present an end-to-end system for inferring social networks based on “only” call logs using kernel-based naïve Bayesian learning. We also introduce normalized mutual information for feature selection process. Our model is evaluated with real-life call logs where it performs at high accuracy rate of 81.82%.

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. Eagle, N., Pentland, A.: Reality Mining: Sensing Complex Social Systems. Journal of Personal and Ubiquitous Computing 10(4), 225–268 (2005)

    Google Scholar 

  2. Shannon, C.E.: A Mathematical Theory of Communications. Bell System Technical Journal 27, 379–423, 623–656 (July and October 1948)

    Google Scholar 

  3. Mitra, P., Murphy, C.A., Pal, S.K.: Unsupervised feature selection using feature similarity. IEEE Transactions on Pattern Analysis and Machine Intelligence 24, 301–312 (2002)

    Article  Google Scholar 

  4. Cover, T.M., Thomas, J.A.: Elements of Information Theory. Wiley, Chichester (1991)

    Book  MATH  Google Scholar 

  5. Quinlan, J.: C4.5: Programs for machine learning. Morgan Kaufman Publishers, Inc., San Francisco (1993)

    Google Scholar 

  6. Duda, R.O., Hart, P.E.: Pattern Classification and Scene Analysis. John Wiley, New York (1973)

    MATH  Google Scholar 

  7. Good, I.J.: Probability and the Weighing of Evidence. Charles Griffin, London (1950)

    MATH  Google Scholar 

  8. Parzen, E.: On estimation of a probability density function and mode. Annual Mathematical Statistics 33(3), 1065–1076 (1962)

    Article  MathSciNet  MATH  Google Scholar 

  9. Wand, M.P., Jones, M.C.: Kernel Smoothing. Chapman & Hall, Boca Raton (1994)

    MATH  Google Scholar 

  10. Sheather, S.J., Jones, M.C.: A reliable data-based bandwidth selection method for kernel density estimation. Journal of the Royal Statical Society, Series B(53), 683–690 (1991)

    Google Scholar 

  11. Wireless Quick Facts. CTIA, Ed. (2007), http://www.ctia.org/media/index.cfm/AID/10323

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Phithakkitnukoon, S., Dantu, R. (2008). Inferring Social Groups Using Call Logs. In: Meersman, R., Tari, Z., Herrero, P. (eds) On the Move to Meaningful Internet Systems: OTM 2008 Workshops. OTM 2008. Lecture Notes in Computer Science, vol 5333. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88875-8_40

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-88875-8_40

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-88874-1

  • Online ISBN: 978-3-540-88875-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics