Abstract
The discovery of circle of friends has risen rapidly in recent years. Traditional methods are mainly based on social network analysis which relies heavily on self-report data, such that these methods have isolated successes with limited accuracy, breadth, and depth. In this paper, we propose a new method which combines clustering technique to automatically discover the circle of friends on mobile data. In our method, the circle of friends is modeled as non-overlapping subspace clusters on mobile data with a Vector Space Model (VSM) based representation, for which a new subspace clustering algorithm is proposed to mine the underlying friend-relationship. The experimental studies on real mobile data demonstrate the effectiveness of the new method, and the results show that our clustering algorithm achieves better performance than the existing clustering algorithms.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Schwartz, M.F., Wood, D.: Discovering shared interests using graph analysis. Communications of the ACM 36, 78–89 (1993)
Nakajima, S., Tatemura, J., Hino, Y., et al.: Discovering important bloggers based on analyzing blog threads. Annual Workshop on the Weblogging Ecosystem. Springer, Heidelberg (2005)
Domingos, P., Richardson, M.: Mining the network value of customers. In: Proceedings of the Seventh International Conference on Knowledge Discovery and Data Mining, pp. 57–66. ACM Press, New York (2001)
Shen, D., Sun, J.T., Yang, Q., et al.: Latent friend mining from blog data. In: International Conference on Data Mining, pp. 552–561. IEEE Press, Piscataway (2006)
Kuan, S.T., Wu, B.Y., Lee, W.J.: Finding friend groups in blogosphere. In: 22nd International Conference on Advanced Information Networking and Applications-Workshops, pp. 1046–1050. IEEE Press, Piscataway (2008)
Java, A., Song, X., Finin, T., et al.: Why we twitter: understanding microblogging usage and communities. In: Proceedings of the 9th WebKDD and 1st SNA-KDD Workshop on Web Mining and Social Network Analysis, pp. 56–65. ACM Press, New York (2007)
Eagle, N., Pentland, A.S., Lazer, D.: Inferring friendship network structure by using mobile phone data. Proceedings of the National Academy of Sciences. 106, 15274–15278 (2009)
Park, H.S., Jun, C.H.: A simple and fast algorithm for K-medoids clustering. Expert Systems with Applications 36, 3336–3341 (2009)
Aggarwal, C.C., Wolf, J.L., Yu, P.S., et al.: Fast algorithms for projected clustering. In: ACM SIGMOD Record, pp. 61–72. ACM Press, New York (1999)
Jing, L., Ng, M.K., Huang, J.Z.: An entropy weighting k-means algorithm for subspace clustering of high-dimensional sparse data. IEEE Transactions on Knowledge and Data Engineering. 19, 1026–1041 (2007)
Gan, G., Wu, J., Yang, Z.-J.: A Fuzzy Subspace Algorithm for Clustering High Dimensional Data. In: Li, X., Zaïane, O.R., Li, Z. (eds.) ADMA 2006. LNCS (LNAI), vol. 4093, pp. 271–278. Springer, Heidelberg (2006)
Chen, L., Jiang, Q., Wang, S.: Model-based method for projective clustering. IEEE Transactions on Knowledge and Data Engineering 24, 1291–1305 (2012)
Han, J., Kamber, M.: Data mining: concepts and techniques, 2nd edn. China Machine Press, Beijing (2007). Fan Ming, Meng Xiaofeng
Strehl, A., Ghosh, J.: Cluster ensembles-a knowledge reuse framework for combining multiple partitions. The Journal of Machine Learning Research 3, 583–617 (2003)
Zhao, Y., Karypis, G.: Comparison of Agglomerative and Partitional Document Clustering Algorithms. Technical Report#02-014. University of Minnesota (2002)
Hubert, L., Arabie, P.: Comparing partitions. Journal of Classification 2(1), 193–218 (1985)
Iam-On, N., Boongoen, T., Garrett, S., et al.: A Link-Based Approach to the Cluster Ensemble Problem. IEEE Transactions on Pattern Analysis & Machine Intelligence 33, 2396–2409 (2011)
Eagle, N., De Montjoye, Y., Bettencourt, L.M.A.: Community computing: Comparisons between rural and urban societies using mobile phone data. In: International Conference on Computational Science and Engineering, pp. 144–150. IEEE, Piscataway (2009)
Papalexakis, E.E.: Automatic Unsupervised Tensor Mining with Quality Assessment (2015). arXiv:1503.0335
Farrahi, K., Gatica-Perez, D.: Daily routine classification from mobile phone data. Machine Learning for Multimodal Interaction. Springer, Heidelberg (2008)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Wu, T., Fan, Y., Hong, Z., Chen, L. (2015). Subspace Clustering on Mobile Data for Discovering Circle of Friends. In: Zhang, S., Wirsing, M., Zhang, Z. (eds) Knowledge Science, Engineering and Management. KSEM 2015. Lecture Notes in Computer Science(), vol 9403. Springer, Cham. https://doi.org/10.1007/978-3-319-25159-2_64
Download citation
DOI: https://doi.org/10.1007/978-3-319-25159-2_64
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-25158-5
Online ISBN: 978-3-319-25159-2
eBook Packages: Computer ScienceComputer Science (R0)