Comparing clustering schemes at two levels of granularity for mobile call mining

  • Authors:
  • Pawan Lingras;Parag Bhalchandra;Satish Mekewad;Ravindra Rathod;Santosh Khamitkar

  • Affiliations:
  • School of Computational Sciences, Swami Ramanand Teerth Marathwada University, Nanded, Maharashtra, India and Department of Mathematics and Computing Science, Saint Mary's University, Halifax, Nov ...;School of Computational Sciences, Swami Ramanand Teerth Marathwada University, Nanded, Maharashtra, India;School of Computational Sciences, Swami Ramanand Teerth Marathwada University, Nanded, Maharashtra, India;School of Computational Sciences, Swami Ramanand Teerth Marathwada University, Nanded, Maharashtra, India;School of Computational Sciences, Swami Ramanand Teerth Marathwada University, Nanded, Maharashtra, India

  • Venue:
  • RSKT'11 Proceedings of the 6th international conference on Rough sets and knowledge technology
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Datasets in many applications can be viewed at different levels of granularity. Depending on the level of granularity, data mining techniques can produce different results. Correlating results from different levels of granularity can improve the quality of analysis. This paper proposes a process and measures for comparing clustering results from two levels of granularity for a mobile call dataset. The clustering is applied to the phone calls as well as phone numbers, where phone calls are finer granules while phone numbers are coarser granules. The coarse granular clustering is then expanded to a finer level and finer granular clustering is contracted to the coarser granularity for additional qualitative analysis. The paper uses a popular cluster quality measure called Davies-Bouldin index as well as a proposal for transforming clustering schemes between different levels of granularity.