Profiling users in a 3g network using hourglass co-clustering
Authors:
Open Access
- 20 September 2010
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 341-352
Abstract
With widespread popularity of smart phones, more and more users are accessing the Internet on the go. Understanding mobile user browsing behavior is of great significance for several reasons. For example, it can help cellular (data) service providers (CSPs) to improve service performance, thus increasing user satisfaction. It can also provide valuable insights about how to enhance mobile user experience by providing dynamic content personalization and recommendation, or location-aware services. In this paper, we try to understand mobile user browsing behavior by investigating whether there exists distinct "behavior patterns" among mobile users. Our study is based on real mobile network data collected from a large 3G CSP in North America. We formulate this user behavior profiling problem as a "co-clustering" problem, i.e., we group both users (who share similar browsing behavior), and browsing profiles (of like-minded users) simultaneously. We propose and develop a scalable co-clustering methodology, Phantom, using a novel hourglass model. The proposed hourglass model first reduces the dimensions of the input data and performs divisive hierarchical co-clustering on the lower dimensional data; it then carries out an expansion step that restores the original dimensions. Applying Phantom to the mobile network data, we find that there exists a number of prevalent and distinct behavior patterns that persist over time, suggesting that user browsing behavior in 3G cellular networks can be captured using a small number of co-clusters. For instance, behavior of most users can be classified as either homogeneous (users with very limited set of browsing interests) or heterogeneous (users with very diverse browsing interests), and such behavior profiles do not change significantly at either short (30-min) or long (6 hour) time scales.Keywords
This publication has 9 references indexed in Scilit:
- Measuring serendipity2009
- XML Filtering Using Dynamic Hierarchical Clustering of User ProfilesLecture Notes in Computer Science, 2008
- A fast kernel-based multilevel algorithm for graph clustering2005
- Fully automatic cross-associations2004
- Revealing modularity and organization in the yeast molecular network by integrated analysis of highly heterogeneous genomewide dataProceedings of the National Academy of Sciences, 2004
- Information-theoretic co-clustering2003
- Co-clustering documents and words using bipartite spectral graph partitioning2001
- Coupled two-way clustering analysis of gene microarray dataProceedings of the National Academy of Sciences, 2000
- Lower Bounds for the Partitioning of GraphsIBM Journal of Research and Development, 1973