Mining Mobile Phone Messages in Mobile Social Network

Article Preview

Abstract:

A mobile social network plays an essential role as the spread of information and relationship. Mining the popular P2P messages in a short period of time is very valuable. Traditional mining method is not suitable for this very large scale dataset. In this paper, we present a mining approach based on MapReduce parallel framework. We use our metric to analyze point-to-point (p2p) messages within an organization to extract social hierarchy. We analyze the behavior of the communication patterns with taking into account the actual communication messages sent by users. Experimental results show that the final dataset of popular messages is very small with high sending coverage ratio. Empirical studies on a large real-world mobile social network show that performance of our algorithm.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 457-458)

Pages:

130-133

Citation:

Online since:

January 2012

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2012 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] M. Kimura and K. Saito: Tractable models for information diffusion in social networks. In PKDD 2006, LNAI 4213, pages 259-271, (2006).

DOI: 10.1007/11871637_27

Google Scholar

[2] M. F. Schwartz and D. C. M. Wood: Discovering shared interests using graph analysis. Communications of the ACM, 36(7): 77-79, (1993).

DOI: 10.1145/163381.163402

Google Scholar

[3] P. Domingos and M. Richardson: Mining the network value of customers. In Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining, pages 57-66. ACM Press, (2001).

DOI: 10.1145/502512.502525

Google Scholar

[4] S.G. Jeffrey Dean: MapReduce: Simplied Data Processing on Large Clusters. Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation. San Francisco, 2004, p.113.

Google Scholar

[5] H. Ma, H. Yang, M. R. Lyu, and I. King: Mining social networks using heat diffusion processes for marketing candidates selection. In CIKM, pages 233-242, (2007).

DOI: 10.1145/1458082.1458115

Google Scholar

[6] D. Kempe, J. Kleinberg, and E. Tardos: Influential nodes in a diffusion model for social networks. In International colloquium on automata, languages and programming No32, pages 1127-1137, (2005).

DOI: 10.1007/11523468_91

Google Scholar

[7] Popescul, G. W. Flake, S. Lawrence, L. H. Ungar, and C. L. Giles: Clustering and identifying temporal trends in document databases. In IEEE Advances in Digital Libraries, (2000).

DOI: 10.1109/adl.2000.848380

Google Scholar

[8] Kimura, M.; Saito, K.; Nakano, R.; and Motoda, H.: Extracting influential nodes on a social network for information diffusion. Data Mining and Knowledge Discovery page 20: 70–97, (2010).

DOI: 10.1007/s10618-009-0150-5

Google Scholar