Evaluating Disseminators for Time-critical Information Diffusion on Social Networks

Yung-Ming Li, Lien-Fa Lin

Abstract

In recent years, information diffusion in social networks has received significant attention from the Internet research community driven by many potential applications such as viral marketing and sales promotions. One of the essential problems in information diffusion process is how to select a set of influential nodes as the initial nodes to disseminate the information through their social network. Most of the existing solutions aim at how to maximize the influence effectiveness of the initially selected "influential nodes", but pay little attention on how the influential nodes selection could minimize the cost of the diffusion. Diffusion effectiveness is important for the applications such as innovation and new technology diffusion. However, many applications, such as disseminating disaster information or product promotions, have the mission to deliver messages in a minimal time. In this paper, we design and implement an efficiently k-best social sites selected mechanism in such that the total diffusion “social cost” required for each user in this social network to receive the diffusion critical time information is minimized.

References

  1. Agarwal N and Liu H., (2008) Blogosphere: research issues, tools, and applications. SIGKDD Explorations 10(1): 18-31.
  2. Asano, T., Bose, P., Carmi, P., Maheshwari, A., Shu, C., Smid, M., (2009). A linear-space algorithm for distance preserving graph embedding. Computational Geometry, 42(4), 289-304.
  3. Domingos P., (2005) Mining social networks for viral marketing. IEEE Intelligent Systems 20(1):80-82.
  4. Domingos P., Richardson M., (2001) Mining the network value of customers. In Proceedings of the seventh ACM SIGKDD international conference on knowledge discovery and data mining, San Francisco, CA, August 2001, pp. 57-66.
  5. Easley and Kleinberg, (2010) Networks, Crowds, and Markets: Reasoning about a Highly Connected World. Cambridge University Press, Draft version: June 10, 2010.
  6. Franz Aurenhammer, (1991). Voronoi Diagrams - A Survey of a Fundamental Geometric Data Structure. ACM Computing Surveys, 23(3):345-405, 1991.
  7. Goldenberg, J., Libai, B. and Muller, E., (2001) Talk of the network: A complex systems look at the underlying process of word-of-mouth. Marketing Letters 12:211-223.
  8. Goyal, A., Bonchi, F., Lakshhmanan, L. V. S., (2010) Learning influence probabilities in social networks. Proceedings of the third ACM international conference on Web Search and Data Mining. 241-250.
  9. Gruhl, D., Guha, R., Liben-Nowell, D. and Tomkins, A., (2004) Information diffusion through blogspace. In Proceedings of the 7th International World Wide Web Conference, 107-117.
  10. Guttman, “R-Trees: A Dynamic Index Structure for Spatial Searching,” Proceedings of the 1984 ACM SIGMOD international conference on Management of data, 47-57, 1984.
  11. Herr, P. M., Kardes, F. R., & Kim, J. (1991). Effects of word-of-mouth and product-attribute information on persuasion: An accessibility-diagnosticity perspective. Journal of Consumer Research, 17 (4), 454-462.
  12. Kempe, D., Kleinberg, J.,and Tardos, E., (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, 137- 146.
  13. Kimura, M., Saito, K., Nakano, R., (2007) Extracting influential nodes for information diffusionon a social network. Proceedings of the 22nd AAAI Conference on Artificial Intelligence 1371-1376.
  14. Kempe, D., Kleinberg, J., and Tardos, E., (2005) Influential nodes in a diffusion model for social networks. In International colloquium on automata, languages and programming No32, 1127-1138.
  15. Kimura M., Saito K., Motoda H., (2009a) Blocking links to minimize contamination spread in a social network. ACM Transactions on Knowledge Discovery from Data 3(2):9:1-9:23
  16. Kimura M., Saito K., Motoda H., (2009b) Efficient estimation of influence functions for SIS model on social networks. In Boutilier C. (ed). Proceedings of the 21st international joint conference on artificial intelligence, Pasadena, CA, July 2009, pp. 2046-2051 Kimura M., Saito K., Nakano R., Motoda H., (2010) Extracting influential nodes on a Social Network for information. Data Mining and Knowledge Discovery 20(1): 70-97.
  17. Mathioudakis and N. Koudas, (2009) Efficient identification of starters and followers in social media. In EDBT, pages 708-719.
  18. Richardson M., Domingos P., (2002) Mining knowledgesharing sites for viral marketing. In Proceedings of the Eighth ACM SIGKDD international conference on knowledge discovery and data mining, Edmonton, Alberta, Canada, July 2002, pp. 61-70
  19. Saito K., Kimura M., Motoda H., (2009) Discovering influential nodes for SIS models in social networks. In Gama J., Costa V. S., Jorge A. M., Brazdil P (eds). Proceedings of the 12th International Conference of Discovery Science, Porto, Portugal, October 2009. Lecture Notes in Computer Science 5808, Springer, pp. 302-316.
  20. Saito, K., Kimura, M., Nakano, R., Motoda, H., (2009) Finding influential nodes in a social network from information diffusion data. In: Proceedings of the International Workshop on Social Computing and Behavioral Modeling 138-145.
  21. Scott, J., (2002) Social Network Analysis: Critical Concepts in Sociology, New York, Routledge Publisher.
  22. Watts, D. J., (2002): A simple model of global cascades on random networks. Proceedings of National Academy of Science, USA 99 (2002) 5766-5771 10.
  23. Watts, D. J., Dodds, P. S.: Influence, networks, and public opinion formation. Journal of Consumer Research 34 (2007) 441-458.
  24. Yu Wang, Gao Cong, Guojie Song, Kunqing Xie, (2010) Community-based Greedy Algorithm for Mining TopK Influential Nodes in Mobile Social Networks. Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining.
  25. Zhang, Zhu, Papadias, Tao, and Lee, (2003) Locationbased spatial queries, in ACM SIGMOD, San Diego, California, USA, June 9-12.
Download


Paper Citation


in Harvard Style

Li Y. and Lin L. (2012). Evaluating Disseminators for Time-critical Information Diffusion on Social Networks . In Proceedings of the International Conference on Data Communication Networking, e-Business and Optical Communication Systems - Volume 1: ICE-B, (ICETE 2012) ISBN 978-989-8565-23-5, pages 251-260. DOI: 10.5220/0004072002510260


in Bibtex Style

@conference{ice-b12,
author={Yung-Ming Li and Lien-Fa Lin},
title={Evaluating Disseminators for Time-critical Information Diffusion on Social Networks},
booktitle={Proceedings of the International Conference on Data Communication Networking, e-Business and Optical Communication Systems - Volume 1: ICE-B, (ICETE 2012)},
year={2012},
pages={251-260},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004072002510260},
isbn={978-989-8565-23-5},
}


in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Data Communication Networking, e-Business and Optical Communication Systems - Volume 1: ICE-B, (ICETE 2012)
TI - Evaluating Disseminators for Time-critical Information Diffusion on Social Networks
SN - 978-989-8565-23-5
AU - Li Y.
AU - Lin L.
PY - 2012
SP - 251
EP - 260
DO - 10.5220/0004072002510260