ActiveDBC: learning Knowledge-based Information propagation in mobile social networks
- 107 Downloads
Due to fast-growing mobile devices usage such as smartphones and wearable devices, the rapid information propagation in the Mobile Social Networks environment is very important. In particular, information transmission of people with repeated daily patterns in complex areas such as big cities requires a very meaningful analysis. We address the problem of identifying a key player who can quickly propagate the information to the whole network. This problem, in other words, often refer as the information propagation problem. In this research, we selected the top-k influential nodes to learn the knowledge-based movements of people by using a Markov chain process in a real-life environment. Subsequently, their movement probabilities according to virtual regions were used to ensure appropriate clustering based on the Density-based Spatial Clustering of Applications with Noise (DBSCAN) algorithm. Since moving patterns in a university campus data have a dense collection of people, the DBSCAN algorithm was useful for producing very dense groupings. After clustering, we also elected the top-k influential nodes based on the results learned from the score of each node according to groups. We determined the rate at which information spreads by using trace data from a real network. Our experiments were conducted in the Opportunistic Network Environment simulator. The results showed that the proposed method has outstanding performance for the level of spreading time in comparison to other methods such as Naïve, Degree, and K-means. Furthermore, we compared the performance of RandomDBC with that of ActiveDBC, proving that the latter method was important to extract the influential top-k nodes, and showed superior performance.
KeywordsDBSCAN Markov chain Machine learning Real trace data Opportunistic network environment simulator
This research was supported by the Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education, Science, and Technology (2016R1A2B4010142).
- 2.Ma, H., Yang, H., Lyu, M. R., & King, I. (2008). Mining social networks using heat diffusion processes for marketing candidates selection. In Proceedings of the 17th ACM conference on information and knowledge management (pp. 233–242).Google Scholar
- 3.Kempe, D., Kleinberg, J., & Tardos, E. (2003). Maximizing the spread of influence through a social network. In: Proceedings of ACM SIGKDD.Google Scholar
- 4.Lu, Z., Wen, Y., & Cao, G. (2014). Information diffusion in mobile social networks: The speed perspective. In Proceedings of IEEE INFOCOM (pp. 1932–1940).Google Scholar
- 5.Ning, T., Yang, Z., Wu, H. & Han, Z. (2013). Self-interest-drive incentives for ad dissemination in autonomous mobile social networks. In: Proceedings of IEEE INFOCOM.Google Scholar
- 6.Kempe, D., Kleinberg, J., & Tardos, É. (2003). Maximizing the spread of influence through a social network. In Proceedings of the 9th ACM SIGKDD international conference on knowledge discovery and data mining (pp. 137–146).Google Scholar
- 7.Richardson, M., & Domingos, P. (2002). Mining knowledge-sharing sites for viral marketing. In Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining (pp. 61–70).Google Scholar
- 8.Myers, S. A., Zhu, C., & Leskovec, J. (2012). Information diffusion and external influence in networks. In Proceedings of the 18th ACM SIGKDD international conference on knowledge discovery and data mining (pp. 33–41).Google Scholar
- 9.Kim, Y., Kim, J. K., Seok, J., & Du Kim, B. (2016). Information propagation modeling in a drone network using disease epidemic models. In 2016 Eighth international conference on ubiquitous and future networks (ICUFN) (pp. 79-81).Google Scholar
- 11.Chen, W., Wang, C., & Wang, Y. (2010). Scalable influence maximization for prevalent viral marketing in large-scale social networks. In: Proceedings of ACM SIGKDD.Google Scholar
- 12.Wang, Y., Cong, G., Song, G., & Xie, K. (2010). Community-based greedy algorithm for mining top-k influential nodes in mobile social networks. In: Proceedings of ACM SIGKDD.Google Scholar
- 14.Lu, Z., Sun, X., & La Porta, T. (2016). Cooperative data offload in opportunistic networks: From mobile devices to Infrastructure. arXiv preprint arXiv:1606.03493.
- 15.Markov chain. (2016). https://en.wikipedia.org/wiki/Markov_chain.
- 16.Lee, J. K., & Hou, J. C. (2006). Modeling steady-state and transient behaviors of user mobility: formulation, analysis, and application. In Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing (pp. 85–96).Google Scholar
- 17.Ester, M., Kriegel, H. P., Sander, J., & Xu, X. (1996). A density-based algorithm for discovering clusters in large spatial databases with noise. In: Kdd (Vol. 96, No. 34, pp. 226–231).Google Scholar
- 18.Mai, S. T., Assent, I., & Storgaard, M. (2016, August). AnyDBC: An Efficient Anytime Density-based Clustering Algorithm for Very Large Complex Datasets. In Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining (pp. 1025–1034). ACM.Google Scholar
- 19.Keranen, A. (2008). Opportunistic network environment simulator. Special Assignment report, Helsinki University of Technology, Department of Communications and Networking.Google Scholar
- 25.Srinivasan, V., Motani, M., Ooi, W.T. (2006). Analysis and implications of student contact patterns derived from campus schedules. In: Proceedings of ACM MobiCom, Los Angeles, CA (pp. 86–97).Google Scholar
- 26.Hui, P. (2008). People are the network: experimental design and evaluation of social-based forwarding algorithms, Ph.D. Dissertation, UCAM-CL-TR-713. University of Cambridge, Computer Laboratory.Google Scholar
- 28.Socievole, A., De Rango, F., Caputo, A. (2014). Wireless contacts, Facebook friendships and interests: analysis of a multi-layer social network in an academic environment. In: 2014 IFIP Wireless Days (WD).Google Scholar
- 30.Alsabti, K., Ranka, S., & Singh, V. (1997). An efficient k-means clustering algorithm.Google Scholar