Skip to main content

Mining Meaningful Student Groups Based on Communication History Records

  • Conference paper
Knowledge-Based Intelligent Information and Engineering Systems (KES 2007)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4693))

  • 2052 Accesses

Abstract

In this paper we propose a novel approach that identifies meaningful student groups more objectively. As the data for objective analysis, we use communication history records that are collected from various communication tools such as telephones, e-mails, and messengers. We use the simple intuition that communication history records implicitly contain peer relationship information. We first formally define the notion of degree of familiarity between students and present mathematical formulas that compute the degree based on the history records. We then adopt a clustering technique to mine meaningful groups. To use the clustering technique, we define the measure of similarity between friends based on the degree of familiarity, and perform clustering using the measure. To show the practicality of the proposed method, we have implemented it and interpreted the meaning of experimental results.

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 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.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. Communication Secret Guard Law: Initial Legislation in 1993 (Law No. 4650), The 8th Revision in 2004 (Law No. 7138) (in Korean)

    Google Scholar 

  2. Dutta, M., Mahanta, A.K., Pujari, A.K.: QROCK: A Quick Version of the ROCK Algorithm for Clustering of Categorical Data. Journal of Pattern Recognition Letters 26(15), 2364–2373 (2005)

    Article  Google Scholar 

  3. Guha, S., Rastogi, R., Shim, K.: ‘ROCK: A Robust Clustering Algorithm for Categorical Attributes. In: Proc. Int’l Conf. on Data Engineering (ICDE), pp. 512–521. IEEE Press, Sydney, Australia (1999)

    Google Scholar 

  4. Herbert, B.: Symbolic Interactionism: Perspective and Method. Prentice-Hall, Englewood Cliffs (1969)

    Google Scholar 

  5. Hwang, J.-J., Whang, K.-Y., Moon, Y.-S., Lee, B.-S.: A Top-down Approach for Density-Based Clustering Using Multidimensional Indexes. Journal of Systems and Software 73(1), 169–180 (2004)

    Article  Google Scholar 

  6. Lee, C.: Preventing Bullying in Schools. Sage, Thousand Oaks (2004)

    Google Scholar 

  7. Media News Daily, AsiaMedia (March 23, 2005), http://www.asiamedia.ucla.edu/article.asp?parentid=22103

  8. Saltz, J.S., Hiltz, S.R., Turoff, M.: Student Social Graphs: Visualizing a Student’s Online Social Network. In: Proc. of Conference on Computer Supported Cooperative Work, ACM CSCW, Chicago, Illinois, pp. 596–599 (2004)

    Google Scholar 

  9. Warr, M.: Organization and Instigation in Deliquent Groups. Criminology 34(1), 11–37 (1996)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Moon, YS., Choi, HY., Kim, HS., Kim, J. (2007). Mining Meaningful Student Groups Based on Communication History Records. In: Apolloni, B., Howlett, R.J., Jain, L. (eds) Knowledge-Based Intelligent Information and Engineering Systems. KES 2007. Lecture Notes in Computer Science(), vol 4693. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74827-4_143

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-74827-4_143

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-74826-7

  • Online ISBN: 978-3-540-74827-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics